{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:11:37Z","timestamp":1746591097335,"version":"3.40.5"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:00:00Z","timestamp":1739318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:00:00Z","timestamp":1739318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100009595","name":"SPW","doi-asserted-by":"publisher","award":["8672"],"award-info":[{"award-number":["8672"]}],"id":[{"id":"10.13039\/501100009595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"FWO","doi-asserted-by":"publisher","award":["FWO1SHBX24N"],"award-info":[{"award-number":["FWO1SHBX24N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004744","name":"Innoviris","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004744","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,2,12]]},"DOI":"10.1109\/icara64554.2025.10977725","type":"proceedings-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T17:52:10Z","timestamp":1746467530000},"page":"399-403","source":"Crossref","is-referenced-by-count":0,"title":["On an Almost Closed-Form Fast Generation of Euclidean Shortest Path Trajectories in Cluttered Environments"],"prefix":"10.1109","author":[{"given":"Ouassim","family":"Benhamouche","sequence":"first","affiliation":[{"name":"Université Libre de Bruxelles,SAAS,Brussels,Belgium"}]},{"given":"Zemerart","family":"Asani","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Brussel, imec,Brubotics,Brussels,Belgium"}]},{"given":"Andr\u00e9s","family":"Cotorruelo","sequence":"additional","affiliation":[{"name":"Université Libre de Bruxelles,SAAS,Brussels,Belgium"}]},{"given":"Benjamin","family":"Wauthion","sequence":"additional","affiliation":[{"name":"Université Libre de Bruxelles,SAAS,Brussels,Belgium"}]},{"given":"Bram","family":"Vanderborght","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Brussel, imec,Brubotics,Brussels,Belgium"}]},{"given":"Emanuele","family":"Garone","sequence":"additional","affiliation":[{"name":"Université Libre de Bruxelles,SAAS,Brussels,Belgium"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3010819"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/s20071880"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-023-02561-y"},{"issue":"2","key":"ref4","first-page":"77","article-title":"Shortest path to a segment and quickest visibility queries","volume":"7","author":"Arkin","year":"2016","journal-title":"Journal of Computational Geometry"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1117\/12.2197062"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107110"},{"key":"ref7","first-page":"717","article-title":"A visibility graph based method for path planning in dynamic environments","volume-title":"2011 Proceedings of the 34th International Convention MIPRO","author":"Kaludjer","year":"2011"},{"volume-title":"Principles of robot motion: theory, algorithms, and implementations","year":"2005","author":"Choset","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-017-0642-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840436"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2014.04.001"},{"issue":"9","key":"ref13","first-page":"557","article-title":"An efficient algorithm for finding the visibility polygon for a polygonal region with holes","volume":"68","author":"Asano","year":"1985","journal-title":"IEICE TRANSACTIONS (1976-1990)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.65"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89550-3_5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MetroSea52177.2021.9611571"},{"key":"ref18","article-title":"Wheeled mobile robotics: from fundamentals towards autonomous systems","volume-title":"Butterworth-Heinemann","author":"Klancar","year":"2017"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/584"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s41315-023-00298-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.23919\/SICE48898.2020.9240227"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1976.16"}],"event":{"name":"2025 11th International Conference on Automation, Robotics, and Applications (ICARA)","start":{"date-parts":[[2025,2,12]]},"location":"Zagreb, Croatia","end":{"date-parts":[[2025,2,14]]}},"container-title":["2025 11th International Conference on Automation, Robotics, and Applications (ICARA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10977061\/10977571\/10977725.pdf?arnumber=10977725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T04:54:17Z","timestamp":1746507257000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10977725\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,12]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icara64554.2025.10977725","relation":{},"subject":[],"published":{"date-parts":[[2025,2,12]]}}}