Sampling-based robot motion planning: A review
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 …
an efficient solution for what is otherwise a rather challenging dilemma of path planning …
A review of global path planning methods for occupancy grid maps regardless of obstacle density
Path planning constitutes one of the most crucial abilities an autonomous robot should
possess, apart from Simultaneous Localization and Map** algorithms (SLAM) and …
possess, apart from Simultaneous Localization and Map** algorithms (SLAM) and …
[HTML][HTML] Perception, planning, control, and coordination for autonomous vehicles
Autonomous vehicles are expected to play a key role in the future of urban transportation
systems, as they offer potential for additional safety, increased productivity, greater …
systems, as they offer potential for additional safety, increased productivity, greater …
A survey and analysis of multi-robot coordination
In the field of mobile robotics, the study of multi-robot systems (MRSs) has grown
significantly in size and importance in recent years. Having made great progress in the …
significantly in size and importance in recent years. Having made great progress in the …
Sampling-based algorithms for optimal motion planning
During the last decade, sampling-based path planning algorithms, such as probabilistic
roadmaps (PRM) and rapidly exploring random trees (RRT), have been shown to work well …
roadmaps (PRM) and rapidly exploring random trees (RRT), have been shown to work well …
Multi-robot path planning method using reinforcement learning
H Bae, G Kim, J Kim, D Qian, S Lee - Applied sciences, 2019 - mdpi.com
This paper proposes a noble multi-robot path planning algorithm using Deep q learning
combined with CNN (Convolution Neural Network) algorithm. In conventional path planning …
combined with CNN (Convolution Neural Network) algorithm. In conventional path planning …
Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rate
Abstract The Rapidly-exploring Random Tree (RRT) algorithm is a popular algorithm in
motion planning problems. The optimal RRT (RRT*) is an extended algorithm of RRT, which …
motion planning problems. The optimal RRT (RRT*) is an extended algorithm of RRT, which …
[書籍][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 …
including robotics, computer-aided design, manufacturing, computer graphics, aerospace …
Randomized kinodynamic planning
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 …
trajectory planning or trajectory design). The task is to determine control inputs to drive a …
Deep learning in robotics: Survey on model structures and training strategies
The ever-increasing complexity of robot applications induces the need for methods to
approach problems with no (viable) analytical solution. Deep learning (DL) provides a set of …
approach problems with no (viable) analytical solution. Deep learning (DL) provides a set of …