Leveraging Experience in Lifelong Multi-Agent Pathfinding

by   Nitzan Madar, et al.

In Lifelong Multi-Agent Path Finding (L-MAPF) a team of agents performs a stream of tasks consisting of multiple locations to be visited by the agents on a shared graph while avoiding collisions with one another. L-MAPF is typically tackled by partitioning it into multiple consecutive, and hence similar, "one-shot" MAPF queries, as in the Rolling-Horizon Collision Resolution (RHCR) algorithm. Therefore, a solution to one query informs the next query, which leads to similarity with respect to the agents' start and goal positions, and how collisions need to be resolved from one query to the next. Thus, experience from solving one MAPF query can potentially be used to speedup solving the next one. Despite this intuition, current L-MAPF planners solve consecutive MAPF queries from scratch. In this paper, we introduce a new RHCR-inspired approach called exRHCR, which exploits experience in its constituent MAPF queries. In particular, exRHCR employs an extension of Priority-Based Search (PBS), a state-of-the-art MAPF solver. The extension, which we call exPBS, allows to warm-start the search with the priorities between agents used by PBS in the previous MAPF instances. We demonstrate empirically that exRHCR solves L-MAPF instances up to 39 throughput for given task streams by increasing the number of agents a planner can cope with for a given time budget.


page 4

page 5

page 10


Lifelong Multi-Agent Path Finding in Large-Scale Warehouses

Multi-Agent Path Finding (MAPF) is the problem of moving a team of agent...

Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation

Multi-agent pathfinding (MAPF) is concerned with planning collision-free...

Cooperative Solutions to Exploration Tasks Under Speed and Budget Constraints

We present a multi-agent system where agents can cooperate to solve a sy...

Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings

Multi-agent path finding in continuous space and time with geometric age...

Periodic Multi-Agent Path Planning

Multi-agent path planning (MAPP) is the problem of planning collision-fr...

Toward a new instances of NELL

We are developing the method to start new instances of NELL in various l...

Position Paper: From Multi-Agent Pathfinding to Pipe Routing

The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision...

Please sign up or login with your details

Forgot password? Click here to reset