Path Planning in Dynamic Environment for a Rover using A* and Potential Field Method Rekha Raja (original) (raw)
Related papers
h i g h l i g h t s • Proposed a new potential field method for rough terrain path planning for a rover. • A gradient function is introduced in the conventional potential field method. • The gradient function depends on the roll, pitch and yaw angles of the rover. • Weights of potential field function are optimized by using GA. • Results prove that the new method is superior to conventional potential field method. a b s t r a c t Motion planning of rovers in rough terrains involves two parts of finding a safe path from an initial point to a goal point and also satisfying the path constraints (velocity, wheel torques, etc.) of the rover for traversing the path. In this paper, we propose a new motion planning algorithm on rough terrain for a 6 wheel rover with 10 DOF (degrees of freedom), by introducing a gradient function in the conventional potential field method. The new potential field function proposed consists of an attractive force, repulsive force, tangential force and a gradient force. The gradient force is a function of the roll, pitch and yaw angles of the rover at a particular location on the terrain. The roll, pitch and yaw angles are derived from the kinematic model of the rover. This additional force component ensures that the rover does not go over very high gradients and results in a safe path. Weights are assigned to the various components of the potential field function and the weights are optimized using genetic algorithms to get an optimal path that satisfies the path constraints via a cost function. The kinematic model of the rover is also derived that gives the wheel velocity ratio as it traverses different gradients. Quasi static force analysis ensures stability of the rover and prevents wheel slip. In order to compare different paths, four different objective functions are evaluated each considering energy, wheel slip, traction and length of the path. A comparison is also made between the conventional 2D potential field method and the newly proposed 3D potential field method. Simulation and experimental results show the usefulness of the new method for generating paths in rough terrains.
A terrain-based path planning method for mobile robots
This paper presents a technique for incorporating terrain traversability data into a global path planning method for field mobile robots operating on rough natural terrain. The focus of this approach is on assessing the traversability characteristics of the global terrain using a multi-valued map representation of traversal dificulty, and using this information to compute a traversal cost function to ensure robot survivability. The traversal cost is then utilized by a global path planner to find an optimally safe path through the terrain. A graphical simulator for the terrain-basedpath planning is presented. The path planner is applied to a commercial Pioneer 2-AT robot andfield test results are provided.
Efficient robotic path planning algorithm based on artificial potential field
International Journal of Electrical and Computer Engineering (IJECE), 2021
Path planning is crucial for a robot to be able to reach a target point safely to accomplish a given mission. In path planning, three essential criteria have to be considered namely path length, computational complexity and completeness. Among established path planning methods are voronoi diagram (VD), cell decomposition (CD), probability roadmap (PRM), visibility graph (VG) and potential field (PF). The above-mentioned methods could not fulfill all three criteria simultaneously which limits their application in optimal and real-time path planning. This paper proposes a path PF-based planning algorithm called dynamic artificial PF (DAPF). The proposed algorithm is capable of eliminating the local minima that frequently occurs in the conventional PF while fulfilling the criterion of path planning. DAPF also integrates path pruning to shorten the planned path. In order to evaluate its performance, DAPF has been simulated and compared with VG in terms of path length and computational complexity. It is found that DAPF is consistent in generating paths with low computation time in obstacle-rich environments compared to VG. The paths produced also are nearly optimal with respect to VG.
Hybrid intelligent path planning for articulated rovers in rough terrain
Fuzzy Sets and Systems, 2008
The paper develops a hybrid intelligent approach to path planning for high mobility robots operating in rough environments. Path planning consists of characterization of the environment using a fuzzy logic framework, and a twostage genetic algorithm planner. A global planner determines the path that optimizes a combination of terrain roughness and path curvature. A local planner uses sensory information, and in case of detection of previously unknown and unaccounted for obstacles, performs an on-line replanning to get around the newly discovered obstacle. Fuzzy adaptation of the genetic operators is achieved by adjusting the probabilities of the operators based on a diversity measure of the paths population and traversability measure of the paths. Path planning for an articulated rover in a rugged Mars terrain is presented to demonstrate the effectiveness of the proposed path planner.
Path Planning of Mobile Robot Using FuzzyPotential Field Method
Iraqi Journal for Electrical And Electronic Engineering, 2015
This paper deals with the navigation of a mobile robot in unknown environment using artificial potential field method. The aim of this paper is to develop a complete method that allows the mobile robot to reach its goal while avoiding unknown obstacles on its path. An approach proposed is introduced in this paper based on combing the artificial potential field method with fuzzy logic controller to solve drawbacks of artificial potential field method such as local minima problems, make an effective motion planner and improve the quality of the trajectory of mobile robot.
IJIWET, 2015
Now-a-days, the Robotic applications are gradually becoming a part of lives. The major bottlenecks of these robotic systems are the complex implementation procedure, lack of ability to perceive and adapt to unpredictable environment. An autonomous robot applications, different types of heuristic methodologies are proposed by researchers like reinforcement learning algorithm, potential field algorithm and wave front algorithm. Here, a potential field heuristic algorithm is experimentally studied using Mobile robot for its path planning in order to complete certain task and the observation are tabulated.The analysis of variance statistical test isalso adopted to check the reliability and stability of the methodologies proposed.
Fuzzy terrain-based path planning for planetary rovers
This paper presents a fuzzy terrain-based path planning method for planetary rovers operating on rough natural terrain. The focus of this approach is on planning an optimally safe path of minimum traversal cost, which is calculated from linguistic descriptors of terrain traversability. The method incorporates the Traversability Map, a fuzzy map representation of traversal difficulty of the terrain, into the path planning logic. The search methodology uses a traversal cost function that is derived directly from this Traversability Map. The path planning method is developed in detail and experimental results are presented.
Improvement of Potential Field Algorithm for Path Planning
2021
In this project, we improved and implemented the Artificial Potential Field Algorithms (APF) for path planning, then the robot uses the path planning to navigate from the starting position to the goal position with avoiding the obstacles collision. The path planning generated by the APF is an optimal path, shortest distance to the goal. We have investigated three scenarios to create the path planning. Forst scenario, generating path planning with one obstacle. The second scenario, generating path planning with two obstacles. The third scenario, generating the path planning with two obstacles but with different parameters of the spread of attraction, the spread of repulsive, the strength of attraction, and the strength of repulsive, then, the optimal path planning among those parameters founded in scenario 3. We tested two local minima and simulated with APF algorithm then we compare the results for the better path planning. An improvement APF has been tested and simulated for the local minima problem.
A Novel Approach to Path Planning for Autonomous Mobile Robots
Control and Intelligent Systems, 2011
Path planning is considered as one of the core problems of autonomous mobile robots. Different approaches have been proposed with different levels of complexity, accuracy, and applicability. This paper presents a hybrid approach to the problem of path planning that can be used to find global optimal collision-free paths. This approach relies on combining potential field (PF) method and genetic algorithm (GA) which takes the strengths of both and overcomes their inherent limitations. In this integrated frame, the PF method is designed as a gradient-based searching strategy to exploit local optimal, and the GA is used to explore over the whole problem space. In this work, different implementing strategies are examined in different complexity scenarios. The conducted experiments show that global optimal paths can be achieved effectively using the proposed approach with a strategy of high diversity and memorization.
Path Planning for Wheeled Mobile Robot in Partially Known Uneven Terrain
Sensors
Path planning for wheeled mobile robots on partially known uneven terrain is an open challenge since robot motions can be strongly influenced by terrain with incomplete environmental information such as locally detected obstacles and impassable terrain areas. This paper proposes a hierarchical path planning approach for a wheeled robot to move in a partially known uneven terrain. We first model the partially known uneven terrain environment respecting the terrain features, including the slope, step, and unevenness. Second, facilitated by the terrain model, we use A⋆ algorithm to plan a global path for the robot based on the partially known map. Finally, the Q-learning method is employed for local path planning to avoid locally detected obstacles in close range as well as impassable terrain areas when the robot tracks the global path. The simulation and experimental results show that the designed path planning approach provides satisfying paths that avoid locally detected obstacles a...