{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:03:22Z","timestamp":1768338202377,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T00:00:00Z","timestamp":1715385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T00:00:00Z","timestamp":1715385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10878-024-01148-4","type":"journal-article","created":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T15:01:18Z","timestamp":1715439678000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1903-3510","authenticated-orcid":false,"given":"Phan Thanh","family":"An","sequence":"first","affiliation":[]},{"given":"Nguyen Thi","family":"Le","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,11]]},"reference":[{"key":"1148_CR1","volume-title":"Optimization Approaches for computational geometry","author":"PT An","year":"2017","unstructured":"An PT (2017) Optimization Approaches for computational geometry. Publishing House for Science and Technology, Vietnam Academy of Science and Technology, Hanoi"},{"key":"1148_CR2","unstructured":"An PT (2023) Determine sequences of bundles of line segments to minimize the length of escape route of autonomous robots with limited vision finding the path to goal in unknown environments. In preparation for registering a patent for a useful solution to protect its exclusive rights, Ho Chi Minh city"},{"key":"1148_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.cam.2012.11.001","volume":"244","author":"PT An","year":"2013","unstructured":"An PT, Hai NN, Hoai TV (2013) Direct multiple shooting method for solving approximate shortest path problems. J Comput Appl Math 244:67\u201376","journal-title":"J Comput Appl Math"},{"issue":"4","key":"1148_CR4","first-page":"1","volume":"37","author":"PT An","year":"2018","unstructured":"An PT, Trang LH (2018) Multiple shooting approach for computing shortest descending paths on convex terrains. Comput Appl Math 37(4):1\u201331","journal-title":"Comput Appl Math"},{"key":"1148_CR5","unstructured":"An PT, Anh PH, Binh TT, Hoai TV (2022) Autonomous robot with limited vision range: a path planning in unknown environment, https:\/\/imacs.hcmut.edu.vn\/prePrint\/648184431c30736e43782739_AutonomousRobot_A20230608.pdf"},{"key":"1148_CR6","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TSMC.1985.6313352","volume":"2","author":"RA Brooks","year":"1985","unstructured":"Brooks RA, Lozano-Perez T (1985) A subdivision algorithm in configuration space for findpath with rotation. IEEE Trans Syst Man Cybern 2:224\u2013233","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"9","key":"1148_CR7","first-page":"789","volume":"8","author":"D Glavaski","year":"2009","unstructured":"Glavaski D, Volf M, Bonkovic M (2009) Mobile robot path planning using exact cell decomposition and potential field methods. WSEAS Trans Circuits Syst 8(9):789\u2013800","journal-title":"WSEAS Trans Circuits Syst"},{"issue":"4","key":"1148_CR8","first-page":"1089","volume":"26","author":"NN Hai","year":"2019","unstructured":"Hai NN, An PT, Huyen PTT (2019) Shortest paths along a sequence of line segments in Euclidean spaces. J Convex Anal 26(4):1089\u20131112","journal-title":"J Convex Anal"},{"issue":"3","key":"1148_CR9","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10957-011-9868-5","volume":"151","author":"NN Hai","year":"2011","unstructured":"Hai NN, An PT (2011) Blaschke-type theorem and separation of disjoint closed geodesic convex sets. J Optim Theory Appl 151(3):541\u2013551","journal-title":"J Optim Theory Appl"},{"key":"1148_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.cam.2016.10.026","volume":"317","author":"TV Hoai","year":"2017","unstructured":"Hoai TV, An PT, Hai NN (2017) Multiple shooting approach for computing approximately shortest paths on convex polytopes. J Comput Appl Math 317:235\u2013246","journal-title":"J Comput Appl Math"},{"issue":"7","key":"1148_CR11","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1177\/0278364906067174","volume":"25","author":"D Hsu","year":"2006","unstructured":"Hsu D, Latombe JC, Kurniawati H (2006) On the probabilistic foundations of probabilistic roadmap planning. Int J Robot Res 25(7):627\u2013643","journal-title":"Int J Robot Res"},{"key":"1148_CR12","first-page":"537","volume-title":"Int Conf Knowl Based Intell Inf Eng Syst","author":"V Kunchev","year":"2006","unstructured":"Kunchev V, Jain L, Ivancevic V, Finn A (2006) Path planning and obstacle avoidance for autonomous mobile robots: a review. Int Conf Knowl Based Intell Inf Eng Syst. Springer, Berlin, Heidelberg, pp 537\u2013544"},{"issue":"2","key":"1148_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1109\/TRA.2004.824649","volume":"20","author":"AM Ladd","year":"2004","unstructured":"Ladd AM, Kavraki LE (2004) Measure theoretic analysis of probabilistic path planning. IEEE Trans Robot Autom 20(2):229\u2013242","journal-title":"IEEE Trans Robot Autom"},{"issue":"3","key":"1148_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee DT, Preparata FP (1984) Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3):393\u2013410","journal-title":"Networks"},{"key":"1148_CR15","first-page":"53","volume-title":"Rubberband algorithms","author":"F Li","year":"2011","unstructured":"Li F, Klette R (2011) Rubberband algorithms. Euclidean Shortest Paths. Springer, London, pp 53\u201389"},{"key":"1148_CR16","doi-asserted-by":"crossref","unstructured":"Mitchell JS (2000) Geometric shortest paths and network optimization. In: Elsevier Science BV (ed) Handbook of Computational Geometry. Amsterdam, pp 633\u2013702","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"1148_CR17","unstructured":"Polishchuk V, Mitchell JS (2005) Touring convex bodies-a conic programming solution. In: Canadian conference on computational geometry, pp 290\u2013293"},{"key":"1148_CR18","doi-asserted-by":"crossref","unstructured":"Rosell J, Iniguez P (2005) Path planning using harmonic functions and probabilistic cell decomposition. In: Proceedings of the 2005 IEEE international conference on robotics and automation, IEEE, pp 1803\u20131808","DOI":"10.1109\/ROBOT.2005.1570375"},{"key":"1148_CR19","doi-asserted-by":"crossref","unstructured":"Sedighi KH, Ashenayi K, Manikas TW, Wainwright RL, Tai HM (2004) Autonomous local path planning for a mobile robot using a genetic algorithm. In: Proceedings of the 2004 congress on evolutionary computation, Vol. 2, IEEE, pp 1338\u20131345","DOI":"10.1109\/CEC.2004.1331052"},{"key":"1148_CR20","volume-title":"Introduction to autonomous mobile robots","author":"R Siegwart","year":"2011","unstructured":"Siegwart R, Nourbakhsh IR, Scaramuzza D (2011) Introduction to autonomous mobile robots. The MIT Press Cambridge, Massachusetts London, England"},{"key":"1148_CR21","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-70004-5_5","volume-title":"International Conference on Future Data and Security Engineering","author":"LH Trang","year":"2017","unstructured":"Trang LH, Chi TQ, Khanh D (2017) An iterative algorithm for computing shortest paths through line segments in 3D. International Conference on Future Data and Security Engineering. Springer, Cham, pp 73\u201384"},{"issue":"1","key":"1148_CR22","first-page":"249","volume":"30","author":"LH Trang","year":"2023","unstructured":"Trang LH, Le NT, An PT (2023) Finding approximately convex ropes in the plane. J Convex Anal 30(1):249\u2013270","journal-title":"J Convex Anal"},{"key":"1148_CR23","doi-asserted-by":"crossref","unstructured":"Warren CW (1993) Fast path planning using modified A* method. In: Proceedings IEEE international conference on robotics and automation, IEEE, pp 662\u2013667","DOI":"10.1109\/ROBOT.1993.291883"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01148-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01148-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01148-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:39:01Z","timestamp":1721659141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01148-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,11]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1148"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01148-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,11]]},"assertion":[{"value":"18 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"71"}}