Differences between revisions 2 and 16 (spanning 14 versions)
Revision 2 as of 2010-08-01 16:19:49
Size: 1533
Editor: MalteHelmert
Comment:
Revision 16 as of 2023-07-28 10:20:22
Size: 0
Editor: MalteHelmert
Comment: deleted because we have not kept this up to date for more than 10 years
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
Back to the HomePage.

= Who uses Fast Downward? =

The following list shows some of the uses that people have found for the Fast Downward and LAMA planners.

/!\ We have only just started collecting this list, so as of now it is '''very''' incomplete.

 * '''over-subscription planning (planning with soft goals)'''
 . Emil Keyder and Héctor Geffner describe a technique for compiling away soft goals (á la the IPC-2008
 net benefit track) and apply LAMA to the resulting problems. The LAMA-based planner performed drastically
 better than native over-subscription planners.
 . ''Reference:'' Keyder, E., & Geffner, H. (2009). Soft Goals Can Be Compiled Away. ''JAIR'', ''36'', 547-556

 * '''finite-state controller synthesis'''
 . Blai Bonet, Héctor Palacios and Héctor Geffner show how to solve control problems by compiling
 the problem of generating a memoryless or finite-state controller into a classical planning task.
 These classical planning tasks are then solved with LAMA or Satplan. (In their experiments, neither
 planner dominates the other.)
 . ''Reference:'' Bonet, B., Palacios, H., & Geffner, H. (2009). Automatic Derivation of Memoryless Policies
 and Finite-State Controllers Using Classical Planners. In ''Proc. ICAPS 2009'', pp. 34-41.

 * TODO: Jörg mentioned some security tool that uses FF and LAMA as "automated hacking tools"
 for finding attack vectors. More details needed.

 * TODO: Jörg and others use LAMA in an ECAI paper on cellular automata. More details needed.