{"id":"https://openalex.org/W7123343944","doi":"https://doi.org/10.1109/cdc57313.2025.11312541","title":"A Hopf-Lax Type Formula for Multi-Agent Path Planning with Pattern Coordination","display_name":"A Hopf-Lax Type Formula for Multi-Agent Path Planning with Pattern Coordination","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123343944","doi":"https://doi.org/10.1109/cdc57313.2025.11312541"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312541","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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/A5064882746","display_name":"Christian Parkinson","orcid":"https://orcid.org/0000-0003-1532-5409"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christian Parkinson","raw_affiliation_strings":["Michigan State University,Department of Mathematics and Department of Computational Mathematics, Science and Engineering,East Lansing,MI,USA,48824"],"affiliations":[{"raw_affiliation_string":"Michigan State University,Department of Mathematics and Department of Computational Mathematics, Science and Engineering,East Lansing,MI,USA,48824","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5119948150","display_name":"Adan Baca","orcid":null},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adan Baca","raw_affiliation_strings":["University of Arizona,Department of Mathematics and Department of Computer Science,Tucson,AZ,USA,85721"],"affiliations":[{"raw_affiliation_string":"University of Arizona,Department of Mathematics and Department of Computer Science,Tucson,AZ,USA,85721","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064882746"],"corresponding_institution_ids":["https://openalex.org/I87216513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.68532873,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"649","last_page":"654"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.37529999017715454,"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.37529999017715454,"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.18950000405311584,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.06369999796152115,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6284000277519226},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6136999726295471},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5019000172615051},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48730000853538513},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.48019999265670776},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.47029998898506165},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4300000071525574},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.42570000886917114}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6284000277519226},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.617900013923645},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6136999726295471},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5669000148773193},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5019000172615051},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48730000853538513},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.48019999265670776},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.47029998898506165},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4300000071525574},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40139999985694885},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.3495999872684479},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.3467000126838684},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C93779851","wikidata":"https://www.wikidata.org/wiki/Q271977","display_name":"Partial differential equation","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.305400013923645},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C93226319","wikidata":"https://www.wikidata.org/wiki/Q193137","display_name":"Differential (mechanical device)","level":2,"score":0.2603999972343445}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312541","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7132459282875061,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,97],"present":[1],"an":[2],"algorithm":[3],"for":[4,58],"a":[5,18,39,113],"multi-agent":[6,53],"path":[7,34],"planning":[8,35,54],"problem":[9],"with":[10,117],"pattern":[11],"coordination":[12],"based":[13,32,76],"on":[14,77],"dynamic":[15],"programming":[16],"and":[17,94],"Hamilton-Jacobi-Bellman":[19],"equation.":[20],"This":[21],"falls":[22],"broadly":[23],"into":[24],"the":[25,48,63],"class":[26],"of":[27,52,65,82,128],"partial":[28],"differential":[29],"equation":[30],"(PDE)":[31],"optimal":[33],"methods,":[36],"which":[37,60],"give":[38],"black-box-free":[40],"alternative":[41],"to":[42,47,84,91,101,111,124],"machine":[43],"learning":[44],"hierarchies.":[45],"Due":[46],"high-dimensional":[49],"state":[50],"space":[51],"problems,":[55],"grid-based":[56],"methods":[57,75],"PDE":[59],"suffer":[61],"from":[62],"curse":[64],"dimensionality":[66],"are":[67],"infeasible,":[68],"so":[69],"we":[70],"instead":[71],"develop":[72],"grid-free":[73],"numerical":[74],"variational":[78],"Hopf-Lax":[79],"type":[80],"representations":[81],"solutions":[83],"Hamilton-Jacobi":[85],"Equations.":[86],"Our":[87],"formulation":[88],"is":[89,121],"amenable":[90],"nonlinear":[92],"dynamics":[93],"heterogeneous":[95],"agents.":[96],"apply":[98],"our":[99],"method":[100],"synthetic":[102],"examples":[103],"wherein":[104],"agents":[105],"navigate":[106],"around":[107],"obstacles":[108],"while":[109],"attempting":[110],"maintain":[112],"prespecified":[114],"formation,":[115],"though":[116],"small":[118],"changes":[119],"it":[120],"likely":[122],"applicable":[123],"much":[125],"larger":[126],"classes":[127],"problems.":[129]},"counts_by_year":[],"updated_date":"2026-01-14T00:46:21.520733","created_date":"2026-01-14T00:00:00"}