Efficient target visiting path planning for multiple vehicles with bounded curvature

Abstract

In this paper, we introduce the k-Dubins Traveling Salesman Problem with Neighborhoods (k-DTSPN), the problem of planning efficient paths among target regions for multiple robots with bounded curvature constraints (Dubins vehicles). This paper presents two approaches for the problem. Firstly, we present a heuristic that solves it in two steps, based on… (More)
DOI: 10.1109/IROS.2013.6696904

Topics

11 Figures and Tables

Cite this paper

@article{Macharet2013EfficientTV, title={Efficient target visiting path planning for multiple vehicles with bounded curvature}, author={Douglas Guimar{\~a}es Macharet and Armando Alves Neto and Vilar Fiuza da Camara Neto and Mario Fernando Montenegro Campos}, journal={2013 IEEE/RSJ International Conference on Intelligent Robots and Systems}, year={2013}, pages={3830-3836} }