{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T03:51:08Z","timestamp":1781841068153,"version":"3.54.5"},"reference-count":36,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T00:00:00Z","timestamp":1777939200000},"content-version":"unspecified","delay-in-days":65,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Parking in narrow spaces presents significant challenges, often resulting in deviations between vehicle\u2019s final parking state (FPS) and normal FPS. These deviations can cause partial intrusion into the target parking spots, increasing the risk of collisions in the parking process and potentially making the parking spots unusable. To address these issues, this paper proposes an optimization method for both the parking path and FPS in narrow and non-ideal vertical parking scenarios. Initially, a partition-based calculation method for the minimum distance between the vehicle and obstacles (DBVO) was developed to quantitatively assess the impact of intrusion on parking safety. Following this, a predefined geometric set of clothoids is used to smooth curvature discontinuities in the parking path, and a four-phase parking path pattern is devised. Subsequently, a preferred method for parking manners is proposed by analyzing the effects of parking direction and maneuvers on spatial requirements. Finally, a two-step parking path optimization method is presented with the framework integrating both online and offline calculations, using the minimum DBVO field and a predefined path pattern. Comparative experiments demonstrate that this method could enhance the proportion of available intrusion scenarios, increase the success rate of effective path acquisition, and improve the overall quality of parking paths.<\/jats:p>","DOI":"10.1017\/s0263574726103324","type":"journal-article","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T06:31:17Z","timestamp":1777962677000},"page":"883-907","source":"Crossref","is-referenced-by-count":0,"title":["Two-step path planning for vertical parking in narrow non-ideal scenarios based on predefined path pattern and numerical optimization"],"prefix":"10.1017","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1956-6779","authenticated-orcid":false,"given":"Xiaoxiao","family":"Lv","sequence":"first","affiliation":[{"name":"Tongji University"},{"id":[{"id":"https:\/\/ror.org\/03rc6as71","id-type":"ROR","asserted-by":"publisher"}],"name":"Tongji University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenrui","family":"Jin","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03rc6as71","id-type":"ROR","asserted-by":"publisher"}],"name":"Tongji University"},{"id":[{"id":"https:\/\/ror.org\/03rc6as71","id-type":"ROR","asserted-by":"publisher"}],"name":"Tongji University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaxue","family":"Li","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03rc6as71","id-type":"ROR","asserted-by":"publisher"}],"name":"Tongji University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangping","family":"Qiu","sequence":"additional","affiliation":[{"name":"First Institute of Telecommunications Technology"},{"name":"Yangtze Communications Industry Group Co., Ltd."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Mo","sequence":"additional","affiliation":[{"name":"University of Oxford"},{"name":"University of Cambridge"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Fang","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03rc6as71","id-type":"ROR","asserted-by":"publisher"}],"name":"Tongji University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingyang","family":"Yu","sequence":"additional","affiliation":[{"name":"Tongji University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Yu","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03rc6as71","id-type":"ROR","asserted-by":"publisher"}],"name":"Tongji University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiangtao","family":"Yu","sequence":"additional","affiliation":[{"name":"Tongji University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2026,5,5]]},"reference":[{"key":"S0263574726103324_ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2023.123975"},{"key":"S0263574726103324_ref6","doi-asserted-by":"publisher","DOI":"10.3390\/vehicles4040063"},{"key":"S0263574726103324_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2021.103964"},{"key":"S0263574726103324_ref1","first-page":"1962","article-title":"Parking planning under limited parking corridor space","volume":"24","author":"Cai","year":"2023","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"S0263574726103324_ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2428705"},{"key":"S0263574726103324_ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.2998137"},{"key":"S0263574726103324_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s12239-023-0038-1"},{"key":"S0263574726103324_ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2022.3210000"},{"key":"S0263574726103324_ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3042120"},{"key":"S0263574726103324_ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2023.3268088"},{"key":"S0263574726103324_ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2008.2012116"},{"key":"S0263574726103324_ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2023.3268088"},{"key":"S0263574726103324_ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3109011"},{"key":"S0263574726103324_ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980105"},{"key":"S0263574726103324_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s42154-023-00244-1"},{"key":"S0263574726103324_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-024-05915-y"},{"key":"S0263574726103324_ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3183610"},{"key":"S0263574726103324_ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3310256"},{"key":"S0263574726103324_ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3209154"},{"key":"S0263574726103324_ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2014.2335054"},{"key":"S0263574726103324_ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2022.3225340"},{"key":"S0263574726103324_ref34","first-page":"1","article-title":"Research on automatic vertical parking path-planning algorithms for narrow parking spaces","volume":"12","author":"Wu","year":"2023","journal-title":"Electron"},{"key":"S0263574726103324_ref36","doi-asserted-by":"publisher","DOI":"10.3389\/fnbot.2023.1234962"},{"key":"S0263574726103324_ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3144867"},{"key":"S0263574726103324_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2022.103624"},{"key":"S0263574726103324_ref24","doi-asserted-by":"publisher","DOI":"10.3390\/s20247297"},{"key":"S0263574726103324_ref33","doi-asserted-by":"publisher","DOI":"10.23919\/ECC51009.2020.9143786"},{"key":"S0263574726103324_ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3225821"},{"key":"S0263574726103324_ref25","doi-asserted-by":"crossref","unstructured":"[25] Bernhard, J. , Gieselmann, R. , Esterle, K. and Knol, A. , \u201cExperience-Based Heuristic Search: Robust Motion Planning with Deep Q-Learning,\u201d In: IEEE Conf. Intell. Transp. Syst. Proceedings, ITSC, 2018 - November (2018) pp. 3175\u20133182 (IEEE).10.1109\/ITSC.2018.8569436","DOI":"10.1109\/ITSC.2018.8569436"},{"key":"S0263574726103324_ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2020.2991951"},{"key":"S0263574726103324_ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3017770"},{"key":"S0263574726103324_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2023.06.037"},{"key":"S0263574726103324_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.dt.2025.09.006"},{"key":"S0263574726103324_ref22","doi-asserted-by":"publisher","DOI":"10.3390\/s19183996"},{"key":"S0263574726103324_ref8","doi-asserted-by":"publisher","DOI":"10.1177\/0278364909359210"},{"key":"S0263574726103324_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2024.104909"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574726103324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T02:59:50Z","timestamp":1781837990000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574726103324\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["S0263574726103324"],"URL":"https:\/\/doi.org\/10.1017\/s0263574726103324","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}