Transition-based RRT for path planning in continuous cost spaces

2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS

Volumn , Issue , 2008, Pages 2145-2150

  Jaillet, Léonard ^a   Cortés, Juan ^a   Siméon, Thierry ^a  

^a LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICULATED ROBOTS; LOW COSTS; PATH-PLANNING; RANDOM TREE; SADDLE POINT; SELFTUNING; SIMULATION RESULT; SOLUTION PATH; STOCHASTIC OPTIMIZATION METHODS; TRANSITION TESTS;

COSTS; INTELLIGENT ROBOTS; PLANNING;

ROBOT PROGRAMMING;

EID: 69549120301     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2008.4650993     Document Type: Conference Paper

References (21)

1. H. Choset, K. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L. Kavraki, and S. Thrun, Principles of Robot Motion: Theory, Algorithms, and Implementations. Cambridge: MIT Press, 2005.
2. S. LaValle, Planning Algorithms. New York: Cambridge University Press, 2006.
3. K. Iagnemma and S. Dubowsky, Mobile Robots in Rough Terrain: Estimation, Motion Planning, and Control with application to Plane- tary Rovers. Springer Tracts in Advanced Robotics (STAR) Series, Springer, 2004.
4. N. Nilsson, Principles of Artificial Intelligence. Palo Alto, CA: Tioga Publishing Company, 1980.
5. A. Stentz, "Optimal and efficient path planning for partially-known environments," Proc. IEEE Int. Conf. on Robotics and Automation, pp. 3310-3317, 1994.
6. A. Ettlin and H. Bleuler, "Rough-terrain robot motion planning based on obstacleness," Proc. Int. Conf. on Control, Automation, Robotics and Vision, pp. 1-6, 2006.
7. -, "Randomised rough-terrain robot motion planning," Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 5798-5803, 2006. (Pubitemid 46928015)
8. C. Urmson and R. Simmons, "Approaches for heuristically biasing RRT growth," Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 1178-1183, 2003.
9. D. Ferguson and A. Stentz, "Anytime rrts," Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 5369-5375, 2006.
10. R. Diankov and J. Kuffner, "Randomized statistical path planning," Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2007.
11. J. Kuffner and S. LaValle, "Rrt-connect: An efficient approach to single-query path planning," Proc. IEEE Int. Conf. on Robotics and Automation, pp. 995-1001, 2000. (Pubitemid 30894939)
12. J. Spall, Introduction to Stochastic Search and Optimization. New York: Wiley, 2003.
13. S. Kirkpatrick, C. Gelatt, and M. Vecchi, "Optimization by simulated annealing," Science, vol.220, pp. 671-680, 1983.
14. M. Apaydin, A. Singh, D. Brutlag, and J.-C. Latombe, "Capturing molecular energy landscapes with probabilistic conformational roadmaps," Proc. IEEE Int. Conf. on Robotics and Automation, pp. 932-939, 2001.
15. L. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," IEEE Transactions on Robotics and Automation, vol.12(4), pp. 566-580, 1996. (Pubitemid 126774162)
16. S. LaValle, "Rapidly-Exploring Random Trees: A New Tool for Path Planning," 1998, tR 98-11, Computer Science Dept., Iowa State University.
17. A. Yershova, L. Jaillet, T. Siméon, and S. LaValle, "Dynamic-domain RRTs: Efficient exploration by controlling the sampling domain," Proc. IEEE Int. Conf. on Robotics and Automation, pp. 3867-3872, 2005.
18. L. Jaillet, A. Yershova, S. LaValle, and T. Siméon, "Adaptive tuning of the sampling domain for dynamic-domain rrts," Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 4086-4091, 2005.
19. T. Siméon, J.-P. Laumond, and F. Lamiraux, "Move3D: A generic platform for path planning," Proc. IEEE Int. Symp. on Assembly & Task Planning, pp. 25-30, 2001. (Pubitemid 32882698)
20. J. Cortés, L. Jaillet, and T. Siméon, "Disassembly path planning for complex articulated objects," IEEE Transactions on Robotics and Automation, 2008, in press.
21. V. Ruiz de Angulo, J. Cortés, and T. Siméon, "BioCD: An efficient algorithm for self-collision and distance computation between highly articulated molecular models," in Robotics: Science and Systems, S. T. snd G. Sukhatme, S. Schaal, and O. Brock, Eds. Cambridge: MIT Press, 2005, pp. 6-11.