{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:09:23Z","timestamp":1775146163801,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T00:00:00Z","timestamp":1659657600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T00:00:00Z","timestamp":1659657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61873235"],"award-info":[{"award-number":["61873235"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62173294"],"award-info":[{"award-number":["62173294"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017054","name":"NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization","doi-asserted-by":"crossref","award":["U1909206"],"award-info":[{"award-number":["U1909206"]}],"id":[{"id":"10.13039\/100017054","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100017054","name":"NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization","doi-asserted-by":"crossref","award":["U1809212"],"award-info":[{"award-number":["U1809212"]}],"id":[{"id":"10.13039\/100017054","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11370-022-00436-4","type":"journal-article","created":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T11:08:00Z","timestamp":1659697680000},"page":"537-555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Dual-layer multi-robot path planning in narrow-lane environments under specific traffic policies"],"prefix":"10.1007","volume":"15","author":[{"given":"Jiaxi","family":"Huo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9095-5905","authenticated-orcid":false,"given":"Ronghao","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Senlin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Meiqin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,5]]},"reference":[{"issue":"2","key":"436_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11370-021-00363-w","volume":"14","author":"K Sharma","year":"2021","unstructured":"Sharma K, Doriya R (2021) Coordination of multi-robot path planning for warehouse application using smart approach for identifying destinations. Intel Serv Robot 14(2):313\u2013325","journal-title":"Intel Serv Robot"},{"key":"436_CR2","doi-asserted-by":"crossref","unstructured":"Rodriguez S, Amato NM (2010) Behavior-based evacuation planning. In: 2010 IEEE international conference on robotics and automation. IEEE, pp 350\u2013355","DOI":"10.1109\/ROBOT.2010.5509502"},{"issue":"4","key":"436_CR3","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.robot.2007.08.005","volume":"56","author":"W Ren","year":"2008","unstructured":"Ren W, Sorensen N (2008) Distributed coordination architecture for multi-robot formation control. Robot Auton Syst 56(4):324\u2013333","journal-title":"Robot Auton Syst"},{"issue":"9","key":"436_CR4","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1177\/0278364917719333","volume":"36","author":"J Alonso-Mora","year":"2017","unstructured":"Alonso-Mora J, Baker S, Rus D (2017) Multi-robot formation control and object transport in dynamic environments via constrained optimization. Int J Robot Res 36(9):1000\u20131021","journal-title":"Int J Robot Res"},{"issue":"11","key":"436_CR5","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1177\/0278364905059067","volume":"24","author":"EJ Griffith","year":"2005","unstructured":"Griffith EJ, Akella S (2005) Coordinating multiple droplets in planar array digital microfluidic systems. Int J Robot Res 24(11):933\u2013949","journal-title":"Int J Robot Res"},{"issue":"6","key":"436_CR6","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1287\/trsc.2018.0826","volume":"52","author":"F Weidinger","year":"2018","unstructured":"Weidinger F, Boysen N, Briskorn D (2018) Storage assignment with rack-moving mobile robots in kiva warehouses. Transp Sci 52(6):1479\u20131495","journal-title":"Transp Sci"},{"key":"436_CR7","unstructured":"Singer S. Helped by robotics, Amazon expands windsor facility. https:\/\/www.courant.com\/business\/hc-biz-amazon-tech-warehouse-20180524-story.html"},{"issue":"1","key":"436_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW et al (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"issue":"2","key":"436_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"436_CR10","doi-asserted-by":"crossref","unstructured":"Erdmann M, Lozano-Perez T (1987) On multiple moving objects. In: IEEE International conference on robotics and automation","DOI":"10.21236\/ADA196213"},{"key":"436_CR11","unstructured":"Lavalle SM, Hutchinson SA (2002) Optimal motion planning for multiple robots having independent goals. In: Proceedings of IEEE international conference on robotics and automation"},{"key":"436_CR12","unstructured":"Yu J, Lavalle SM (2015) Optimal multi-robot path planning on graphs: structure and computational complexity. Comput Sci"},{"key":"436_CR13","first-page":"99","volume":"1\u20131","author":"J Li","year":"2020","unstructured":"Li J, Ran M, Xie L (2020) Efficient trajectory planning for multiple non-holonomic mobile robots via prioritized trajectory optimization. IEEE Robot Autom Lett 1\u20131:99","journal-title":"IEEE Robot Autom Lett"},{"issue":"3","key":"436_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10846-021-01490-3","volume":"103","author":"G Huang","year":"2021","unstructured":"Huang G, Cai Y, Liu J, Qi Y, Liu X (2021) A novel hybrid discrete grey wolf optimizer algorithm for multi-UAV path planning. J Intell Rob Syst 103(3):1\u201318","journal-title":"J Intell Rob Syst"},{"key":"436_CR15","doi-asserted-by":"crossref","unstructured":"Surynek P (2010) An optimization variant of multi-robot path planning is intractable. In: Proceedings of the AAAI conference on artificial intelligence, vol 24","DOI":"10.1609\/aaai.v24i1.7767"},{"key":"436_CR16","doi-asserted-by":"crossref","unstructured":"Schouwenaars T, De\u00a0Moor B, Feron E, How J (2001) Mixed integer programming for multi-vehicle path planning. In: 2001 European control conference (ECC). IEEE, pp 2603\u20132608","DOI":"10.23919\/ECC.2001.7076321"},{"issue":"5","key":"436_CR17","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/TRO.2016.2593448","volume":"32","author":"J Yu","year":"2016","unstructured":"Yu J, LaValle SM (2016) Optimal multirobot path planning on graphs: complete algorithms and effective heuristics. IEEE Trans Rob 32(5):1163\u20131177","journal-title":"IEEE Trans Rob"},{"key":"436_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon G, Stern R, Felner A, Sturtevant NR (2015) Conflict-based search for optimal multi-agent pathfinding. Artif Intell 219:40\u201366","journal-title":"Artif Intell"},{"key":"436_CR19","doi-asserted-by":"crossref","unstructured":"Okumura K, Machida M, D\u00e9fago X, Tamura Y (2019) Priority inheritance with backtracking for iterative multi-agent path finding. arXiv preprint arXiv:1901.11282","DOI":"10.24963\/ijcai.2019\/76"},{"key":"436_CR20","doi-asserted-by":"crossref","unstructured":"Barer M, Sharon G, Stern R, Felner A (2014) Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. In: Seventh annual symposium on combinatorial search","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"436_CR21","doi-asserted-by":"crossref","unstructured":"Guo T, Han SD, Yu J (2021) Spatial and temporal splitting heuristics for multi-robot motion planning. arXiv preprint arXiv:2103.14111","DOI":"10.1109\/ICRA48506.2021.9561899"},{"issue":"2","key":"436_CR22","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1109\/LRA.2020.2967326","volume":"5","author":"SD Han","year":"2020","unstructured":"Han SD, Yu J (2020) Ddm: fast near-optimal multi-robot path planning using diversified-path and optimal sub-problem solution database heuristics. IEEE Robot Autom Lett 5(2):1350\u20131357","journal-title":"IEEE Robot Autom Lett"},{"key":"436_CR23","unstructured":"Wang KHC, Botea A et al (2008) Fast and memory-efficient multi-agent pathfinding. In: ICAPS, pp 380\u2013387"},{"key":"436_CR24","unstructured":"Cohen L, Uras T, Koenig S (2015) Feasibility study: using highways for bounded-suboptimal multi-agent path finding. In: Eighth annual symposium on combinatorial search"},{"key":"436_CR25","doi-asserted-by":"crossref","unstructured":"Bolu A, Kor\u00e7ak \u00d6 (2019) Path planning for multiple mobile robots in smart warehouse. In: 2019 7th International conference on control, mechatronics and automation (ICCMA). IEEE, pp 144\u2013150","DOI":"10.1109\/ICCMA46720.2019.8988635"},{"key":"436_CR26","unstructured":"Gurobi Optimization, LLC: Gurobi optimizer reference manual (2021). https:\/\/www.gurobi.com"},{"key":"436_CR27","unstructured":"Ralphs T, G\u00fczelsoy M (2006) Duality and warm starting in integer programming. In: The proceedings of the 2006 NSF design, service, and manufacturing grantees and research conference (2006)"},{"issue":"1","key":"436_CR28","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/TPWRS.2019.2930706","volume":"35","author":"Y Chen","year":"2019","unstructured":"Chen Y, Wang F, Ma Y, Yao Y (2019) A distributed framework for solving and benchmarking security constrained unit commitment with warm start. IEEE Trans Power Syst 35(1):711\u2013720","journal-title":"IEEE Trans Power Syst"},{"key":"436_CR29","doi-asserted-by":"crossref","unstructured":"Koenig N, Howard A (2004) Design and use paradigms for gazebo, an open-source multi-robot simulator. In: 2004 IEEE\/RSJ international conference on intelligent robots and systems (IROS)(IEEE Cat. No. 04CH37566), vol 3. IEEE, pp 2149\u20132154","DOI":"10.1109\/IROS.2004.1389727"},{"key":"436_CR30","doi-asserted-by":"crossref","unstructured":"\u010c\u00e1p M, Vok\u0159\u00ednek J, Kleiner A (2015) Complete decentralized method for on-line multi-robot trajectory planning in well-formed infrastructures. In: Twenty-fifth international conference on automated planning and scheduling","DOI":"10.1609\/icaps.v25i1.13696"},{"key":"436_CR31","doi-asserted-by":"crossref","unstructured":"Han SD, Yu J (2019) Integer programming as a general solution methodology for path-based optimization in robotics: principles, best practices, and applications. In: 2019 IEEE\/RSJ international conference on intelligent robots and systems (IROS). IEEE, pp 1890\u20131897","DOI":"10.1109\/IROS40897.2019.8968479"},{"key":"436_CR32","unstructured":"Nguyen V, Obermeier P, Son TC, Schaub T, Yeoh W (2019) Generalized target assignment and path finding using answer set programming. In: Twelfth annual symposium on combinatorial search"},{"key":"436_CR33","unstructured":"Cohen L, Uras T, Kumar TS, Xu H, Ayanian N, Koenig S (2016) Improved solvers for bounded-suboptimal multi-agent path finding. In: Proceedings of the 2016 international joint conference on artificial intelligence (IJCAI), pp 3067\u20133074"},{"key":"436_CR34","unstructured":"Stanford Artificial Intelligence Laboratory et al.: Robotic operating system. https:\/\/www.ros.org"},{"key":"436_CR35","unstructured":"Quigley M, Conley K, Gerkey B, Faust J, Foote T, Leibs J, Wheeler R, Ng AY et al (2009) Ros: an open-source robot operating system. In: ICRA workshop on open source software, vol 3. Kobe, Japan, p 5"},{"key":"436_CR36","unstructured":"wiki.ros.org: diff_drive_controller. https:\/\/wiki.ros.org\/diff_drive_controller. last edited 2022-06-13 15:36:18 by Dr.No"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-022-00436-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-022-00436-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-022-00436-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:25:25Z","timestamp":1664537125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-022-00436-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,5]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["436"],"URL":"https:\/\/doi.org\/10.1007\/s11370-022-00436-4","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,5]]},"assertion":[{"value":"16 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All the authors mentioned in the manuscript have agreed for authorship, read and approved the manuscript, and given consent for submission and subsequent publication of the manuscript.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All the authors mentioned in the manuscript have agreed to the publication of the manuscript.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The MATLAB and Python codes used and analyzed during the study are available from the first author on reasonable request.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}