Abstract
The traditional goal-bias RRT is mentioned to improve the efficiency, but it has an inherent problem, when there are lesser vertexes, the search toward the goal is often invalid; however, when there are more vertexes, the search toward other regions is often unnecessary. To solve this problem, we introduce a kind bidirectional variable probability RRT algorithm. In this paper, we build two trees, and one tree expands toward to the other tree at a variable probability. This probability is in proportion to the coverage of the trees, that is, when there are lesser vertexes, the searches are mainly toward unexplored regions, and when there are more vertexes, we attach more importance to the connection of two trees. The results show the good performance and convergence speed of the proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
LaValle SM (2006) Planning algorithms. Cambridge University Press, Cambridge
LaValle SM (1998) Rapidly-exploring random trees: a new tool for path planning. Computer Science Department, Lowa State University, Ames. Technical Report 98–11
LaValle SM (2001) Randomized kinodynamic planning. Int J Robot Res 20(5):378–400
Liu H, Yang J, Lu J, Tang Z, Zhao C, Cheng W (2006) Review of robotic motion planning with dynamics. Eng Sci 8(1)
Plaku E, Kavraki LE, Vardi MY (2007) Discrete search leading continuous exploration for kinodynamic motion planning. In: Robotics: Science and Systems. MIT Press, Cambridge, pp 326–333
Ladd AM, Kavraki LE (2004) Fast tree-based exploration of state space for robots with dynamics. In: Proceedings of the international workshop on the algorithmic foundations of robotics, Utrecht/Zeist, The Netherlands, pp 297–312
Kuffner JJ, LaValle SM (2000) RRT-connect: an efficient approach to single-query path planning. In: Proceedings of the IEEE international conference on robotics and automation
Guo H, Zhu Q, Xu S (2007) Rapid-exploring random tree algorithm for path planning of robot based on grid method. J Nanjing Univ 7(2):58–67
Plaku E, Kavraki LE, Vardi MY (2010) Motion planning with dynamics by a synergistic combination of layers of planning. IEEE Trans Robot 26:469–474
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this paper
Cite this paper
Yingying, K., Xiong, C., Jianda, H. (2012). Bidirectional Variable Probability RRT Algorithm for Robotic Path Planning. In: Wang, X., Wang, F., Zhong, S. (eds) Electrical, Information Engineering and Mechatronics 2011. Lecture Notes in Electrical Engineering, vol 138. Springer, London. https://doi.org/10.1007/978-1-4471-2467-2_207
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2467-2_207
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2466-5
Online ISBN: 978-1-4471-2467-2
eBook Packages: EngineeringEngineering (R0)