1.9k citations · 2.3k across the 9 of their papers we have counts for
6 papers · 1 filter
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
Joerg Hoffmann
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic h+…
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
Carlos Sarraute, Olivier Buffet, Joerg Hoffmann
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic…
Penetration Testing == POMDP Solving?
Carlos Sarraute, Olivier Buffet, Joerg Hoffmann
Penetration Testing is a methodology for assessing network security, by generating and executing possible attacks. Doing so automatically allows for regular and systematic testing…
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting
C. Domshlak, J. Hoffmann
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF…
The Metric-FF Planning System: Translating "Ignoring Delete Lists" to Numeric State Variables
J. Hoffmann
Planning with numeric state variables has been a challenge for many years, and was a part of the 3rd International Planning Competition (IPC-3). Currently one of the most popular a…
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…