ℹ️
🇬🇧
Search
Search for publications relevant for "Multi-Agent Path Finding"
Multi-Agent Path Finding
Publication
Class
Person
Publication
Programmes
Export current view
publication
Multi-Agent Path Finding on Ozobots
2019 |
Faculty of Mathematics and Physics
publication
k-Robust Multi-Agent Path Finding
2017 |
Faculty of Mathematics and Physics
publication
Adversarial Multi-Agent Path Finding is Intractable
2021 |
Faculty of Mathematics and Physics
publication
Multi-Agent Path Finding on Biconnected Directed Graphs
2015 |
Faculty of Mathematics and Physics
publication
Multi-Agent Path Finding on Real Robots
+1
2019 |
Faculty of Mathematics and Physics
publication
Scheduling Models for Multi-Agent Path Finding
2017 |
Faculty of Mathematics and Physics
publication
On Modelling Multi-Agent Path Finding as a Classical Planning Problem
+1
2020 |
Faculty of Mathematics and Physics
publication
Contingent Planning for Robust Multi-Agent Path Finding
+1
2021 |
Faculty of Mathematics and Physics
publication
Robust Multi-Agent Path Finding and Executing
2020 |
Faculty of Mathematics and Physics
publication
Combining Strengths of Optimal Multi-Agent Path Finding Algorithms
2019 |
Faculty of Mathematics and Physics
publication
OzoMorph: Demonstrating Colored Multi-Agent Path Finding on Real Robots
2021 |
Faculty of Mathematics and Physics
publication
Variants of independence detection in SAT-based optimal multi-agent path finding
2017 |
Faculty of Mathematics and Physics
publication
On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective
2019 |
Faculty of Mathematics and Physics
publication
Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective
2016 |
Faculty of Mathematics and Physics
publication
Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Cost Objective
2016 |
Faculty of Mathematics and Physics
publication
An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives
2016 |
Faculty of Mathematics and Physics
publication
New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding
2017 |
Faculty of Mathematics and Physics
publication
Robust Multi-Agent Path Finding
2018 |
Faculty of Mathematics and Physics
publication
From Classical to Colored Multi-Agent Path Finding
2021 |
Faculty of Mathematics and Physics
publication
What Does Multi-agent Path-finding Tell Us About Intelligent Intersections
2020 |
Faculty of Mathematics and Physics
publication
Multi-agent path finding on real robots
2019 |
Faculty of Mathematics and Physics
publication
Robust multi-agent path finding
2018 |
Faculty of Mathematics and Physics
publication
Colored Multi-Agent Path Finding: Solving Approaches
2021 |
Faculty of Mathematics and Physics
publication
Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver
2017 |
Faculty of Mathematics and Physics
publication
Multi-agent Path Finding on Real Robots: First Experience with Ozobots
2018 |
Faculty of Mathematics and Physics
publication
A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs
2018 |
Faculty of Mathematics and Physics
publication
Routing and Scheduling in different ways: Abridged Preliminary Report
2023 |
Faculty of Mathematics and Physics