Intro to AI STRIPS Planning & Applications in Video-games Lecture3-Part1

Stavros Vassos, University of Athens, Greece stavrosv@di.uoa.gr May 2012

INTRODUCTION TO AI
STRIPS PLANNING
.. and Applications to Video-games!

Course overview
2

 Lecture 1: Game-inspired competitions for AI research,
AI decision making for non-player characters in games
 Lecture 2: STRIPS planning, state-space search
 Lecture 3: Planning Domain Definition Language (PDDL),
using an award winning planner to solve Sokoban
 Lecture 4: Planning graphs, domain independent
heuristics for STRIPS planning
 Lecture 5: Employing STRIPS planning in games:
SimpleFPS, iThinkUnity3D, SmartWorkersRTS
 Lecture 6: Planning beyond STRIPS

STRIPS planning
3

 Given:
 Initial state

STRIPS planning
4

 Given:
 Initial state

 Goal

STRIPS planning
5

 Given:
 Initial state

 Goal

 Available actions

STRIPS planning
6

 Given:
 Initial state

 Goal


 Find:
A sequence of actions that achieves the goal
 E.g.: [Left, Down, Left, Up, …]

Planning Domain Description Language
7

 Planning Domain Definition Language (PDDL)
 Formal language for specifying planning problems
 Formal syntax similar to a programming language

 Includes STRIPS and ADL, and many more features

 Provides the ground for performing a direct comparison
between planning techniques and evaluating against
classes of problems

8

 Blocks world domain

 Initial state: s0 Α
Β
Α Β C C
 Goal: g
s0 g

 Available actions: moving a block
 from the table to the top of another block
 from the top of another block to the table
 from the top of one block to the top of another block

9

 Init( On(Α,Table)  On(Β,Table)  On(C,Table)
 Clear(Α)  Clear(Β)  Clear(C) )
 Goal( On(Α,Β)  On(Β,C) )
 Action( Move(b,x,y),
PRECONDITIONS: On(b,x)  Clear(b)  Clear(y)
EFFECTS: On(b,y)  Clear(x)  On(b,x)
 Clear(y) )
 Action( MoveToTable(b,x),
PRECONDITIONS: On(b,x)  Clear(b)
EFFECTS: On(b,Table)  Clear(x)  On(b,x) )

10

 Init( On(Α,Table)  On(Β,Table)  On(C,Table) …)
 (:init
 (:goal …)
 (:action …)
PRECONDITIONS: On(b,x)  Clear(b)(:action …)
  Clear(y)
 Clear(y) )
PRECONDITIONS: On(b,x)  Clear(b)

11

 Init( On(Α,Table)  On(Β,Table)  On(C,Table) …)
 (:init
 (:goal …)
 (:action …)
PRECONDITIONS: On(b,x)  Clear(b)(:action …)
  Clear(y)
 Clear(y) )
(:objects …)
PRECONDITIONS: On(b,x)  Clear(b)(:predicates …)


12

 (:init …)
 (:goal …)

 (:action …) DOMAIN
 (:action …)

PROBLEM
 (:objects …)
 (:predicates …)

13

 (:init …)
 (:goal …)

 (:action …)

PROBLEM
 (:objects …)

14

 (:init …)
 (:goal …)

 (:action …)

PROBLEM
 (:objects …)

15

 (:action …)

 (:objects …)
 (:init …) PROBLEM
 (:goal …)

16

 On(A,B)  (on a b)

 On(A,B)  (not (on a b))

 On(A,B)  On(B,C)  (and (on a b) (on b c))

 On(x,y)  (on ?x ?y)

The blocks world example in PDDL
17


 Available predicates (:predicates …)

 Available actions (:action …)

18


 Available predicates (:predicates
(on ?x ?y) (clear ?x)
)

19


 Available action (:action move
:parameters (?b ?x ?y)
:precondition (and
(on ?b ?x) (clear ?b)
(clear ?y))
:effect (…)
)

20


 Available action (:action move-to-table
:parameters (?b ?x)
:precondition (…)
:effect (…)
)

21

 Blocks world problem

 Available objects (:objects …)

 Initial state (:init …)

 Goal (:goal …)

22


 Available objects (:objects
a b c table
)

23


 Initial state (:init
(on a table) (clear a)
(on b table) (clear b)
Α Β Γ
(on c table) (clear c)
)

24


 Goal (:goal
Α
(and (on a b) (on b c) )
Β
Γ
)

25

