RSRT: RAPIDLY EXPLORING SORTED RANDOM TREE - Online Adapting RRT to Reduce Computational Solving Time while Motion Planning in Wide Configuration Spaces

Nicolas Jouandeau

2007

Abstract

We present a new algorithm, named RSRT, for Rapidly-exploring Random Trees (RRT) based on inherent relations analysis between RRT components. RRT algorithms are designed to consider interactions between these inherent components. We explain properties of known variations and we present some future once which are required to deal with dynamic strategies. We present experimental results for a wide set of path planning problems involving a free flying object in a static environment. The results show that our RSRT algorithm (where RSRT stands for Rapidly-exploring Sorted Random Trees) is faster than existing ones. This results can also stand as a starting point of a motion planning benchmark instances which would make easier further comparative studies of path planning algorithms.

References

  1. Barraquand, J. and Latombe, J. (1990). A Monte-Carlo Algorithm for Path Planning with many degrees of Freedom. In Int. Conf. on Robotics and Automation (ICRA'90).
  2. Barraquand, J. and Latombe, J. (1991). Robot motion planning: A distributed representation approach. Int. Journal of Robotics Research (IJRR'91).
  3. Canny, J. (1987). The complexity of robot motion planning. PhD thesis, Massachusetts Institute of Technology. Artificial Intelligence Laboratory.
  4. Carpin, S. and Pagello, E. (2002). On Parallel RRTs for Multi-robot Systems. In 8th Conf. of the Italian Association for Artificial Intelligence (AI*IA'02).
  5. Cheng, P. (2001). Reducing rrt metric sensitivity for motion planning with differential constraints. Master's thesis, Iowa State University.
  6. Cheng, P. and LaValle, S. (2001). Reducing Metric Sensitivity in Randomized Trajectory Design. In Int. Conf. on Intelligent Robots and Systems (IROS'01).
  7. Cheng, P. and LaValle, S. (2002). Resolution Complete Rapidly-Exploring Random Trees. In Int. Conf. on Robotics and Automation (ICRA'02).
  8. Cortès, J. and Siméon, T. (2004). Sampling-based motion planning under kinematic loop-closure constraints. In Workshop on the Algorithmic Foundations of Robotics (WAFR'04).
  9. Donald, B., Xavier, P., Canny, J., and Reif, J. (1993). Kinodynamic Motion Planning. Journal of the ACM.
  10. Ferré, E. and Laumond, J. (2004). An iterative diffusion algorithm for part disassembly. In Int. Conf. Robotics and Automation (ICRA'04).
  11. Fraichard, T. (1993). Dynamic trajectory planning with dynamic constraints: a "state-time space" approach. In Int. Conf. Robotics and Automation (ICRA'93).
  12. Gottschalk, S., Lin, M., and Manocha, D. (1996). Obb-tree: A hierarchical structure for rapid interference detection. In Proc. of ACM Siggraph'96.
  13. Jouandeau, N. and Chérif, A. A. (2004). Fast Approximation to gaussian random sampling for randomized motion planning. In Int. Symp. on Intelligent Autonomous Vehicules (IAV'04).
  14. Kavraki, L. (1995). Random networks in configuration space for fast path planning. PhD thesis, Stanford University.
  15. Khatib, O. (1985). Real-time obstacle avoidance for manipulators and mobile robots. In Int. Conf. on Robotics and Automation (ICRA'85).
  16. Kuffner, J. and LaValle, S. (2000). RRT-Connect: An efficient approach to single-query path planning. In Int. Conf. on Robotics and Automation (ICRA'00).
  17. Kuffner, J., Nishiwaki, K., Kagami, S., Inaba, M., and Inoue, H. (2003). Motion planning for humanoid robots. In Int'l Symp. Robotics Research (ISRR'03).
  18. Latombe, J. (1991). Robot Motion Planning (4th edition). Kluwer Academic.
  19. LaValle, S. (1998). Rapidly-exploring random trees: A new tool for path planning. Technical Report 98-11, Dept. of Computer Science, Iowa State University.
  20. LaValle, S. (2004). Planning Algorithms. [on-line book]. http://msl.cs.uiuc.edu/planning/.
  21. LaValle, S. and Kuffner, J. (1999). Randomized kinodynamic planning. In Int. Conf. on Robotics and Automation (ICRA'99).
  22. LaValle, S. and Kuffner, J. (2000). Rapidly-exploring random trees: Progress and prospects. In Workshop on the Algorithmic Foundations of Robotics (WAFR'00).
  23. Lindemann, S. and LaValle, S. (2004). Incrementally reducing dispersion by increasing Voronoi bias in RRTs. In Int. Conf. on Robotics and Automation (ICRA'04).
  24. Lindemann, S. R. and LaValle, S. M. (2003). Current issues in sampling-based motion planning. In Int. Symp. on Robotics Research (ISRR'03).
  25. Lozano-Pérez, T. (1983). Spatial Planning: A Configuration Space Approach. In Trans. on Computers.
  26. Russell, S. (2002). Rationality and Intelligence. In Press, O. U., editor, Common sense, reasoning, and rationality.
  27. Russell, S. and Norvig, P. (2003). Artificial Intelligence, A Modern Approach (2ème édition). Prentice Hall.
  28. Schwartz, J. and Sharir, M. (1983). On the piano movers problem:I, II, III, IV, V. Technical report, New York University, Courant Institute, Department of Computer Sciences.
  29. Simov, B., LaValle, S., and Slutzki, G. (2002). A complete pursuit-evasion algorithm for two pursuers using beam detection. In Int. Conf. on Robotics and Automation (ICRA'02).
  30. Svestka, P. (1997). Robot Motion Planning using Probabilistic Roadmaps. PhD thesis, Utrecht University.
  31. Tovar, B., LaValle, S., and Murrieta, R. (2003). Optimal navigation and object finding without geometric maps or localization. In Int. Conf. on Robotics and Automation (ICRA'03).
  32. Williams, B. C., B.C., Kim, P., Hofbaur, M., How, J., Kennell, J., Loy, J., Ragno, R., Stedl, J., and Walcott, A. Model-based reactive programming of cooperative vehicles for mars exploration. In Int. Symp. on Artificial Intelligence, Robotics and Automation in Space, page 2001.
  33. Yershova, A., Jaillet, L., Simeon, T., and LaValle, S. M. (2005). Dynamic-domain rrts: Efficient exploration by controlling the sampling domain. In Int. Conf. on Robotics and Automation (ICRA'05).
Download


Paper Citation


in Harvard Style

Jouandeau N. (2007). RSRT: RAPIDLY EXPLORING SORTED RANDOM TREE - Online Adapting RRT to Reduce Computational Solving Time while Motion Planning in Wide Configuration Spaces . In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-82-5, pages 100-107. DOI: 10.5220/0001622001000107


in Bibtex Style

@conference{icinco07,
author={Nicolas Jouandeau},
title={RSRT: RAPIDLY EXPLORING SORTED RANDOM TREE - Online Adapting RRT to Reduce Computational Solving Time while Motion Planning in Wide Configuration Spaces},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2007},
pages={100-107},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001622001000107},
isbn={978-972-8865-82-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - RSRT: RAPIDLY EXPLORING SORTED RANDOM TREE - Online Adapting RRT to Reduce Computational Solving Time while Motion Planning in Wide Configuration Spaces
SN - 978-972-8865-82-5
AU - Jouandeau N.
PY - 2007
SP - 100
EP - 107
DO - 10.5220/0001622001000107