The problem of scheduling cooperating vehicles is a generalization of the classical vehicle routing problem where certain tasks are linked by precedence constraints and vehicles have varying constrained resources. We describe a type of roll-out algorithm that finds an approximate solution to the problem in real-time and demonstrate the results of the computational experiments.
Routing Cooperating Vehicles to Perform Precedence-Linked Tasks
2005
19 pages
Report
Keine Angabe
Englisch
Operations Research , Logistics Military Facilities & Supplies , Algorithms , Computations , Military vehicles , Experimental data , Military applications , Jamming , Routing , Heuristic methods , Scheduling , Standoff , Real time , Cooperating vehicle orieteering , Roll-out algorithms , Vehicle routing problems , Briefing charts
Multiple Tasks Assignment for Cooperating Homogeneous Unmanned Aerial Vehicles
Springer Verlag | 2019
|Efficient Routing for Precedence-Constrained Package Delivery for Heterogeneous Vehicles
BASE | 2020
|AIAA | 2004
|Optimizing selection of battery electric vehicles to perform delivery tasks
Europäisches Patentamt | 2017
UEMM-Air: Make Unmanned Aerial Vehicles Perform More Multi-modal Tasks
ArXiv | 2024
|