{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T08:26:58Z","timestamp":1750667218961,"version":"3.40.5"},"reference-count":44,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T00:00:00Z","timestamp":1543449600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>Path planning under 2D map is a key issue in robot applications. However, most related algorithms rely on point-by-point traversal. This causes them usually cannot find the strict shortest path, and their time cost increases dramatically as the map scale increases. So we proposed RimJump to solve the above problem, and it is a new path planning method that generates the strict shortest path for a 2D map. RimJump selects points on the edge of barriers to form the strict shortest path. Simulation and experimentation prove that RimJump meets the expected requirements.<\/jats:p>","DOI":"10.1017\/s0263574718001236","type":"journal-article","created":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T14:43:03Z","timestamp":1543502583000},"page":"641-655","source":"Crossref","is-referenced-by-count":7,"title":["RimJump: Edge-based Shortest Path Planning for a 2D Map"],"prefix":"10.1017","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7532-4200","authenticated-orcid":false,"given":"Zhuo","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weimin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongliang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingzhu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenshuo","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangxing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"doi-asserted-by":"publisher","key":"S0263574718001236_ref15","DOI":"10.1177\/0278364914547786"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref13","DOI":"10.1109\/TRO.2010.2049527"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref8","DOI":"10.1177\/027836499000900605"},{"unstructured":"7. A. Nash , S. Koenig and C. A. Tovey , \u201cLazy Theta*: Any-angle path planning and path length analysis in 3D,\u201d Symposium on Combinatorial Search, SOCS, Stone Mountain, Atlanta, Georgia, USA, July DBLP (2010) pp. 299\u2013307.","key":"S0263574718001236_ref7"},{"key":"S0263574718001236_ref6","first-page":"201","volume-title":"AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","author":"Yap","year":"2011"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref2","DOI":"10.1177\/0278364908097578"},{"key":"S0263574718001236_ref12","first-page":"533","article-title":"Theta*: Any-angle path planning on grids","volume":"39","author":"Nash","year":"2014","journal-title":"J. Artif. Intell. Res."},{"key":"S0263574718001236_ref9","first-page":"262","volume-title":"Fifteenth International Conference on International Conference on Automated Planning and Scheduling","author":"Likhachev","year":"2005"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref3","DOI":"10.1017\/CBO9780511546877"},{"doi-asserted-by":"crossref","unstructured":"33. G. Francis , L. Ott and F. Ramos , Stochastic functional gradient path planning in occupancy maps, Preprint arXiv:1705.05987 (2017).","key":"S0263574718001236_ref33","DOI":"10.1109\/ICRA.2017.7989436"},{"doi-asserted-by":"crossref","unstructured":"37. T. Arribas , M. G\u00f3mez and S. S\u00e1nchez , \u201cOptimal motion planning based on CACM-RL using SLAM,\u201d 44(8), 75\u201380 (2012).","key":"S0263574718001236_ref37","DOI":"10.1109\/IVS.2012.6232204"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref1","DOI":"10.1177\/1729881418757046"},{"doi-asserted-by":"crossref","unstructured":"21. N. A. Vien , N. H. Viet , S. G. Lee and T. C. Chung , \u201cObstacle avoidance path planning for mobile robot based on ant-Q reinforcement learning algorithm,\u201d International Symposium on Neural Networks, Nanjing, China, vol. 4491 (Springer, Berlin, Heidelberg, 2007) Vol. 4491, pp. 704\u2013713.","key":"S0263574718001236_ref21","DOI":"10.1007\/978-3-540-72383-7_83"},{"key":"S0263574718001236_ref4","first-page":"617","article-title":"Robot control system for window cleaning","volume":"1","author":"Farsi","year":"1994","journal-title":"Autom. Robot. Constr. XI"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref31","DOI":"10.1109\/TIE.2011.2109332"},{"key":"S0263574718001236_ref41","first-page":"363","volume-title":"Algorithmic and Computational Robotics: New Directions: The Fourth International Workshop on the Algorithmic Foundations of Robotics","author":"Leven","year":"2018"},{"key":"S0263574718001236_ref44","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1017\/S0263574714000289","article-title":"Algorithms for collision-free navigation of mobile robots in complex cluttered environments: A survey","volume":"33","author":"Michael","year":"2015","journal-title":"Robotica"},{"key":"S0263574718001236_ref10","doi-asserted-by":"crossref","first-page":"3310","DOI":"10.1109\/ROBOT.1994.351061","volume-title":"Proceedings of the IEEE International Conference on Robotics and Automation","volume":"4","author":"Stentz","year":"1994"},{"volume-title":"International Conference on Computer Design and Applications","year":"2010","author":"Brand","key":"S0263574718001236_ref23"},{"key":"S0263574718001236_ref26","first-page":"521","volume-title":"Proceedings of ICRA IEEE International Conference on Robotics and Automation","author":"Bohlin","year":"2000"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref34","DOI":"10.1109\/ISDA.2006.253908"},{"key":"S0263574718001236_ref14","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1177\/0278364909357643","article-title":"Reachable distance space: Efficient sampling-based planning for spatially constrained systems","volume":"29","author":"Thomas","year":"2010","journal-title":"Int. J. Robot. Res."},{"key":"S0263574718001236_ref43","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1017\/S0263574707003669","article-title":"Geometry for robot path planning","volume":"25","author":"Lyle","year":"2007","journal-title":"Robotica"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref39","DOI":"10.1145\/359156.359164"},{"key":"S0263574718001236_ref20","first-page":"132","article-title":"An ant colony algorithm based on grid method for mobile robot path planning","volume":"27","author":"Zhu","year":"2005","journal-title":"Robot"},{"doi-asserted-by":"crossref","unstructured":"22. J. Zhou , G. Dai , D-Q. He , J. Ma and X-Y. Cai , \u201cSwarm intelligence: Ant-based robot path planning,\u201d Fifth International Conference on Information Assurance and Security IEEE Computer Society, Xi\u2019an, China (2009), pp. 459\u2013463.","key":"S0263574718001236_ref22","DOI":"10.1109\/IAS.2009.120"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref5","DOI":"10.1177\/027836498600500305"},{"volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","year":"2005","author":"Choset","key":"S0263574718001236_ref17"},{"doi-asserted-by":"crossref","unstructured":"18. L. M. Gambardella and M. Dorigo , \u201cAnt-Q: A reinforcement learning approach to the traveling Salesman problem,\u201d Machine Learning, Proceedings of the Twelfth International Conference on Machine Learning, Tahoe City, California, USA, July DBLP (1995) pp. 252\u2013260.","key":"S0263574718001236_ref18","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"S0263574718001236_ref19","first-page":"25","volume-title":"International Conference on Information Technology and Applications","author":"Liu","year":"2005"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref24","DOI":"10.1017\/S0263574797000234"},{"key":"S0263574718001236_ref11","first-page":"1652","volume-title":"International Joint Conference on Artificial Intelligence","author":"Stentz","year":"1995"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref25","DOI":"10.1017\/S0263574798000289"},{"volume-title":"IEEE Congress on Evolutionary Computation","year":"2004","author":"Sedighi","key":"S0263574718001236_ref28"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref29","DOI":"10.1007\/3-540-57132-9_6"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref30","DOI":"10.3844\/jcssp.2008.341.344"},{"key":"S0263574718001236_ref36","first-page":"735","volume-title":"Proceedings 2003 IEEE\/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003)","author":"Lee","year":"2003"},{"key":"S0263574718001236_ref38","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1017\/S0263574711000452","article-title":"Optimal motion planning by reinforcement learning in autonomous mobile vehicles","volume":"30","author":"Meziat","year":"2012","journal-title":"Robotica"},{"doi-asserted-by":"publisher","key":"S0263574718001236_ref32","DOI":"10.1177\/027836498600500106"},{"key":"S0263574718001236_ref35","first-page":"2190","volume-title":"Proceedings of the, IEEE SICE Conference","author":"Park","year":"2003"},{"volume-title":"Computational Geometry","year":"2013","author":"de Berg","key":"S0263574718001236_ref40"},{"key":"S0263574718001236_ref42","first-page":"333","article-title":"Computational geometry: Algorithms and applications","volume":"19","author":"De Berg","year":"2008","journal-title":"Math. Gaz."},{"key":"S0263574718001236_ref27","first-page":"1221","volume-title":"IEEE International Conference on Robotics and Automation","author":"Tu","year":"2003"},{"key":"S0263574718001236_ref16","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TRO.2005.853485","article-title":"Narrow passage sampling for probabilistic roadmap planning","volume":"21","author":"Sun","year":"2005","journal-title":"IEEE Trans. Robot."}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574718001236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T04:34:06Z","timestamp":1662525246000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574718001236\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,29]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["S0263574718001236"],"URL":"https:\/\/doi.org\/10.1017\/s0263574718001236","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"type":"print","value":"0263-5747"},{"type":"electronic","value":"1469-8668"}],"subject":[],"published":{"date-parts":[[2018,11,29]]}}}