Caching-Augmented Lifelong Multi-Agent Path Finding
원문 초록
Multi-Agent Path Finding (MAPF), which involves finding collision-free paths for multiple robots, is crucial in various applications. Lifelong MAPF, where targets are reassigned to agents as soon as they complete their initial targets, offers a more accurate approximation of real-world warehouse planning. In this paper, we present a novel mechanism named Caching-Augmented Lifelong MAPF (CAL-MAPF), designed to improve the performance of Lifelong MAPF. We have developed a new type of map grid called cache for temporary item storage and replacement, and created a locking mechanism to improve the planning solution's stability. A task assigner (TA) is designed for CAL-MAPF to allocate target locations to agents and control agent status in different situations. CAL-MAPF has been evaluated using various cache replacement policies and input task distributions. We have identified three main factors significantly impacting CAL-MAPF performance through experimentation: suitable input task distribution, high cache hit rate, and smooth traffic. In general, CAL-MAPF has demonstrated potential for performance improvements in certain task distributions, map and agent configurations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds
SIGMA: Sheaf-Informed Geometric Multi-Agent Pathfinding
Simultaneous Computation with Multiple Prioritizations in Multi-Agent Motion Planning
Graph Coloring to Reduce Computation Time in Prioritized Planning
Multi-Agent Motion Planning For Differential Drive Robots Through Stationary State Search
Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.