On the application of safe-interval path planning to a variant of the pickup and delivery problem

We address a variant of multi-agent pickup and delivery problem and decouple 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. Copyright © 2020 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.

Authors
Yakovlev K. 1, 2 , Andreychuk A. 1, 3 , Rybecký T.4 , Kulich M.4
Publisher
SciTePress
Language
English
Pages
521-528
Status
Published
Year
2020
Organizations
  • 1 Federal Reseach Center for Computer Science and Control of Russian Academy of Sciences, Russian Federation
  • 2 Moscow Institute of Physics and Technology, Russian Federation
  • 3 Peoples’ Friendship University of Russia (RUDN), Russian Federation
  • 4 Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University, Czech Republic
Keywords
Automated warehouses; Multi-agent path finding; Multi-robot systems; Safe-interval path planning
Share

Other records

Tartakovskiу I.S., Rachin S.A., Sinopal'nikov A.I., Rachina S.A., Yanovich Y.A., Hruleva Y.V., Bondar S.A.
Pulmonologiya. Medical Education. Vol. 30. 2020. P. 350-360