{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:39:00Z","timestamp":1774964340723,"version":"3.50.1"},"reference-count":58,"publisher":"SAGE Publications","issue":"12","license":[{"start":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:00:00Z","timestamp":1630281600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.sagepub.com\/licence-information-for-chorus"}],"funder":[{"DOI":"10.13039\/100002427","name":"Ford Motor Company","doi-asserted-by":"publisher","award":["N022977"],"award-info":[{"award-number":["N022977"]}],"id":[{"id":"10.13039\/100002427","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2575"],"award-info":[{"award-number":["N00014-18-1-2575"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1239037"],"award-info":[{"award-number":["CNS-1239037"]}],"id":[{"id":"10.13039\/100000001","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":[[2020,10]]},"abstract":"<jats:p> To operate with limited sensor horizons in unpredictable environments, autonomous robots use a receding-horizon strategy to plan trajectories, wherein they execute a short plan while creating the next plan. However, creating safe, dynamically feasible trajectories in real time is challenging, and planners must ensure persistent feasibility, meaning a new trajectory is always available before the previous one has finished executing. Existing approaches make a tradeoff between model complexity and planning speed, which can require sacrificing guarantees of safety and dynamic feasibility. This work presents the Reachability-based Trajectory Design (RTD) method for trajectory planning. RTD begins with an offline forward reachable set (FRS) computation of a robot\u2019s motion when tracking parameterized trajectories; the FRS provably bounds tracking error. At runtime, the FRS is used to map obstacles to parameterized trajectories, allowing RTD to select a safe trajectory at every planning iteration. RTD prescribes an obstacle representation to ensure that obstacle constraints can be created and evaluated in real time while maintaining safety. Persistent feasibility is achieved by prescribing a minimum sensor horizon and a minimum duration for the planned trajectories. A system decomposition approach is used to improve the tractability of computing the FRS, allowing RTD to create more complex plans at runtime. RTD is compared in simulation with rapidly-exploring random trees and nonlinear model-predictive control. RTD is also demonstrated in randomly crafted environments on two hardware platforms: a differential-drive Segway and a car-like Rover. The proposed method is safe and persistently feasible across thousands of simulations and dozens of real-world hardware demos. <\/jats:p>","DOI":"10.1177\/0278364920943266","type":"journal-article","created":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T05:36:36Z","timestamp":1598852196000},"page":"1419-1469","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":87,"title":["Bridging the gap between safety and real-time performance in receding-horizon trajectory design for mobile robots"],"prefix":"10.1177","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1348-7463","authenticated-orcid":false,"given":"Shreyas","family":"Kousik","sequence":"first","affiliation":[{"name":"Department of Mechanical Engineering, University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Sean","family":"Vaskov","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Fan","family":"Bu","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Matthew","family":"Johnson-Roberson","sequence":"additional","affiliation":[{"name":"Department of Naval Architecture and Marine Engineering, University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Ram","family":"Vasudevan","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, University of Michigan, Ann Arbor, MI, USA"}]}],"member":"179","published-online":{"date-parts":[[2020,8,30]]},"reference":[{"key":"bibr1-0278364920943266","author":"Ahnert K","year":"2011","journal-title":"CoRR"},{"key":"bibr2-0278364920943266","unstructured":"Althoff M (2015) An Introduction to CORA 2015. Available at: https:\/\/tumcps.github.io\/CORA\/"},{"key":"bibr3-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2014.2312453"},{"key":"bibr4-0278364920943266","author":"Ansari A","year":"2017","journal-title":"CoRR"},{"key":"bibr5-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03991-1"},{"key":"bibr6-0278364920943266","author":"Chen M","year":"2016","journal-title":"arXiv preprint arXiv:1609.05248"},{"key":"bibr7-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2797194"},{"key":"bibr8-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980268"},{"key":"bibr9-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2014.2302442"},{"key":"bibr10-0278364920943266","volume-title":"Proceedings of the International Symposium on Advanced Vehicle Control (AVEC \u201908)","author":"Falcone P","year":"2008"},{"key":"bibr11-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2007.894653"},{"key":"bibr12-0278364920943266","volume-title":"Minkowksi Sums and Offset Polygons","author":"Fogel E","year":"2012"},{"key":"bibr13-0278364920943266","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2013.6669836"},{"key":"bibr14-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1145\/360881.360919"},{"key":"bibr15-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793905"},{"key":"bibr16-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2014.6859253"},{"key":"bibr17-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1080\/00423114.2014.902537"},{"key":"bibr18-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2498841"},{"key":"bibr19-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2012.6315303"},{"key":"bibr20-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263867"},{"key":"bibr21-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487258"},{"key":"bibr22-0278364920943266","doi-asserted-by":"crossref","unstructured":"Holmes P, Kousik S, Zhang B, et al. (2020) Reachable sets for safe, real-time manipulator trajectory design. In: arXiv preprint arXiv:2002.01591. Available at: https:\/\/roboticsconference.org\/program\/papers\/100\/","DOI":"10.15607\/RSS.2020.XVI.100"},{"key":"bibr23-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906075328"},{"key":"bibr24-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"bibr25-0278364920943266","author":"Johnson-Roberson M","year":"2016","journal-title":"arXiv preprint arXiv:1610.01983"},{"key":"bibr26-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"bibr27-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"bibr28-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1115\/DSCC2019-9214"},{"key":"bibr29-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1115\/DSCC2017-5361"},{"key":"bibr30-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2008.2012116"},{"key":"bibr31-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1142\/p665"},{"key":"bibr32-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"bibr33-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"bibr34-0278364920943266","author":"Liniger A","year":"2017","journal-title":"arXiv preprint arXiv:1701.08735"},{"key":"bibr35-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46448-0_2"},{"key":"bibr36-0278364920943266","doi-asserted-by":"publisher","DOI":"10.2514\/6.2010-8160"},{"key":"bibr37-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917712421"},{"key":"bibr38-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914528059"},{"key":"bibr39-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980223"},{"key":"bibr40-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.851439"},{"key":"bibr41-0278364920943266","unstructured":"MOSEK APS (2010) The MOSEK optimization software. http:\/\/www.mosek.com."},{"key":"bibr42-0278364920943266","volume-title":"Topology","author":"Munkres J","year":"2000","edition":"2"},{"key":"bibr43-0278364920943266","doi-asserted-by":"publisher","DOI":"10.3846\/16484142.2007.9638146"},{"key":"bibr44-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5_10"},{"key":"bibr45-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487439"},{"key":"bibr46-0278364920943266","unstructured":"Parrilo PA (2000) Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology Pasadena, CA."},{"key":"bibr47-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1145\/2558904"},{"key":"bibr48-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/ICTTA.2006.1684472"},{"key":"bibr49-0278364920943266","volume-title":"Vehicle Dynamics and Control","author":"Rajamani R","year":"2011"},{"key":"bibr50-0278364920943266","volume-title":"Principles of Mathematical Analysis","author":"Rudin W","year":"1976"},{"key":"bibr51-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1982.11995491"},{"key":"bibr52-0278364920943266","unstructured":"Tobenkin MM, Permenter F, Megretski A (2013) Spotless polynomial and conic optimization. https:\/\/github.com\/spot-toolbox\/spotless"},{"key":"bibr53-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20255"},{"key":"bibr54-0278364920943266","unstructured":"Vandiver J, Gossard D (2011) 2.003SC Engineering Dynamics Course. https:\/\/ocw.mit.edu\/courses\/mechanical-engineering\/2-003sc-engineering-dynamics-fall-2011\/ (accessed: 20 August 2018)."},{"key":"bibr55-0278364920943266","author":"Vaskov S","year":"2019","journal-title":"arXiv preprint arXiv:1902.02851"},{"key":"bibr56-0278364920943266","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2019.8814853"},{"key":"bibr57-0278364920943266","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7354071"},{"key":"bibr58-0278364920943266","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8431536"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364920943266","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0278364920943266","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364920943266","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364920943266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T19:40:51Z","timestamp":1740685251000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0278364920943266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,30]]},"references-count":58,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["10.1177\/0278364920943266"],"URL":"https:\/\/doi.org\/10.1177\/0278364920943266","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"value":"0278-3649","type":"print"},{"value":"1741-3176","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,30]]}}}