A Lagrangian-based algorithm for a multiple depot, multiple travelling salesmen problem

Authors

• Sai Yadlapalli, Texas A & M University - College Station
• Waqar A. Malik, Texas A & M University - College Station
• Swaroop Dharba, Texas A & M University - College Station
• Meir Pachter, Air Force Institute of TechnologyFollow

Document Type

Conference Proceeding

Publication Date

7-9-2007

Abstract

Excerpt: In this manuscript, we consider the problem of motion planning of m Dubins' vehicles through n points in a plane. The initial location and heading of the vehicles is specified and is assumed to be distinct for each vehicle. A motion plan for a vehicle is given by the sequence of points and the corresponding angles at which each point must be visited by the vehicle.

Comments

Copyright © 2007, IEEE.

The full conference paper is available from IEEE via subscription or purchase, using the DOI link below.

DOI

10.1109/ACC.2007.4282957

Source Publication

2007 American Control Conference, ACC

Recommended Citation

S. Yadlapalli, W. A. Malik, S. Darbha and M. Pachter, "A Lagrangian-Based Algorithm for a Multiple Depot, Multiple Travelling Salesmen Problem," 2007 American Control Conference, New York, NY, USA, 2007, pp. 4027-4032, doi: 10.1109/ACC.2007.4282957.