{"id":"https://openalex.org/W7147720958","doi":"https://doi.org/10.1613/jair.1.19325","title":"Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures","display_name":"Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures","publication_year":2026,"publication_date":"2026-03-31","ids":{"openalex":"https://openalex.org/W7147720958","doi":"https://doi.org/10.1613/jair.1.19325"},"language":null,"primary_location":{"id":"doi:10.1613/jair.1.19325","is_oa":true,"landing_page_url":"https://doi.org/10.1613/jair.1.19325","pdf_url":"https://www.jair.org/index.php/jair/article/download/19325/27291","source":{"id":"https://openalex.org/S139930977","display_name":"Journal of Artificial Intelligence Research","issn_l":"1076-9757","issn":["1076-9757","1943-5037"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315760","host_organization_name":"AI Access Foundation","host_organization_lineage":["https://openalex.org/P4310315760"],"host_organization_lineage_names":["AI Access Foundation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jair.org/index.php/jair/article/download/19325/27291","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018558873","display_name":"Foivos Fioravantes","orcid":"https://orcid.org/0000-0001-8217-030X"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Foivos Fioravantes","raw_affiliation_strings":["a:1:{s:5:\"en_US\";s:130:\"epartment of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech Republic\";}"],"raw_orcid":"https://orcid.org/0000-0001-8217-030X","affiliations":[{"raw_affiliation_string":"a:1:{s:5:\"en_US\";s:130:\"epartment of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech Republic\";}","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":["Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague"],"raw_orcid":"https://orcid.org/0000-0003-2588-5709","affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019015361","display_name":"Jan Maty\u00e1\u0161 K\u0159i\u0161\u0165an","orcid":"https://orcid.org/0000-0001-6657-0020"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Maty\u00e1\u0161 K\u0159i\u0161\u0165an","raw_affiliation_strings":["Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague"],"raw_orcid":"https://orcid.org/0000-0001-6657-0020","affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088003340","display_name":"Nikolaos Melissinos","orcid":"https://orcid.org/0000-0002-0864-9803"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikolaos Melissinos","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-0864-9803","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5006649123","display_name":"Michal Opler","orcid":"https://orcid.org/0000-0002-4389-5807"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Michal Opler","raw_affiliation_strings":["Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague"],"raw_orcid":"https://orcid.org/0000-0002-4389-5807","affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.44723688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"85","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.33719998598098755,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.33719998598098755,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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.21799999475479126,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.050999999046325684,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7734000086784363},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6676999926567078},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6376000046730042},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5792999863624573},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5436000227928162},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.5364000201225281},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4787999987602234},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.47749999165534973},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47440001368522644}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7734000086784363},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6676999926567078},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.647599995136261},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6376000046730042},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5792999863624573},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5436000227928162},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.5364000201225281},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4787999987602234},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4778999984264374},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.47749999165534973},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47440001368522644},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.37610000371932983},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.36579999327659607},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3635999858379364},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.335099995136261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33340001106262207},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3133000135421753},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3066999912261963},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.2870999872684479},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26600000262260437},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2517000138759613},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1613/jair.1.19325","is_oa":true,"landing_page_url":"https://doi.org/10.1613/jair.1.19325","pdf_url":"https://www.jair.org/index.php/jair/article/download/19325/27291","source":{"id":"https://openalex.org/S139930977","display_name":"Journal of Artificial Intelligence Research","issn_l":"1076-9757","issn":["1076-9757","1943-5037"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315760","host_organization_name":"AI Access Foundation","host_organization_lineage":["https://openalex.org/P4310315760"],"host_organization_lineage_names":["AI Access Foundation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1613/jair.1.19325","is_oa":true,"landing_page_url":"https://doi.org/10.1613/jair.1.19325","pdf_url":"https://www.jair.org/index.php/jair/article/download/19325/27291","source":{"id":"https://openalex.org/S139930977","display_name":"Journal of Artificial Intelligence Research","issn_l":"1076-9757","issn":["1076-9757","1943-5037"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315760","host_organization_name":"AI Access Foundation","host_organization_lineage":["https://openalex.org/P4310315760"],"host_organization_lineage_names":["AI Access Foundation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G112504165","display_name":null,"funder_award_id":"CZ.02.01.01/00/22_008/0004590","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G2178263053","display_name":null,"funder_award_id":"22-19557S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G2678520069","display_name":null,"funder_award_id":"CZ.02.01","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G3697738339","display_name":null,"funder_award_id":"SGS23/205/OHK3/3T/18","funder_id":"https://openalex.org/F4320309972","funder_display_name":"\u010cesk\u00e9 Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Praze"}],"funders":[{"id":"https://openalex.org/F4320309972","display_name":"\u010cesk\u00e9 Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Praze","ror":"https://ror.org/03kqpb082"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7147720958.pdf","grobid_xml":"https://content.openalex.org/works/W7147720958.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Consider":[0],"the":[1,41,44,49,53,64,84,97,100,114,123,142,150,153,157,167,170,205,212,216,221],"scenario":[2],"where":[3],"multiple":[4],"agents":[5,65,101,160,208],"have":[6],"to":[7,69,75,81,199],"move":[8],"in":[9,52,166],"an":[10],"optimal":[11],"way":[12,68],"through":[13],"a":[14,37,67,105,173,181],"network,":[15],"each":[16,72,89],"one":[17],"towards":[18],"their":[19],"ending":[20],"position":[21],"while":[22],"avoiding":[23],"collisions.":[24],"By":[25],"optimal,":[26],"we":[27,61,112],"mean":[28],"as":[29,31,40,209],"fast":[30],"possible,":[32],"which":[33],"is":[34,48,79,130,196,218,224],"evaluated":[35],"by":[36,192],"measure":[38],"known":[39],"makespan":[42,162,217],"of":[43,86,88,99,107,159,207,211],"proposed":[45],"solution.":[46],"This":[47],"setting":[50],"studied":[51],"Multiagent":[54,115],"Path":[55,116],"Finding":[56,117],"problem.":[57],"In":[58,109],"this":[59,110],"work,":[60,111],"additionally":[62],"provide":[63,146],"with":[66,71,118],"communicate":[70],"other.":[73],"Due":[74],"size":[76],"constraints,":[77],"it":[78,195],"reasonable":[80],"assume":[82],"that":[83,134,194],"range":[85,155,223],"communication":[87,154,222],"agent":[90],"will":[91],"be":[92,96],"limited.":[93],"What":[94],"should":[95],"trajectories":[98],"to,":[102],"additionally,":[103],"maintain":[104],"backbone":[106],"communication?":[108],"study":[113],"Communication":[119],"Constraints":[120],"problem":[121],"under":[122],"parameterized":[124],"complexity":[125],"framework.":[126],"Our":[127],"main":[128],"contribution":[129],"three":[131],"exact":[132],"algorithms":[133,148,202],"are":[135,164],"efficient":[136,201],"when":[137,152,203],"considering":[138,204],"particular":[139],"structures":[140],"for":[141,149],"input":[143,168],"network.":[144],"We":[145,188],"such":[147],"case":[151],"and":[156,169,220],"number":[158,206],"(the":[161],"resp.)":[163],"provided":[165],"network":[171],"has":[172],"tree":[174],"topology,":[175,183],"or":[176],"bounded":[177,185],"maximum":[178],"degree":[179],"(has":[180],"tree-like":[182],"i.e.,":[184],"treewidth":[186],"resp.).":[187],"complement":[189],"these":[190],"results":[191],"showing":[193],"highly":[197],"unlikely":[198],"construct":[200],"part":[210],"input,":[213],"even":[214],"if":[215],"3":[219],"1.":[225]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-02T00:00:00"}