scholarly journals Survey of Robot 3D Path Planning Algorithms

2016 ◽  
Vol 2016 ◽  
pp. 1-22 ◽  
Author(s):  
Liang Yang ◽  
Juntong Qi ◽  
Dalei Song ◽  
Jizhong Xiao ◽  
Jianda Han ◽  
...  
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Free Path ◽  
Optimal Path ◽  
Temporal Constraints ◽  
Three Dimension ◽  
Underwater Robots ◽  
Kinematic Constraints ◽  
Aerial Robots ◽  
Planning Algorithms

Robot 3D (three-dimension) path planning targets for finding an optimal and collision-free path in a 3D workspace while taking into account kinematic constraints (including geometric, physical, and temporal constraints). The purpose of path planning, unlike motion planning which must be taken into consideration of dynamics, is to find a kinematically optimal path with the least time as well as model the environment completely. We discuss the fundamentals of these most successful robot 3D path planning algorithms which have been developed in recent years and concentrate on universally applicable algorithms which can be implemented in aerial robots, ground robots, and underwater robots. This paper classifies all the methods into five categories based on their exploring mechanisms and proposes a category, called multifusion based algorithms. For all these algorithms, they are analyzed from a time efficiency and implementable area perspective. Furthermore a comprehensive applicable analysis for each kind of method is presented after considering their merits and weaknesses.

scholarly journals Path Planning Usage for Autonomous Agents

2015 ◽  
Vol 2 ◽  
pp. 40
Author(s):  
Edvards Valbahs ◽  
Peter Grabusts
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Mobile Robots ◽  
Autonomous Agents ◽  
Optimal Path ◽  
Careful Analysis ◽  
Algorithm Analysis ◽  
Simulation Data ◽  
Wide Range ◽  
Planning Algorithms

In order to achieve the wide range of the robotic application it is necessary to provide iterative motions among points of the goals. For instance, in the industry mobile robots can replace any components between a storehouse and an assembly department. Ammunition replacement is widely used in military services. Working place is possible in ports, airports, waste site and etc. Mobile agents can be used for monitoring if it is necessary to observe control points in the secret place. The paper deals with path planning programme for mobile robots. The aim of the research paper is to analyse motion-planning algorithms that contain the design of modelling programme. The programme is needed as environment modelling to obtain the simulation data. The simulation data give the possibility to conduct the wide analyses for selected algorithm. Analysis means the simulation data interpretation and comparison with other data obtained using the motion-planning. The results of the careful analysis were considered for optimal path planning algorithms. The experimental evidence was proposed to demonstrate the effectiveness of the algorithm for steady covered space. The results described in this work can be extended in a number of directions, and applied to other algorithms.

scholarly journals Path Planning Followed by Kinodynamic Smoothing for Multirotor Aerial Vehicles (MAVs)

2021 ◽  
Vol 17 (4) ◽  
pp. 491-505
Author(s):  
G. Kulathunga ◽  
◽  
D. Devitt ◽  
R. Fedorenko ◽  
A. Klimchik ◽  
...  
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Free Path ◽  
Optimal Path ◽  
Optimal Solution ◽  
Search Space ◽  
Planning Algorithm ◽  
Feasible Path ◽  
Straight Lines ◽  
Path Planning Algorithm

Any obstacle-free path planning algorithm, in general, gives a sequence of waypoints that connect start and goal positions by a sequence of straight lines, which does not ensure the smoothness and the dynamic feasibility to maneuver the MAV. Kinodynamic-based motion planning is one of the ways to impose dynamic feasibility in planning. However, kinodynamic motion planning is not an optimal solution due to high computational demands for real-time applications. Thus, we explore path planning followed by kinodynamic smoothing while ensuring the dynamic feasibility of MAV. The main difference in the proposed technique is not to use kinodynamic planning when finding a feasible path, but rather to apply kinodynamic smoothing along the obtained feasible path. We have chosen a geometric-based path planning algorithm “RRT*” as the path finding algorithm. In the proposed technique, we modified the original RRT* introducing an adaptive search space and a steering function that helps to increase the consistency of the planner. Moreover, we propose a multiple RRT* that generates a set of desired paths. The optimal path from the generated paths is selected based on a cost function. Afterwards, we apply kinodynamic smoothing that will result in a dynamically feasible as well as obstacle-free path. Thereafter, a b-spline-based trajectory is generated to maneuver the vehicle autonomously in unknown environments. Finally, we have tested the proposed technique in various simulated environments. According to the experiment results, we were able to speed up the path planning task by 1.3 times when using the proposed multiple RRT* over the original RRT*.

scholarly journals Time-efficient path planning using two virtual robots

2019 ◽  
Vol 16 (6) ◽  
pp. 172988141988674
Author(s):  
Jonghoek Kim
Keyword(s):  
Path Planning ◽  
Finite Time ◽  
Free Space ◽  
Path Length ◽  
Optimal Path ◽  
Three Dimensional ◽  
Computational Time ◽  
Topological Map ◽  
Planning Algorithms ◽  
Safe Path

This article introduces time-efficient path planning algorithms handling both path length and safety within a reasonable computational time. The path is planned considering the robot’s size so that as the robot traverses the constructed path, it doesn’t collide with an obstacle boundary. This article introduces two virtual robots deploying virtual nodes which discretize the obstacle-free space into a topological map. Using the topological map, the planner generates a safe and near-optimal path within a reasonable computational time. It is proved that our planner finds a safe path to the goal in finite time. Using MATLAB simulations, we verify the effectiveness of our path planning algorithms by comparing it with the rapidly-exploring random tree (RRT)-star algorithm in three-dimensional environments.

