By Topic

An incremental learning approach to motion planning with roadmap management

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tsai-Yen Li ; Comput. Sci. Dept., Nat. Chengchi Univ., Taipei, Taiwan ; Yang-Chuan Shie

Traditional approaches to the motion-planning problem can be classified into single-query and multiple-query problems with the tradeoffs on run-time computation cost and adaptability to environment changes. In this paper, we propose a novel approach to the problem that can learn incrementally on every planning query and effectively manage the learned roadmap as the process goes on. This planner is based on previous work on probabilistic roadmaps and uses a data structure, called reconfigurable random forest (RRF), which extends the rapidly-exploring random tree structure proposed in the literature. The planner can account for environmental changes while keeping the size of the roadmap small. The planner removes invalid nodes in the roadmap as the obstacle configurations change. It also uses a tree-pruning algorithm to trim RRF into a more concise representation. Our experiments show that the planner is flexible and efficient.

Published in:

Robotics and Automation, 2002. Proceedings. ICRA '02. IEEE International Conference on  (Volume:4 )

Date of Conference: