A Study on Improving Multi-agent Path Finding in Congested Environments Using Agent Merging and Splitting
The rising demand for robots in warehouses has highlighted the need for efficient multi-robot algorithms. In response, researchers have focused on Multi-Agent Path Finding (MAPF), which enables multiple agents to calculate conflict-free paths to their individual goals. However, the computation time...
محفوظ في:
| المؤلفون الرئيسيون: | , , , , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Korean Society for Precision Engineering
2026-02-01
|
| سلاسل: | 한국정밀공학회지 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://www.jkspe.or.kr/upload/pdf/JKSPE-025-044.pdf |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|