scholarly journals Robot Motion Planning in an Unknown Environment with Danger Space

Electronics ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 201 ◽  
Author(s):  
Hadi Jahanshahi ◽  
Mohsen Jafarzadeh ◽  
Naeimeh Najafizadeh Sari ◽  
Viet-Thanh Pham ◽  
Van Van Huynh ◽  
...  
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Markov Decision Processes ◽  
Free Space ◽  
Optimal Path ◽  
Humanoid Robots ◽  
Decision Processes ◽  
Inference System ◽  
Unknown Environment ◽  
Markov Decision

This paper discusses the real-time optimal path planning of autonomous humanoid robots in unknown environments regarding the absence and presence of the danger space. The danger is defined as an environment which is not an obstacle nor free space and robot are permitted to cross when no free space options are available. In other words, the danger can be defined as the potentially risky areas of the map. For example, mud pits in a wooded area and greasy floor in a factory can be considered as a danger. The synthetic potential field, linguistic method, and Markov decision processes are methods which have been reviewed for path planning in a free-danger unknown environment. The modified Markov decision processes based on the Takagi–Sugeno fuzzy inference system is implemented to reach the target in the presence and absence of the danger space. In the proposed method, the reward function has been calculated without the exact estimation of the distance and shape of the obstacles. Unlike other existing path planning algorithms, the proposed methods can work with noisy data. Additionally, the entire motion planning procedure is fully autonomous. This feature makes the robot able to work in a real situation. The discussed methods ensure the collision avoidance and convergence to the target in an optimal and safe path. An Aldebaran humanoid robot, NAO H25, has been selected to verify the presented methods. The proposed methods require only vision data which can be obtained by only one camera. The experimental results demonstrate the efficiency of the proposed methods.

New Approach for Mobile Robot Path Planning

2013 ◽  
Vol 467 ◽  
pp. 475-478
Author(s):  
Feng Yun Lin
Keyword(s):  
Path Planning ◽  
Optimal Path ◽  
Dc Motor ◽  
Robot Path Planning ◽  
New Approach ◽  
Kinematic Constraints ◽  
Optimal Path Planning ◽  
Kinematic Limit ◽  
Time Optimal ◽  
Robot Path

This paper presents a method of time optimal path planning under kinematic, limit heat characteristics of DC motor and dynamic constrain for a 2-DOF wheeled. Firstly the shortest path is planned by using the geometric method under kinematic constraints. Then, in order to make full use of motors capacity we have the torque limits under limit heat characteristics of DC motor, finally the velocity limit and the boundary acceleration (deceleration) are determined to generate a time optimal path.

Autonomous Rectilinear Motion Planning for a Spatial Robot: Path Planning for a Spatial 4R Manipulator With a Single Spherical Obstacle Inside the Workspace

1992 ◽  
Vol 114 (4) ◽  
pp. 559-563 ◽  
Author(s):  
Menq-Dar Shieh ◽  
J. Duffy
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Free Path ◽  
Efficient Algorithm ◽  
Rectilinear Motion ◽  
Robot Path Planning ◽  
End Effector ◽  
Truncated Pyramid ◽  
Robot Path

This is the first of a series of papers dealing with the path planning for a spatial 4R robot with multiple spherical obstacles inside the workspace. In this paper, a time efficient algorithm has been developed to determine a collision free path for the end effector tip of the robot with a single spherical obstacle inside the workspace. A truncated pyramid and a right circular torus are used to model the nonreachable workspaces of the end effector tip of the robot. The problem of guiding the spatial 4R manipulator while avoiding a spherical obstacle is reduced to moving a point while avoiding a truncated pyramid and/or a right circular torus inside the workspace. The point represents the tip of the end effector of the manipulator. This approach produces an efficient algorithm for determining a collision free path. The algorithm has been successfully developed and implemented in the Silicon Graphics 4D-70GT workstation to verify the results.

scholarly journals A Performance Review of Collision-Free Path Planning Algorithms

Electronics ◽  
2020 ◽  
Vol 9 (2) ◽  
pp. 316
Author(s):  
Hyunwoo Shin ◽  
Junjae Chae
Keyword(s):  
Path Planning ◽  
Free Path ◽  
Mobile Agents ◽  
Future Research ◽  
Computing Environment ◽  
Performance Review ◽  
Spatial Environment ◽  
Planning Algorithms ◽  
A Performance

Path planning for mobile agents is one of the areas that has drawn the attention of researchers’, as evidenced in the large number of papers related to the collision-free path planning (CFPP) algorithm. The purpose of this paper is to review the findings of those CFPP papers and the methodologies used to generate possible solutions for CFPP for mobile agents. This survey shows that the previous CFPP papers can be divided based on four characteristics. The performance of each method primarily used to solve CFPP in previous research is evaluated and compared. Several methods are implemented and tested in same computing environment to compare the performance of generating solution in specified spatial environment with different obstacles or size. The strengths and weakness of each methodology for CFPP are shown through this survey. Ideally, this paper will provide reference for new future research.

Sign in / Sign up

Export Citation Format

Share Document