Conference paper Open Access
Yakovlev, Konstantin;
Andreychuk, Anton;
Rybecký, Tomáš;
Kulich, Miroslav
In this paper, we address the multi-agent pickup and delivery problem, a variant of multi-agent path finding.
Specifically, we decouple the problem into two parts: task allocation and path planning. We employ the
any-angle safe-interval path planning algorithm introduced in our recent work and study the performance
of several task allocation strategies. Furthermore, the proposed approach has been integrated into a control
system to verify its feasibility in deployment on real robots. A key part of the system is a visual localization
system which is based on the detection of unique artificial markers placed in the working environment. The
conducted experiments show that generated plans can be safely executed on a real system.
Name | Size | |
---|---|---|
Yakovlev20icinco.pdf
md5:1e8c1014748892053e5e827c50dcd93d |
700.5 kB | Download |
Views | 48 |
Downloads | 51 |
Data volume | 35.7 MB |
Unique views | 43 |
Unique downloads | 50 |