Vehicle Routing Problem with Metric Temporal Logic Specifications
Authors:
- 1 January 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 3953-3958
Abstract
This paper proposes a novel version of the vehicle routing problem (VRP). Instead of servicing all the customers, feasible solutions of the VRP instance are forced to satisfy a set of complex high-level tasks given as a metric temporal logic (MTL) specification, which allows complex quantitative timing constraints to be incorporated into the problem. For the resulting vehicle routing problem with metric temporal logic specifications (VRPMTL), a mixed-integer linear programming (MILP) based algorithm is provided that solves the problem to optimality. Examples for optimal multi-UAV mission planning are provided where MTL is used as a high level language to specify complex mission tasks.Keywords
This publication has 19 references indexed in Scilit:
- Vehicle Routing with Linear Temporal Logic Specifications: Applications to Multi-UAV Mission Planning2008
- Complex mission optimization for Multiple-UAVs using Linear Temporal Logic2008
- Optimization of air vehicles operations using mixed-integer linear programmingJournal of the Operational Research Society, 2007
- On the Decidability of Metric Temporal Logic2006
- Experimental Demonstrations of Real-Time MILP Control2003
- The Vehicle Routing Problem2002
- The regular real-time languages1998
- The Temporal Logic of Reactive and Concurrent Systems1992
- Specifying real-time properties with metric temporal logicReal-Time Systems, 1990
- The temporal logic of programs1977