By Topic

LP-based Optimal Path Planning in Acceleration Space

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
$33 $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

3 Author(s)
Di Zu ; Robotics Laboratory, Chinese Academy of Science (CAS), Shenyang Institute of Automation, Shenyang, China; Graduate school, Chinese Academy of Science, Beijing, China. ; Jianda Han ; Dalong Tan

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.

Published in:

2006 IEEE International Conference on Robotics and Biomimetics

Date of Conference:

17-20 Dec. 2006