A Low Dispersion Probabilistic Roadmaps (LD-PRM) Algorithm for Fast and Efficient Sampling-Based Motion Planning
In this paper, we propose a new learning strategy for a probabilistic roadmap (PRM) algorithm. The proposed strategy is based on reducing the dispersion of the generated set of samples. We defined a forbidden range around each selected sample and ignored this region in further sampling. The resultan...
Main Authors: | Weria Khaksar, Tang Sai Hong, Mansoor Khaksar, Omid Motlagh |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2013-11-01
|
Series: | International Journal of Advanced Robotic Systems |
Online Access: | https://doi.org/10.5772/56973 |
Similar Items
-
Multiquery Motion Planning in Uncertain Spaces: Incremental Adaptive Randomized Roadmaps
by: Khaksar Weria, et al.
Published: (2019-12-01) -
Local Randomization in Neighbor Selection Improves PRM Roadmap Quality
by: Boyd, Bryan 1985-
Published: (2013) -
Analysis of probabilistic roadmap methods for motion planning and applications to polygon manipulation
by: Ladd, Andrew M.
Published: (2009) -
Intelligent Motion Planning and Analysis with Probabilistic Roadmap Methods for the Study of Complex and High-Dimensional Motions
by: Tapia, Lydia
Published: (2011) -
Ambient Sensors for Elderly Care and Independent Living: A Survey
by: Md. Zia Uddin, et al.
Published: (2018-06-01)