Abstract
This paper discusses a class of mission planning problems in which mission objectives and relative timing constraints are specified using the linear temporal logic language LTL-x. Among all mission plans that satisfy the LTL-x specifications, it is desired to find those minimizing a given cost functional. We show that such an optimization problem can be formulated as a mixed-integer linear program, and present an algorithm for this purpose. This algorithm mainly relies on a novel systematic procedure which converts a given LTL-x formula into a set of mixed-integer linear constraints. The approach presented here can be used for multiple-UAV mission planning purposes, allowing the operator to specify complex mission objectives in LTL-x in a very natural manner; the proposed algorithm constructs the optimal mission plan satisfying the given LTL-x specification. Examples for practical problem sizes are presented and discussed in the paper.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
