Conference paper Open Access
Yakovlev, Konstantin;
Andreychuk, Anton;
Rybecký, Tomáš;
Kulich, Miroslav
{ "files": [ { "links": { "self": "https://zenodo.org/api/files/b11b7a41-debc-4dba-aec8-5d25661ce413/Yakovlev20icinco.pdf" }, "checksum": "md5:1e8c1014748892053e5e827c50dcd93d", "bucket": "b11b7a41-debc-4dba-aec8-5d25661ce413", "key": "Yakovlev20icinco.pdf", "type": "pdf", "size": 700532 } ], "owners": [ 113644 ], "doi": "10.5220/0009888905210528", "stats": { "version_unique_downloads": 50.0, "unique_views": 44.0, "views": 49.0, "version_views": 49.0, "unique_downloads": 50.0, "version_unique_views": 44.0, "volume": 35727132.0, "version_downloads": 51.0, "downloads": 51.0, "version_volume": 35727132.0 }, "links": { "doi": "https://doi.org/10.5220/0009888905210528", "latest_html": "https://zenodo.org/record/4432280", "bucket": "https://zenodo.org/api/files/b11b7a41-debc-4dba-aec8-5d25661ce413", "badge": "https://zenodo.org/badge/doi/10.5220/0009888905210528.svg", "html": "https://zenodo.org/record/4432280", "latest": "https://zenodo.org/api/records/4432280" }, "created": "2021-01-11T14:29:08.478235+00:00", "updated": "2021-01-12T00:52:07.137515+00:00", "conceptrecid": "4432279", "revision": 3, "id": 4432280, "metadata": { "access_right_category": "success", "doi": "10.5220/0009888905210528", "description": "<p>In this paper, we address the multi-agent pickup and delivery problem, a variant of multi-agent path finding.<br>\nSpecifically, we decouple the problem into two parts: task allocation and path planning. We employ the<br>\nany-angle safe-interval path planning algorithm introduced in our recent work and study the performance<br>\nof several task allocation strategies. Furthermore, the proposed approach has been integrated into a control<br>\nsystem to verify its feasibility in deployment on real robots. A key part of the system is a visual localization<br>\nsystem which is based on the detection of unique artificial markers placed in the working environment. The<br>\nconducted experiments show that generated plans can be safely executed on a real system.<br>\n </p>", "language": "eng", "title": " On the Application of Safe-Interval Path Planning to a Variant of the Pickup and Delivery Problem", "license": { "id": "CC-BY-4.0" }, "relations": { "version": [ { "count": 1, "index": 0, "parent": { "pid_type": "recid", "pid_value": "4432279" }, "is_last": true, "last_child": { "pid_type": "recid", "pid_value": "4432280" } } ] }, "grants": [ { "code": "688117", "links": { "self": "https://zenodo.org/api/grants/10.13039/501100000780::688117" }, "title": "Safe human-robot interaction in logistic applications for highly flexible warehouses", "acronym": "SafeLog", "program": "H2020", "funder": { "doi": "10.13039/501100000780", "acronyms": [], "name": "European Commission", "links": { "self": "https://zenodo.org/api/funders/10.13039/501100000780" } } } ], "communities": [ { "id": "safelog" } ], "publication_date": "2020-07-07", "creators": [ { "orcid": "0000-0002-4377-321X", "affiliation": "Institute of Systems Analysis of Russian Academy of Sciences, Russian Federation", "name": "Yakovlev, Konstantin" }, { "orcid": "0000-0001-5320-4603", "affiliation": "Federal Reseach Center for Computer Science and Control of Russian Academy of Sciences, Russia, Peoples' Friendship University of Russia (RUDN), Russia", "name": "Andreychuk, Anton" }, { "orcid": "0000-0002-5019-9260", "affiliation": "Czech Technical University in Prague, Czech Republic", "name": "Rybeck\u00fd, Tom\u00e1\u0161" }, { "orcid": "0000-0002-0997-5889", "affiliation": "Czech Technical University in Prague, Czech Republic", "name": "Kulich, Miroslav" } ], "access_right": "open", "resource_type": { "subtype": "conferencepaper", "type": "publication", "title": "Conference paper" } } }
Views | 49 |
Downloads | 51 |
Data volume | 35.7 MB |
Unique views | 44 |
Unique downloads | 50 |