{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T10:00:31Z","timestamp":1777716031191,"version":"3.51.4"},"reference-count":63,"publisher":"SAGE Publications","issue":"13","license":[{"start":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T00:00:00Z","timestamp":1713830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/501100013209","name":"Hellenic Foundation for Research and Innovation","doi-asserted-by":"publisher","award":["9110"],"award-info":[{"award-number":["9110"]}],"id":[{"id":"10.13039\/501100013209","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p>In this paper, a novel optimal motion planning framework that enables navigating optimally from any initial, to any final position within confined workspaces with convex, moving obstacles is presented. Our method outputs a smooth velocity vector field, which is then employed as a reference controller in order to sub-optimally avoid moving obstacles. The proposed approach leverages and extends desirable properties of reactive methods in order to provide a provably convergent and safe solution. Our algorithm is evaluated with both static and moving obstacles in synthetic environments and is compared against a variety of existing methods. The efficacy and applicability of the proposed scheme is finally validated in a high-fidelity simulation environment.<\/jats:p>","DOI":"10.1177\/02783649241245729","type":"journal-article","created":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T03:12:44Z","timestamp":1713841964000},"page":"2027-2048","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["Reactive optimal motion planning to anywhere in the presence of moving obstacles"],"prefix":"10.1177","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4669-3204","authenticated-orcid":false,"given":"Panagiotis","family":"Rousseas","sequence":"first","affiliation":[{"name":"School of Mechanical Engineering, Control Systems Laboratory, National Technical University of Athens, Athens, Greece"}]},{"given":"Charalampos","family":"Bechlioulis","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Patras, Patra, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1229-3029","authenticated-orcid":false,"given":"Kostas","family":"Kyriakopoulos","sequence":"additional","affiliation":[{"name":"Center of AI & Robotics (CAIR), New York University, Abu Dhabi, UAE"}]}],"member":"179","published-online":{"date-parts":[[2024,4,23]]},"reference":[{"key":"bibr1-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2004.11.034"},{"key":"bibr2-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2638961"},{"key":"bibr3-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/ICRoM.2015.7367873"},{"key":"bibr4-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195910003451"},{"key":"bibr5-02783649241245729","doi-asserted-by":"crossref","unstructured":"Anastopoulos N, Nikas K, Goumas G, et al. (2009) Early experiences on accelerating Dijkstra\u2019s algorithm using transactional memory. In Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium, Chengdu, 10\u201312 August.","DOI":"10.1109\/IPDPS.2009.5161103"},{"key":"bibr6-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095053"},{"key":"bibr7-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980575"},{"key":"bibr64-02783649241245729","doi-asserted-by":"publisher","DOI":"10.4064\/fm-20-1-177-190"},{"key":"bibr9-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1016\/j.net.2018.11.018"},{"key":"bibr10-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9303745"},{"key":"bibr11-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/CAC57257.2022.10055420"},{"key":"bibr12-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3222953"},{"key":"bibr13-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/CACS50047.2020.9289780"},{"key":"bibr53-02783649241245729","volume-title":"CGAL User and Reference Manual","author":"Hachenberger P","year":"2024"},{"key":"bibr14-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"bibr15-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942565"},{"key":"bibr16-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1177\/02783649231209340"},{"key":"bibr17-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2008.4650993"},{"key":"bibr18-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"bibr19-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"bibr20-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195902000803"},{"key":"bibr21-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1991.131683"},{"key":"bibr22-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/ICNSC.2006.1673210"},{"key":"bibr23-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2004.1389727"},{"key":"bibr24-02783649241245729","unstructured":"Koenig S, Likhachev M (2002) D*lite. In Proceedings of the National Conference on Artificial Intelligence, St. Paul, MN, 21\u201326 August 1988, 476\u2013483."},{"key":"bibr25-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"bibr26-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.abc5986"},{"key":"bibr27-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1002\/9781118122631.ch11"},{"key":"bibr28-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1002\/9781118122631"},{"key":"bibr29-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2005.1582713"},{"key":"bibr30-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6161438"},{"key":"bibr31-02783649241245729","first-page":"04445","author":"Loizou SG","year":"2021","journal-title":"CoRR abs\/2103"},{"key":"bibr32-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.abk2822"},{"key":"bibr33-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1145\/2822013.2822036"},{"key":"bibr34-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2018.2830081"},{"key":"bibr35-02783649241245729","doi-asserted-by":"publisher","DOI":"10.21236\/ADA459660"},{"key":"bibr36-02783649241245729","unstructured":"Obermeyer KJ, Contributors (2008) VisiLibity: a c++ library for visibility computations in planar polygonal environments. https:\/\/www.VisiLibity.org.V1."},{"key":"bibr37-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915594679"},{"key":"bibr38-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/CDC51059.2022.9992744"},{"key":"bibr39-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2020.2998740"},{"key":"bibr40-02783649241245729","first-page":"5","volume-title":"ICRA Workshop on Open Source Software","volume":"3","author":"Quigley M","year":"2009"},{"key":"bibr41-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/70.163777"},{"key":"bibr42-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341148"},{"key":"bibr43-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3060711"},{"key":"bibr44-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3178788"},{"key":"bibr45-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3143308"},{"key":"bibr46-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10161189"},{"key":"bibr47-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981198"},{"key":"bibr48-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/IV47402.2020.9304644"},{"key":"bibr49-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3315210"},{"key":"bibr50-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636670"},{"key":"bibr51-02783649241245729","doi-asserted-by":"publisher","DOI":"10.4236\/ajor.2015.53013"},{"key":"bibr52-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/70.563653"},{"key":"bibr54-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2000.870304"},{"key":"bibr55-02783649241245729","doi-asserted-by":"publisher","DOI":"10.3390\/s23094464"},{"key":"bibr56-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/OCEANSChennai45887.2022.9775402"},{"key":"bibr57-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4738955"},{"key":"bibr58-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2987397"},{"key":"bibr59-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2020.2973327"},{"key":"bibr60-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-023-10088-7"},{"key":"bibr61-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3105491"},{"key":"bibr62-02783649241245729","volume-title":"Efficient Lqr-Cbf-Rrt*: Safe and Optimal Motion Planning","author":"Yang G","year":"2023"},{"key":"bibr63-02783649241245729","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-021-01867-z"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/02783649241245729","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/02783649241245729","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/02783649241245729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:17:10Z","timestamp":1777457830000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/02783649241245729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,23]]},"references-count":63,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10.1177\/02783649241245729"],"URL":"https:\/\/doi.org\/10.1177\/02783649241245729","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,23]]}}}