Receding horizon multi-vehicle routing for emergency scenarios

Abstract

This paper deals with dynamic Multi-Vehicle Routing Problem in both deterministic and stochastic scenarios; the objective is to find the best paths for a fleet of vehicles, with the aim of visiting a set of targets. Based on the Cooperative Receding Horizon approach proposed in [4] for the Euclidean case, this paper i) develop a routing algorithm for graph-represented mission spaces, ii) presents a switching algorithm, which is able to dynamically change the vehicle behaviour according to the time-variable configuration of both vehicles and targets, as well as to handle the discovery of unknown targets. Simulations show the algorithm effectiveness.

Original document

The different versions of the original document can be found in:

• http://hdl.handle.net/11573/656474

• http://xplorestaging.ieee.org/ielx7/6940139/6961315/06961400.pdf?arnumber=6961400,

http://dx.doi.org/10.1109/med.2014.6961400

• https://ieeexplore.ieee.org/document/6961400,

https://dblp.uni-trier.de/db/conf/med/med2014.html#ChiniPOPG14,

https://academic.microsoft.com/#/detail/2043953910