1.9k citations · 2k across the 8 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.AI2022★ 1 cited
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…
cs.AI2022
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…