Motion planning algorithms for the Dubins Travelling Salesperson Problem

DOI10.1016/J.AUTOMATICA.2014.12.041MaRDI QIDQ2409439zbMATH OpenOpenAlexFDO

Authors Pantelis Isaiah, Tal Shima

Publication date 11 October 2017

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2014.12.041

zbMATH Keywords

algorithmsautonomous vehiclesoptimal controltrajectory planning

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Discrete optimization methods to determine trajectories for Dubins' vehicles
• Dubins traveling salesman problem with neighborhoods: a graph-based approach
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• Shortest Dubins paths through three points
• Hybrid encoding based differential evolution algorithms for Dubins traveling salesman problem with neighborhood

Cites work

• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• scientific article; zbMATH DE number 3167340 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms
• Introduction to algorithms
• Multi-target control problems
• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Traveling Salesperson Problems for the Dubins Vehicle
• Viability theory

Cited in

(14)

• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• Markov-Dubins path via optimal control theory
• On shortest Dubins path via a circular boundary
• VectorTSP: a traveling salesperson problem with racetrack-like acceleration constraints
• On Dubins paths to a circle
• Multi-goal motion planning using traveling salesman problem in belief space
• Shortest Dubins paths through three points
• Markov-Dubins interpolating curves
• Discrete optimization methods to determine trajectories for Dubins' vehicles
• A Lagrangian-based algorithm for a combinatorial motion planning problem
• Traveling Salesperson Problems for the Dubins Vehicle
• Hybrid encoding based differential evolution algorithms for Dubins traveling salesman problem with neighborhood
• Optimization of interception plan for rectilinearly moving targets
• Motion planning for a high order Dubins vehicle

Describes a project that uses

Uses Software

• Boost
• Boost C++ Libraries

This page was built for publication: Motion planning algorithms for the Dubins Travelling Salesperson Problem

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