Deadlock-Free Method for Multi-Agent Pickup and Delivery Problem Using Priority Inheritance with Temporary Priority

@inproceedings{Fujitani2022DeadlockFreeMF,
  title={Deadlock-Free Method for Multi-Agent Pickup and Delivery Problem Using Priority Inheritance with Temporary Priority},
  author={Yukita Fujitani and Tomoki Yamauchi and Yuki Miyashita and Toshiharu Sugawara},
  booktitle={International Conference on Knowledge-Based Intelligent Information \& Engineering Systems},
  year={2022}
}
This paper proposes a control method for the multi-agent pickup and delivery problem (MAPD problem) by extending the priority inheritance with backtracking (PIBT) method to make it applicable to more general environments. PIBT is an e ff ective algorithm that introduces a priority to each agent, and at each timestep, the agents, in descending order of priority, decide their next neighboring locations in the next timestep through communications only with the local agents. Unfortunately, PIBT is… 

Figures from this paper

References

SHOWING 1-10 OF 16 REFERENCES

Emergence of divisional cooperation with negotiation and re-learning and evaluation of flexibility in continuous cooperative patrol problem

This work addresses the continuous cooperative patrol problem, which requires cooperation based on high autonomy, and proposes an autonomous learning method with simple negotiation to enhance divisional cooperation for efficient work and investigates how this method can have high flexibility to adapt to change.

Standby-Based Deadlock Avoidance Method for Multi-Agent Pickup and Delivery Tasks

SBDA uses standby nodes determined in real-time using the articulation-point-finding algorithm, and the agent is guaranteed to stay there for a finite amount of time, and it is demonstrated that this proposed method outperforms a conventional approach.

Decentralized Task Assignment for Multi-item Pickup and Delivery in Logistic Scenarios

A distributed algorithm based on a Token-Passing approach, where robots handles by themselves the allocation of tasks and generates conflict-free paths requiring weaker assumptions in comparison to previous approaches, which produces solutions comparable in quality to those produced by a centralized approach and reduces computation times significantly.

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

A new grid-based benchmark for MAPF is introduced, and it is demonstrated experimentally that it poses a challenge to contemporary MAPF algorithms.

Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery

This work makes Token Passing even more efficient and effective by using a novel combinatorial search algorithm, called Safe Interval Path Planning with Reservation Table (SIPPwRT), for single-agent path planning, which takes kinematic constraints of real robots into account directly during planning.

Planning, Scheduling and Monitoring for Airport Surface Operations

This paper explores the problem of managing movements of aircraft along the surface of busy airports. Airport surface management is a complex logistics problem involving the coordination of humans

Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks

Two decoupled MAPD algorithms, Token Passing (TP) and Token Passing with Task Swaps (TPTS) are presented and it is shown that they solve all well-formed MAPD instances, a realistic subclass ofMAPD instances.

Finding Optimal Solutions to Cooperative Pathfinding Problems

This work proposes a technique called operator decomposition, which can be used to reduce the branching factors of many search algorithms, including algorithms for cooperative pathfinding, and shows how a type of independence common in instances of Cooperative pathfinding problems can be exploited.

Conflict-based search for optimal multi-agent pathfinding