Probabilistic roadmaps-putting it all together

• Published in: Proceedings - IEEE International Conference on Robotics and Automation Vol. 2; pp. 1940 - 1947 vol.2
• Main Authors: Dale, L.K., Amato, N.M.
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 2001
• Subjects: Computer science; Drugs; Educational robots; Management training; Mathematics; Motion planning; Orbital robotics; Path planning; Road accidents; Robot kinematics
• ISBN: 0780365763; 9780780365766
• ISSN: 1050-4729; 2577-087X
• DOI: 10.1109/ROBOT.2001.932892

Given a robot and a workspace, probabilistic roadmap planners (PRMs) build a roadmap of paths sampled from the workspace. A roadmap node is a single collision-free robot configuration, randomly generated. A roadmap edge is a sequence of collision-free robot configurations which interpolate the path from one roadmap node to another. Queries to the roadmap are (start, goal) pairs. If both the start and goal of a pair can be connected to the same connected component of the roadmap, the query is solved. Many promising variants of the PRM have been proposed, each with their own strengths and weaknesses. We propose a meta-planner for using many PRMs in such a way that the strengths are combined and the weaknesses offset. Our meta-planner will perform the combination in the following manner: i) provide a framework in which different motion planners are available and to which new ones are easily added; ii) characterize subregions (possibly overlapping) based on sample characteristics and connection results; iii) assign subregions to one or more planners which are judged promising; and iv) provide stopping criteria for roadmap construction. We present experimental results for four characterization measures. A general technique we call 'filtering' is presented for keeping roadmaps compact.