Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/75057
題名: | An Incremental Learning Approach to Motion Planning with Roadmap Management | 作者: | Li, Tsai-yen;SHIE, YANG-CHUAN 李蔡彥 |
貢獻者: | 資科系 | 關鍵詞: | incremental learning; motion planning; probabilistic roadmap management; reconfigurable random forest; planning for dynamic environments | 日期: | 2007 | 上傳時間: | 8-May-2015 | 摘要: | Traditional approaches to the motion-planning problem can be classified into solutions for 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 road-map 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 (RRT) 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 resulting roadmap has good coverage of freespace as the original one. We have also successful incorporated the planner into the application of intelligent navigation control. | 關聯: | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 23, 525-538 | 資料類型: | article | DOI: | http://dx.doi.org/10.1109/ROBOT.2002.1014238 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
200703_11.pdf | 1.35 MB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.