Discrete optimization methods to determine trajectories for Dubins' vehicles

DOI10.1016/J.ENDM.2010.05.003MaRDI QIDQ2883544zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Motion planning algorithms for the Dubins Travelling Salesperson Problem
• Shortest Dubins paths through three points
• Dubins traveling salesman problem with neighborhoods: a graph-based approach
• Bounded-curvature shortest paths through a sequence of points using convex optimization
• Hybrid encoding based differential evolution algorithms for Dubins traveling salesman problem with neighborhood

Cites work

• scientific article; zbMATH DE number 6472596 (Why is no real title available?)
• Classification of the Dubins set
• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
• Planning Algorithms
• Solution of a Large-Scale Traveling-Salesman Problem
• Traveling Salesperson Problems for the Dubins Vehicle

Cited in

(15)

• Motion planning algorithms for the Dubins Travelling Salesperson Problem
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
• Geometric and LP-based heuristics for angular travelling salesman problems in the plane
• VectorTSP: a traveling salesperson problem with racetrack-like acceleration constraints
• Trajectory generation for the N-trailer problem using Goursat normal form
• Bi-objective data gathering path planning for vehicles with bounded curvature
• On the Optimality of Dubins Paths across Heterogeneous Terrain
• A tabu search with geometry‐based sparsification methods for angular traveling salesman problems
• Trajectory optimization based on differential inclusion (Revised)
• Shortest Dubins paths through three points
• Discrete approximations to optimal trajectories using direct transcription and nonlinear programming
• Hybrid encoding based differential evolution algorithms for Dubins traveling salesman problem with neighborhood
• Edge sparsification for geometric tour problems
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883544)