ℹ️
🇨🇿
Hledání
Hledat publikace relevantní k dotazu "MAPF"
MAPF
Publikace
Předměty
Osoby
Publikace
Studium
Exportovat aktuální pohled
publication
MAPF Scenario: Software for Evaluating MAPF Plans on Real Robots
2020 |
Matematicko-fyzikální fakulta
publication
Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver
2017 |
Matematicko-fyzikální fakulta
publication
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
2019 |
Matematicko-fyzikální fakulta
publication
Scheduling Models for Multi-Agent Path Finding
2017 |
Matematicko-fyzikální fakulta
publication
Robust Multi-Agent Path Finding and Executing
2020 |
Matematicko-fyzikální fakulta
publication
Online Multi-Agent Pathfinding
2019 |
Matematicko-fyzikální fakulta
publication
From Classical to Colored Multi-Agent Path Finding
2021 |
Matematicko-fyzikální fakulta
publication
An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives
2016 |
Matematicko-fyzikální fakulta
publication
Modeling and Solving the Multi-agent Pathfinding Problem in Picat
2017 |
Matematicko-fyzikální fakulta
publication
OzoMorph: Demonstrating Colored Multi-Agent Path Finding on Real Robots
2021 |
Matematicko-fyzikální fakulta
publication
Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding
2017 |
Matematicko-fyzikální fakulta
publication
Robust Multi-Agent Path Finding
2018 |
Matematicko-fyzikální fakulta
publication
Colored Multi-Agent Path Finding: Solving Approaches
2021 |
Matematicko-fyzikální fakulta
publication
Variants of independence detection in SAT-based optimal multi-agent path finding
2017 |
Matematicko-fyzikální fakulta
publication
k-Robust Multi-Agent Path Finding
2017 |
Matematicko-fyzikální fakulta
publication
Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Cost Objective
2016 |
Matematicko-fyzikální fakulta
publication
On Modelling Multi-Agent Path Finding as a Classical Planning Problem
2020 |
Matematicko-fyzikální fakulta
publication
A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs
2018 |
Matematicko-fyzikální fakulta
publication
Multi-agent Path Finding on Real Robots: First Experience with Ozobots
2018 |
Matematicko-fyzikální fakulta
publication
Multi-agent path finding on real robots
2019 |
Matematicko-fyzikální fakulta
publication
Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective
2016 |
Matematicko-fyzikální fakulta
publication
Combining Strengths of Optimal Multi-Agent Path Finding Algorithms
2019 |
Matematicko-fyzikální fakulta
publication
Tackling Train Routing via Multi-agent Pathfinding and Constraint-based Scheduling
2022 |
Matematicko-fyzikální fakulta
publication
On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective
2019 |
Matematicko-fyzikální fakulta
publication
Multi-Agent Path Finding on Real Robots
+1
2019 |
Matematicko-fyzikální fakulta
publication
New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding
2017 |
Matematicko-fyzikální fakulta
publication
Multi-Agent Path Finding on Ozobots
2019 |
Matematicko-fyzikální fakulta