DocumentCode
3525503
Title
Sparsification of motion-planning roadmaps by edge contraction
Author
Shaharabani, Doron ; Salzman, Oren ; Agarwal, Pankaj K. ; Halperin, Dan
Author_Institution
Balvatnic Sch. of Comput. Sci., Tel-Aviv Univ., Tel Aviv, Israel
fYear
2013
fDate
6-10 May 2013
Firstpage
4098
Lastpage
4105
Abstract
We present Roadmap Sparsification by Edge Contraction (RSEC), a simple and effective algorithm for reducing the size of a motion-planning roadmap. The algorithm exhibits minimal effect on the quality of paths that can be extracted from the new roadmap. The primitive operation used by RSEC is edge contraction-the contraction of a roadmap edge to a single vertex and the connection of the new vertex to the neighboring vertices of the contracted edge. For certain scenarios, we compress more than 98% of the edges and vertices at the cost of degradation of average shortest path length by at most 2%.
Keywords
graph theory; path planning; RSEC; average shortest path length; compression; graph; motion-planning roadmaps sparsification; neighboring vertices; roadmap sparsification by edge contraction; vertex; Approximation algorithms; Approximation methods; Degradation; Educational institutions; Image edge detection; Joining processes; Motion-planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation (ICRA), 2013 IEEE International Conference on
Conference_Location
Karlsruhe
ISSN
1050-4729
Print_ISBN
978-1-4673-5641-1
Type
conf
DOI
10.1109/ICRA.2013.6631155
Filename
6631155
Link To Document