{"id":"https://openalex.org/W3117059735","doi":"https://doi.org/10.1109/itsc45102.2020.9294321","title":"A Real-Time Optimization-Based Trajectory Planning Method in Dynamic and Uncertain Environments","display_name":"A Real-Time Optimization-Based Trajectory Planning Method in Dynamic and Uncertain Environments","publication_year":2020,"publication_date":"2020-09-20","ids":{"openalex":"https://openalex.org/W3117059735","doi":"https://doi.org/10.1109/itsc45102.2020.9294321","mag":"3117059735"},"language":"en","primary_location":{"id":"doi:10.1109/itsc45102.2020.9294321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc45102.2020.9294321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5011601269","display_name":"Yuqing Guo","orcid":"https://orcid.org/0000-0001-5232-0629"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuqing Guo","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013491643","display_name":"Huile Xu","orcid":"https://orcid.org/0000-0001-6715-0247"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huile Xu","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081663090","display_name":"Danya Yao","orcid":"https://orcid.org/0000-0001-5032-6322"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Danya Yao","raw_affiliation_strings":["Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, Nanjing, China","Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, Nanjing, China","institution_ids":[]},{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114911316","display_name":"Li Li","orcid":"https://orcid.org/0000-0002-9428-1960"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Li","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.743004322052002},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7009431719779968},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6880890727043152},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.6254101395606995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6098718047142029},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.5615318417549133},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4979519844055176},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.49003446102142334},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4632960557937622},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4402335286140442},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3764473795890808},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.2871747612953186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26925918459892273},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.2335885763168335},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.16035997867584229},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1414397656917572}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.743004322052002},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7009431719779968},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6880890727043152},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.6254101395606995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6098718047142029},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.5615318417549133},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4979519844055176},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.49003446102142334},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4632960557937622},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4402335286140442},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3764473795890808},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.2871747612953186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26925918459892273},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.2335885763168335},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.16035997867584229},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1414397656917572},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc45102.2020.9294321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc45102.2020.9294321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320337504","display_name":"Research and Development","ror":"https://ror.org/027s68j25"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W61873113","https://openalex.org/W83533993","https://openalex.org/W1534096605","https://openalex.org/W1592601589","https://openalex.org/W1969472392","https://openalex.org/W1999131722","https://openalex.org/W2024802078","https://openalex.org/W2038537670","https://openalex.org/W2112271657","https://openalex.org/W2115353852","https://openalex.org/W2127617835","https://openalex.org/W2139809908","https://openalex.org/W2192586580","https://openalex.org/W2334897604","https://openalex.org/W2524886531","https://openalex.org/W2734615402","https://openalex.org/W2740584750","https://openalex.org/W2771809894","https://openalex.org/W2793611744","https://openalex.org/W2909324603","https://openalex.org/W2948883340","https://openalex.org/W2963214840","https://openalex.org/W3001538587","https://openalex.org/W3098201584"],"related_works":["https://openalex.org/W4317634134","https://openalex.org/W2981729160","https://openalex.org/W4310743282","https://openalex.org/W2743212448","https://openalex.org/W2889566344","https://openalex.org/W3046417820","https://openalex.org/W2537110013","https://openalex.org/W4381746183","https://openalex.org/W2997189060","https://openalex.org/W4395060245"],"abstract_inverted_index":{"Reducing":[0],"conservatism":[1],"while":[2],"ensuring":[3],"safety":[4],"poses":[5],"great":[6],"difficulties":[7],"for":[8,53,56],"real-time":[9,144],"trajectory":[10,20,35,80,98,149,169],"planning":[11,21,36,81,99],"in":[12],"uncertain":[13,32,106],"and":[14,38,63,158,170],"cluttered":[15],"environments.":[16],"If":[17],"we":[18,93,154],"view":[19],"as":[22],"an":[23,160],"optimization":[24,131],"problem,":[25,55],"the":[26,48,128,147,167,178,181],"non-convex":[27,130],"collision":[28,115],"avoidance":[29,116],"constraints":[30],"with":[31,70,101,111,119],"obstacles":[33,107],"make":[34],"challenging":[37],"time-consuming.":[39],"Disjunctive":[40],"chance":[41,78,102],"constraint-based":[42,79],"methods":[43],"have":[44],"been":[45],"one":[46],"of":[47,138,180],"most":[49],"popular":[50],"stochastic":[51],"tools":[52],"this":[54],"they":[57],"can":[58,142],"provide":[59],"a":[60,95,120,136],"tighter":[61],"bound":[62,114],"lead":[64],"to":[65,164],"less":[66],"conservative":[67],"trajectories":[68],"compared":[69],"other":[71],"methods.":[72],"However,":[73],"previous":[74],"work":[75],"on":[76],"disjunctive":[77],"adopts":[82],"mixed-integer":[83],"programming":[84],"which":[85,104,141],"has":[86],"exponential":[87],"complexity.":[88],"Different":[89],"from":[90],"existing":[91],"work,":[92],"propose":[94],"new":[96],"optimization-based":[97],"method":[100],"constraints,":[103],"turns":[105],"into":[108,135],"bounding":[109],"boxes":[110],"tight":[112],"upper":[113],"constraints.":[117],"Then,":[118],"proposed":[121,182],"time-varying":[122],"convex":[123,139],"feasible":[124],"sets":[125],"(TVCFS)":[126],"algorithm,":[127],"original":[129],"problem":[132,163],"is":[133],"transferred":[134],"series":[137],"problems,":[140],"meet":[143],"requirements.":[145],"Since":[146],"planned":[148,168],"may":[150],"be":[151],"dynamically":[152],"infeasible,":[153],"consider":[155],"vehicle":[156],"kinematics":[157],"formulate":[159],"optimal":[161],"control":[162,173],"further":[165],"smooth":[166],"obtain":[171],"desired":[172],"inputs.":[174],"Simulation":[175],"tests":[176],"demonstrate":[177],"effectiveness":[179],"method.":[183]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}