Real-Time Optimal Mission Scheduling and Flight Path Selection

Kim, Yoonsoo, Gu, Da-Wei and Postlethwaite, Ian (2007) Real-Time Optimal Mission Scheduling and Flight Path Selection. IEEE Transactions on Automatic Control, 52 (6). pp. 1119-1123. ISSN 0018-9286

Full text not available from this repository. (Request a copy)

Abstract

We consider a mission in which m UAVs with a capacity limit q each visit n(les mq) targets in a hostile environment in a cooperative manner (and return to where they departed from) such that the cost reflecting operating time and risk exposed is minimized. We first propose a mixed-integer linear programming (MILP) formulation which exactly solves the problem and then propose four alternative MILP formulations which are computationally less intensive and, therefore, suited for real-time purposes, but yield a theoretically guaranteed suboptimal solution. The main contributions of this note are an exact but compact MILP formulation, using a room concept, and four nonexact formulations, each one of which ensures a certain level of solution quality and relatively fast computational time for the considered real-time mission scheduling problem.

Item Type:	Article
Subjects:	H600 Electronic and Electrical Engineering
Department:	Faculties > Engineering and Environment > Mathematics, Physics and Electrical Engineering
Depositing User:	Sarah Howells
Date Deposited:	12 Nov 2012 16:37
Last Modified:	13 Oct 2019 00:23
URI:	http://nrl.northumbria.ac.uk/id/eprint/10233

Downloads