{"id":"https://openalex.org/W4389665840","doi":"https://doi.org/10.1109/iros55552.2023.10342328","title":"Efficient Constrained Multi-Agent Trajectory Optimization Using Dynamic Potential Games","display_name":"Efficient Constrained Multi-Agent Trajectory Optimization Using Dynamic Potential Games","publication_year":2023,"publication_date":"2023-10-01","ids":{"openalex":"https://openalex.org/W4389665840","doi":"https://doi.org/10.1109/iros55552.2023.10342328"},"language":"en","primary_location":{"id":"doi:10.1109/iros55552.2023.10342328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros55552.2023.10342328","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5081923391","display_name":"Maulik Bhatt","orcid":"https://orcid.org/0000-0002-4742-9192"},"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":"Maulik Bhatt","raw_affiliation_strings":["University of Illinois,Department of Aerospace Engineering,Urbana-Champaign,USA","Department of Aerospace Engineering, University of Illinois, Urbana-Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois,Department of Aerospace Engineering,Urbana-Champaign,USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Aerospace Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101229564","display_name":"Yixuan Jia","orcid":null},"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":"Yixuan Jia","raw_affiliation_strings":["University of Illinois,Department of Electrical and Computer Engineering,Urbana-Champaign,USA","Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois,Department of Electrical and Computer Engineering,Urbana-Champaign,USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062267932","display_name":"Negar Mehr","orcid":"https://orcid.org/0000-0002-1045-4423"},"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":"Negar Mehr","raw_affiliation_strings":["University of Illinois,Department of Aerospace Engineering,Urbana-Champaign,USA","Department of Aerospace Engineering, University of Illinois, Urbana-Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois,Department of Aerospace Engineering,Urbana-Champaign,USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Aerospace Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":1.8207,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.9069571,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"7303","last_page":"7310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.970300018787384,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7105145454406738},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6896882057189941},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6696752309799194},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.5749611854553223},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.5408978462219238},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5184890031814575},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.517479658126831},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.5148648023605347},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48871850967407227},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45328712463378906},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.33306393027305603},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17375323176383972},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16585353016853333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14540427923202515}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7105145454406738},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6896882057189941},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6696752309799194},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.5749611854553223},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.5408978462219238},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5184890031814575},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.517479658126831},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.5148648023605347},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48871850967407227},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45328712463378906},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.33306393027305603},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17375323176383972},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16585353016853333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14540427923202515},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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":1,"locations":[{"id":"doi:10.1109/iros55552.2023.10342328","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros55552.2023.10342328","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G140214086","display_name":null,"funder_award_id":"ECCS-2145134,CNS-2218759,CCF-2211542","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W195033972","https://openalex.org/W1977794212","https://openalex.org/W1979610255","https://openalex.org/W2011507340","https://openalex.org/W2024587727","https://openalex.org/W2032427678","https://openalex.org/W2054129049","https://openalex.org/W2066767736","https://openalex.org/W2103151730","https://openalex.org/W2123871098","https://openalex.org/W2170269759","https://openalex.org/W2334899171","https://openalex.org/W2411577903","https://openalex.org/W2492629073","https://openalex.org/W2563700852","https://openalex.org/W2600080636","https://openalex.org/W2842089854","https://openalex.org/W2892355632","https://openalex.org/W2962893524","https://openalex.org/W2962963881","https://openalex.org/W2969076652","https://openalex.org/W2982117252","https://openalex.org/W3004162504","https://openalex.org/W3022321359","https://openalex.org/W3035045431","https://openalex.org/W3089576059","https://openalex.org/W3120436098","https://openalex.org/W3130217624","https://openalex.org/W3173989948","https://openalex.org/W3202277149","https://openalex.org/W4383108202","https://openalex.org/W4385452062","https://openalex.org/W4404609280","https://openalex.org/W6605628997","https://openalex.org/W6637327146","https://openalex.org/W6754752817"],"related_works":["https://openalex.org/W2003479292","https://openalex.org/W3135469233","https://openalex.org/W3101253900","https://openalex.org/W3123416417","https://openalex.org/W2347892399","https://openalex.org/W2133687134","https://openalex.org/W3038596169","https://openalex.org/W345637666","https://openalex.org/W2355999325","https://openalex.org/W2000609527"],"abstract_inverted_index":{"Although":[0],"dynamic":[1,102,110,114],"games":[2,13,116,121],"provide":[3,193],"a":[4,56,108,118,127,135,140,149,170,201,208],"rich":[5],"paradigm":[6],"for":[7,14,48,81,122],"modeling":[8],"agents'":[9,33,70,93],"interactions,":[10],"solving":[11,126,148],"these":[12],"real-world":[15,21],"applications":[16],"is":[17,63,104,182],"often":[18],"challenging.":[19],"Many":[20],"interactive":[22,49,158],"settings":[23],"involve":[24],"general":[25],"nonlinear":[26],"state":[27],"and":[28,45,72,83,95,177],"input":[29],"constraints":[30],"that":[31,75,179],"couple":[32],"decisions":[34],"with":[35,214],"one":[36],"another.":[37],"In":[38],"this":[39],"work,":[40],"we":[41,88],"develop":[42],"an":[43,105],"efficient":[44],"fast":[46,82],"planner":[47],"trajectory":[50,159],"optimization":[51,160],"in":[52,78,169,200],"constrained":[53,57,109,131,136,151,157],"setups":[54],"using":[55],"game-theoretical":[58],"framework.":[59],"Our":[60],"key":[61],"insight":[62],"to":[64],"leverage":[65],"the":[66,90,100,164,189],"special":[67],"structure":[68,91],"of":[69,92,107,120,125,129,166,196],"objective":[71],"constraint":[73,96],"functions":[74,97],"are":[76,117],"common":[77],"multi-agent":[79],"interactions":[80],"reliable":[84],"planning.":[85],"More":[86],"precisely,":[87],"identify":[89],"cost":[94],"under":[98],"which":[99,123],"resulting":[101],"game":[103],"instance":[106],"potential":[111,115],"game.":[112],"Constrained":[113],"class":[119],"instead":[124],"set":[128],"coupled":[130],"optimal":[132,152],"control":[133,153],"problems,":[134],"Nash":[137,142],"equilibrium,":[138,143],"i.e.":[139],"Generalized":[141],"can":[144],"be":[145],"found":[146],"by":[147],"single":[150],"problem.":[154],"This":[155],"simplifies":[156],"significantly.":[161],"We":[162,191],"compare":[163],"performance":[165],"our":[167,180,197],"method":[168,181,199],"navigation":[171,202],"setup":[172,203],"involving":[173,204],"four":[174],"planar":[175],"agents":[176],"show":[178],"on":[183],"average":[184],"20":[185],"times":[186],"faster":[187],"than":[188],"state-of-the-art.":[190],"further":[192],"experimental":[194],"validation":[195],"proposed":[198],"two":[205,215],"quadrotors":[206],"carrying":[207],"rigid":[209],"object":[210],"while":[211],"avoiding":[212],"collisions":[213],"humans.":[216]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":8}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}