Sampling-based robot motion planning: A review

M Elbanhawi, M Simic - Ieee access, 2014 - ieeexplore.ieee.org
Motion planning is a fundamental research area in robotics. Sampling-based methods offer
an efficient solution for what is otherwise a rather challenging dilemma of path planning …

Methodology for path planning and optimization of mobile robots: A review

MN Zafar, JC Mohanta - Procedia computer science, 2018 - Elsevier
Mobile robotics research is an emerging area since last three decades. The present
research on mobile robotics addresses the problems which are mainly on path planning …

PQ-RRT*: An improved path planning algorithm for mobile robots

Y Li, W Wei, Y Gao, D Wang, Z Fan - Expert systems with applications, 2020 - Elsevier
During the last decade, sampling-based algorithms for path planning have gained
considerable attention. The RRT*, a variant of RRT (rapidly-exploring random trees), is of …

HPPRM: hybrid potential based probabilistic roadmap algorithm for improved dynamic path planning of mobile robots

AA Ravankar, A Ravankar, T Emaru… - Ieee Access, 2020 - ieeexplore.ieee.org
Path planning and navigation is a very important problem in robotics, especially for mobile
robots operating in complex environments. Sampling based planners such as the …

Sampling-based methods for motion planning with constraints

Z Kingston, M Moll, LE Kavraki - Annual review of control …, 2018 - annualreviews.org
Robots with many degrees of freedom (eg, humanoid robots and mobile manipulators) have
increasingly been employed to accomplish realistic tasks in domains such as disaster relief …

Classical and heuristic approaches for mobile robot path planning: A survey

JA Abdulsaheb, DJ Kadhim - Robotics, 2023 - mdpi.com
The most important research area in robotics is navigation algorithms. Robot path planning
(RPP) is the process of choosing the best route for a mobile robot to take before it moves …

Gross motion planning—a survey

YK Hwang, N Ahuja - ACM Computing Surveys (CSUR), 1992 - dl.acm.org
Motion planning is one of the most important areas of robotics research. The complexity of
the motion-planning problem has hindered the development of practical algorithms. This …

Neural networks based reinforcement learning for mobile robots obstacle avoidance

M Duguleana, G Mogan - Expert Systems with Applications, 2016 - Elsevier
This study proposes a new approach for solving the problem of autonomous movement of
robots in environments that contain both static and dynamic obstacles. The purpose of this …

There is a planar graph almost as good as the complete graph

P Chew - Proceedings of the second annual symposium on …, 1986 - dl.acm.org
Given a set S of points in the plane, there is a triangulation of S such that a path found within
this triangulation has length bounded by a constant times the straight-line distance between …

Exploring implicit spaces for constrained sampling-based planning

Z Kingston, M Moll, LE Kavraki - The International Journal of …, 2019 - journals.sagepub.com
We present a review and reformulation of manifold constrained sampling-based motion
planning within a unifying framework, IMACS (implicit manifold configuration space). IMACS …