Paper Info
Title
A solution of mixed integer linear programming for obstacle-avoided pursuit problem.
Abstract
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 vehicle's motion. Integer variables are used to describe the relative position of vehicle and obstacles. "Expansible Target Size" is proposed to describe the pursuit process for target step-by-step. "Pursuit Direction" 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.
Year
DOI
Venue
2008
10.1109/IJCNN.2008.4633775
IJCNN
Keywords
Field
DocType
convergence,mathematical model,optimal control,integer programming,vehicle dynamics,force,linear programming,obstacle avoidance,artificial neural networks,path planning,trajectory,state equation
Motion planning,Integer,Convergence (routing),Mathematical optimization,Optimal control,Computer science,Branch and price,Vehicle dynamics,Integer programming,Linear programming
Conference
Volume
Issue
ISSN
null
null
null
ISBN
Citations 
PageRank 
978-1-4244-1821-3
0
0.34
References 
Authors
6
4
Name
Order
Citations
PageRank
Liying Yang1117.05
Jianda Han222060.61
Chengdong Wu325046.36
Yi-Yong Nie4284.53