Zobrazeno 1 - 4
of 4
pro vyhledávání: '"James Motes"'
Publikováno v:
IEEE Robotics and Automation Letters. 6:7001-7008
In this letter, we present the following optimal multi-agent pathfinding (MAPF) algorithms: Hierarchical Composition Conflict-Based Search, Parallel Hierarchical Composition Conflict-Based Search, and Dynamic Parallel Hierarchical Composition Conflic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a99473efe30af9e1fa1c93341ec81b7b
https://doi.org/10.1109/lra.2021.3096476
https://doi.org/10.1109/lra.2021.3096476
Publikováno v:
IEEE Robotics and Automation Letters. 5:3338-3345
We present a multi-robot integrated task and motion method capable of handling sequential subtask dependencies within multiply decomposable tasks. We map the multi-robot pathfinding method, Conflict Based Search, to task planning and integrate this w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f83ac8feea101682f1937c6e5348ca76
https://doi.org/10.1109/lra.2020.2976329
https://doi.org/10.1109/lra.2020.2976329
Publikováno v:
IEEE Robotics and Automation Letters. 4:2926-2933
This letter describes a framework for multi-robot problems that require or utilize interactions between robots. Solutions consider interactions on a motion planning level to determine the feasibility and cost of the multi-robot team solution. Modelin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd369725efdbc3c10ca2f61b7d126e07
https://doi.org/10.1109/lra.2019.2923386
https://doi.org/10.1109/lra.2019.2923386
Multi-Agent Motion Planning (MAMP) is the problem of computing feasible paths for a set of agents given individual start and goal states. Given the hardness of MAMP, most of the research related to multi-agent systems has focused on multi-agent pathf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4716bb9ab592175ca0a4623ff072cd0f