blocks-domain.txt: blocks-problem1.txt:
(define (domain gripper) (define (problem gripper1)
(:requirements :strips) (:domain gripper)
(:predicates (on ?x ?y) (clear ?x)) (:objects a b c table)

(:action move (:init
:parameters (?b ?x ?y) (on a table) (on b table) (on c table)
:precondition (and (on ?b ?x) (clear ?b) (clear ?y)) (clear a) (clear b) (clear c)
:effect (and (not (on ?b ?x)) )
(not (clear ?y))
(on ?b ?y) (:goal (and (on a b) (on b c)))
(clear ?x))) )
…

Using PDDL planners
26

 International Planning Competition 1998 – today

 SAT Plan
 TL Plan Planning problems in
PDDL, e.g., Blocks
 FF world, Storage, Trucks,
…
 BlackBox

 SHOP2

 TALPlanner
Direct comparison between
… planning techniques! E.g.,
evaluation of heuristics, …

Using PDDL planners: Blocks world
27

 blackbox –o blocks-domain.txt –f blocks-problem1.txt

----------------------------------------------------
Begin plan
Α Β C
1 (move b table c)
2 (move a table b)
End plan
---------------------------------------------------- Α
Β
C

Using PDDL planners: Blocks world
28

 blackbox –o blocks-domain.txt –f blocks-problem2.txt
----------------------------------------------------
Begin plan G
1 (move e b d) D E F
2 (move b table e) Α Β C
3 (move g f table)
4 (move f c g)
5 (move b e c) Α
6 (move e d f) Β
7 (move d a e) C
8 (move b c a) D
E
9 (move c table d)
F
10 (move b a c)
G
11 (move a table b)
End plan

Using PDDL planners
29

 We can use blackbox (or any other off-the-self PDDL
planner) for any problem we can write in PDDL!

Using PDDL planners: Sokoban
30

 We can use blackbox (or any other off-the-self PDDL
planner) for any problem we can write in PDDL!

 Let’s do this for Sokoban

31

 Available predicates

 Available objects
 Initial state

 Goal

32


33

 (robot-at ?loc)
 (object-at ?b ?loc)

34

 (robot-at ?loc)
 (object-at ?b ?loc) c4-4 c5-4 c6-4

c1-3 c2-3 c3-3 c4-3 c5-3 c6-3
 Available objects c1-2 c2-2 c3-2 c4-2 c5-2
 c1-1,c1-2, c2-1, …
c1-1 c2-1
 box1, box2

35

 Initial state
 (robot-at c5-4)
 (object-at box1 c3-3) c4-4 c6-4

 (object-at box2 c4-3) c1-3 c2-3 c5-3 c6-3

c1-2 c2-2 c3-2 c4-2 c5-2

c1-1 c2-1

36

 move(?from ?to ?dir)

:precondition (

)

37


:precondition (and
(robot-at ?from)
(adjacent ?from ?to ?dir)
(empty ?to)
)

38


:effect (and

)

39


:effect (and
(empty ?from)
(robot-at ?to)
(not (empty ?to))
(not (robot-at ?from))
)

40

 (robot-at ?loc)
 (object-at ?b ?loc)
 (adjacent ?from ?to ?dir)
 (empty ?to)

41

 Initial state
 (robot-at c5-4)
 (object-at box1 c3-3)
 (object-at box2 c4-3) c2-3

c1-2 c2-2 c3-2
 (empty c1-1)
c2-1
 (empty c2-1)
 (empty c1-2)
 (empty c2-2)
…

42

 Initial state
 (robot-at c5-4)
 (object-at box2 c4-3) c2-3

c1-2 c2-2 c3-2
 (adjacent c2-2 c3-2 right)
c2-1
 (adjacent c2-2 c1-2 left)
 (adjacent c2-2 c2-3 up)
 (adjacent c2-2 c2-1 down)
…

43

 push(?rloc ?bloc ?floc ?dir ?b)

44


:precondition (and
(robot-at ?rloc)
(object-at ?b ?bloc)
(adjacent ?rloc ?bloc ?dir)
(adjacent ?bloc ?floc ?dir)
(empty ?floc)
)

45


:effect (and
(robot-at ?bloc)
(object-at ?b ?floc)
(empty ?rloc)
(not (robot-at ?rloc))
(not (object-at ?b ?bloc))
(not (empty ?floc))
)

46

 Goal
 (object-at box2 c5-3) c4-4 c6-4

c1-3 c2-3 c6-3

c1-2 c2-2 c3-2 c4-2 c5-2

c1-1 c2-1

47

 blackbox –o sokoban-domain.txt –f sokoban-problem.txt
----------------------------------------------------
Begin plan
1 (push c4-4 c4-3 c4-2 down box1)
2 (push c4-3 c3-3 c2-3 left box2)
3 (move c3-3 c3-2 down)
4 (move c3-2 c2-2 left)
…
28 (move c1-2 c1-3 up)
29 (push c1-3 c2-3 c3-3 right box1)
30 (push c2-3 c3-3 c4-3 right box1)
End plan
----------------------------------------------------

Using PDDL planners: SimpleGame
48

 SimpleGame domain

 turn(?fromd ?tod)
 move(?froml ?tol
?dir)
 pickup(?o ?l)
 stab(?l ?knife)
 shoot(?locn ?locp
?dir ?gun )

Building your own PDDL planner
49

 Pyperplan
 Lightweight STRIPS planner written in Python. Developed during
the planning course at Albert-Ludwigs-Universität Freiburg
2010/2011, GNU General Public License 3
 https://bitbucket.org/malte/pyperplan
 Source code of academic planners
 BlackBox:
http://www.cs.rochester.edu/u/kautz/satplan/blackbox/
 FastForward: http://www.loria.fr/~hoffmanj/ff.html
 FastDownward: http://www.fast-downward.org/
 ANTLR Parser Generator
 http://www.antlr.org/
 http://www.antlr.org/grammar/1222962012944/Pddl.g

50

 Quick overview of the provided PROLOG code
 Good for quick prototyping ;-)

