{"id":"https://openalex.org/W3175421789","doi":"https://doi.org/10.1109/tro.2021.3076454","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":2021,"publication_date":"2021-06-16","ids":{"openalex":"https://openalex.org/W3175421789","doi":"https://doi.org/10.1109/tro.2021.3076454","mag":"3175421789"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2021.3076454","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tro.2021.3076454","pdf_url":"https://ieeexplore.ieee.org/ielx7/8860/9634176/09457044.pdf","source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ieeexplore.ieee.org/ielx7/8860/9634176/09457044.pdf","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 Inc., Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0003-0179-6234","affiliations":[{"raw_affiliation_string":"XYZ Robotics Inc., 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, IL, USA"],"raw_orcid":"https://orcid.org/0000-0003-0156-4759","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 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, IL, USA"],"raw_orcid":"https://orcid.org/0000-0002-5207-1527","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 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":1.7168,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.84916187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"37","issue":"6","first_page":"2010","last_page":"2024"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987000226974487,"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.9987000226974487,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9835000038146973,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.9825000166893005,"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.8268495798110962},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6991767883300781},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.6702085137367249},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6261703968048096},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.589005708694458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5710752606391907},{"id":"https://openalex.org/keywords/state-variable","display_name":"State variable","score":0.5380039215087891},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5085564851760864},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.480507493019104},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.47358423471450806},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.4661036431789398},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.43345892429351807},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.43058571219444275},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4273908734321594},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4251958727836609},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.42138880491256714},{"id":"https://openalex.org/keywords/decoupling","display_name":"Decoupling (probability)","score":0.41419732570648193},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.3811849355697632},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36893221735954285},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3670278787612915},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.2917255759239197},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2913694381713867},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.21524405479431152},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.17750141024589539},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07590630650520325}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.8268495798110962},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6991767883300781},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.6702085137367249},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6261703968048096},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.589005708694458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5710752606391907},{"id":"https://openalex.org/C129537906","wikidata":"https://www.wikidata.org/wiki/Q7603913","display_name":"State variable","level":2,"score":0.5380039215087891},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5085564851760864},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.480507493019104},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.47358423471450806},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.4661036431789398},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.43345892429351807},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.43058571219444275},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4273908734321594},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4251958727836609},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.42138880491256714},{"id":"https://openalex.org/C205606062","wikidata":"https://www.wikidata.org/wiki/Q5249645","display_name":"Decoupling (probability)","level":2,"score":0.41419732570648193},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.3811849355697632},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36893221735954285},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3670278787612915},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2917255759239197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2913694381713867},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.21524405479431152},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.17750141024589539},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07590630650520325},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C133731056","wikidata":"https://www.wikidata.org/wiki/Q4917288","display_name":"Control engineering","level":1,"score":0.0},{"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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tro.2021.3076454","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tro.2021.3076454","pdf_url":"https://ieeexplore.ieee.org/ielx7/8860/9634176/09457044.pdf","source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1109/tro.2021.3076454","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tro.2021.3076454","pdf_url":"https://ieeexplore.ieee.org/ielx7/8860/9634176/09457044.pdf","source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6354871771","display_name":"CAREER: Cooperative Motion Planning for Human-Operated Robots","funder_award_id":"1253553","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309133","display_name":"Duke University","ror":"https://ror.org/00py81415"},{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3175421789.pdf","grobid_xml":"https://content.openalex.org/works/W3175421789.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W1570351331","https://openalex.org/W1572204513","https://openalex.org/W1960239420","https://openalex.org/W1970101292","https://openalex.org/W1996025842","https://openalex.org/W2102884619","https://openalex.org/W2106320154","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/W2505728881","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/W2962917939","https://openalex.org/W2964210434","https://openalex.org/W3003747652","https://openalex.org/W3029808435","https://openalex.org/W3035992974","https://openalex.org/W3105372678","https://openalex.org/W3175421789","https://openalex.org/W4250589301","https://openalex.org/W4287636167","https://openalex.org/W4301014524","https://openalex.org/W4301496368","https://openalex.org/W6725192724","https://openalex.org/W6734122017","https://openalex.org/W6753596642","https://openalex.org/W6756809452","https://openalex.org/W6784059676"],"related_works":["https://openalex.org/W574348691","https://openalex.org/W2107502531","https://openalex.org/W2587737421","https://openalex.org/W2096282913","https://openalex.org/W2119283772","https://openalex.org/W1555927645","https://openalex.org/W2282397816","https://openalex.org/W2369920403","https://openalex.org/W2170048621","https://openalex.org/W2116765717"],"abstract_inverted_index":{"In":[0],"the":[1,36,47,67,70,88],"article,":[2],"we":[3],"present":[4],"an":[5,119],"efficient":[6],"optimization":[7,12,61,103,126],"framework":[8,104],"that":[9,124],"solves":[10],"trajectory":[11],"problems":[13],"by":[14,75],"decoupling":[15],"state":[16,37,110],"variables":[17,38,49,72,111],"from":[18,87],"timing":[19,34,48,71,108],"variables,":[20],"thereby":[21],"decomposing":[22],"a":[23,54,59,92,132],"challenging":[24],"nonlinear":[25],"programming":[26],"(NLP)":[27],"problem":[28],"into":[29],"two":[30],"easier":[31],"subproblems.":[32],"With":[33],"fixed,":[35],"can":[39,50],"be":[40,51],"optimized":[41,52],"efficiently":[42,105],"using":[43],"convex":[44],"optimization,":[45],"and":[46,109,136,147],"in":[53,142],"separate":[55],"NLP,":[56],"which":[57,112],"forms":[58],"bilevel":[60,102,125],"problem.":[62],"The":[63,81,101],"challenge":[64],"of":[65,69,78,144],"obtaining":[66],"gradient":[68,84],"is":[73,85,113],"solved":[74],"sensitivity":[76],"analysis":[77],"parametric":[79],"NLPs.":[80],"exact":[82],"analytic":[83],"computed":[86],"dual":[89],"solution":[90],"as":[91],"by-product,":[93],"whereas":[94],"existing":[95],"finite-difference":[96],"techniques":[97],"require":[98],"additional":[99],"optimization.":[100],"optimizes":[106],"both":[107],"demonstrated":[114],"on":[115],"generating":[116],"trajectories":[117],"for":[118,155],"UAV.":[120],"Numerical":[121],"experiments":[122,150],"demonstrate":[123,151],"converges":[127],"significantly":[128],"more":[129],"reliably":[130],"than":[131],"standard":[133],"NLP":[134],"solver,":[135],"analytical":[137],"gradients":[138],"outperform":[139],"finite":[140],"differences":[141],"terms":[143],"computation":[145],"speed":[146],"accuracy.":[148],"Physical":[149],"its":[152],"real-time":[153],"applicability":[154],"reactive":[156],"target":[157],"tracking":[158],"tasks.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":14},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}