{"id":"https://openalex.org/W3046005546","doi":"https://doi.org/10.23919/acc45564.2020.9147300","title":"Fast UAV Trajectory Optimization using Bilevel Optimization with Analytical Gradients","display_name":"Fast UAV Trajectory Optimization using Bilevel Optimization with Analytical Gradients","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3046005546","doi":"https://doi.org/10.23919/acc45564.2020.9147300","mag":"3046005546"},"language":"en","primary_location":{"id":"doi:10.23919/acc45564.2020.9147300","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc45564.2020.9147300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 American Control Conference (ACC)","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/A5101830720","display_name":"Weidong Sun","orcid":"https://orcid.org/0000-0003-0179-6234"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weidong Sun","raw_affiliation_strings":["XYZ Robotics, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"XYZ Robotics, Shanghai, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074378776","display_name":"Gao Tang","orcid":"https://orcid.org/0000-0003-0156-4759"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gao Tang","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027878263","display_name":"Kris Hauser","orcid":"https://orcid.org/0000-0002-5207-1527"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kris Hauser","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"82","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9830999970436096,"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/T12158","display_name":"Guidance and Control Systems","score":0.979200005531311,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/bilevel-optimization","display_name":"Bilevel optimization","score":0.752720832824707},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6986194849014282},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6292821764945984},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.5734619498252869},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.5680475234985352},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.566429853439331},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5328890085220337},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.5095798969268799},{"id":"https://openalex.org/keywords/test-functions-for-optimization","display_name":"Test functions for optimization","score":0.47021010518074036},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.45790717005729675},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.443071573972702},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.41970136761665344},{"id":"https://openalex.org/keywords/state-variable","display_name":"State variable","score":0.4112863540649414},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.3807227611541748},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.3563300669193268},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3076469898223877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29929816722869873},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.10925981402397156}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.752720832824707},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6986194849014282},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6292821764945984},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.5734619498252869},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.5680475234985352},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.566429853439331},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5328890085220337},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.5095798969268799},{"id":"https://openalex.org/C150185637","wikidata":"https://www.wikidata.org/wiki/Q7705773","display_name":"Test functions for optimization","level":4,"score":0.47021010518074036},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.45790717005729675},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.443071573972702},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.41970136761665344},{"id":"https://openalex.org/C129537906","wikidata":"https://www.wikidata.org/wiki/Q7603913","display_name":"State variable","level":2,"score":0.4112863540649414},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3807227611541748},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.3563300669193268},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3076469898223877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29929816722869873},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.10925981402397156},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc45564.2020.9147300","is_oa":false,"landing_page_url":"https://doi.org/10.23919/acc45564.2020.9147300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1570351331","https://openalex.org/W1572204513","https://openalex.org/W2117271243","https://openalex.org/W2124659975","https://openalex.org/W2162218551","https://openalex.org/W2162991084","https://openalex.org/W2172012981","https://openalex.org/W2482392012","https://openalex.org/W2529220408","https://openalex.org/W2587415290","https://openalex.org/W2614367549","https://openalex.org/W2789286310","https://openalex.org/W2884634491","https://openalex.org/W2890883362","https://openalex.org/W2891491652","https://openalex.org/W2919946715","https://openalex.org/W3105372678","https://openalex.org/W4301014524","https://openalex.org/W6753596642"],"related_works":["https://openalex.org/W2490511642","https://openalex.org/W2030310352","https://openalex.org/W1968991653","https://openalex.org/W2053344917","https://openalex.org/W2076882792","https://openalex.org/W2369249776","https://openalex.org/W3121664024","https://openalex.org/W2144965974","https://openalex.org/W4281724244","https://openalex.org/W4297925816"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,74,144],"efficient":[3],"optimization":[4,9,58,75,84,108,152],"framework":[5,134],"that":[6,150],"solves":[7],"trajectory":[8],"problems":[10,85],"by":[11],"decoupling":[12],"state":[13,34],"variables":[14,35,46],"from":[15],"timing":[16,31,45],"variables,":[17],"thereby":[18],"decomposing":[19],"a":[20,51,56,120,158,176],"challenging":[21],"nonlinear":[22],"programming":[23],"(NLP)":[24],"problem":[25],"into":[26],"two":[27],"easier":[28],"subproblems.":[29],"With":[30,175],"fixed,":[32],"the":[33,44,65,68,88,100,106,116,123,125,189],"can":[36,47,128],"be":[37,48,129],"optimized":[38,49],"efficiently":[39],"using":[40],"convex":[41],"optimization,":[42,124],"and":[43,162,173],"in":[50,140,168],"separate":[52],"NLP,":[53],"which":[54,71],"forms":[55],"bilevel":[57,151],"problem.":[59],"The":[60,133],"challenge":[61],"is":[62,92,109,119,135],"to":[63,76,86,111],"obtain":[64],"gradient":[66],"of":[67,97,105,122,170],"objective":[69],"function":[70],"itself":[72],"needs":[73],"compute.":[77],"Whereas":[78],"finite":[79,166],"differences":[80,167],"must":[81],"solve":[82],"many":[83],"compute":[87,112],"gradient,":[89],"our":[90,180],"method":[91],"based":[93],"on":[94,137],"sensitivity":[95],"analysis":[96],"parametric":[98],"programming:":[99],"dual":[101,117],"solution":[102,118],"(Lagrange":[103],"multipliers)":[104],"lower-level":[107],"used":[110],"analytical":[113,163],"gradients.":[114],"Since":[115],"by-product":[121],"exact":[126],"gradients":[127,164],"obtained":[130],"\"for":[131],"free\".":[132],"demonstrated":[136],"generating":[138],"trajectories":[139],"safe":[141],"corridors":[142],"for":[143],"unmanned":[145],"aerial":[146],"vehicle.":[147],"Experiments":[148],"demonstrate":[149],"converges":[153],"significantly":[154],"more":[155],"reliably":[156],"than":[157,188],"standard":[159],"NLP":[160],"solver,":[161],"outperform":[165],"terms":[169],"computation":[171],"speed":[172],"accuracy.":[174],"25ms":[177],"cutoff":[178],"time,":[179],"approach":[181],"achieves":[182],"over":[183],"8":[184],"times":[185],"better":[186],"suboptimality":[187],"current":[190],"state-of-the-art.":[191]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}