Abstract
In the literature, e.g. [10], one can find the so-called basic UAV mission target assignment in which m UAVs each with a capacity limit q visit n targets in a cooperative manner (and return to their departure points) such that the cost incurred by each UAV’s travel is minimized. In [10], we proposed a mixed integer linear program (MILP) formulation which exactly solves the problem, as well as four alternative MILP formulations which are computationally less intensive (and therefore suited for real-time purposes) yet yield a theoretically guaranteed sub-optimal solution. In this chapter, we further consider timing constraints imposed on some p of the targets, so-called prime targets. This consideration is often required for scenarios in which prime targets must be visited in a pre-defined time interval, and mathematically results in the addition of several integer linear constraints to the previous MILP formulation making the problem computationally intractable. We propose a novel procedure of adding these cumbersome timing constraints to the previous MILP formulation, in order to avoid increasing too much computational cost under practically valid assumptions. We first show that the proposed procedure still guarantees the previously claimed theoretical solution quality associated with the basic mission. We then show through extensive numerical simulations that under certain conditions, our algorithms return solutions which are still computationally manageable.
This research has been supported by the UK Engineering and Physical Sciences Research Council and BAE Systems. The authors truly appreciate the valuable comments and suggestions by the editors and anonymous reviewers.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Ahuja, R., Kumar, A., Jha, K., Orlin, J.: Exact and heuristic methods for the weapon target assignment problem. In: Oper. Res (to appear)
Alighanbari, M., How, J.: Decentralized task assignment for unmanned aerial vehicles. In: Proc. 44th IEEE Conf. Decision Control, pp. 5668–5673. IEEE Computer Society Press, Los Alamitos (2005)
Alighanbari, M., Kuwata, Y., How, J.: Coordination and control of multiple UAVs with time constraints and loitering. In: Proc. IEEE Amererican Control Conf., pp. 5311–5316. IEEE Computer Society Press, Los Alamitos (2003)
Beard, R., McLain, T., Goodrich, M., Anderson, E.: Coordinated target assignment and intercept for unmanned aer vehicles. IEEE Trans. Robot. Automat. 18, 911–922 (2002)
Bellingham, J., Tillerson, M., Richards, A., How, J.: Multi-Task Allocation and Trajectory Design for Cooperating UAVs. In: Proc. 2nd Annual Conf. Cooperative Control Optimization, pp. 1–19 (2001)
Christofides, N., Mignozzi, A., Toth, P.: The vehicle routing problem. In: Combinatorial Optimization, pp. 315–338. Wiley, Chichester (1979)
Gu, D.-W., Kamal, W.A., Postlethwaite, I.: A UAV Waypoint Generator. In: Proc. AIAA 1st Intelligent Systems Technical Conf. AIAA-2004-6227 (2004)
Gu, D.-W., Postlethwaite, I., Kim, Y.: A Comprehensive Study on Flight Path Selection Algorithms. In: Proc. IEEE Seminar Target Tracking, pp. 77–89. IEEE Computer Society Press, Los Alamitos (2006)
Haimovich, M., Kan, R., Stougie, L.: Analysis of heuristics for vehicle routing problems. In: Vehicle Routing: Methods and Studies, pp. 87–127. Elsevier, Amsterdam (1988)
Kim, Y., Gu, D.-W., Postlethwaite, I.: Real-time optimal mission scheduling and flight path selection. IEEE Trans. Automat. Contr. (to appear)
Kingston, D.B., Schumacher, C.J.: Time-dependent cooperative assignment. In: Proc. IEEE American Control Conf., pp. 4084–4089. IEEE Computer Society Press, Los Alamitos (2005)
Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2002)
Li, C., Simchi-levi, D.: Worst-case analysis of heuristics for multidepot capacitated vehicle routing problem. ORSA J. Comput. 2, 64–73 (1990)
Manne, A.: A target-assignment problem. Oper. Res. 6, 346–351 (1958)
MacLain, T.W., Beard, R.W.: Coopertative path planning for timing-critical missions. In: Proc. IEEE American Control Conf., pp. 296–301. IEEE Computer Society Press, Los Alamitos (2003)
Mitrovic-minic, S., Krishnamurti, R.: The multiple travelling salesman problem with time windows: bounds for the minimum number of vehicles. Simon Fraser University TR-2002-11 (2002)
Marinakis, Y., Migdalas, A.: Heuristic solutions of vehicle routing problems in supply chain management. Working Paper (2001)
Ryan, J., Bailey, G., Moore, J., Carlton, W.: Reactive tabu search in unmanned aerial reconnaissance simulations. In: Proc. Winter Simulation Conf., pp. 873–879 (1998)
Savelsbergh, M.: Local search in routing problems with time windows. Ann. Oper. Res. 4, 285–305 (1985)
Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13, 87–127 (1999)
Shetty, V., Sudit, M., Nagi, R.: Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles. Comp. & Oper. Res. (2006), doi:10.1016/j.cor.2006.09.013
White, C., Lee, Y., Kim, Y., Thomas, R., Perkins, P.: Creating weekly timetables to maximize employee preferences. The UMAP J. 25, 5–25 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, Y., Gu, DW., Postlethwaite, I. (2007). Real-Time Optimal Time-Critical Target Assignment for UAVs. In: Pardalos, P.M., Murphey, R., Grundel, D., Hirsch, M.J. (eds) Advances in Cooperative Control and Optimization. Lecture Notes in Control and Information Sciences, vol 369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74356-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-74356-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74354-5
Online ISBN: 978-3-540-74356-9
eBook Packages: EngineeringEngineering (R0)