51

 Quick overview of the provided PROLOG code
 Works with SWI Prolog 6.x (tested with 6.0.2)
 Predicates provided
 parsePDDL(+DomainFile, +ProblemFile)
 get_init(-InitialState)

 get_goal(-Goal)

 satisfies_goal(+State)

 progress(+State, -Action, -NextState)
 h(+State, -Value)
 {dfs,astar}planner(+DomainFile, +ProblemFile)

52

 International Planning Competition 1998 – today

 SAT Plan
 TL Plan

 FF Sokoban
 BlackBox

 SHOP2

 TALPlanner
Direct comparison between
… planning techniques! E.g.,
evaluation of heuristics, …

Using PDDL planners
53

 FastDownward [Helmert 2006]
 Introduced a new type of heuristic that is not based on
an empty list of negative actions
 Efficient implementation of all notable forward search
methods and heuristics (including the more recent ones)
 Requires a number of preprocessing steps that
transforms the STRIPS planning problem…

Using PDDL planners
54

 Introduced a new type of heuristic that is not based on
an empty list of negative actions
 Efficient implementation of all notable forward search
methods and heuristics (including the more recent ones)
 Requires a number of preprocessing steps that
transforms the STRIPS planning problem…

 Can be used as a framework to evaluate forward
search planning methods

Using PDDL planners
55

 translate/translate.py sokoban-domain.txt
sokoban.problem.txt
 preprocess/preprocess < output.sas

 search/downward --search SearchConfiguration < output

 http://www.fast-downward.org

56

 search/downward --search "astar(blind())" <output

57

 search/downward --search "astar(goalcount())"

58

 search/downward --search "astar(hmax())" <output

59

 search/downward --search "astar(add())" <output

60

 search/downward --search "lazy_greedy(ff())" <output

61

 Notice that the planner does not know anything
about the planning problem we are solving
 The heuristics we tried are domain independent
 goal count
 hmax

 hadd

 FF

 We will see how each one works in Lecture 4 (after
we first go over planning graphs that are needed)

Next lecture
62

 Lecture 1: Game-inspired competitions for AI research,
AI decision making for non-player characters in games
 Lecture 2: STRIPS planning, state-space search
 Lecture 3: Planning Domain Definition Language (PDDL),
using an award winning planner to solve Sokoban
 Lecture 4: Planning graphs, domain independent
heuristics for STRIPS planning
 Lecture 5: Employing STRIPS planning in games:
SimpleFPS, iThinkUnity3D, SmartWorkersRTS
 Lecture 6: Planning beyond STRIPS

Bibliography
63

 Material
 Artificial Intelligence: A Modern Approach 2nd Ed. Stuart Russell, Peter
Norvig. Prentice Hall, 2003 Section 11.4

 References
 PDDL - The Planning Domain Definition Language. Drew McDermott,
Malik Ghallab, Adele Howe, Craig Knoblock, Ashwin Ram, Manuela
Veloso, Daniel Weld, David Wilkins. Technical report, Yale Center for
Computational Vision and Control, TR-98-003, 1998.
 Unifying SAT-Based and Graph-Based Planning. Henry Kautz, Bart
Selman. In Proceedings of the International Joint Conference on
Artificial Intelligence (IJCAI), 1999
 The Fast Downward Planning System. Malte Helmert. Artificial
Intelligence Research (JAIR), Vol. 26, 2006

Intro to AI STRIPS Planning & Applications in Video-games Lecture3-Part1

More Related Content

What's hot (20)

Similar to Intro to AI STRIPS Planning & Applications in Video-games Lecture3-Part1 (20)

More from Stavros Vassos (8)

Recently uploaded (20)

Intro to AI STRIPS Planning & Applications in Video-games Lecture3-Part1