(Created page with " == 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 flee...") |
m (Scipediacontent moved page Draft Content 453972974 to Chini et al 2014a) |
(No difference)
| |
Latest revision as of 09:49, 8 February 2021
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:
Document information
Published on 31/12/13
Accepted on 31/12/13
Submitted on 31/12/13
Volume 2014, 2014
DOI: 10.1109/med.2014.6961400
Licence: CC BY-NC-SA license
Share this document
claim authorship
Are you one of the authors of this document?