By Topic

A solution of mixed integer linear programming for obstacle-avoided pursuit problem

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

4 Author(s)
Yang, Liying ; State Key Lab. of Robot., Chinese Acad. of Sci., Shenyang ; Jianda Han ; Chengdong Wu ; Yiyong Nie

In this paper the path planning for obstacle-avoided pursuit problem (OAP) is studied. The OAP models based on the mixed integer linear programming (MILP) is presented. In the OAP models, the dynamic equation of mass point with linear damping is taken as the state equation of vehiclepsilas motion. Integer variables are used to describe the relative position of vehicle and obstacles. ldquoExpansible Target Sizerdquo is proposed to describe the pursuit process for target step-by-step. ldquoPursuit Directionrdquo of vehicle is defined. The Isometric Plane Method selected integer variables is used to solve MILP pursuit problem. How to select the integer variables of inner point is also given. Finally, simulations are given to show the efficiency of the method.

Published in:

Neural Networks, 2008. IJCNN 2008. (IEEE World Congress on Computational Intelligence). IEEE International Joint Conference on

Date of Conference:

1-8 June 2008