In Multi-Agent Pickup and Delivery (MAPD), a group of moving agents plan coordinated paths to execute pickup and delivery tasks appearing online in a known environment. The typical application of MAPD is in warehouses, where the agents are mobile robots powered by batteries. Current research on MAPD does not fully take into account the need for the agents to recharge their batteries when planning paths. In this paper, we study a variant of the MAPD problem, called MAPD-b, which considers battery consumption and charging stations, and we propose an algorithm to solve it.
Multi-Agent Pickup and Delivery with Batteries
Bavaro M.;Amigoni F.
2025-01-01
Abstract
In Multi-Agent Pickup and Delivery (MAPD), a group of moving agents plan coordinated paths to execute pickup and delivery tasks appearing online in a known environment. The typical application of MAPD is in warehouses, where the agents are mobile robots powered by batteries. Current research on MAPD does not fully take into account the need for the agents to recharge their batteries when planning paths. In this paper, we study a variant of the MAPD problem, called MAPD-b, which considers battery consumption and charging stations, and we propose an algorithm to solve it.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
p2428.pdf
Accesso riservato
:
Publisher’s version
Dimensione
861.15 kB
Formato
Adobe PDF
|
861.15 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
