{"id":"https://openalex.org/W4405312059","doi":"https://doi.org/10.48550/arxiv.2412.08556","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":2024,"publication_date":"2024-12-11","ids":{"openalex":"https://openalex.org/W4405312059","doi":"https://doi.org/10.48550/arxiv.2412.08556"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2412.08556","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2412.08556","pdf_url":"https://arxiv.org/pdf/2412.08556","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2412.08556","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018558873","display_name":"Foivos Fioravantes","orcid":"https://orcid.org/0000-0001-8217-030X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fioravantes, Foivos","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Knop, Du\u0161an","raw_affiliation_strings":[],"affiliations":[]},{"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":[],"countries":[],"is_corresponding":false,"raw_author_name":"K\u0159i\u0161\u0165an, Jan Maty\u00e1\u0161","raw_affiliation_strings":[],"affiliations":[]},{"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":"Melissinos, Nikolaos","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5006649123","display_name":"Michal Opler","orcid":"https://orcid.org/0000-0002-4389-5807"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Opler, Michal","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5018558873"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9979000091552734,"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.9979000091552734,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9919000267982483,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.988099992275238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6750091910362244},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6439527273178101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5481517314910889},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.5236077904701233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44062721729278564},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.41188526153564453},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.400527685880661},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30584776401519775},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.25003474950790405},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2215946912765503},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11551916599273682},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09783396124839783}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6750091910362244},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6439527273178101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5481517314910889},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.5236077904701233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44062721729278564},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.41188526153564453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.400527685880661},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30584776401519775},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25003474950790405},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2215946912765503},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11551916599273682},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09783396124839783}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2412.08556","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2412.08556","pdf_url":"https://arxiv.org/pdf/2412.08556","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2412.08556","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2412.08556","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2412.08556","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2412.08556","pdf_url":"https://arxiv.org/pdf/2412.08556","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"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"},{"id":"https://openalex.org/G7594605176","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"}],"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":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4405312059.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2071459461","https://openalex.org/W2093885745","https://openalex.org/W2351266481","https://openalex.org/W2132547887","https://openalex.org/W2516987005","https://openalex.org/W1903828570","https://openalex.org/W2907786475","https://openalex.org/W2963447120","https://openalex.org/W4289082820","https://openalex.org/W2092152400"],"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],"Constraint":[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-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}