{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:04:57Z","timestamp":1764687897799,"version":"3.37.3"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"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\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#1751093"],"award-info":[{"award-number":["#1751093"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tro.2020.3036617","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T21:45:21Z","timestamp":1606340721000},"page":"815-830","source":"Crossref","is-referenced-by-count":12,"title":["Safe, Optimal, Real-Time Trajectory Planning With a Parallel Constrained Bernstein Algorithm"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1348-7463","authenticated-orcid":false,"given":"Shreyas","family":"Kousik","sequence":"first","affiliation":[]},{"given":"Bohao","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6431-6926","authenticated-orcid":false,"given":"Pengcheng","family":"Zhao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1978-0572","authenticated-orcid":false,"given":"Ram","family":"Vasudevan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"2005","author":"finkel","article-title":"Global optimization with the DIRECT algorithm","key":"ref39"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1007\/BF00941892"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1007\/s10107-010-0409-z"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1007\/s10107-011-0464-0"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1137\/090772952"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1137\/080729104"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1016\/0098-1354(94)E0032-I"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1201\/9780203026922"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1007\/s13675-015-0050-y"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1007\/s10107-011-0489-4"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1137\/S1052623400366802"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1137\/0403036"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1016\/j.tcs.2006.05.011"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1177\/0278364911406761"},{"year":"2007","author":"kuwata","article-title":"Trajectory planning for unmanned vehicles using robust receding horizon control","key":"ref1"},{"year":"2014","author":"kamyar","article-title":"Polynomial optimization with applications to stability analysis and control-alternatives to sum of squares","key":"ref20"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1177\/0278364918784361","article-title":"SE-S ync: A certifiably correct algorithm for synchronization over the special Euclidean group","volume":"38","author":"rosen","year":"0","journal-title":"Int J Robot Res"},{"key":"ref21","first-page":"291","article-title":"Stability and stabilization of polynomial dynamical systems using Bernstein polynomials","author":"sassi","year":"0","journal-title":"Proc 18th Int Conf Hybrid Syst Comput Control"},{"year":"2006","author":"nocedal","journal-title":"Numerical Optimization","key":"ref24"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/ICRA.2019.8794454"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/BF01581273"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1137\/S1052623403420857"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1109\/CDC.1992.371776"},{"year":"2020","author":"kousik","article-title":"Reachability-based trajectory design","key":"ref51"},{"doi-asserted-by":"publisher","key":"ref56","DOI":"10.21236\/ADA058633"},{"key":"ref55","first-page":"1","article-title":"The analytic domain in the implicit function theorem","volume":"4","author":"chang","year":"2003","journal-title":"JIPAM J Inequal Pure Appl Math"},{"year":"2019","author":"gavana","article-title":"Global Optimization Benchmarks and AMPGO","key":"ref54"},{"doi-asserted-by":"publisher","key":"ref53","DOI":"10.1109\/9.661615"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1007\/BF01097060"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1115\/DSCC2019-9214"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.15607\/RSS.2019.XV.051"},{"key":"ref40","first-page":"154","article-title":"The Bernstein algorithm","volume":"2","author":"garloff","year":"1993","journal-title":"Interval Comput"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ITSC.2019.8917052"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.23919\/ACC.2019.8814853"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.15607\/RSS.2020.XVI.100"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1023\/A:1024778309049","article-title":"Multivariate polynomial minimization and its application in signal processing","volume":"26","author":"qi","year":"0","journal-title":"J Global Optim"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/78.224247"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1109\/TSP.2002.808112","article-title":"Blind constant modulus equalization via convex optimization","volume":"51","author":"mariere","year":"2003","journal-title":"IEEE Trans Signal Process"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/j.laa.2006.08.026"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/780542.780545"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1177\/0278364917712421"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1002\/rob.20285"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/IVS.2016.7535446"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1002\/aic.690390208"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1177\/0278364920943266"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ICRA.2019.8793905"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.6028\/jres.070B.005"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/2558904"},{"year":"2019","journal-title":"MATLAB Optimization Toolbox","key":"ref46"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1007\/s13198-017-0639-z"},{"key":"ref48","first-page":"25","article-title":"Fast determination of the tensorial and simplicial Bernstein forms of multivariate polynomials and rational functions","volume":"25","author":"titi","year":"2017","journal-title":"Reliable Comput"},{"year":"2018","author":"hamadneh","article-title":"Bounding polynomials and rational functions in the tensorial and simplicial Bernstein forms","key":"ref47"},{"year":"2015","author":"sassi","article-title":"Bernstein polynomial relaxations for polynomial optimization problems","key":"ref42"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/s10898-009-9485-0"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1007\/s11633-007-0342-7"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1007\/3-540-16437-5_5"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8860\/9447299\/9271860-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8860\/9447299\/09271860.pdf?arnumber=9271860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:51:35Z","timestamp":1649443895000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9271860\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":56,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tro.2020.3036617","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"type":"print","value":"1552-3098"},{"type":"electronic","value":"1941-0468"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}