Dynamic Travelling Salesman Problem - Path Planning Algorithm for Unmanned Surface Vehicles
Más información
Fecha de publicación: | 2015 |
Objetivos: | This project addresses the Drone-Assisted Travelling Salesman Problem and the Shortest Covering Path Problem for UAV missions, where the locations to visit and their sequence are decided jointly. As these problems are NP-hard, we develop decomposition-based mathematical heuristics. |
Año de Inicio/Término: | 2015-2018 |
Financiamiento/Sponsor: | Office of Naval Research Global |
Rol del Usuario: | DIRECTOR(A) |
DOI: |
N62909-16-1-2018 |