{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:51:36Z","timestamp":1767649896847,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/icra40945.2020.9197206","type":"proceedings-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T21:25:46Z","timestamp":1600205146000},"page":"3574-3580","source":"Crossref","is-referenced-by-count":31,"title":["An NMPC Approach using Convex Inner Approximations for Online Motion Planning with Guaranteed Collision Avoidance"],"prefix":"10.1109","author":[{"given":"Tobias","family":"Schoels","sequence":"first","affiliation":[]},{"given":"Luigi","family":"Palmieri","sequence":"additional","affiliation":[]},{"given":"Kai O.","family":"Arras","sequence":"additional","affiliation":[]},{"given":"Moritz","family":"Diehl","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"0","key":"ref33","article-title":"Gurobi optimizer reference manual"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/15M1020575"},{"key":"ref31","article-title":"CasADi: a software framework for nonlinear optimization and optimal control","author":"andersson","year":"2018","journal-title":"Mathematical Programming Computation"},{"journal-title":"A collection of Fortran codes for large scale scienti c computation","year":"2011","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2012.08.010"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2016.11.007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2013.6669836"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/oca.2123"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2466911"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487274"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942562"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487439"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10013-018-0311-1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/70.88137"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989731"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914528132"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139246"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913488805"},{"key":"ref6","article-title":"Optimization-based collision avoidance","author":"zhang","year":"2017","journal-title":"arXiv preprint arXiv 1711 03890"},{"article-title":"IPOPT - an Interior Point OPTimizer","year":"2009","author":"w\u00a4achter","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263867"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2028959"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794205"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364902021012002"},{"key":"ref9","first-page":"835","article-title":"A convex optimization approach to smooth trajectories for motion planning with car-like robots","author":"zhu","year":"2015","journal-title":"Proc IEEE Conf Decis Control (CDC)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1993.291936"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/100.580977"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1177\/027836499801700706"},{"key":"ref21","first-page":"1615","article-title":"The lane-curvature method for local obstacle avoidance","volume":"3","author":"ko","year":"1998","journal-title":"IEEE\/RSJ Int Conf Intell Rob Syst (IROS)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0893-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2003.820849"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0559-y"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-6670(17)61205-9"}],"event":{"name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2020,5,31]]},"location":"Paris, France","end":{"date-parts":[[2020,8,31]]}},"container-title":["2020 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9187508\/9196508\/09197206.pdf?arnumber=9197206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:15:13Z","timestamp":1656375313000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9197206\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/icra40945.2020.9197206","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}