{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:52:21Z","timestamp":1759333941456,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004829","name":"Sichuan Province Science and Technology Support Program","doi-asserted-by":"publisher","award":["2020ZDZX0015"],"award-info":[{"award-number":["2020ZDZX0015"]}],"id":[{"id":"10.13039\/501100004829","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.mdpi.com"],"crossmark-restriction":true},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this paper a novel adaptive rapidly-exploring random trees algorithm based on cross-entropy optimization (CE-RRT) is proposed. We seek to provide a low-cost, fast, and effective solution for path planning of robots in various complex environments. Firstly, an adaptive sampling strategy is introduced to make the search directional. Then, an adaptive step adjustment strategy is proposed to improve the search efficiency of the algorithm. Finally, the cross-entropy algorithm is introduced to optimize redundant nodes in feasible paths and improve path quality. In order to verify the feasibility and effectiveness of the proposed algorithm, it is used to solve path planning problems in two two-dimensional environments and one three-dimensional environment. The RRT and RRT* algorithms are used as benchmarks to measure the effectiveness of the three optimization strategies. The simulation demonstrates that the proposed CE-RRT algorithm can effectively improve search efficiency and path quality. Particularly (path shortened by 26%, 22.70%, and 49.11%), the CE-RRT algorithm exhibits stronger robustness in three-dimensional environments. In addition, the proposed CE-RRT algorithm can be used to plan a reasonable path for the dual robot based on the dual Sawyer simulation platform.<\/jats:p>","DOI":"10.3390\/a18100615","type":"journal-article","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T08:21:51Z","timestamp":1759220511000},"page":"615","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Adaptive Rapidly-Exploring Random Trees Algorithm Based on Cross-Entropy Optimization"],"prefix":"10.3390","volume":"18","author":[{"given":"Duo","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Electrical Engineering, Southwest Jiaotong University, Chengdu 611756, China"}]},{"given":"Qichao","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Information, Southwest Petroleum University, Chengdu 610500, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0906-3978","authenticated-orcid":false,"given":"Lei","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Southwest Jiaotong University, Chengdu 611756, China"}]},{"given":"Yongkui","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Southwest Jiaotong University, Chengdu 611756, China"}]},{"given":"Jieyu","family":"Lei","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Southwest Jiaotong University, Chengdu 611756, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,9,29]]},"reference":[{"key":"ref_1","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G.A., and Burgard, W. (2005). Principles of Robot Motion: Theory, Algorithms, and Implementations, MIT Press."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"LaValle, S.M. (2006). Planning Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511546877"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.robot.2016.08.001","article-title":"Heuristic approaches in robot path planning: A survey","volume":"86","author":"Mac","year":"2016","journal-title":"Robot. Auton. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/JAS.2020.1003381","article-title":"An overview of calibration technology of industrial robots","volume":"8","author":"Li","year":"2021","journal-title":"IEEE-CAA J. Autom. Sin."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1109\/TITS.2015.2498841","article-title":"A review of motion planning techniques for automated vehicles","volume":"17","author":"Gonzalez","year":"2015","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_7","first-page":"1652","article-title":"The focussed d* algorithm for real-time replanning","volume":"Volume 2","author":"Stentz","year":"1995","journal-title":"IJCAI\u201995: Proceedings of the 14th International Joint Conference on Artificial Intelligence"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1748","DOI":"10.1109\/TASE.2020.2976560","article-title":"Neural RRT*: Learning-based optimal path planning","volume":"17","author":"Wang","year":"2020","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.eswa.2018.08.008","article-title":"Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm","volume":"115","author":"Nazarahari","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"107230","DOI":"10.1016\/j.cie.2021.107230","article-title":"Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm","volume":"156","author":"Miao","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/70.660866","article-title":"Analysis of probabilistic roadmaps for path planning","volume":"14","author":"Kavraki","year":"1998","journal-title":"IEEE Trans. Robot."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","article-title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","volume":"12","author":"Kavraki","year":"1996","journal-title":"IEEE Trans. Robot."},{"key":"ref_13","unstructured":"LaValle, S. (2025, September 01). Rapidly-Exploring Random Trees: A New Tool for Path Planning; Research Report 9811. Available online: https:\/\/www.semanticscholar.org\/paper\/Rapidly-exploring-random-trees-%3A-a-new-tool-for-LaValle\/d967d9550f831a8b3f5cb00f8835a4c866da60ad."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.eswa.2019.01.032","article-title":"Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rate","volume":"123","author":"Jeong","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_15","unstructured":"Kalisiak, M., and van de Panne, M. (2006, January 15\u201319). RRT-blossom: RRT with a local flood-fill behavior. Proceedings of the 2006 IEEE International Conference on Robotics and Automation (ICRA), Orlando, FL, USA."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1109\/TRO.2014.2331091","article-title":"Scalable multicore motion planning using lock-free concurrency","volume":"30","author":"Ichnowski","year":"2014","journal-title":"IEEE Trans. Robot."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1177\/0278364911406761","article-title":"Sampling-based algorithms for optimal motion planning","volume":"30","author":"Karaman","year":"2011","journal-title":"Int. J. Robot. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1177\/02783640122067453","article-title":"Randomized kinodynamic planning","volume":"20","author":"LaValle","year":"2001","journal-title":"Int. J. Robot. Res."},{"key":"ref_19","first-page":"995","article-title":"RRT-connect: An efficient approach to single-query path planning","volume":"2","author":"Kuffner","year":"2000","journal-title":"IEEE Int. Conf. Robot. Auto."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-2217(96)00385-2","article-title":"Optimization of computer simulation models with rare events","volume":"99","author":"Rubinstein","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"108151","DOI":"10.1016\/j.asoc.2021.108151","article-title":"A multi-objective cross-entropy optimization algorithm and its application in high-speed train lateral control","volume":"115","author":"Tang","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"5532","DOI":"10.1109\/TAP.2017.2740974","article-title":"Cross-entropy method for electromagnetic optimization with constraints and mixed variables","volume":"65","author":"Kovaleva","year":"2017","journal-title":"IEEE Trans. Antennas Propag."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2777","DOI":"10.1016\/j.ins.2010.03.030","article-title":"Optimal fuzzy control system using the cross-entropy method. A case study of a drilling process","volume":"180","author":"Haber","year":"2010","journal-title":"Inf. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s11009-006-9753-0","article-title":"The cross-entropy method for continuous multi-extremal optimization","volume":"8","author":"Kroese","year":"2006","journal-title":"Methodol. Comput. Appl. Probab."},{"key":"ref_25","unstructured":"Quigley, M., Conley, K., Gerkey, B.P., Faust, J., Foote, T., Leibs, J., Wheeler, R., and Ng, A.Y. ROS: An open-source robot operating system. Proceedings of the ICRA Workshop Open Source Software."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/10\/615\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T08:27:20Z","timestamp":1759220840000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/10\/615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":25,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["a18100615"],"URL":"https:\/\/doi.org\/10.3390\/a18100615","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2025,9,29]]}}}