Terraforming – Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery

05/19/2023
by   David Vainshtein, et al.
0

In automated warehouses, teams of mobile robots fulfill the packaging process by transferring inventory pods to designated workstations while navigating narrow aisles formed by tightly packed pods. This problem is typically modeled as a Multi-Agent Pickup and Delivery (MAPD) problem, which is then solved by repeatedly planning collision-free paths for agents on a fixed graph, as in the Rolling-Horizon Collision Resolution (RHCR) algorithm. However, existing approaches make the limiting assumption that agents are only allowed to move pods that correspond to their current task, while considering the other pods as stationary obstacles (even though all pods are movable). This behavior can result in unnecessarily long paths which could otherwise be avoided by opening additional corridors via pod manipulation. To this end, we explore the implications of allowing agents the flexibility of dynamically relocating pods. We call this new problem Terraforming MAPD (tMAPD) and develop an RHCR-based approach to tackle it. As the extra flexibility of terraforming comes at a significant computational cost, we utilize this capability judiciously by identifying situations where it could make a significant impact on the solution quality. In particular, we invoke terraforming in response to disruptions that often occur in automated warehouses, e.g., when an item is dropped from a pod or when agents malfunction. Empirically, using our approach for tMAPD, where disruptions are modeled via a stochastic process, we improve throughput by over 10 and the pickup time of a pod) by more than 50 the runtime, compared to the MAPD setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2022

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

Multi-agent pathfinding (MAPF) is concerned with planning collision-free...
research
03/30/2023

Robust Multi-Agent Pickup and Delivery with Delays

Multi-Agent Pickup and Delivery (MAPD) is the problem of computing colli...
research
04/27/2023

Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses

We introduce a new problem formulation, Double-Deck Multi-Agent Pickup a...
research
08/22/2023

Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics tha...
research
05/25/2022

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

This paper proposes a control method for the multi-agent pickup and deli...
research
07/02/2018

Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles

The problem of planning a set of paths for the coalition of robots (agen...
research
12/22/2022

Scalable Multi-Agent Reinforcement Learning for Warehouse Logistics with Robotic and Human Co-Workers

This project leverages advances in multi-agent reinforcement learning (M...

Please sign up or login with your details

Forgot password? Click here to reset