fast-downward-0.1.0.0: Solve classical planning problems (STRIPS/SAS+) using Haskell & Fast Downward.

Safe HaskellNone
LanguageHaskell2010

FastDownward.Examples.Gripper

Description

This module is an example of using fast-downward to solve a problem of transporting balls between rooms using a robot. See the source listing for this file for the full example, and see https://ocharles.org.uk/blog/posts/2018-12-25-fast-downward.html for a detailed walk through.

Documentation

data Room Source #

Constructors

RoomA 
RoomB 
Instances
Eq Room Source # 
Instance details

Defined in FastDownward.Examples.Gripper

Methods

(==) :: Room -> Room -> Bool #

(/=) :: Room -> Room -> Bool #

Ord Room Source # 
Instance details

Defined in FastDownward.Examples.Gripper

Methods

compare :: Room -> Room -> Ordering #

(<) :: Room -> Room -> Bool #

(<=) :: Room -> Room -> Bool #

(>) :: Room -> Room -> Bool #

(>=) :: Room -> Room -> Bool #

max :: Room -> Room -> Room #

min :: Room -> Room -> Room #

Show Room Source # 
Instance details

Defined in FastDownward.Examples.Gripper

Methods

showsPrec :: Int -> Room -> ShowS #

show :: Room -> String #

showList :: [Room] -> ShowS #

data Action Source #

Instances
Show Action Source # 
Instance details

Defined in FastDownward.Examples.Gripper

main :: IO () Source #