Journal
ADVANCED ROBOTICS
Volume 27, Issue 14, Pages 1113-1122Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/01691864.2013.805472
Keywords
rapidly exploring random trees; probabilistic roadmaps; robot path planning; multi-robot systems
Categories
Ask authors/readers for more resources
Rapidly exploring random trees (RRT) and probabilistic roadmaps (PRM) are sampling-based techniques being extensively used for robot path planning. In this paper, the tree structure of the RRT is generalized to a graph structure which enables a greater exploration. Exploration takes place simultaneously from multiple points in the map, all explorations fusing at multiple points producing well-connected graph architecture. Initially, in a typical RRT manner, the search algorithm attempts to reach the goal by expansions, and thereafter furtherer areas are explored. With some additional computation cost, as compared to RRT with a single robot, the results can be significantly improved. The so-formed graph is similar to roadmap produced by PRM. However as compared to PRM, the proposed algorithm has a more judicious search strategy and is adaptable to the number of nodes as a parameter. Experimental results are shown with multiple robots planned using prioritization scheme. Results show the betterment of the proposed algorithm as compared to RRT and PRM techniques.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available