中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
LP-based optimal path planning in acceleration space

文献类型:会议论文

作者Zu D(祖迪); Han JD(韩建达); Tan DL(谈大龙)
出版日期2006
会议名称IEEE International Conference on Robotics and Biomimetics (ROBIO 2006)
会议日期December 17-20, 2006
会议地点Kunming, China
关键词path planning linear programming target pursuit and obstacle avoidance dynamic environment
页码1340-1345
通讯作者祖迪
中文摘要This paper proposed Acceleration Space Linear Programming (ASLP) method for the path planning of target pursuit and obstacles avoidance (TPOA) problem in dynamic and uncertain environment. The acceleration space for TPOA problem is defined and LP algorithm is introduced into it. LP is a powerful tool for optimization but exhibits weakness when there exist nonlinear constraints or objective function. In the proposed acceleration space, the constraints and objective function of TOPA problems are inherently described as linear inequalities that can be directly solved by LP. Also, the complexity in obstacle contour does not increase the computational burden of the ASLP. Simulations are conduced with respect to the TPOA scenario including one moving target and multiple moving obstacles. The results obtained by ASLP are presented and compared with those of artificial potential guided evolution algorithm (APEA). Significant superior is demonstrated in many aspects by the comparison.
收录类别EI ; CPCI(ISTP)
产权排序1
会议主办者IEEE, IEEE Robot & Automat Soc, Robot Soc Japan, Japanese Soc Mech Engineers, Peking Univ, Beijing Inst Technol, Yunnan Univ
会议录2006 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS, VOLS 1-3
会议录出版者IEEE
会议录出版地NEW YORK
语种英语
ISBN号978-1-4244-0570-1
WOS记录号WOS:000245907302038
源URL[http://ir.sia.cn/handle/173321/8764]  
专题沈阳自动化研究所_机器人学研究室
推荐引用方式
GB/T 7714
Zu D,Han JD,Tan DL. LP-based optimal path planning in acceleration space[C]. 见:IEEE International Conference on Robotics and Biomimetics (ROBIO 2006). Kunming, China. December 17-20, 2006.

入库方式: OAI收割

来源:沈阳自动化研究所

浏览0
下载0
收藏0
其他版本

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