{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T16:33:00Z","timestamp":1787243580727,"version":"build-2736575974"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T00:00:00Z","timestamp":1721260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T00:00:00Z","timestamp":1721260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the National Key Research and Development Plan program","award":["No. 2023YFC2907400"],"award-info":[{"award-number":["No. 2023YFC2907400"]}]},{"DOI":"10.13039\/501100012476","name":"Fundamental Research Funds for Central Universities of the Central South University","doi-asserted-by":"publisher","award":["FRF-IDRY-21-025"],"award-info":[{"award-number":["FRF-IDRY-21-025"]}],"id":[{"id":"10.13039\/501100012476","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["51804019"],"award-info":[{"award-number":["51804019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Youth Core Individuals Project of Beijing","award":["2017000020124G022"],"award-info":[{"award-number":["2017000020124G022"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The RRT*-Connect algorithm enhances efficiency through dual tree bias growth, yet this bias can be inherently blind, potentially affecting the algorithm\u2019s heuristic performance. In contrast, the Informed RRT* algorithm narrows the planning problem\u2019s scope by leveraging an informed region, thereby improving convergence efficiency towards optimal solutions. However, this approach relies on the prior establishment of feasible paths. Combining these two algorithms can address the challenges posed by Informed RRT while also accelerating convergence towards optimality, albeit without resolving the issue of blind bias in dual trees.In this paper, we proposed a novel algorithm: Dynamic Informed Bias RRT*-Connect. This algorithm, grounded in potential and explicit informed bias sampling, introduces a dynamical bias points set that guides dual tree growth with precision objectives. Additionally, we enhance the evaluation framework for algorithmic heuristics by introducing two innovative metrics that effectively capture the algorithm\u2019s characteristics. The improvements observed in traditional indicators demonstrate that the proposed algorithm exhibits greater heuristic compared to RRT*-Connect and Informed RRT*-Connect. These findings also suggest the viability of the new metrics introduced in our evaluation framework.<\/jats:p>","DOI":"10.1007\/s10846-024-02144-w","type":"journal-article","created":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T06:01:56Z","timestamp":1721282516000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Dynamic Informed Bias RRT*-Connect: Improving Heuristic Guidance by Dynamic Informed Bias Using Hybrid Dual Trees Search"],"prefix":"10.1007","volume":"110","author":[{"given":"Haotian","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4806-636X","authenticated-orcid":false,"given":"Yiting","family":"Kang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haisong","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,18]]},"reference":[{"key":"2144_CR1","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2023.3326120","author":"J Jiang","year":"2023","unstructured":"Jiang, J., Cao, G., Deng, J., Do, T.-T., Luo, S.: Robotic perception of transparent objects: A review. IEEE Trans. Artif. Intell. (2023). https:\/\/doi.org\/10.1109\/TAI.2023.3326120","journal-title":"IEEE Trans. Artif. Intell."},{"key":"2144_CR2","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2024.3396872","author":"L Wang","year":"2024","unstructured":"Wang, L., Zhang, Y., Guo, C.: Path planning for a prostate intervention robot based on an improved bi-rrt algorithm. IEEE\/ASME Trans. Mechatron. (2024). https:\/\/doi.org\/10.1109\/TMECH.2024.3396872","journal-title":"IEEE\/ASME Trans. Mechatron."},{"issue":"1","key":"2144_CR3","doi-asserted-by":"publisher","first-page":"8942","DOI":"10.1038\/s41598-024-59413-9","volume":"14","author":"X Yin","year":"2024","unstructured":"Yin, X., Dong, W., Wang, X., Yu, Y., Yao, D.: Route planning of mobile robot based on improved rrt star and teb algorithm. Sci. Rep. 14(1), 8942 (2024). https:\/\/doi.org\/10.1038\/s41598-024-59413-9","journal-title":"Sci. Rep."},{"key":"2144_CR4","doi-asserted-by":"publisher","unstructured":"Liu, L., Wang, X., Yang, X., Liu, H., Li, J., Wang, P.: Path planning techniques for mobile robots: Review and prospect. Expert Syst. Appl. 120254 (2023). https:\/\/doi.org\/10.1016\/j.eswa.2023.120254","DOI":"10.1016\/j.eswa.2023.120254"},{"key":"2144_CR5","doi-asserted-by":"publisher","first-page":"103112","DOI":"10.1016\/j.jprocont.2023.103112","volume":"132","author":"H Tao","year":"2023","unstructured":"Tao, H., Zheng, J., Wei, J., Paszke, W., Rogers, E., Stojanovic, V.: Repetitive process based indirect-type iterative learning control for batch processes with model uncertainty and input delay. J. Process Control 132, 103112 (2023). https:\/\/doi.org\/10.1016\/j.jprocont.2023.103112","journal-title":"J. Process Control"},{"key":"2144_CR6","doi-asserted-by":"publisher","unstructured":"Tao, Y., Tao, H., Zhuang, Z., Stojanovic, V., Paszke, W.: Quantized iterative learning control of communication-constrained systems with encoding and decoding mechanism. Trans. Inst. Meas. Control., 01423312231225782 (2024). https:\/\/doi.org\/10.1177\/01423312231225782","DOI":"10.1177\/01423312231225782"},{"key":"2144_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.isatra.2023.07.043","volume":"142","author":"R Wang","year":"2023","unstructured":"Wang, R., Zhuang, Z., Tao, H., Paszke, W., Stojanovic, V.: Q-learning based fault estimation and fault tolerant iterative learning control for mimo systems. ISA Trans. 142, 123\u2013135 (2023). https:\/\/doi.org\/10.1016\/j.isatra.2023.07.043","journal-title":"ISA Trans."},{"key":"2144_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.robot.2016.08.001","volume":"86","author":"TT Mac","year":"2016","unstructured":"Mac, T.T., Copot, C., Tran, D.T., De Keyser, R.: Heuristic approaches in robot path planning: A survey. Rob. Auton. Syst. 86, 13\u201328 (2016). https:\/\/doi.org\/10.1016\/j.robot.2016.08.001","journal-title":"Rob. Auton. Syst."},{"issue":"23","key":"2144_CR9","doi-asserted-by":"publisher","first-page":"7898","DOI":"10.3390\/s21237898","volume":"21","author":"JR Sanchez-Ibanez","year":"2021","unstructured":"Sanchez-Ibanez, J.R., Perez-del-Pulgar, C.J., Garc\u00eda-Cerezo, A.: Path planning for autonomous mobile robots: A review. Sensors 21(23), 7898 (2021). https:\/\/doi.org\/10.3390\/s21237898","journal-title":"Sensors"},{"key":"2144_CR10","unstructured":"Rapidly-exploring random trees: A new tool for path planning. Res. Rep. 9811 (1998)"},{"issue":"4","key":"2144_CR11","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L.E., Svestka, P., Latombe, J.-C., Overmars, M.H.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Trans. Robot. Autom. 12(4), 566\u2013580 (1996). https:\/\/doi.org\/10.1109\/70.508439","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"4","key":"2144_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.3390\/robotics12040093","volume":"12","author":"JA Abdulsaheb","year":"2023","unstructured":"Abdulsaheb, J.A., Kadhim, D.J.: Classical and heuristic approaches for mobile robot path planning: A survey. Robotics 12(4), 93 (2023). https:\/\/doi.org\/10.3390\/robotics12040093","journal-title":"Robotics"},{"issue":"3","key":"2144_CR13","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/lra.2022.3174257","volume":"7","author":"BH Meng","year":"2022","unstructured":"Meng, B.H., Godage, I.S., Kanj, I.: Rrt*-based path planning for continuum arms. IEEE Robot. Autom. Lett. 7(3), 6830\u20136837 (2022). https:\/\/doi.org\/10.1109\/lra.2022.3174257","journal-title":"IEEE Robot. Autom. Lett."},{"issue":"4","key":"2144_CR14","doi-asserted-by":"publisher","first-page":"687","DOI":"10.3390\/jmse11040687","volume":"11","author":"S Mao","year":"2023","unstructured":"Mao, S., Yang, P., Gao, D., Bao, C., Wang, Z.: A motion planning method for unmanned surface vehicle based on improved rrt algorithm. J. Mar. Sci. Eng. 11(4), 687 (2023). https:\/\/doi.org\/10.3390\/jmse11040687","journal-title":"J. Mar. Sci. Eng."},{"issue":"4","key":"2144_CR15","doi-asserted-by":"publisher","first-page":"2413","DOI":"10.1109\/LRA.2023.3245409","volume":"8","author":"W Zhang","year":"2023","unstructured":"Zhang, W., Shan, L., Chang, L., Dai, Y.: Svf-rrt*: A stream-based vf-rrt* for usvs path planning considering ocean currents. Ieee Robot. Autom. Lett. 8(4), 2413\u20132420 (2023). https:\/\/doi.org\/10.1109\/LRA.2023.3245409","journal-title":"Ieee Robot. Autom. Lett."},{"issue":"3","key":"2144_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10514-023-10083-y","volume":"47","author":"F Yu","year":"2023","unstructured":"Yu, F., Shang, H., Zhu, Q., Zhang, H., Chen, Y.: An efficient rrt-based motion planning algorithm for autonomous underwater vehicles under cylindrical sampling constraints. Auton. Robots 47(3), 281\u2013297 (2023). https:\/\/doi.org\/10.1007\/s10514-023-10083-y","journal-title":"Auton. Robots"},{"key":"2144_CR17","doi-asserted-by":"publisher","unstructured":"Tang, G., Liu, P., Hou, Z., Claramunt, C., Zhou, P.: Motion planning of uav for port inspection based on extended rrt* algorithm. J. Mar. Sci. Eng. 11(4), 702 (2023). https:\/\/doi.org\/10.3390\/jmse11040702","DOI":"10.3390\/jmse11040702"},{"key":"2144_CR18","doi-asserted-by":"publisher","unstructured":"Jiang, C., Hu, Z., Mourelatos, Z.P., Gorsich, D., Jayakumar, P., Fu, Y., Majcher, M.: R2-rrt*: Reliability-based robust mission planning of off-road autonomous ground vehicle under uncertain terrain environment. IEEE Trans. Autom. Sci. Eng. 19(2), 1030\u20131046 (2021). https:\/\/doi.org\/10.1109\/TASE.2021.3050762","DOI":"10.1109\/TASE.2021.3050762"},{"issue":"5","key":"2144_CR19","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1109\/ROBOT.1999.770022","volume":"20","author":"SM LaValle","year":"2001","unstructured":"LaValle, S.M., Kuffner, J.J., Jr.: Randomized kinodynamic planning. Int. J. Robot. Res. 20(5), 378\u2013400 (2001). https:\/\/doi.org\/10.1109\/ROBOT.1999.770022","journal-title":"Int. J. Robot. Res."},{"issue":"3","key":"2144_CR20","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1109\/TIV.2022.3152740","volume":"7","author":"H Ma","year":"2022","unstructured":"Ma, H., Meng, F., Ye, C., Wang, J., Meng, M.Q.-H.: Bi-risk-rrt based efficient motion planning for autonomous ground vehicles. IEEE Trans. Intell. Veh. 7(3), 722\u2013733 (2022). https:\/\/doi.org\/10.1109\/TIV.2022.3152740","journal-title":"IEEE Trans. Intell. Veh."},{"issue":"3","key":"2144_CR21","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1109\/TASE.2021.3130372","volume":"19","author":"J Wang","year":"2021","unstructured":"Wang, J., Chi, W., Li, C., Meng, M.Q.-H.: Efficient robot motion planning using bidirectional-unidirectional rrt extend function. IEEE Trans. Autom. Sci. Eng. 19(3), 1859\u20131868 (2021). https:\/\/doi.org\/10.1109\/TASE.2021.3130372","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"2144_CR22","doi-asserted-by":"publisher","unstructured":"Urmson, C., Simmons, R.: Approaches for heuristically biasing rrt growth. In: Intelligent Robots and Systems, 2003. (IROS 2003). Proceedings 2003 IEEE\/RSJ International Conference On (2003). https:\/\/doi.org\/10.1109\/IROS.2003.1248805","DOI":"10.1109\/IROS.2003.1248805"},{"key":"2144_CR23","doi-asserted-by":"publisher","first-page":"3011","DOI":"10.1007\/s11063-021-10536-4","volume":"53","author":"Y Gan","year":"2021","unstructured":"Gan, Y., Zhang, B., Ke, C., Zhu, X., He, W., Ihara, T.: Research on robot motion planning based on rrt algorithm with nonholonomic constraints. Neural Process. Lett. 53, 3011\u20133029 (2021). https:\/\/doi.org\/10.1007\/s11063-021-10536-4","journal-title":"Neural Process. Lett."},{"key":"2144_CR24","doi-asserted-by":"publisher","unstructured":"Gammell, J.D., Srinivasa, S.S., Barfoot, T.D.: Informed rrt*: Optimal incremental path planning focused through an admissible ellipsoidal heuristic. In: Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), vol. 2, pp. 3\u20131 (2014). https:\/\/doi.org\/10.1109\/IROS.2014.6942976","DOI":"10.1109\/IROS.2014.6942976"},{"issue":"3","key":"2144_CR25","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s12541-022-00756-6","volume":"24","author":"L Yuan","year":"2023","unstructured":"Yuan, L., Zhao, J., Li, W., Hou, J.: Improved informed-rrt* based path planning and trajectory optimization for mobile robots. Int. J. Precis. Eng. Manuf. 24(3), 435\u2013446 (2023). https:\/\/doi.org\/10.1007\/s12541-022-00756-6","journal-title":"Int. J. Precis. Eng. Manuf."},{"issue":"6","key":"2144_CR26","doi-asserted-by":"publisher","first-page":"4774","DOI":"10.1109\/TMECH.2022.3165845","volume":"27","author":"L Jiang","year":"2022","unstructured":"Jiang, L., Liu, S., Cui, Y., Jiang, H.: Path planning for robotic manipulator in complex multi-obstacle environment based on improved_rrt. IEEE\/ASME Trans. Mechatron. 27(6), 4774\u20134785 (2022). https:\/\/doi.org\/10.1109\/TMECH.2022.3165845","journal-title":"IEEE\/ASME Trans. Mechatron."},{"key":"2144_CR27","doi-asserted-by":"publisher","first-page":"19842","DOI":"10.1109\/ACCESS.2020.2969316","volume":"8","author":"R Mashayekhi","year":"2020","unstructured":"Mashayekhi, R., Idris, M.Y.I., Anisi, M.H., Ahmedy, I., Ali, I.: Informed rrt*-connect: An asymptotically optimal single-query path planning method. IEEE Access 8, 19842\u201319852 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2969316","journal-title":"IEEE Access"},{"key":"2144_CR28","doi-asserted-by":"publisher","first-page":"18658","DOI":"10.1109\/ACCESS.2020.2968471","volume":"8","author":"R Mashayekhi","year":"2020","unstructured":"Mashayekhi, R., Idris, M.Y.I., Anisi, M.H., Ahmedy, I.: Hybrid rrt: A semi-dual-tree rrt-based motion planner. IEEE Access 8, 18658\u201318668 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2968471","journal-title":"IEEE Access"},{"issue":"10","key":"2144_CR29","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1017\/S0263574719000195","volume":"37","author":"J Wang","year":"2019","unstructured":"Wang, J., Chi, W., Shao, M., Meng, M.Q.-H.: Finding a high-quality initial solution for the rrts algorithms in 2d environments. Robotica 37(10), 1677\u20131694 (2019). https:\/\/doi.org\/10.1017\/S0263574719000195","journal-title":"Robotica"}],"container-title":["Journal of Intelligent &amp; Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-024-02144-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10846-024-02144-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-024-02144-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T09:12:23Z","timestamp":1727341943000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10846-024-02144-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,18]]},"references-count":29,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["2144"],"URL":"https:\/\/doi.org\/10.1007\/s10846-024-02144-w","relation":{},"ISSN":["1573-0409"],"issn-type":[{"value":"1573-0409","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,18]]},"assertion":[{"value":"30 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors have no relevant financial or nonfinancial interests to disclose.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"106"}}