{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T20:06:24Z","timestamp":1779912384301,"version":"3.53.1"},"reference-count":43,"publisher":"SAGE Publications","issue":"10","license":[{"start":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T00:00:00Z","timestamp":1690761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:p>In this paper, we address the trajectory planning problem in uncertain nonconvex static and dynamic environments that contain obstacles with probabilistic location, size, and geometry. To address this problem, we provide a risk-bounded trajectory planning method that looks for continuous-time trajectories with guaranteed bounded risk over the planning time horizon. Risk is defined as the probability of collision with uncertain obstacles. Existing approaches to address risk-bounded trajectory planning problems either are limited to Gaussian uncertainties and convex obstacles or rely on sampling-based methods that need uncertainty samples and time discretization. To address the risk-bounded trajectory planning problem, we leverage the notion of risk contours to transform the risk-bounded planning problem into a deterministic optimization problem. Risk contours are the set of all points in the uncertain environment with guaranteed bounded risk. The obtained deterministic optimization is, in general, nonlinear and nonconvex time-varying optimization. We provide convex methods based on sum-of-squares optimization to efficiently solve the obtained nonconvex time-varying optimization problem and obtain the continuous-time risk-bounded trajectories without time discretization. The provided approach deals with arbitrary (and known) probabilistic uncertainties, nonconvex and nonlinear, static and dynamic obstacles, and is suitable for online trajectory planning problems. In addition, we provide convex methods based on sum-of-squares optimization to build the max-sized tube with respect to its parameterization along the trajectory so that any state inside the tube is guaranteed to have bounded risk.<\/jats:p>","DOI":"10.1177\/02783649231183458","type":"journal-article","created":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T22:31:11Z","timestamp":1690842671000},"page":"705-728","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":12,"title":["Convex risk-bounded continuous-time trajectory planning and tube design in uncertain nonconvex environments"],"prefix":"10.1177","volume":"42","author":[{"given":"Ashkan","family":"Jasour","sequence":"first","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2778-0567","authenticated-orcid":false,"given":"Weiqiao","family":"Han","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brian C.","family":"Williams","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2023,7,31]]},"reference":[{"key":"bibr1-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2020.1117"},{"key":"bibr2-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918778338"},{"key":"bibr3-02783649231183458","unstructured":"Bellon A, Henrion D, Kungurtsev V, et al. (2021) Time-varying semidefinite programming: geometry of the trajectory of solutions.\n                      arXiv preprint arXiv:2104.05445\n                      ."},{"key":"bibr4-02783649231183458","doi-asserted-by":"publisher","DOI":"10.2514\/6.2009-5876"},{"key":"bibr5-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2044948"},{"key":"bibr6-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2161160"},{"key":"bibr7-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2006.875041"},{"key":"bibr8-02783649231183458","unstructured":"Cannon M (2017) Chance-constrained optimization with tight confidence bounds.\n                      arXiv preprint arXiv:1711.03747\n                      ."},{"key":"bibr9-02783649231183458","first-page":"86","volume-title":"Conference on Robot Learning","author":"Chai Y","year":"2020"},{"key":"bibr10-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28872-7_37"},{"key":"bibr11-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793660"},{"key":"bibr12-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341193"},{"key":"bibr13-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7138978"},{"key":"bibr14-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.01502"},{"key":"bibr15-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9811363"},{"key":"bibr16-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1080\/10556780802699201"},{"key":"bibr17-02783649231183458","volume-title":"Probability Essentials","author":"Jacod J","year":"2012"},{"key":"bibr18-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60916-4_20"},{"key":"bibr19-02783649231183458","unstructured":"Jasour A (2019) Risk aware and robust nonlinear planning (rarnop).\n                      Course Notes for MIT 16.S498\n                      . URL: rarnop.mit.edu."},{"key":"bibr20-02783649231183458","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2021.XVII.069"},{"key":"bibr21-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683600"},{"key":"bibr22-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618744"},{"key":"bibr23-02783649231183458","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2019.XV.056"},{"key":"bibr24-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561614"},{"key":"bibr25-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1002\/9780470172506.ch15"},{"key":"bibr26-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1837.17.228"},{"key":"bibr27-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"bibr28-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"bibr29-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"bibr30-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"bibr31-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812337"},{"key":"bibr32-02783649231183458","doi-asserted-by":"publisher","DOI":"10.2514\/6.2010-8160"},{"key":"bibr33-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1017\/9781316661239"},{"key":"bibr34-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1137\/050622328"},{"key":"bibr35-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0387-5"},{"key":"bibr36-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1993.42.42045"},{"key":"bibr37-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1145\/179812.179911"},{"key":"bibr38-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-017-0302-y"},{"key":"bibr39-02783649231183458","doi-asserted-by":"crossref","unstructured":"Schwarting W, Alonso-Mora J, Pauli L, et al. (2017) Parallel autonomy in automated vehicles: safe motion generation with minimal intervention. In: IEEE International Conference on Robotics and Automation (ICRA), Marina Bay Sands, Singapore, May 29\u2013June 3, 2017, pp. 1928\u20131935.","DOI":"10.1109\/ICRA.2017.7989224"},{"key":"bibr40-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593893"},{"key":"bibr41-02783649231183458","unstructured":"Tobenkin MM, Permenter F, Megretski A (2013) spotless: Polynomial and conic optimization. URL: github.com\/spot-toolbox\/spotless"},{"key":"bibr42-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812107"},{"key":"bibr43-02783649231183458","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.3010755"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/02783649231183458","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/02783649231183458","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/02783649231183458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:16:59Z","timestamp":1777457819000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/02783649231183458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,31]]},"references-count":43,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["10.1177\/02783649231183458"],"URL":"https:\/\/doi.org\/10.1177\/02783649231183458","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,31]]}}}