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 …

Path planning and trajectory planning algorithms: A general overview

A Gasparetto, P Boscariol, A Lanzutti… - Motion and operation …, 2015 - Springer
Path planning and trajectory planning are crucial issues in the field of Robotics and, more
generally, in the field of Automation. Indeed, the trend for robots and automatic machines is …

Augmenting reinforcement learning with behavior primitives for diverse manipulation tasks

S Nasiriany, H Liu, Y Zhu - 2022 International Conference on …, 2022 - ieeexplore.ieee.org
Realistic manipulation tasks require a robot to interact with an environment with a prolonged
sequence of motor actions. While deep reinforcement learning methods have recently …

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 …

Language-conditioned path planning

A Xie, Y Lee, P Abbeel… - Conference on Robot …, 2023 - proceedings.mlr.press
Contact is at the core of robotic manipulation. At times, it is desired (eg manipulation and
grasping), and at times, it is harmful (eg when avoiding obstacles). However, traditional path …

[图书][B] Planning algorithms

SM LaValle - 2006 - books.google.com
Planning algorithms are impacting technical disciplines and industries around the world,
including robotics, computer-aided design, manufacturing, computer graphics, aerospace …

RRT-connect: An efficient approach to single-query path planning

JJ Kuffner, SM LaValle - Proceedings 2000 ICRA. Millennium …, 2000 - ieeexplore.ieee.org
A simple and efficient randomized algorithm is presented for solving single-query path
planning problems in high-dimensional configuration spaces. The method works by …

Randomized kinodynamic planning

SM LaValle, JJ Kuffner Jr - The international journal of …, 2001 - journals.sagepub.com
This paper presents the first randomized approach to kinodynamic planning (also known as
trajectory planning or trajectory design). The task is to determine control inputs to drive a …

Rapidly-exploring random trees: Progress and prospects: Steven m. lavalle, iowa state university, a james j. kuffner, jr., university of tokyo, tokyo, japan

SM LaValle, JJ Kuffner - Algorithmic and computational robotics, 2001 - taylorfrancis.com
We present our current progress on the design and analysis of path planning algorithms
based on Rapidlyexploring Random Trees (RRTs). The basis for our methods is the …

Path planning using lazy PRM

R Bohlin, LE Kavraki - Proceedings 2000 ICRA. Millennium …, 2000 - ieeexplore.ieee.org
Describes an approach to probabilistic roadmap planners (PRMs). The overall theme of the
algorithm, called Lazy PRM, is to minimize the number of collision checks performed during …