Back to Search
Start Over
A solution of mixed integer linear programming for obstacle-avoided pursuit problem
- Source :
- IJCNN
- Publication Year :
- 2008
- Publisher :
- IEEE, 2008.
-
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 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.
Details
- Database :
- OpenAIRE
- Journal :
- 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)
- Accession number :
- edsair.doi...........364f583f5921350c086c9a729f4ee4fc