Planning tours of robotic arms among partitioned goals

International Journal of Robotics Research

Volumn 25, Issue 3, 2006, Pages 207-223

  Saha, Mitul ^a   Roughgarden, Tim ^a   Latombe, Jean Claude ^a   Sánchez Ante, Gildardo ^b  

^a Stanford University   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Motion planning; Multigoal planning; Partitioned goal

Indexed keywords

ALGORITHMS; INVERSE KINEMATICS; MOTION PLANNING; SPOT WELDING; TRAVELING SALESMAN PROBLEM;

GOAL CONFIGURATIONS; GOAL PLACEMENT; MULTIGOAL PLANNING; PARTITIONED GOAL;

ROBOTIC ARMS;

EID: 33645653559     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364906061705     Document Type: Article

References (24)

1. Akinc, M., Bekris, K. E., Chen, B. Y., Ladd, A. M., Plaku, E., and Kavraki, L. E. 2005. Probabilistic roadmaps of trees for parallel computation of multiple query roadmaps. Robotics Research, P. Dario and R. Chatila, editors, Springer, Berlin. pp. 80 - 89.
2. Bobrow, J. E. 1988. Optimal robot path planning using the minimum-time criterion. IEEE Journal of Robotics and Automation 4 (4). 443 - 450.
3. Bonert, M., Shu, L. H., and Benhabib, B. 1999. Motion planning for multirobot assembly systems. Proceedings of the ASME Design Engineering Technical Conferences, LasVegas, NV, September.
4. Canny, J. F. and Reif, J. 1987. New lower bound techniques for robot motion planning problems. Proceedings of the 28th IEEE Conference on the Foundations of Computer Science, Los Angeles, pp. 39 - 48.
5. Cao, B., Dodds, G. I., and Irwin, G. W. 1998. A practical approach to near time-optimal inspection-task-sequence planning for two cooperative industrial robot arms. International Journal of Robotics Research 17 (8). 858 - 867.
6. Chekuri, C., Even, G., and Kortsarz, G. 2006. A lazy approximation algorithm for the group Steiner problem. Discrete Applied Mathematics, 154 (1). 15 - 34.
7. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1990. Introduction to Algorithms, MIT Press, Cambridge, MA.
8. Danner, T. and Kavraki, L. E. 2000. Randomized planning for short inspection paths. Proceedings of the IEEE International Conference on Robotics and Automation, San Francisco, CA, April 24-28.
9. Eppstein, D., Galil, Z., Italiano, G. F., and Nissenzweig, A. 1997. Sparsification - technique for speeding up dynamic graph algorithms. Journal of the ACM 44 (5). 669 - 696.
10. Fakcharoenphol, J., Rao, S., and Talwar, K. 2003. A tight bound on approximating arbitrary metrics by tree metrics. Proceedings of the ACM Symposium on Theory of Computing, San Diego, CA, June 9-11, pp. 448 - 455.
11. Frederickson, G. N. 1985. Data structures for on-line updating of minimum spanning trees, with applications. SIAM Journal of Computing 14 (4). 781 - 798.
12. Garg, N., Konjevod, G., and Ravi, R. 2000. A polylogarithmic approximation algorithm for the group Steiner tree problem. Journal of Algorithms 37: 66 - 84.
13. Gonzalez-Baños, H. H. and Latombe, J.-C. 2000. A randomized art-gallery algorithm for sensor placement. Proceedingsof the ACM Symposium on Computational Geometry, Hong Kong University of Science and Technology, Hong Kong, June 12-14, pp. 232 - 240.
14. Halperin, E. and Krauthgamer, R. 2003. Polylogarithmic inapproximability. Proceedings of the ACM Symposium on Theory of Computing, San Diego, CA, pp. 585 - 594.
15. Hsu, D. 2000. Randomized Single-Query Motion Planning in Expansive Space. Ph.D. Thesis, Computer Science Department, Stanford University, Stanford, CA, May.
16. Hsu, D., Latombe, J.-C., and Motwani, R. 1997. Path planning in expansive configuration spaces. Proceedings of the IEEE International Conference on Robotics and Automation, Albuquerque, NM, pp. 2719 - 2726.
17. Kavraki, L. E., Svestka, P., Latombe, J.-C., and Overmars, M. 1996. Probabilistic roadmaps for path planning in highdimensional configuration spaces. IEEE Transactions on Robotics and Automation 12 (4). 566 - 580.
18. Mitchell, J. S. B. 1997. Shortest paths and networks. Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, editors, CRCPress, Boca Raton, FL, pp. 445 - 466.
19. Papadimitriou, C. 1977. The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science 4: 237 - 244.
20. Reich, G. and Widmayer, P. 1990. Beyond Steiner's problem: a VLSI oriented generalization. Proceedings of Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science Vol. 411, Springer-Verlag, Berlin, pp. 196 - 210.
21. Saha, M., Sánchez, G., and Latombe, J.-C. 2003. Planning multigoal tours for robot arms. Proceedings of the IEEE International Conference on Robotics and Automation, Taipei, Taiwan, September 14-19.
22. Sánchez, G. and Latombe, J.-C. 2002. On Delaying collision checking in PRM planning - application to multirobot coordination. International Journal of Robotics Research 21 (1). 5 - 26.
23. Spitz, S. N. and Requicha, A. A. G. 2000. Multiple goals path planning for coordinate measuring machines. Proceedings of the IEEE International Conference on Robotics and Automation, San Francisco, CA, April 24-28.
24. Wurll, C., Henrich, D., and Wörn, H. 1999. Multigoal path planning for industrial robots. Proceedings of the IEEE International Conference on Robotics and Applications, Santa Barbara, CA.