Abstract
This paper investigates the motion planning from initial configuration to goal configuration for Free-Floating Space Robot (FFSR) and suggests a motion planning algorithm named Bidirectional RRT For FFSR (BiD-RRT-For-FFSR). Similar to RRT-Connect, BiD-RRT-For-FFSR constructs a tree from initial configuration and a tree from goal configuration. Local planner for random extension of a tree is proposed for the growth of these two trees, and local planner for bidirectional extension of two trees is developed for the connection of these two trees. Inspired by the projection method, these local planners involve an iteration process and are based on error projection. In each iteration, actions are generated by mapping the configuration error using the pseudo-inverse of Jacobian matrix, which enables the tree to grow towards a desired direction. Unlike projection method for geometric motion planning, these local planners can directly consider differential constraints. Besides, local planner for bidirectional extension adopts the bidirectional approach, which allows the configuration error between two trees to converge.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Flores-Abad, A., Ma, O., Pham, K., Ulrich, S.: A review of space robotics technologies for on-orbit servicing. Prog. Aerosp. Sci. 68, 1–26 (2014)
Dubowsky, S., Torres, M. A.: Path planning for space manipulators to minimize spacecraft attitude disturbances. In: 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, USA, pp. 2522–2528. IEEE (1991)
Nakamura, Y., Mukherjee, R.: Nonholonomic path planning of space robots via a bidirectional approach. IEEE Trans. Robot. Autom. 7(4), 500–514 (1991)
Liu, X., Baoyin, H., Ma, X.: Optimal path planning of redundant free-floating revolute-jointed space manipulators with seven links. Multibody Syst. Dyn. 29(1), 41–56 (2013)
Wang, M., Luo, J., Fang, J., Yuan, J.: Optimal trajectory planning of free-floating space manipulator using differential evolution algorithm. Adv. Space Res. 61(6), 1525–1536 (2018)
Virgili-Llop, J., Zagaris, C., Zappulla, R., Bradstreet, A., Romano, M.: A convex-programming-based guidance algorithm to capture a tumbling object on orbit using a spacecraft equipped with a robotic manipulator. Int. J. Robot. Res. 38(1), 40–72 (2019)
Misra, G., Bai, X.: Task-constrained trajectory planning of free-floating space-robotic systems using convex optimization. J. Guid. Control. Dyn. 40(11), 2857–2870 (2017)
Webb, D.J., Van Den Berg, J.: Kinodynamic RRT*: asymptotically optimal motion planning for robots with linear dynamics. In: 2013 IEEE International Conference on Robotics and Automation, Karlsruhe, Germany, pp. 5054–5061. IEEE (2013)
Li, Y., Littlefield, Z., Bekris, K.E.: Asymptotically optimal sampling-based kinodynamic planning. Int. J. Robot. Res. 35(5), 528–564 (2016)
Berenson, D., Srinivasa, S., Kuffner, J.: Task space regions: a framework for pose-constrained manipulation planning. Int. J. Robot. Res. 30(12), 1435–1460 (2011)
Xu, W., Li, C., Wang, X., Liu, Y., Liang, B., Xu, Y.: Study on non-holonomic cartesian path planning of a free-floating space robotic system. Adv. Robot. 23(1–2), 113–143 (2009)
Kuffner, J.J., LaValle, S.M.: RRT-connect: an efficient approach to single-query path planning. In: Proceedings 2000 IEEE International Conference on Robotics and Automation, San Francisco, CA, USA, pp. 995–1001. IEEE (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhang, H., Tang, Y., Zhu, Z. (2023). A Novel Motion Planning Algorithm Based on RRT-Connect and Bidirectional Approach for Free-Floating Space Robot. In: Yang, H., et al. Intelligent Robotics and Applications. ICIRA 2023. Lecture Notes in Computer Science(), vol 14273. Springer, Singapore. https://doi.org/10.1007/978-981-99-6498-7_27
Download citation
DOI: https://doi.org/10.1007/978-981-99-6498-7_27
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-6497-0
Online ISBN: 978-981-99-6498-7
eBook Packages: Computer ScienceComputer Science (R0)