{"id":"https://openalex.org/W3200418126","doi":"https://doi.org/10.1109/icra46639.2022.9811562","title":"Optimizing Trajectories with Closed-Loop Dynamic SQP","display_name":"Optimizing Trajectories with Closed-Loop Dynamic SQP","publication_year":2022,"publication_date":"2022-05-23","ids":{"openalex":"https://openalex.org/W3200418126","doi":"https://doi.org/10.1109/icra46639.2022.9811562","mag":"3200418126"},"language":"en","primary_location":{"id":"doi:10.1109/icra46639.2022.9811562","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra46639.2022.9811562","pdf_url":null,"source":{"id":"https://openalex.org/S4363607759","display_name":"2022 International Conference on Robotics and Automation (ICRA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.mit.edu/bitstream/1721.1/154989/2/2109.07081v2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101898346","display_name":"Sumeet Singh","orcid":"https://orcid.org/0000-0003-4510-5853"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sumeet Singh","raw_affiliation_strings":["Robotics at Google,New York City,NY,USA,10011"],"affiliations":[{"raw_affiliation_string":"Robotics at Google,New York City,NY,USA,10011","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044026747","display_name":"Jean-Jacques Slotine","orcid":"https://orcid.org/0000-0002-7161-7812"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jean-Jacques Slotine","raw_affiliation_strings":["Robotics at Google,New York City,NY,USA,10011"],"affiliations":[{"raw_affiliation_string":"Robotics at Google,New York City,NY,USA,10011","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058073838","display_name":"Vikas Sindhwani","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vikas Sindhwani","raw_affiliation_strings":["Robotics at Google,New York City,NY,USA,10011"],"affiliations":[{"raw_affiliation_string":"Robotics at Google,New York City,NY,USA,10011","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101898346"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":0.6566,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.77501774,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5249","last_page":"5254"},"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.9767000079154968,"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.9761999845504761,"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/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.7720497846603394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7019739151000977},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6038601994514465},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6036391258239746},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5682583451271057},{"id":"https://openalex.org/keywords/differential-dynamic-programming","display_name":"Differential dynamic programming","score":0.5219489932060242},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.4861852526664734},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4651544988155365},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.46104520559310913},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.45720037817955017},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4335537552833557},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.419288694858551},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.3760315477848053},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.3711048364639282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2225557267665863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15757399797439575},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11710560321807861},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.1117546558380127}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.7720497846603394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7019739151000977},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6038601994514465},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6036391258239746},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5682583451271057},{"id":"https://openalex.org/C92292787","wikidata":"https://www.wikidata.org/wiki/Q5275342","display_name":"Differential dynamic programming","level":3,"score":0.5219489932060242},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.4861852526664734},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4651544988155365},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.46104520559310913},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45720037817955017},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4335537552833557},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.419288694858551},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.3760315477848053},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3711048364639282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2225557267665863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15757399797439575},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11710560321807861},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.1117546558380127},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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":2,"locations":[{"id":"doi:10.1109/icra46639.2022.9811562","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra46639.2022.9811562","pdf_url":null,"source":{"id":"https://openalex.org/S4363607759","display_name":"2022 International Conference on Robotics and Automation (ICRA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/154989","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/154989","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/154989/2/2109.07081v2.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arxiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/154989","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/154989","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/154989/2/2109.07081v2.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arxiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.550000011920929,"display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3200418126.pdf","grobid_xml":"https://content.openalex.org/works/W3200418126.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W195033972","https://openalex.org/W1566070776","https://openalex.org/W1964946446","https://openalex.org/W1970101292","https://openalex.org/W1993170675","https://openalex.org/W2004975435","https://openalex.org/W2019965290","https://openalex.org/W2046596783","https://openalex.org/W2049105993","https://openalex.org/W2055381865","https://openalex.org/W2060902294","https://openalex.org/W2083940610","https://openalex.org/W2109944946","https://openalex.org/W2119079709","https://openalex.org/W2142224528","https://openalex.org/W2178091345","https://openalex.org/W2557925931","https://openalex.org/W2736013428","https://openalex.org/W2737829489","https://openalex.org/W2749680651","https://openalex.org/W2774021736","https://openalex.org/W2951069078","https://openalex.org/W2963414638","https://openalex.org/W2970791107","https://openalex.org/W3004162504","https://openalex.org/W3023482301","https://openalex.org/W3081791272","https://openalex.org/W3096721080","https://openalex.org/W3123819824","https://openalex.org/W3131300404","https://openalex.org/W3211752748"],"related_works":["https://openalex.org/W4206704743","https://openalex.org/W4313119266","https://openalex.org/W2164807043","https://openalex.org/W4231448069","https://openalex.org/W2019128690","https://openalex.org/W2128461291","https://openalex.org/W2355907103","https://openalex.org/W1495847109","https://openalex.org/W2270789747","https://openalex.org/W2894731288"],"abstract_inverted_index":{"Indirect":[0],"trajectory":[1],"optimization":[2],"methods":[3],"such":[4],"as":[5,68,81],"Differential":[6],"Dynamic":[7],"Programming":[8],"(DDP)":[9],"have":[10],"found":[11],"considerable":[12],"success":[13],"when":[14,30],"only":[15],"planning":[16],"under":[17],"dynamic":[18,111],"feasibility":[19],"constraints.":[20],"Meanwhile,":[21],"nonlinear":[22],"programming":[23,51],"(NLP)":[24],"has":[25],"been":[26],"the":[27,64,73,76,117,123,141],"state-of-the-art":[28],"approach":[29],"faced":[31],"with":[32],"additional":[33],"constraints":[34],"(e.g.,":[35],"control":[36],"bounds,":[37],"obstacle":[38],"avoidance).":[39],"However,":[40],"a":[41,82,86,109,128,153],"na\u00efve":[42],"implementation":[43],"of":[44,63,140,155],"NLP":[45],"algorithms,":[46],"e.g.,":[47],"shooting-based":[48],"sequential":[49],"quadratic":[50],"(SQP),":[52],"may":[53],"suffer":[54],"from":[55,60],"slow":[56],"convergence":[57,163],"\u2013":[58],"caused":[59],"natural":[61],"instabilities":[62],"underlying":[65],"system":[66],"manifesting":[67],"poor":[69],"numerical":[70],"stability":[71],"within":[72],"optimization.":[74],"Re-interpreting":[75],"DDP":[77],"closed-loop":[78],"rollout":[79],"policy":[80],"sensitivity-based":[83],"correction":[84],"to":[85,93],"second-order":[87],"search":[88],"direction,":[89],"we":[90,126,145],"demonstrate":[91],"how":[92],"compute":[94],"analogous":[95],"closedloop":[96,133],"policies":[97],"(i.e.,":[98],"feedback":[99,142],"gains)":[100],"for":[101],"constrained":[102],"problems.":[103],"Our":[104],"key":[105],"theoretical":[106,148],"result":[107],"introduces":[108],"novel":[110],"programmingbased":[112],"constraint-set":[113],"recursion":[114],"that":[115],"augments":[116],"canonical":[118],"\u201ccost-to-go\u201d":[119],"backward":[120],"pass.":[121],"On":[122],"algorithmic":[124,150],"front,":[125],"develop":[127],"hybrid-SQP":[129],"algorithm":[130],"incorporating":[131],"DDP-style":[132],"rollouts,":[134],"enabled":[135],"via":[136],"efficient":[137],"parallelized":[138],"computation":[139],"gains.":[143],"Finally,":[144],"validate":[146],"our":[147],"and":[149],"contributions":[151],"on":[152],"set":[154],"increasingly":[156],"challenging":[157],"benchmarks,":[158],"demonstrating":[159],"significant":[160],"improvements":[161],"in":[162],"speed":[164],"over":[165],"standard":[166],"open-loop":[167],"SQP.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}