Dubins traveling salesman problem with neighborhoods: a graph-based approach
From MaRDI portal
Publication:1736545
DOI10.3390/a6010084zbMath1461.90120OpenAlexW2097171912MaRDI QIDQ1736545
Jason T. Isaacs, João P. Hespanha
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a6010084
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (5)
On Dubins paths to a circle ⋮ Multi-depot vessel routing problem in a direction dependent wavefield ⋮ Editorial: Special issue on graph algorithms ⋮ On shortest Dubins path via a circular boundary ⋮ Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks
Uses Software
Cites Work
- Unnamed Item
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- A memetic algorithm for the generalized traveling salesman problem
- Transformations of generalized ATSP into ATSP.
- Shortest paths of bounded curvature in the plane
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
- A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- Approximation algorithms for TSP with neighborhoods in the plane
- Classification of the Dubins set
- Traveling Salesperson Problems for the Dubins Vehicle
- Dynamic Vehicle Routing for Translating Demands: Stability Analysis and Receding-Horizon Policies
- On the Dubins Traveling Salesman Problem
- Automata, Languages and Programming
This page was built for publication: Dubins traveling salesman problem with neighborhoods: a graph-based approach
