Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2602.20512 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910031293710336 |
|---|---|
| author | He, Haitong Wu, Xuemian Zhao, Shizhe Ren, Zhongqiang |
| author_facet | He, Haitong Wu, Xuemian Zhao, Shizhe Ren, Zhongqiang |
| contents | This paper investigates a problem called Multi-Agent Path Finding with Elevators (MAPF-E), which seeks conflict-free paths for multiple agents from their start to goal locations that may locate on different floors, and the agents can use elevators to travel between floors. The existence of elevators complicates the interaction among the agents and introduces new challenges to the planning. On the one hand, elevators can cause many conflicts among the agents due to its relatively long traversal time across floors, especially when many agents need to reach a different floor. On the other hand, the planner has to reason in a larger state space including the states of the elevators, besides the locations of the agents. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_20512 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Conflict-Based Search for Multi-Agent Path Finding with Elevators He, Haitong Wu, Xuemian Zhao, Shizhe Ren, Zhongqiang Robotics This paper investigates a problem called Multi-Agent Path Finding with Elevators (MAPF-E), which seeks conflict-free paths for multiple agents from their start to goal locations that may locate on different floors, and the agents can use elevators to travel between floors. The existence of elevators complicates the interaction among the agents and introduces new challenges to the planning. On the one hand, elevators can cause many conflicts among the agents due to its relatively long traversal time across floors, especially when many agents need to reach a different floor. On the other hand, the planner has to reason in a larger state space including the states of the elevators, besides the locations of the agents. |
| title | Conflict-Based Search for Multi-Agent Path Finding with Elevators |
| topic | Robotics |
| url | https://arxiv.org/abs/2602.20512 |