• CN: 11-2187/TH
  • ISSN: 0577-6686

›› 2008, Vol. 44 ›› Issue (10): 51-59.

• Article • Previous Articles     Next Articles

Solution of Mixed Integer Linear Programming for Multi-target Pursuit Problem

YANG Liying;WU Chengdong;HAN Jianda;NIE Yiyong   

  1. Shenyang Institute of Automation, Chinese Academy of Sciences Graduate School, Chinese Academy of Sciences School of Information Science & Engineering, Northeast University
  • Published:2008-10-15

Abstract: The path planning for multi-target pursuit (MTP) is studied. Two MTP models, the nearest target pursuit and one-vehicle-one-target enable pursuit, based on the mixed integer linear programming (MILP) are presented. In the two MTP models, the dynamic equation of mass point with linear damping is taken as the state equation of vehicle motion. Integer variables are used to describe the relative position of vehicle and obstacle. Target expansion size is proposed to describe the pursuit process for target. Pursuit direction of vehicle is defined. The isometric plane method selecting integer variables is used to solve MILP pursuit problem. How to select the integer variables in initial inner point is also given. Finally, simulation experiment 1 is given to make comparisons between two MTP models and simulation experiment 2 to show the efficiency of the method.

Key words: Isometric plane method, Mixed integer linear programming (MILP), Multi-target pursuit (MTP), Path planning, Target expansion size

CLC Number: