{"id":"https://openalex.org/W2737829489","doi":"https://doi.org/10.1109/icra.2017.7989086","title":"Differential dynamic programming with nonlinear constraints","display_name":"Differential dynamic programming with nonlinear constraints","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2737829489","doi":"https://doi.org/10.1109/icra.2017.7989086","mag":"2737829489"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2017.7989086","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","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/A5102887266","display_name":"Zhaoming Xie","orcid":"https://orcid.org/0000-0003-1948-1767"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhaoming Xie","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048338914","display_name":"C. Karen Liu","orcid":"https://orcid.org/0000-0001-5926-0905"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Karen Liu","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA, US","institution_ids":["https://openalex.org/I130701444"]}]},{"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/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kris Hauser","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"695","last_page":"702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.9751999974250793,"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"}},"topics":[{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.9751999974250793,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9646999835968018,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.960099995136261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/differential-dynamic-programming","display_name":"Differential dynamic programming","score":0.6871244311332703},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6683915257453918},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.6307390928268433},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.6132335662841797},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5779976844787598},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5395826697349548},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5013537406921387},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.4884999990463257},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.48473283648490906},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.4781399965286255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4737221300601959},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4486334025859833},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.4383937418460846},{"id":"https://openalex.org/keywords/nonlinear-control","display_name":"Nonlinear control","score":0.4253506660461426},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.41373366117477417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41282325983047485},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.23806291818618774}],"concepts":[{"id":"https://openalex.org/C92292787","wikidata":"https://www.wikidata.org/wiki/Q5275342","display_name":"Differential dynamic programming","level":3,"score":0.6871244311332703},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6683915257453918},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.6307390928268433},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.6132335662841797},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5779976844787598},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5395826697349548},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5013537406921387},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.4884999990463257},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.48473283648490906},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.4781399965286255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4737221300601959},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4486334025859833},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.4383937418460846},{"id":"https://openalex.org/C91581856","wikidata":"https://www.wikidata.org/wiki/Q2707001","display_name":"Nonlinear control","level":3,"score":0.4253506660461426},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.41373366117477417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41282325983047485},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.23806291818618774},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2017.7989086","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W195033972","https://openalex.org/W1528725978","https://openalex.org/W1742473997","https://openalex.org/W1964946446","https://openalex.org/W1970101292","https://openalex.org/W1993170675","https://openalex.org/W2022144657","https://openalex.org/W2060902294","https://openalex.org/W2080132051","https://openalex.org/W2087617385","https://openalex.org/W2126147262","https://openalex.org/W2154393604","https://openalex.org/W2158370675","https://openalex.org/W2296319761","https://openalex.org/W2413365548","https://openalex.org/W2571503750","https://openalex.org/W3152048569","https://openalex.org/W4250589301","https://openalex.org/W6607786297"],"related_works":["https://openalex.org/W2347515520","https://openalex.org/W2716677055","https://openalex.org/W2358235347","https://openalex.org/W2097175811","https://openalex.org/W3152231735","https://openalex.org/W2515254463","https://openalex.org/W938042447","https://openalex.org/W2049105993","https://openalex.org/W1977696209","https://openalex.org/W2737829489"],"abstract_inverted_index":{"Differential":[0],"dynamic":[1],"programming":[2],"(DDP)":[3],"is":[4,43,62,97,128,143,152,170],"a":[5,37,64,75,98,113,131,148],"widely":[6],"used":[7,129],"trajectory":[8],"optimization":[9],"technique":[10],"that":[11,42,63,136],"addresses":[12],"nonlinear":[13,21,48,110],"optimal":[14,157],"control":[15,32,158,167],"problems,":[16],"and":[17,54,142,166,169],"can":[18,71],"readily":[19],"handle":[20,28],"cost":[22],"functions.":[23],"However,":[24],"it":[25],"does":[26],"not":[27],"either":[29],"state":[30,53],"or":[31],"constraints.":[33,178],"This":[34,126],"paper":[35],"presents":[36],"novel":[38],"formulation":[39],"of":[40,67,93,100,109,115],"DDP":[41,61],"able":[44],"to":[45,145,161,172],"accommodate":[46],"arbitrary":[47],"inequality":[49],"constraints":[50,117,168],"on":[51,154],"both":[52],"control.":[55],"The":[56,89],"main":[57,90],"insight":[58],"in":[59,106,124,130],"standard":[60],"quadratic":[65,103],"approximation":[66,104],"the":[68,80,94,101,107],"value":[69],"function":[70],"be":[72],"derived":[73],"using":[74],"recursive":[76,81,102],"backward":[77],"pass,":[78],"however":[79],"formulae":[82],"are":[83],"only":[84],"valid":[85],"for":[86,176],"unconstrained":[87],"problems.":[88],"technical":[91],"contribution":[92],"presented":[95],"method":[96],"derivation":[99],"formula":[105,127],"presence":[108],"constraints,":[111],"after":[112],"set":[114,141],"active":[116,140],"has":[118],"been":[119],"identified":[120],"at":[121],"each":[122],"point":[123],"time.":[125],"new":[132],"Constrained-DDP":[133],"(CDDP)":[134],"algorithm":[135],"iteratively":[137],"determines":[138],"these":[139],"guaranteed":[144],"converge":[146],"toward":[147],"local":[149],"minimum.":[150],"CDDP":[151],"demonstrated":[153],"several":[155],"underactuated":[156],"problems":[159],"up":[160],"12D":[162],"with":[163],"obstacle":[164],"avoidance":[165],"shown":[171],"outperform":[173],"other":[174],"methods":[175],"accommodating":[177]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":21},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}