Solving Planning Problems with Fast Downward and Haskell
In this post I'll demonstrate my new
fast-downward library to solve planning problems. The name "Fast Downward" comes from the backend solver - Fast Downward. But what's a planning problem?
Roughly speaking, planning problems are a subclass of AI problems where we have:
- A known starting state - information about the world we know to be true right now.
- A set of possible effects - deterministic ways we can change the world.
- A goal state that we wish to reach.
- A solution to a planning problem is a plan - a totally ordered sequence of steps that converge the starting state into the goal state.