{"id":"https://openalex.org/W7164306401","doi":"https://doi.org/10.48550/arxiv.2606.12070","title":"Fibration Trees: A Unified Approach to Multi-Robot Motion Planning","display_name":"Fibration Trees: A Unified Approach to Multi-Robot Motion Planning","publication_year":2026,"publication_date":"2026-06-10","ids":{"openalex":"https://openalex.org/W7164306401","doi":"https://doi.org/10.48550/arxiv.2606.12070"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.12070","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.12070","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.12070","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024839170","display_name":"Andreas Orthey","orcid":"https://orcid.org/0000-0002-1478-1405"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Orthey, Andreas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018027629","display_name":"Florian T. Pokorny","orcid":"https://orcid.org/0000-0003-1114-6040"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pokorny, Florian T.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138405681","display_name":"Lydia E. Kavraki","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kavraki, Lydia E.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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.5527999997138977,"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.5527999997138977,"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/T10142","display_name":"Formal Methods in Verification","score":0.120899997651577,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.09000000357627869,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fibration","display_name":"Fibration","score":0.8489000201225281},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5879999995231628},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.5410000085830688},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5170000195503235},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4846999943256378},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4652000069618225},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4551999866962433}],"concepts":[{"id":"https://openalex.org/C54486226","wikidata":"https://www.wikidata.org/wiki/Q493941","display_name":"Fibration","level":3,"score":0.8489000201225281},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5879999995231628},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.5410000085830688},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5170000195503235},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4846999943256378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47269999980926514},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4652000069618225},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4551999866962433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4318000078201294},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4307999908924103},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3905999958515167},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3700999915599823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35989999771118164},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3312999904155731},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.31060001254081726},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.2809000015258789},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25850000977516174},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.12070","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.12070","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.12070","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.12070","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"State":[0],"space":[1,74],"projections":[2,34,83,94],"and":[3,38,61,92,125,144,155,164],"decompositions":[4,39],"have":[5],"emerged":[6],"as":[7,59,63,84,199],"powerful":[8],"tools":[9],"to":[10,75,147,176],"tackle":[11],"the":[12,105,133,153],"curse":[13],"of":[14,33,56,135,157,179],"dimensionality":[15],"in":[16],"high-dimensional,":[17],"multi-robot":[18,205],"motion":[19,114,206],"planning":[20],"problems.":[21],"However,":[22],"existing":[23],"methods":[24],"lack":[25],"a":[26,66,69,72,76,96,112,200],"unified":[27,202],"framework":[28,203],"which":[29,52],"seamlessly":[30],"handles":[31],"combinations":[32],"(prioritization":[35],"or":[36,41],"task-space)":[37],"(parallel":[40],"decoupled":[42],"subspaces).":[43],"To":[44,151],"fill":[45],"this":[46],"gap,":[47],"we":[48,86,103,159],"introduce":[49],"fibration":[50,67,108,142,193,197],"trees,":[51,194],"are":[53],"trees":[54,109,143,198],"consisting":[55],"state":[57],"spaces":[58],"nodes":[60],"fibrations":[62],"edges,":[64],"whereby":[65],"models":[68],"projection":[70],"from":[71,119],"higher-dimensional":[73],"lower-dimensional":[77],"(or":[78],"simplified)":[79],"space.":[80],"By":[81],"modeling":[82],"fibrations,":[85],"unify":[87],"sequential":[88,123],"prioritization,":[89],"parallel":[90,129],"decomposition,":[91],"task-space":[93,136],"under":[95],"single,":[97],"coherent":[98],"formalism.":[99],"Building":[100],"on":[101,140,167],"this,":[102],"develop":[104],"rapidly-exploring":[106],"random":[107],"(Fibration-RRT)":[110],"planner,":[111],"sampling-based":[113],"planner":[115],"that":[116,184],"generalizes":[117],"strategies":[118],"quotient-space":[120],"RRT":[121,127],"(for":[122,128],"prioritizations)":[124],"discrete":[126],"decompositions),":[130],"while":[131],"allowing":[132],"inclusion":[134],"projections.":[137],"Fibration-RRT":[138,185],"operates":[139],"user-defined":[141,192],"is":[145],"proven":[146],"be":[148],"probabilistically":[149],"complete.":[150],"test":[152],"generality":[154],"efficiency":[156],"Fibration-RRT,":[158],"provide":[160],"an":[161],"open-source":[162],"implementation":[163],"conduct":[165],"experiments":[166],"32":[168],"scenarios":[169],"using":[170],"multi":[171],"robot":[172],"teams":[173],"with":[174],"up":[175],"96":[177],"degrees":[178],"freedom.":[180],"Our":[181],"results":[182],"indicate":[183],"efficiently":[186],"solves":[187],"high-dimensional":[188],"problems":[189],"by":[190],"exploiting":[191],"thereby":[195],"establishing":[196],"powerful,":[201],"for":[204],"planning.":[207]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-12T00:00:00"}
