{"id":"https://openalex.org/W7140676733","doi":"https://doi.org/10.48550/arxiv.2603.23503","title":"Optimal Unlabeled Pebble Motion on Trees and its Application to Multi-Agent Path Finding","display_name":"Optimal Unlabeled Pebble Motion on Trees and its Application to Multi-Agent Path Finding","publication_year":2026,"publication_date":"2026-02-04","ids":{"openalex":"https://openalex.org/W7140676733","doi":"https://doi.org/10.48550/arxiv.2603.23503"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.23503","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.23503","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.23503","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5116167666","display_name":"Annalisa Calvi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Calvi, Annalisa","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035242315","display_name":"Pierre Le Bodic","orcid":"https://orcid.org/0000-0003-0842-9533"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bodic, Pierre Le","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130634888","display_name":"Samuel McGuire","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"McGuire, Samuel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004876793","display_name":"Edward Lam","orcid":"https://orcid.org/0000-0002-4485-5014"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lam, Edward","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5116167666"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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.7469000220298767,"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.7469000220298767,"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/T12288","display_name":"Optimization and Search Problems","score":0.05590000003576279,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.02459999918937683,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/pebble","display_name":"Pebble","score":0.8395000100135803},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6920999884605408},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6173999905586243},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.5701000094413757},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5382999777793884},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5249999761581421}],"concepts":[{"id":"https://openalex.org/C2777760186","wikidata":"https://www.wikidata.org/wiki/Q14673","display_name":"Pebble","level":2,"score":0.8395000100135803},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6920999884605408},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6646999716758728},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6173999905586243},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.5701000094413757},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5382999777793884},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.534600019454956},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5249999761581421},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.47839999198913574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3889999985694885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3336000144481659},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30239999294281006},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.23503","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.23503","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":"doi:10.48550/arxiv.2603.23503","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.23503","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4630400240421295,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,3,16,32,79],"tree,":[2,14],"set":[4,17],"of":[5,12,18,50,57,85,93,118],"pebbles":[6,37],"initially":[7],"stationed":[8],"at":[9],"some":[10],"nodes":[11,42,46],"the":[13,21,36,40,44,48,51,55,62,83,86,91,94],"and":[15,90,120],"target":[19,45],"nodes,":[20],"Unlabeled":[22],"Pebble":[23],"Motion":[24],"on":[25,114],"Trees":[26],"problem":[27],"(UPMT)":[28],"asks":[29],"to":[30,34,43,102],"find":[31],"plan":[33,123],"move":[35],"one-at-a-time":[38],"from":[39],"starting":[41],"along":[47],"edges":[49],"tree":[52],"while":[53],"minimizing":[54],"number":[56],"moves.":[58],"This":[59],"paper":[60],"proposes":[61],"first":[63],"optimal":[64,97,115],"algorithm":[65],"for":[66],"UPMT":[67],"that":[68],"is":[69],"asymptotically":[70],"as":[71,73,75],"fast":[72],"possible,":[74],"it":[76],"runs":[77],"in":[78,82,109],"time":[80],"linear":[81],"size":[84,92],"input":[87],"(the":[88,96],"tree)":[89],"output":[95],"plan).":[98],"We":[99],"extend":[100],"this":[101],"solve":[103],"unlabeled":[104],"Multi-Agent":[105],"Path":[106],"Finding":[107],"(MAPF)":[108],"trees,":[110],"providing":[111],"novel":[112],"bounds":[113],"makespan,":[116],"sum":[117],"costs,":[119],"pebble":[121],"motion":[122],"length.":[124]},"counts_by_year":[],"updated_date":"2026-03-27T06:05:27.210665","created_date":"2026-03-27T00:00:00"}