1 code implementation • 10 Oct 2022 • 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.
1 code implementation • 17 Mar 2022 • Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova, Markus Krötzsch, Bernhard Nebel, Marcel Steinmetz
State constraints in AI Planning globally restrict the legal environment states.
no code implementations • 11 Nov 2019 • Bernhard Nebel
Further, recently it has been shown that a special case on directed graphs is solvable in polynomial time.
no code implementations • 20 Jul 2017 • Felix Burget, Lukas Dominique Josef Fiederer, Daniel Kuhner, Martin Völker, Johannes Aldinger, Robin Tibor Schirrmeister, Chau Do, Joschka Boedecker, Bernhard Nebel, Tonio Ball, Wolfram Burgard
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.
no code implementations • 7 Mar 2017 • Thorsten Engesser, Thomas Bolander, Robert Mattmüller, Bernhard Nebel
Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities.