Multi-Target Assignment and Path Planning for Groups of UAVs

  • Theju Maddula
  • Ali A. Minai
  • Marios M. Polycarpou
Part of the Cooperative Systems book series (COSY, volume 3)


Uninhabited autonomous vehicles (UAVs) have many useful military applications, including reconnaissance, search-and-destroy, and search-and-rescue missions in hazardous environments such as battlefields or disaster areas. Recently, there has been considerable interest in the possibility of using large teams (swarms) of UAVs functioning cooperatively to accomplish a large number of tasks (e.g., finding and attacking targets). However, this requires the assignment of multiple spatially distributed tasks to each UAV along with a feasible path that minimizes effort and avoids threats.

In this work, we consider an extended environment with M UAVs, N targets and P threats. The goal is to assign all the targets to the UAVs so as to minimize the maximum path length, divide work equitably among the UAVs, and limit the threat faced by each UAV. We use a four stage approach to address this problem. First, a Voronoi tessellation around the threats is used to create a graph of potential paths and waypoints. The segments of this graph are then systematically removed by a threat/cost-based thresholding process to obtain a feasible set of path elements. In the second stage, this reduced graph is searched to identify short paths between tasks and from UAVs to tasks. In the third stage, initial paths for UAVs are constructed using a semi-greedy heuristic that divides tasks equally among UAVs. Finally, in the fourth stage, this initial assignment is refined using spatially constrained exchange of sub-paths among UAVs. A direct method for obtaining paths of approximately equal length is also considered.


Path Planning Vehicle Rout Problem Average Path Length Voronoi Tessellation Cooperative Control 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R.W. Beard, T.W. McLain, and M. Goodrich. Coordinated target assignment and intercept for unmanned air vehicles. Proc. ICRA’2000, pages 2581–2586, 2000.Google Scholar
  2. [2]
    R.W. Beard, T.W. McLain, M. Goodrich, and E.P. Anderson. Coordinated target assignment and intercept for unmanned air vehicles. IEEE Trans. On Robotics and Automation. Google Scholar
  3. [3]
    J. Bellingham, M. Tillerson, A. Richards, and J. How. Multi-task allocation and path planning for cooperative nays. Conference on Coordination, Control and Optimization, 2001.Google Scholar
  4. [4]
    P.R. Chandler and M. Pachter. Research issues in autonomous control of tactical uays. Proc. ACC’1998, pages 394–398, 1998.Google Scholar
  5. [5]
    P.R. Chandler and M. Pachter. Hierarchical control for autonomous teams. Proc. GNC’2001, pages 632–642, 2001.Google Scholar
  6. [6]
    P.R. Chandler, M. Pachter, and S. Rasmussen. Uav cooperative control. Proc. АCC’2001, 2001.Google Scholar
  7. [7]
    P.R. Chandler, S. Rasmussen, and M. Pachter. Uav cooperative path planning. Proc. GNC’2000, pages 1255–1265, 2000.Google Scholar
  8. [8]
    P.R. et al. Chandler. Complexity in uav cooperative control. Proc ACC’2002, 2002.Google Scholar
  9. [9]
    D.R. Jacques. Search, classification and attack decisions for cooperative wide area search munitions. Proc. Cooperative Optimization and Control Workshop, 1998.Google Scholar
  10. [10]
    S.-M. Li, J.D. Boskovic, S. Seereeeram, R. Prasanth, R. Amin, R.K. Mehra, and R.W. amd Mclain. T.W. Beard. Autonomous hierarchical control of multiple unmanned combat air vehicles (ucays). Proc. АCC’2002, pages 274–279, 2002.Google Scholar
  11. [11]
    T.W. McLain and R.W. Beard. Trajectory planning for coordinated rendezvous of unmanned air vehicles. Proc. GNC’2000, pages 1247–1254, 2000.Google Scholar
  12. [12]
    T.W. McLain, R.W. Beard, and J.M. Kelsey. Experimental demonstration of multiple robot cooperative target intercept. Proc GNC’2002, 2002.Google Scholar
  13. [13]
    A. Moitra, R.J. Szczerba, V.A. Didomizio, L.J. Hoebel, R.M. Mattheyses, and B. Yamrom. A novel approach for the coordination of multi-vehicle teams. Proc. GNC’2001, pages 608–618, 2001.Google Scholar
  14. [14]
    K. Passino. An introduction to research challenges in cooperative control for uninhabited autonomous vehicles. preprint, 2002.Google Scholar
  15. [15]
    M.M. Polycarpou, Y. Yang, and K. Passino. A cooperative search framework for distributed agents. Proc. 2001 IEEE ISIC, pages 1–6, 2001.Google Scholar
  16. [16]
    M.M. Polycarpou, Y. Yang, and K. Passino. Cooperative control of distributed multi-agent systems. IEEE Control Systems Magazine, 2002.Google Scholar
  17. [17]
    T. Schouwenaars, B. De Moor, E. Feron, and J. How. Mixed integer programming for multi-vehicle path planning. Proc. АCC’2001, 2001.Google Scholar
  18. [18]
    C. Schumacher, P.R. Chandler, and S.R. Rasmussen. Task allocation for wide area search munitions via network flow optimization. Proc. GNC’2001, pages 619–626, 2001.Google Scholar
  19. [19]
    K.C. Tan, L.H. Lee, Q.L. Zhu, and K. Ou. Heuristic methods for vehicle routing problem with time windows. Intelligent in Engineering, pages 281–295, 2002.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Theju Maddula
    • 1
  • Ali A. Minai
    • 1
  • Marios M. Polycarpou
    • 1
  1. 1.Department of Electrical & Computer Engineering and Computer ScienceUniversity of CincinnatiCincinnatiUSA

Personalised recommendations