{"id":"https://openalex.org/W4415180737","doi":"https://doi.org/10.23919/ecc65951.2025.11186852","title":"Improved Approximation Accuracy for Nonconvex Trajectory Optimization via Trajectory Sensitivities","display_name":"Improved Approximation Accuracy for Nonconvex Trajectory Optimization via Trajectory Sensitivities","publication_year":2025,"publication_date":"2025-06-24","ids":{"openalex":"https://openalex.org/W4415180737","doi":"https://doi.org/10.23919/ecc65951.2025.11186852"},"language":"en","primary_location":{"id":"doi:10.23919/ecc65951.2025.11186852","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11186852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","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/A5101750774","display_name":"Xiaofei Wu","orcid":"https://orcid.org/0000-0002-2970-4904"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Xiaofei Wu","raw_affiliation_strings":["University of Waterloo,Department of Electrical and Computer Engineering,Waterloo,Canada,N2L 3G1"],"affiliations":[{"raw_affiliation_string":"University of Waterloo,Department of Electrical and Computer Engineering,Waterloo,Canada,N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039826433","display_name":"Michael W. Fisher","orcid":"https://orcid.org/0000-0002-4640-5738"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michael W. Fisher","raw_affiliation_strings":["University of Waterloo,Department of Electrical and Computer Engineering,Waterloo,Canada,N2L 3G1"],"affiliations":[{"raw_affiliation_string":"University of Waterloo,Department of Electrical and Computer Engineering,Waterloo,Canada,N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105207212","display_name":"Stephen L. Smith","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephen L. Smith","raw_affiliation_strings":["University of Waterloo,Department of Electrical and Computer Engineering,Waterloo,Canada,N2L 3G1"],"affiliations":[{"raw_affiliation_string":"University of Waterloo,Department of Electrical and Computer Engineering,Waterloo,Canada,N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101750774"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30384516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1097","last_page":"1104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9984999895095825,"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.9984999895095825,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9901000261306763,"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"}},{"id":"https://openalex.org/T11082","display_name":"Spacecraft Dynamics and Control","score":0.9728999733924866,"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/trajectory","display_name":"Trajectory","score":0.8062999844551086},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.7513999938964844},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7027000188827515},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6136999726295471},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.5259000062942505},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5152000188827515},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.45719999074935913},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4390000104904175},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4309000074863434}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.8062999844551086},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.7513999938964844},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7027000188827515},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6381999850273132},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6136999726295471},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.5259000062942505},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5152000188827515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.475600004196167},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.45719999074935913},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4390000104904175},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4309000074863434},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.42179998755455017},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42170000076293945},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.40119999647140503},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37290000915527344},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3375000059604645},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.33410000801086426},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.31220000982284546},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.29429998993873596},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.2921000123023987},{"id":"https://openalex.org/C142311740","wikidata":"https://www.wikidata.org/wiki/Q1066177","display_name":"Shaping","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc65951.2025.11186852","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11186852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","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":16,"referenced_works":["https://openalex.org/W184480995","https://openalex.org/W1557324374","https://openalex.org/W2002443028","https://openalex.org/W2123871098","https://openalex.org/W2142224528","https://openalex.org/W2162767308","https://openalex.org/W2411880591","https://openalex.org/W2607001947","https://openalex.org/W2948883340","https://openalex.org/W2966532463","https://openalex.org/W3011355528","https://openalex.org/W3109518394","https://openalex.org/W3135798748","https://openalex.org/W3200871490","https://openalex.org/W3208343212","https://openalex.org/W4293775970"],"related_works":[],"abstract_inverted_index":{"Trajectory":[0],"optimization":[1,29,63,88],"is":[2,130,140,184],"valuable":[3],"for":[4,13,79,122,135],"a":[5,48,76,150,194],"wide":[6],"range":[7],"of":[8,43,58,95,105,152,169],"applications,":[9],"from":[10],"motion":[11],"planning":[12],"mobile":[14],"robots,":[15],"to":[16,25,46,112,115,132,142,177,187],"aircraft":[17],"flight":[18],"planning.":[19],"However,":[20],"nonlinear":[21],"dynamic":[22],"models":[23],"lead":[24],"challenging":[26],"nonconvex":[27,86],"trajectory":[28,87,100,109],"problems.":[30,89],"Many":[31],"existing":[32],"approaches":[33],"formulate":[34],"them":[35],"as":[36],"multistage":[37],"programs":[38],"and":[39,139,179,183],"rely":[40],"on":[41,68,149],"derivatives":[42,104],"each":[44,52],"stage":[45],"obtain":[47],"local":[49,82,117,170],"approximation":[50,59,171],"at":[51],"iteration,":[53],"in":[54,167],"which":[55,102],"case":[56],"quality":[57],"when":[60,84,189],"solving":[61,85],"the":[62,106,123,157,161],"program":[64],"has":[65],"significant":[66],"impact":[67],"convergence":[69,120],"behavior.":[70],"In":[71],"this":[72],"work,":[73],"we":[74,98],"develop":[75],"novel":[77],"approach":[78],"obtaining":[80],"improved":[81],"approximations":[83],"By":[90],"performing":[91],"an":[92,136],"input-to-state":[93],"reformulation":[94],"system":[96,108],"dynamics,":[97],"use":[99],"sensitivities,":[101],"are":[103,126],"entire":[107],"with":[110,145,193],"respect":[111],"control":[113],"inputs,":[114],"form":[116],"approximations.":[118],"Local":[119],"guarantees":[121],"proposed":[124,158],"method":[125,129,159],"presented.":[127],"The":[128],"applied":[131],"generate":[133],"trajectories":[134],"autonomous":[137],"vehicle,":[138],"extended":[141],"include":[143],"scenario":[144],"static":[146],"obstacles.":[147],"Simulation":[148],"variety":[151],"reference":[153],"paths":[154],"show":[155],"that":[156],"outperforms":[160],"traditional":[162],"Sequential":[163],"Quadratic":[164],"Programming":[165],"(SQP)":[166],"terms":[168],"accuracy,":[172],"allowable":[173],"trust-region":[174],"radius,":[175],"iterations":[176],"converge,":[178],"total":[180],"solver":[181],"time,":[182],"less":[185],"prone":[186],"failure":[188],"handling":[190],"multiple":[191],"obstacles":[192],"complex":[195],"reference.":[196]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-15T00:00:00"}