1.9k citations · 2k across the 8 of their papers we have counts for
7 papers · 1 filter
The Small Solution Hypothesis for MAPF on Strongly Connected Directed Graphs Is True
Bernhard Nebel
The determination of the computational complexity of multi-agent pathfinding on directed graphs (diMAPF) has been an open research problem for many years. While diMAPF has been sho…
Expressivity of Planning with Horn Description Logic Ontologies (Technical Report)
Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova +3
State constraints in AI Planning globally restrict the legal environment states. Standard planning languages make closed-domain and closed-world assumptions. Here we address open-w…
On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs
Bernhard Nebel
The determination of the computational complexity of multi-agent pathfinding on directed graphs has been an open problem for many years. For undirected graphs, solvability can be d…
Acting Thoughts: Towards a Mobile Robotic Service Assistant for Users with Limited Communication Skills
Felix Burget, Lukas Dominique Josef Fiederer, Daniel Kuhner +8
As autonomous service robots become more affordable and thus available also for the general public, there is a growing need for user friendly interfaces to control the robotic syst…
Cooperative Epistemic Multi-Agent Planning for Implicit Coordination
Thorsten Engesser, Thomas Bolander, Robert Mattmüller +1
Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities. Recently, Dynamic Epistemic Logic (DEL) has been shown to…
The FF Planning System: Fast Plan Generation Through Heuristic Search
J. Hoffmann, B. Nebel
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that es…