Publikace
- Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?2023 | Matematicko-fyzikální fakulta
- Multi-Agent Pathfnding with Predefned Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]2023 | Matematicko-fyzikální fakulta
- Coordinated Collision-free Movement of Groups of Agents2022 | Matematicko-fyzikální fakulta
- Reduction-based Solving of Multi-agent Pathfinding on Large Maps Using Graph Pruning2022 | Matematicko-fyzikální fakulta
- Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?2022 | Matematicko-fyzikální fakulta
- What Does Multi-agent Path-finding Tell Us About Intelligent Intersections2020 | Matematicko-fyzikální fakulta
- Combining Strengths of Optimal Multi-Agent Path Finding Algorithms2019 | Matematicko-fyzikální fakulta
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver2017 | Matematicko-fyzikální fakulta
- Variants of independence detection in SAT-based optimal multi-agent path finding2017 | Matematicko-fyzikální fakulta
- Routing and Scheduling in different ways: Abridged Preliminary Report2023 | Matematicko-fyzikální fakulta
Loading network view...