{"id":"https://openalex.org/W4385407444","doi":"https://doi.org/10.1177/02783649231183458","title":"Convex risk-bounded continuous-time trajectory planning and tube design in uncertain nonconvex environments","display_name":"Convex risk-bounded continuous-time trajectory planning and tube design in uncertain nonconvex environments","publication_year":2023,"publication_date":"2023-07-31","ids":{"openalex":"https://openalex.org/W4385407444","doi":"https://doi.org/10.1177/02783649231183458"},"language":"en","primary_location":{"id":"doi:10.1177/02783649231183458","is_oa":false,"landing_page_url":"https://doi.org/10.1177/02783649231183458","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039991188","display_name":"Ashkan Jasour","orcid":"https://orcid.org/0000-0002-4530-8311"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ashkan Jasour","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028395418","display_name":"Weiqiao Han","orcid":"https://orcid.org/0000-0002-2778-0567"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Weiqiao Han","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-2778-0567","affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101709620","display_name":"Brian Williams","orcid":"https://orcid.org/0000-0002-1057-3940"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brian C. Williams","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028395418"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0245,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78591446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"42","issue":"10","first_page":"705","last_page":"728"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9591000080108643,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9397000074386597,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7810091376304626},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6943884491920471},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5779004096984863},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.49114343523979187},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.47947725653648376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4644475281238556},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.46398261189460754},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4633024334907532},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.4504207670688629},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35409557819366455},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.29144287109375}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7810091376304626},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6943884491920471},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5779004096984863},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.49114343523979187},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.47947725653648376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4644475281238556},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.46398261189460754},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4633024334907532},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.4504207670688629},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35409557819366455},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.29144287109375},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/02783649231183458","is_oa":false,"landing_page_url":"https://doi.org/10.1177/02783649231183458","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1574221391","https://openalex.org/W1605218591","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1999131722","https://openalex.org/W2061039445","https://openalex.org/W2067778155","https://openalex.org/W2083093559","https://openalex.org/W2090967418","https://openalex.org/W2097148013","https://openalex.org/W2099506495","https://openalex.org/W2101496914","https://openalex.org/W2165281529","https://openalex.org/W2167412190","https://openalex.org/W2229105208","https://openalex.org/W2482392012","https://openalex.org/W2536620281","https://openalex.org/W2729776805","https://openalex.org/W2761297771","https://openalex.org/W2807095006","https://openalex.org/W2895355463","https://openalex.org/W2909882608","https://openalex.org/W2966257892","https://openalex.org/W2967258016","https://openalex.org/W3044582844","https://openalex.org/W3129335422","https://openalex.org/W3158310418","https://openalex.org/W3177428007","https://openalex.org/W3202248056","https://openalex.org/W3204875639","https://openalex.org/W3206336571","https://openalex.org/W3214950490","https://openalex.org/W4221156184","https://openalex.org/W4233204656","https://openalex.org/W4255442211","https://openalex.org/W4280639678","https://openalex.org/W4399469378"],"related_works":["https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096","https://openalex.org/W4320477335","https://openalex.org/W2518949622","https://openalex.org/W2084892497","https://openalex.org/W4382725876","https://openalex.org/W2115614142","https://openalex.org/W2275184629","https://openalex.org/W1561889708"],"abstract_inverted_index":{"In":[0,194],"this":[1,27],"paper,":[2],"we":[3,29,97,196],"address":[4,26,64,91],"the":[5,46,54,92,99,106,118,124,154,162,206,215,222],"trajectory":[6,33,66,94,191,216],"planning":[7,34,47,67,95,108,192],"problem":[8,109,159],"in":[9,123,136],"uncertain":[10,59,125],"nonconvex":[11,140,156,179],"static":[12,182],"and":[13,23,75,87,139,160,180,183,186],"dynamic":[14,184],"environments":[15],"that":[16,36,83,218],"contain":[17],"obstacles":[18,77],"with":[19,41,58,127,173,209],"probabilistic":[20,177],"location,":[21],"size,":[22],"geometry.":[24],"To":[25,90],"problem,":[28,96],"provide":[30,144,197],"a":[31,111],"risk-bounded":[32,65,93,107,164],"method":[35],"looks":[37],"for":[38,189],"continuous-time":[39,163],"trajectories":[40,165],"guaranteed":[42,128,225],"bounded":[43,129,228],"risk":[44,102],"over":[45],"time":[48,88,167],"horizon.":[49],"Risk":[50,115],"is":[51,187,224],"defined":[52],"as":[53],"probability":[55],"of":[56,101,120],"collision":[57],"obstacles.":[60],"Existing":[61],"approaches":[62],"to":[63,72,104,151,204,211,226],"problems":[68],"either":[69],"are":[70,117],"limited":[71],"Gaussian":[73],"uncertainties":[74],"convex":[76,145,198],"or":[78],"rely":[79],"on":[80,148,201],"sampling-based":[81],"methods":[82,146,199],"need":[84],"uncertainty":[85],"samples":[86],"discretization.":[89,168],"leverage":[98],"notion":[100],"contours":[103,116],"transform":[105],"into":[110],"deterministic":[112,133],"optimization":[113,134,150,158,203],"problem.":[114],"set":[119],"all":[121],"points":[122],"environment":[126],"risk.":[130,229],"The":[131,169],"obtained":[132,155],"is,":[135],"general,":[137],"nonlinear":[138],"time-varying":[141,157],"optimization.":[142],"We":[143],"based":[147,200],"sum-of-squares":[149,202],"efficiently":[152],"solve":[153],"obtain":[161],"without":[166],"provided":[170],"approach":[171],"deals":[172],"arbitrary":[174],"(and":[175],"known)":[176],"uncertainties,":[178],"nonlinear,":[181],"obstacles,":[185],"suitable":[188],"online":[190],"problems.":[193],"addition,":[195],"build":[205],"max-sized":[207],"tube":[208,223],"respect":[210],"its":[212],"parameterization":[213],"along":[214],"so":[217],"any":[219],"state":[220],"inside":[221],"have":[227]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-23T08:51:43.019350","created_date":"2025-10-10T00:00:00"}