{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T21:03:51Z","timestamp":1781211831267,"version":"3.54.1"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Flanders Make's SBO"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tro.2026.3695992","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T19:38:21Z","timestamp":1779478701000},"page":"2215-2230","source":"Crossref","is-referenced-by-count":0,"title":["Kinematically Constrained Marching for Optimal Reeds\u2013Shepp Nonholonomic Path Planning on 2-D Cartesian Grids"],"prefix":"10.1109","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6840-558X","authenticated-orcid":false,"given":"Ibrahim","family":"Ibrahim","sequence":"first","affiliation":[{"name":"Department of Mechanical Engineering, MECO Research Team, KU Leuven, Heverlee, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9724-8103","authenticated-orcid":false,"given":"Wilm","family":"Decr\u00e9","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, MECO Research Team, KU Leuven, Heverlee, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2034-5519","authenticated-orcid":false,"given":"Jan","family":"Swevers","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, MECO Research Team, KU Leuven, Heverlee, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"367","article-title":"Optimal paths for a car that goes both forwards and backwards","volume-title":"Pacific J. Math.","volume":"145","author":"Reeds","year":"1990"},{"key":"ref2","article-title":"Efficient constrained path planning via search in state lattices","author":"Pivtoraiko","year":"2005"},{"key":"ref3","article-title":"Practical search techniques in path planning for autonomous driving","author":"Dolgov","year":"2008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref5","article-title":"Rapidly-exploring random trees: A new tool for path planning","volume-title":"Annu. Res. Rep.","author":"LaValle","year":"1998"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/lra.2024.3460409"},{"key":"ref7","article-title":"Path planning algorithms in the autonomous driving system: A comprehensive review","volume-title":"Robot. Auton. Syst.","volume":"174","author":"Reda","year":"2024"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA57147.2024.10611529"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/tro.2025.3554406"},{"key":"ref10","article-title":"CL-MAPF: Multi-agent path finding for car-like robots with kinematic and spatiotemporal constraints","volume-title":"Robot. Auton. Syst.","volume":"150","author":"Wen","year":"2022"},{"key":"ref11","article-title":"Open-source, cost-aware kinematically feasible planning for mobile and surface robotics","author":"Macenski","year":"2024"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.93.4.1591"},{"issue":"6","key":"ref13","first-page":"784","article-title":"Fast marching methods for curvature penalized shortest paths","volume-title":"J. Math. Imag. Vis.","volume":"60","author":"Mirebeau","year":"2018"},{"key":"ref14","article-title":"Optimal paths for variants of the 2D and 3D reeds-shepp car with applications in image analysis","author":"Duits","year":"2017"},{"issue":"4","key":"ref15","first-page":"72","article-title":"The open motion planning library","volume-title":"IEEE Robot. Automat. Mag.","volume":"19","author":"ucan","year":"2012"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8860\/11297026\/11534126.pdf?arnumber=11534126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T20:04:23Z","timestamp":1781208263000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11534126\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/tro.2026.3695992","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}