IEEE Xplore - Login

Cart | Sitemap | Help

Login


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT


Article Information

Probabilistic roadmaps-putting it all together Dale, L.K.; Amato, N.M. Robotics and Automation, 2001. Proceedings 2001 ICRA. IEEE International Conference on Volume 2, Issue , 2001 Page(s): 1940 - 1947 vol.2 Digital Object Identifier 10.1109/ROBOT.2001.932892 Summary: 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. » View citation and abstract



IEEE Members

Log in by entering your IEEE Web Account Username and Password. IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.



Users at Subscribing Institutions

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.



Already Purchased This Article?

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.



Guests

• Search and access Abstract records free of charge • Register for table of contents alerts • Purchase Full Text PDF documents » Learn more about subscription options or how to become an IEEE Member.

You are not logged in.

Username

Password

» Forgot your password?

Please remember to log out when you have finished your session.

You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML

Access this document

» Buy this document now

» Learn more about

subscription options

» Learn more about

purchasing articles

and standards

Learn more about IEEE Subscriptions

Help Contact Us Privacy & Security IEEE.org