RRT-blossom: RRT with a local flood-fill behavior

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2006, Issue , 2006, Pages 1237-1242

  Kalisiak, Maciej ^a   Van De Panne, Michiel ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED PROBLEMS; FLOOD-FILL BEHAVIOR; HIGHLY-CONSTRAINED ENVIRONMENTS;

CONSTRAINT THEORY; PROBLEM SOLVING; ROBOTICS;

MOTION PLANNING;

EID: 33845599601     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2006.1641878     Document Type: Conference Paper

References (20)

1. L. Kavraki, P. Švestka, J.-C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration space," in IEEE Trans. on Robotics & Automation, vol. 12(4), 1996, pp. 566-580.
2. S. M. LaValle and J. J. Kuffner, Jr., "Rapidly-exploring random trees: Progress and prospects," in Workshop on Algorithmic Foundations of Robotics, 2000.
3. P. Cheeseman, B. Kanefsky, and W. M. Taylor, "Where the really hard problems are," in Proc. of the 12th Int. Joint Conf. on Artificial Intelligence, 1991, pp. 331-337.
4. B. Selman, D. G. Mitchell, and H. J. Levesque, "Generating hard satisfiability problems," Artificial Intelligence, vol. 81, no. 1-2, pp. 17-29, 1996.
5. S. M. LaValle, "Rapidly-exploring random trees: A new tool for path planning," Computer Science Dept., Iowa State University, technical report TR 98-11, 1998.
6. J. J. Kuffner, Jr. and S. M. LaValle, "RRT-Connect: An efficient approach to single-query path planning," in IEEE Int. Conf. on Robotics & Automation, 2000.
7. S. M. LaValle and J. J. Kuffner, Jr., "Randomized kinodynamic planning," in IEEE Int. Conf. on Robotics & Automation, 1999.
8. P. Cheng and S. M. LaValle, "Reducing metric sensitivity in randomized trajectory design," in IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2001.
9. M. Strandberg, "Augmenting RRT-planners with local trees," in IEEE Int. Conf. on Robotics & Automation, 2004, pp. 3258-3262.
10. S. Carpin and E. Pagello, "On parallel RRTs for multi-robot systems," Proc. 8th Conf. Italian Association for Artificial Intelligence, pp. 834-841, 2002.
11. C. Urmson and R. Simmons, "Approaches for heuristically biasing RRT growth," Proc. IEEE Intl. Conf. on Intelligent Robots and Systems, pp. 1178-1183, 2003.
12. S. R. Lindemann and S. M. LaValle, "Incrementally reducing dispersion by increasing Voronoi bias in RRTs," Proc. of IEEE Intl. Conf. on Robotics & Automation, pp. 3251-3257, 2004.
13. A. Yershova, L. Jaillet, T. Siméon, and S. M. LaValle, "Dynamic-domain RRTs: Efficient exploration by controlling the sampling domain," Proc. IEEE Intl. Conf. on Robotics & Automation, 2005.
14. L. Jaillet, A. Yershova, S. M. LaValle, and T. Siméon, "Adaptive tuning of the sampling domain for dynamic-domain RRTs," Proc. of the IEEE Int. Conf. on Robots and Systems, 2005.
15. J. Barraquand and J.-C. Latombe, "Robot motion planning: A distributed representation approach," The International Journal of Robotics Research, vol. 10(6), pp. 628-649, 1991.
16. J.-P. Aubin, Viability Theory, ser. Systems & Control: Foundations & Applications, C. I. Byrnes, Ed. Birkhäuser, 1991.
17. M. Kalisiak and M. van de Panne, "Approximate safety enforcement using computed viability envelopes," in IEEE Int. Conf. on Robotics & Automation, vol. 5, 2004, pp. 4289-4294.
18. M. Kalisiak. RRT-blossom online resource. http://www.dgp.toronto.edu/ ~mac/research/rrt-blossom/.
19. P. Isto, M. Mäntylä, and J. Tuominen, "On addressing the run-cost variance in randomized motion planners," Proc. IEEE Int. Conf. on Robotics & Automation, 2003.
20. A. Atramentov and S. M. LaValle, "Efficient nearest neighbor searching for motion planning," Proc. IEEE Int. Conf. on Robotics & Automation, 2002.