Please use this identifier to cite or link to this item:
|Title:||Priority-based routing of unmanned combat aerial vehicles||Authors:||Jiang, J.
unmanned combat aerial vehicles
|Issue Date:||2011||Citation:||Jiang, J.,Ng, K.M. (2011). Priority-based routing of unmanned combat aerial vehicles. 2011 Defense Science Research Conference and Expo, DSR 2011 : -. ScholarBank@NUS Repository. https://doi.org/10.1109/DSR.2011.6026850||Abstract:||This paper considers routing of unmanned combat aerial vehicles to destroy a set of targets characterized by priorities, munitions levels, and time windows. Some additional constraints to be considered are the unmanned combat aerial vehicles' dynamics and collision avoidance. This paper illustrates an integrated formulation of such a routing problem. The complexity of the problem is addressed through a receding horizon strategy and a decomposition method. Using some test problems, we have established the applicability of these approaches to solve the routing problem. © 2011 IEEE.||Source Title:||2011 Defense Science Research Conference and Expo, DSR 2011||URI:||http://scholarbank.nus.edu.sg/handle/10635/87383||ISBN:||9781424492763||DOI:||10.1109/DSR.2011.6026850|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 5, 2019
checked on Nov 30, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.