A new path planning algorithm with uncertainty information of robot's initial position
Pengfei Liu; Jianwei Sun; Ruiqing Fu; Yen-Lun Chen; Wei Feng; Xinyu Wu
2013
会议名称2013 IEEE International Conference on Information and Automation, ICIA 2013
会议地点Yinchuan, China
英文摘要The task of path planning has attracted considerable attentions over decades. Mostpath planning research was focused on the property of environment, which is either static or dynamic, and many accomplishments have been achieved. However, less attention has been paid to the uncertainty of robot location. Previous research works always assume the position of robot to be a certain point, which is a waste of information. Actually, many localization algorithms suggest that robots knowledge of its location is a probability distribution over many points. Partial Observable Markov Decision Process(POMDP) provides a framework to handleuncertainty in planing. In this paper we propose a new path planning algorithm, which is called M* to find an admissible and optimal path for moving robots with the initial position of the robot be uncertain. By using the Monte Carlo method and considering in high dimensionality, we transform this problem into a more neat form and make A* applicable.
收录类别EI
语种英语
内容类型会议论文
源URL[http://ir.siat.ac.cn:8080/handle/172644/4604]  
专题深圳先进技术研究院_集成所
作者单位2013
推荐引用方式
GB/T 7714
Pengfei Liu,Jianwei Sun,Ruiqing Fu,et al. A new path planning algorithm with uncertainty information of robot's initial position[C]. 见:2013 IEEE International Conference on Information and Automation, ICIA 2013. Yinchuan, China.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace