RRT*-SMART: A rapid convergence implementation of RRT*

International Journal of Advanced Robotic Systems

Volumn 10, Issue , 2013, Pages

  Nasir, Jauwairia ^a   Islam, Fahad ^a   Malik, Usman ^a   Ayaz, Yasar ^a   Hasan, Osman ^a   Khan, Mushtaq ^a   Muhammad, Mannan Saeed ^a,b  

^a NATIONAL UNIVERSITY OF SCIENCES AND TECHNOLOGY   (Pakistan)

^b Hanyang University   (South Korea)

Author keywords

Biasing Radius; Biasing Ratio; Path Optimization

Indexed keywords

BIASING RADIUS; BIASING RATIO; CLUTTERED ENVIRONMENTS; INTELLIGENT SAMPLINGS; MATHEMATICAL ANALYSIS; PATH OPTIMIZATIONS; RAPIDLY-EXPLORING RANDOM TREES; SAMPLING-BASED ALGORITHMS;

ALGORITHMS; FORESTRY; MOTION PLANNING;

OPTIMIZATION;

ALGORITHMS; FORESTRY; OPTIMIZATION;

EID: 84883396889     PISSN: 17298806     EISSN: 17298814     Source Type: Journal    
DOI: 10.5772/56718     Document Type: Article

References (22)

1. M. Kanehara, S. Kagami, J.J. Kuffner, S. Thompson, H. Mizoguhi (2007) "Path shortening and smoothing of grid-based path planning with consideration of obstacles", IEEE International Conference on Systems, Man and Cybernetics, (ISIC), pp. 991-996.
2. I. Petrovic and M. Brezak (2011) "A visibility graph based method for path planning in dynamic environments", in proceedings of 34th International Convention on Information and Commuincation Technology, Electronics and Microelectronics (MIPRO), pp. 711-716.
3. N.H. Sleumer, N. Tschichold-Grman (1999) "Exact cell decomposition of arrangements used for path planning in robotics", Technical report. Switzerland: Institute of Theoretical Computer Science Swiss Federal Institute of Technology Zurich.
4. Y.K.Hwang, N. Ahuja (1992) "A potential field approach to path planning", IEEE Transactions on Robotics and Automation,, vol. 8, no. 1, pp. 23-32.
5. A. Ghorbani, S, Shiry, and A. Nodehi (2009) "Using Genetic Algorithm for a Mobile Robot Path Planning", Proceedings of the 2009 International Conference on Future Computer and Communication (ICFCC) . pp. 164-166.
6. S.X. Yang, C. Luo (2004) "A neural network approach to complete coverage path planning", IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 34, no. 1, pp. 718-724.
7. Roland Geraerts (2006) "Sampling-based Motion Planning: Analysis and Path Quality", Ph.D. thesis. Utrecht University.
8. Roland Geraerts (2006) "On Experimental Research in Sampling-based Motion Planning", In (IROS) Workshop on Benchmarks in Robotics Research, pp. 31-34.
9. Lavalle, S.M. (1998). "Rapidly-exploring random trees: A new tool for path planning", Computer Science Dept, Iowa State University, Tech. Rep. TR: 98-11. Retrieved 2008-06-30.S.
10. S. Karaman and E. Frazzoli (2011) "Sampling-based Algorithms for Optimal Motion Planning", International Journal of Robotics Research, vol. 30, no. 7, pp. 846-894.
11. I. Garcia, J. P. How (2005) "Improving the efficiency of Rapidly-exploring Random Trees Using a Potential Function Planner", in the proceedings of 44th IEEE Conference on Decision and Control, and the European Control Conference, pp. 7965-7970.
12. Khanmohammadi, S.; Mahdizadeh, A. (2008) "Density Avoided Sampling: An Intelligent Sampling Technique for Rapidly-Exploring Random Trees", Eighth International Conference on Hybrid Intelligent Systems, HIS, pp.672-677.
13. J. Kuffner and S.M. LaValle (Apr. 2000) RRT-connect: "An efficient approach to single-query path planning", in Proc. of IEEE Intl. Conf. on Robotics and Automation, pp. 995-1001.
14. L.E. Kavraki, P.Švestka, J.-C. Latombe, and M.H. Overmars (Aug. 1996) "Probabilistic roadmaps for path planning in high-dimensional configuration spaces", IEEE Trans. on Robotics and Automation, vol. 12, pp. 566-580.
15. D. Hsu, J.-C. Latombe, and R. Motwani (1999) "Path planning in expansive configuration spaces", Intl. J. of Computational Geometry and Applications, vol. 9, no. 4/5, pp. 495-512.
16. S. M. LaValle and J. J. Kuffner (2001)"Randomized kinodynamic planning," Intl. J. of Robotics Research, vol. 17, no. 5, pp. 378-400.
17. I. Şucan and L. E. Kavraki (2012) "A sampling-based tree planner for systems with complex dynamics", IEEE Trans. on Robotics, vol. 28, no. 1, pp.116-131.
18. S. M. Lavalle and J.J. Kuffner (2000) "Rapidly Exploring Random Trees: Progress and Prospects", In Proceedings Workshop on the Algorithmic Foundations of Robotics.
19. S. Karaman, Matthew R. Walter, A. Parez, E. Farazolli and S. Teller (2011) "Anytime Motion Planning using the RRT", in proceedings of International Conference on Robotic and Automation, pp. 1478-1483.
20. M. Zucker, J. Kuffner and M. Branicky (2007) "Multipartite RRTs for Rapid Replanning in Dynamic Environments", in Proc. Of Internation Conference on Robotics and Automation, pp. 1603-160.
21. Bialkowski,S. Karaman, and E. Frazzoli (2011) "Massively Parallelizing the RRT and the RRT*," in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).
22. Latombe, J.C. (1990) "Robot Motion Planning", Springer.