Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem

This paper addresses a MinMax variant of the Dubins multiple traveling salesman problem (mTSP). This routing problem arises naturally in mission planning applications involving fixed-wing unmanned vehicles and ground robots. We first formulate the routing problem, referred to as the one-in-a-set Dub...

Descripción completa

Detalles Bibliográficos
Autores principales: Nayak, Abhishek, Rathinam, Sivakumar
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10383109/
https://www.ncbi.nlm.nih.gov/pubmed/37514725
http://dx.doi.org/10.3390/s23146432

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10383109/
https://www.ncbi.nlm.nih.gov/pubmed/37514725
http://dx.doi.org/10.3390/s23146432

Ejemplares similares