{"id":"https://openalex.org/W3090500517","doi":"https://doi.org/10.1109/icra40945.2020.9196789","title":"Enhancing Bilevel Optimization for UAV Time-Optimal Trajectory using a Duality Gap Approach","display_name":"Enhancing Bilevel Optimization for UAV Time-Optimal Trajectory using a Duality Gap Approach","publication_year":2020,"publication_date":"2020-05-01","ids":{"openalex":"https://openalex.org/W3090500517","doi":"https://doi.org/10.1109/icra40945.2020.9196789","mag":"3090500517"},"language":"en","primary_location":{"id":"doi:10.1109/icra40945.2020.9196789","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra40945.2020.9196789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-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/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":true,"raw_author_name":"Gao Tang","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","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"],"affiliations":[{"raw_affiliation_string":"XYZ Robotics, Shanghai, China","institution_ids":[]}]},{"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"],"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":3,"corresponding_author_ids":["https://openalex.org/A5074378776"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.6839,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.72155004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2515","last_page":"2521"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9925000071525574,"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.9925000071525574,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9660999774932861,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9427000284194946,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8192227482795715},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6874277591705322},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6198985576629639},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.59799724817276},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5670749545097351},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.5585501790046692},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.5573004484176636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5512274503707886},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5294974446296692},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5014584064483643},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.46858686208724976},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4421495199203491},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.43097975850105286},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.42793431878089905},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4192259907722473},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4123260974884033},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.3756527900695801},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.36581769585609436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3286411762237549}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.8192227482795715},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6874277591705322},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6198985576629639},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.59799724817276},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5670749545097351},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.5585501790046692},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.5573004484176636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5512274503707886},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5294974446296692},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5014584064483643},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.46858686208724976},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4421495199203491},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.43097975850105286},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.42793431878089905},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4192259907722473},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4123260974884033},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.3756527900695801},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.36581769585609436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3286411762237549},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","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/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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra40945.2020.9196789","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra40945.2020.9196789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","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":40,"referenced_works":["https://openalex.org/W1570351331","https://openalex.org/W1968651858","https://openalex.org/W1971998222","https://openalex.org/W2005354226","https://openalex.org/W2021468336","https://openalex.org/W2022144657","https://openalex.org/W2026733661","https://openalex.org/W2064842627","https://openalex.org/W2099454002","https://openalex.org/W2108234997","https://openalex.org/W2115091574","https://openalex.org/W2117271243","https://openalex.org/W2123871098","https://openalex.org/W2124659975","https://openalex.org/W2136209220","https://openalex.org/W2148701460","https://openalex.org/W2162218551","https://openalex.org/W2172012981","https://openalex.org/W2296319761","https://openalex.org/W2335306738","https://openalex.org/W2343568200","https://openalex.org/W2529220408","https://openalex.org/W2614367549","https://openalex.org/W2891491652","https://openalex.org/W2902634936","https://openalex.org/W2919946715","https://openalex.org/W2963970238","https://openalex.org/W2964057747","https://openalex.org/W2964304581","https://openalex.org/W3003717015","https://openalex.org/W3046005546","https://openalex.org/W3103565931","https://openalex.org/W3105372678","https://openalex.org/W4250589301","https://openalex.org/W4297803541","https://openalex.org/W4301496368","https://openalex.org/W6651853181","https://openalex.org/W6734122017","https://openalex.org/W6755905128","https://openalex.org/W6756809452"],"related_works":["https://openalex.org/W1533868172","https://openalex.org/W3116511799","https://openalex.org/W37717830","https://openalex.org/W2022488470","https://openalex.org/W1823078487","https://openalex.org/W2337387285","https://openalex.org/W1986112072","https://openalex.org/W2763044528","https://openalex.org/W1997572981","https://openalex.org/W2034177488"],"abstract_inverted_index":{"Time-optimal":[0],"trajectories":[1],"for":[2,11],"dynamic":[3],"robotic":[4],"vehicles":[5],"are":[6],"difficult":[7],"to":[8,18,112,125,158],"compute":[9],"even":[10],"state-of-the-art":[12],"nonlinear":[13],"programming":[14],"(NLP)":[15],"solvers,":[16],"due":[17],"nonlinearity":[19],"and":[20,39,67,85,181,191,198],"bang-bang":[21],"control":[22],"structure.":[23],"This":[24],"paper":[25],"presents":[26],"a":[27,43,58,63,77,114,160,176],"bilevel":[28,152,171,196],"optimization":[29,82,106,120,197],"framework":[30],"that":[31,185],"addresses":[32],"these":[33],"problems":[34],"by":[35,76,88,145],"decomposing":[36],"the":[37,47,73,94,118,129,134,140,186],"spatial":[38],"temporal":[40],"variables":[41],"into":[42,52],"hierarchical":[44],"optimization.":[45,172],"Specifically,":[46],"original":[48],"problem":[49],"is":[50,83,111,156],"divided":[51],"an":[53,68],"inner":[54,81,119],"layer,":[55,70],"which":[56,71],"computes":[57],"time-optimal":[59],"velocity":[60,180],"profile":[61],"along":[62],"given":[64],"geometric":[65,74],"path,":[66],"outer":[69,95,141],"refines":[72],"path":[75],"Quasi-Newton":[78],"method.":[79],"The":[80,91],"convex":[84],"efficiently":[86],"solved":[87],"interior-point":[89,135],"methods.":[90],"gradients":[92],"of":[93,104,133,139],"layer":[96],"can":[97],"be":[98],"analytically":[99],"obtained":[100],"using":[101],"sensitivity":[102],"analysis":[103],"parametric":[105],"problems.":[107],"A":[108],"novel":[109],"contribution":[110],"introduce":[113],"duality":[115],"gap":[116],"in":[117],"rather":[121],"than":[122,169,194],"solving":[123],"it":[124],"optimality;":[126],"this":[127,154],"lets":[128],"optimizer":[130],"realize":[131],"warm-starting":[132],"method,":[136],"avoids":[137],"non-smoothness":[138],"cost":[142],"function":[143],"caused":[144],"active":[146],"inequality":[147],"constraint":[148],"switching.":[149],"Like":[150],"prior":[151],"frameworks,":[153],"method":[155,188],"guaranteed":[157],"return":[159],"feasible":[161],"solution":[162],"at":[163],"any":[164],"time,":[165],"but":[166],"converges":[167],"faster":[168,190],"gap-free":[170,195],"Numerical":[173],"experiments":[174],"on":[175],"drone":[177],"model":[178],"with":[179],"acceleration":[182],"limits":[183],"show":[184],"proposed":[187],"performs":[189],"more":[192],"robustly":[193],"general":[199],"NLP":[200],"solvers.":[201]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}