Search Results for author:
Found 5 papers, 2 papers with code
The Small Solution Hypothesis for MAPF on Strongly Connected Directed Graphs Is True
The determination of the computational complexity of multi-agent pathfinding on directed graphs (diMAPF) has been an open research problem for many years.
Expressivity of Planning with Horn Description Logic Ontologies (Technical Report)
State constraints in AI Planning globally restrict the legal environment states.
On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs
Further, recently it has been shown that a special case on directed graphs is solvable in polynomial time.
Acting Thoughts: Towards a Mobile Robotic Service Assistant for Users with Limited Communication Skills
As our results demonstrate, our system is capable of adapting to frequent changes in the environment and reliably completing given tasks within a reasonable amount of time.
Cooperative Epistemic Multi-Agent Planning for Implicit Coordination
Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities.
