Skip to main content
Article thumbnail
Location of Repository

PDRRTs: Integrating Graph-Based and Cell-Based Planning

By Ananth Ranganathan

Abstract

Abstract — Motion-planning problems can be solved by discretizing the continuous configuration space, for example with graph-based or cell-based techniques. We study rapidly exploring random trees (RRTs) as an example of graph-based techniques and the parti-game method as an example of cell-based techniques. We then propose partigame directed RRTs (PDRRTs) as a novel technique that combines them. PDRRTs are based on the parti-game method but use RRTs as local controllers rather than the simplistic controllers used by the parti-game method. Our experimental results show that PDRRTs plan faster and solve more motion-planning problems than RRTs and plan faster and with less memory than the parti-game method. I

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.9376
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cc.gatech.edu/~anan... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.