A task and motion planning algorithm for the dubins travelling salesperson problem

Pantelis Isaiah, Tal Shima

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A new motion planning algorithm for the so-called Dubins Travelling Salesperson Problem is derived, and compared via simulations with a number of existing algorithms from the literature. In its general form, the new algorithm is dubbed "k-step look-ahead algorithm" and stems naturally from the formulation of the Dubins Travelling Salesperson Problem as a minimum-time control problem. When the minimum turning radius of the Dubins vehicle is comparable to the average intercity distance, the simulations yield a comparison favourable to the new algorithm. The examples in the paper are confined to small instances of the Dubins Travelling Salesperson Problem, however the main idea behind the k-step look-ahead algorithm can be combined with different optimisation methods, if larger instances of the DTSP are to be considered.

Original languageEnglish
Title of host publication19th IFAC World Congress IFAC 2014, Proceedings
EditorsEdward Boje, Xiaohua Xia
Pages9816-9821
Number of pages6
ISBN (Electronic)9783902823625
DOIs
StatePublished - 2014
Event19th IFAC World Congress on International Federation of Automatic Control, IFAC 2014 - Cape Town, South Africa
Duration: 24 Aug 201429 Aug 2014

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Volume19

Conference

Conference19th IFAC World Congress on International Federation of Automatic Control, IFAC 2014
Country/TerritorySouth Africa
CityCape Town
Period24/08/1429/08/14

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Cite this