{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:53:19Z","timestamp":1771469599093,"version":"3.50.1"},"reference-count":30,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The path planning and obstacle-crossing motion planning of cable trench inspection robots are essential for achieving automated inspection. To improve path planning efficiency and obstacle navigation in complex environments, an enhanced global path planning algorithm based on the A* algorithm has been developed, combined with an improved Dynamic Window Approach (DWA) for local path planning. For unavoidable obstacles, a specific obstacle-crossing motion planning strategy has been formulated. The enhanced A* algorithm improves efficiency and safety through adaptive neighborhood expansion and the elimination of redundant path points. The improved DWA algorithm enables real-time dynamic obstacle avoidance in local path planning. The simulation results on a <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0263574724001930_inline1.png\"\/><jats:tex-math>\n$20 \\times 20$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> grid map indicate that the improved A* algorithm reduces the number of nodes by 58.4% and shortens the path length by 6.1% compared to the traditional A* algorithm, demonstrating significant advantages over other conventional path planning algorithms. In the simulation experiments integrating global and local path planning, the enhanced A* algorithm combined with the improved DWA algorithm reduces the path length by 3.2% on the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0263574724001930_inline2.png\"\/><jats:tex-math>\n$20 \\times 20$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> grid map compared to the integration with the traditional DWA algorithm. On the <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0263574724001930_inline3.png\"\/><jats:tex-math>\n$30 \\times 30$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> grid maps with different obstacle configurations, the path lengths are reduced by 3.5% and 3.6%, respectively. In the obstacle-crossing experiments, the robot successfully overcame obstacles of 10 cm and 20 cm in height. The proposed path planning algorithm and obstacle-crossing motion planning strategy hold substantial application potential in complex environments, offering reliable technical support for cable trench inspection robots.<\/jats:p>","DOI":"10.1017\/s0263574724001930","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T23:21:13Z","timestamp":1733786473000},"page":"433-448","source":"Crossref","is-referenced-by-count":3,"title":["Research on the path planning algorithm and obstacle-crossing motion planning strategy for a cable trench inspection robot"],"prefix":"10.1017","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3482-8039","authenticated-orcid":false,"given":"Linjie","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renfei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junfei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shanshan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingsong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2024,12,10]]},"reference":[{"key":"S0263574724001930_ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2024.3400932"},{"key":"S0263574724001930_ref2","doi-asserted-by":"crossref","unstructured":"[2] Khan, A. A. , Malik, N. , Al-Arainy, A. and Alghuwainem, S. , \u201cA review of condition monitoring of underground power cables,\u201d In: 2012 IEEE International Conference on Condition Monitoring and Diagnosis, IEEE (2012) pp. 909\u2013912.","DOI":"10.1109\/CMD.2012.6416300"},{"key":"S0263574724001930_ref4","doi-asserted-by":"publisher","DOI":"10.3389\/fenrg.2022.860461"},{"key":"S0263574724001930_ref26","doi-asserted-by":"publisher","DOI":"10.3390\/s23198260"},{"key":"S0263574724001930_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.mechmachtheory.2022.105185"},{"key":"S0263574724001930_ref16","doi-asserted-by":"crossref","unstructured":"[16] Li, B. , Dong, C. , Chen, Q. , Mu, Y. , Fan, Z. , Wang, Q. and Chen, X. , \u201cPath planning of mobile robots based on an improved A* algorithm,\u201d In: Proceedings of the 2020 4th High Performance Computing and Cluster Technologies Conference & 2020 3rd International Conference on Big Data and Artificial Intelligence, (2020) pp. 49\u201353.","DOI":"10.1145\/3409501.3409524"},{"key":"S0263574724001930_ref23","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500106"},{"key":"S0263574724001930_ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2020.2998740"},{"key":"S0263574724001930_ref9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.3844\/jcssp.2008.341.344","article-title":"A mobile robot path planning using genetic algorithm in static environment","volume":"4","author":"Ismail","year":"2008","journal-title":"J. Comput. Sci."},{"key":"S0263574724001930_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108123"},{"key":"S0263574724001930_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.08.004"},{"key":"S0263574724001930_ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2014.2302442"},{"key":"S0263574724001930_ref30","doi-asserted-by":"publisher","DOI":"10.3390\/machines10010050"},{"key":"S0263574724001930_ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S026357472400016X"},{"key":"S0263574724001930_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2022.101937"},{"key":"S0263574724001930_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574723001546"},{"key":"S0263574724001930_ref19","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0263841"},{"key":"S0263574724001930_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574723001625"},{"key":"S0263574724001930_ref3","doi-asserted-by":"publisher","DOI":"10.1108\/IR-06-2022-0162"},{"key":"S0263574724001930_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120254"},{"key":"S0263574724001930_ref8","doi-asserted-by":"crossref","unstructured":"[8] Li, J. , Yang, S. X. and Xu, Z. , \u201cA survey on robot path planning using bio-inspired algorithms,\u201d In: 2019 IEEE International Conference on Robotics and Biomimetics (ROBIO), IEEE (2019) pp. 2111\u20132116.","DOI":"10.1109\/ROBIO49542.2019.8961498"},{"key":"S0263574724001930_ref5","doi-asserted-by":"publisher","DOI":"10.1108\/IR-04-2024-0184"},{"key":"S0263574724001930_ref17","first-page":"565","article-title":"Path planning and control strategy design for mobile robot based on hybrid swarm optimization algorithm","volume":"14","author":"Razzaq Abdul Wahhab","year":"2021","journal-title":"Int. J. Intell. Engineer. Sys."},{"key":"S0263574724001930_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S026357472200114X"},{"key":"S0263574724001930_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-014-1461-4"},{"key":"S0263574724001930_ref22","first-page":"1186","article-title":"Path planning based on motion constraints for mobile robot","volume":"29","author":"Y.","year":"2023","journal-title":"Comput. Integr. Manuf. Sys."},{"key":"S0263574724001930_ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3150036"},{"key":"S0263574724001930_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107230"},{"key":"S0263574724001930_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2014.12.098"},{"key":"S0263574724001930_ref1","doi-asserted-by":"crossref","unstructured":"[1] Xie, J. , Sun, T. , Zhang, J. , Ye, L. , Fan, M. and Zhu, M. , \u201cResearch on cable defect recognition technology based on image contour detection,\u201d In: 2021, 2nd International Conference on Big Data & Artificial Intelligence & Software Engineering (ICBASE), IEEE (2021) pp. 387\u2013391.","DOI":"10.1109\/ICBASE53849.2021.00078"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574724001930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T12:30:53Z","timestamp":1752409853000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574724001930\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,10]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["S0263574724001930"],"URL":"https:\/\/doi.org\/10.1017\/s0263574724001930","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,10]]}}}