The angular-metric traveling salesman problem

SIAM Journal on Computing

Volumn 29, Issue 3, 2000, Pages 697-711

  Aggarwal, Alok ^a   Coppersmith, Don ^a   Khanna, Sanjeev ^b   Motwani, Rajeev ^c   Schieber, Baruch ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c Stanford University   (United States)

Author keywords

Angle metric; Approximation algorithms; Combinatorial optimization; Computational complexity; Extremal point sets; Robotics; Traveling salesman problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; ROBOTICS;

ANGLE METRIC; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; EXTERNAL POINT SETS;

TRAVELING SALESMAN PROBLEM;

EID: 0033296268     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796312721     Document Type: Article

References (16)

1. P.K. AGARWAL, P. RAGHAVAN, AND H. TAMAKI, Motion planning for a steering-constrained robot through moderate obstacles, in Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, ACM, New York, 1995, pp. 343-352.
2. J. BARRAQUAND AND J-C. LATOMBE, Nonholonomic mobile robots and optimal maneuvering, Revue d'Intelligence Artificelle, 3 (1989), pp. 77-103.
3. J. BARRAQUAND AND J-C. LATOMBE, Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles, Algorithmica, 10 (1993), pp. 121-155.
4. J. BOISSONNAT, J. CZYZOWICZA, O. DEVILLERS, J-M. ROBERT, AND M. YVINEC, Convex tours of bounded curvature, in Proceedings of the Second Annual European Symposium on Algorithms (ESA94), Springer, Utrecht, The Netherlands, 1994, pp. 254-265.
5. J. BOISSONNAT, A. CÉRÉZO, AND J. LEBLOND, Shortest paths of bounded curvature in the plane, J. Intelligent and Robotic Systems: Theory and Appl., 11 (1994), pp. 5-20.
6. J.B. BOYCE, D.P. DOBKIN, R.L. DRYSDALE III, AND L.J. GUIDAS, Finding extremal polygons, SIAM J. Comput., 14 (1985), pp. 134-147.
7. N. CHRISTOFIDES, Worst-Case Analysis for a New Heuristic for the Traveling Salesman Problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
8. J.C. CLEMENTS, Minimum-time turn trajectories to fly-to points, Optimal Control Appl. Methods, 11 (1990), pp. 39-50.
9. P. ERDOS AND G. SZEKERES, A combinatorial problem in geometry, Composito Math., 2 (1935), pp. 463-470.
10. T. FRAICHARD, Smooth trajectory planning for a car in a structured world, in Proceedings of the IEEE International Conference on Robotics, IEEE Press, Piscataway, NJ, 1991, pp. 318-323.
11. M.R. GAREY AND D.S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, CA, 1979.
12. L. GUIBAS, private communication, Stanford Univeristy, Palo Alto, CA, 1995.
13. P. JACOBS AND J. CANNY, Planning smooth paths for mobile robots, in Proceedings of the IEEE International Conference on Robotics, IEEE Press, Piscataway, NJ, 1989, pp. 2-7.
14. J-C. LATOMBE, Robot Motion Planning, Kluwer Academic Publishers, Norwell, MA, 1991.
15. J-P. LAUMOND, Finding collision-free smooth trajectories for a non-holonomic mobile robot, in Proceedings of the IEEE International Conference on Robotics, IEEE Press, Piscataway, NJ, 1987, pp. 1120-1123.
16. E.L. LAWLER, J.K. LENSTRA, A.H.G. RINNOOY KAN, AND D.B. SHMOYS, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley, New York, 1985.