High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

A Heuristic Algorithm for The Traveling-Salesman Problem for a Double Integrator

Author(s):

Rishi Bajpai , G.E.C. JABALPUR

Keywords:

Uninhabited Aerial Vehicle, Non-Holonomic Vehicle, Recursive Bead-Tiling, Dynamic Traveling Repairperson

Abstract

This paper presents an algorithm for a double integrator with bounded velocity and bounded control inputs: given a set of points in Rd, find the fastest tour over the point set. Asymptotic bounds on the time taken to complete such a tour in the worst-case then a stochastic version of the travelling problem for double integrator in R2 and R3 are incorporated in the algorithms subjected to operation and stability constraints. Proposed algorithms performances are within a constant factor from the optimum.

Other Details

Paper ID: IJSRDV3I80163
Published in: Volume : 3, Issue : 8
Publication Date: 01/11/2015
Page(s): 326-331

Article Preview

Download Article