Discrete optimization methods to determine trajectories for Dubins' vehicles

DOI10.1016/j.endm.2010.05.003zbMath1237.90004OpenAlexW1964433368MaRDI QIDQ2883544

André César Medeiros, Sebastián Urrutia

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.003

zbMATH Keywords

traveling salesman problemroboticsDubins' paths

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (5)

Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics ⋮ Bi-objective data gathering path planning for vehicles with bounded curvature ⋮ A tabu search with geometry‐based sparsification methods for angular traveling salesman problems ⋮ Unnamed Item ⋮ Geometric and LP-based heuristics for angular travelling salesman problems in the plane

Cites Work

• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
• Classification of the Dubins set
• Traveling Salesperson Problems for the Dubins Vehicle
• Solution of a Large-Scale Traveling-Salesman Problem
• Planning Algorithms
• Unnamed Item

This page was built for publication: Discrete optimization methods to determine trajectories for Dubins' vehicles