planning as satisfiability cse 473 sp 06. satplan cnf formula satisfying model plan mapping length...
TRANSCRIPT
![Page 1: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/1.jpg)
Planning as Satisfiability
cse 473 sp 06
![Page 2: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/2.jpg)
SATPLANSATPLAN
cnfformula
satisfyingmodelplan
mapping
length
STRIPSproblem
description
SATengine
encoder
interpreter
![Page 3: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/3.jpg)
Translating STRIPS
• Ground action = a STRIPS operator with constants assigned to all of its parameters
• Ground fluent = a precondition or effect of a ground action
operator: Fly(a,b)precondition: At(a), Fueledeffect: At(b), ~At(a), ~Fueled
constants: NY, Boston, SeattleGround actions: Fly(NY,Boston), Fly(NY,Seattle),
Fly(Boston,NY), Fly(Boston,Seattle), Fly(Seattle,NY), Fly(Seattle,Boston)
Ground fluents: Fueled, At(NY), At(Boston), At(Seattle)
![Page 4: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/4.jpg)
Translating STRIPS
• Ground action = a STRIPS operator with constants assigned to all of its parameters
• Ground fluent = a precondition or effect of a ground action
operator: Fly(a,b)precondition: At(a), Fueledeffect: At(b), ~At(a), ~Fueled
constants: NY, Boston, SeattleGround actions: Fly(NY,Boston), Fly(NY,Seattle),
Fly(Boston,NY), Fly(Boston,Seattle), Fly(Seattle,NY), Fly(Seattle,Boston)
Ground fluents: Fueled, At(NY), At(Boston), At(Seattle)
![Page 5: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/5.jpg)
Clause Schemas
• A large set of clauses can be represented by a schema
![Page 6: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/6.jpg)
SAT Encoding• Time is sequential and discrete
– Represented by integers– Actions occur instantaneously at a time point– Each fluent is true or false at each time point
• If an action occurs at time i, then its preconditions must hold at time i
• If an action occurs at time i, then its effects must hold at time i+1
• If a fluent changes its truth value from time i to time i+1, one of the actions with the new value as an effect must have occurred at time i
• Two conflicting actions cannot occur at the same time• The initial state holds at time 0, and the goals hold at a
given final state K
![Page 7: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/7.jpg)
SAT Encoding• If an action occurs at time i, then its preconditions must
hold at time i• If an action occurs at time i, then its effects must hold at
time i+1
(fly(a,b,i) at(a,i
for (1 i<K)
for (a {NY,B
))
(fly(a,b,i)
oston,Seattle})
for (b {NY,Boston,Seattl
fuel(i))
(fly(a,b,i) at(b,i+1))
(fly(a,b,i) f
e
u
} & a b
l
)
e (
i+1))
![Page 8: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/8.jpg)
SAT Encoding• If a fluent changes its truth value from time i to time i+1,
one of the actions with the new value as an effect must have occurred at time i
( at(b,i) at(b,i+1))
for (1 i<K)
for (b {NY,Bo
exists (a {NY,Boston,Sea
st
tt
on,Seattle}
le} & a b)
)
fly(a,b,i)
)
Like “for”, but connects propositions
with OR
![Page 9: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/9.jpg)
SAT Encoding• If a fluent changes its truth value from time i to time i+1,
one of the actions with the new value as an effect must have occurred at time i
( at(NY,i) at(NY,i+1))
fly(Boston,NY,i)
for (1 i<
fly(Seattle,NY,i)
K)
)
(at(NY,i) at(NY,i+1))
fly(Boston,NY,i)
for (1 i<
fly(Seattle,NY,i)
K)
)
![Page 10: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/10.jpg)
The IPC-4 Domains
• Airport: control the ground traffic [Hoffmann & Trüg] • Pipesworld: control oil product flow in a pipeline network
[Liporace & Hoffmann] • Promela: find deadlocks in communication protocols
[Edelkamp]• PSR: resupply lines in a faulty electricity network
[Thiebaux & Hoffmann]• Satellite & Settlers [Fox & Long], additional Satellite
versions with time windows for sending data [Hoffmann]• UMTS: set up applications for mobile terminals
[Edelkamp & Englert]
![Page 11: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/11.jpg)
The Competitors: Optimal planners
![Page 12: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/12.jpg)
PSR
![Page 13: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/13.jpg)
Dining Philosophers
![Page 14: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/14.jpg)
Airport
![Page 15: Planning as Satisfiability cse 473 sp 06. SATPLAN cnf formula satisfying model plan mapping length STRIPS problem description SAT engine encoder interpreter](https://reader036.vdocuments.mx/reader036/viewer/2022062713/56649cd95503460f949a32bb/html5/thumbnails/15.jpg)
Hosted atInternational Conference on Automated Planning
and Scheduling
Whistler, June 6, 2004Stefan Edelkamp Jörg Hoffmann
IPC-4 Co-Chairs Classical Part
Performance Award: 1st Prize, Optimal Track
Henry Kautz, David Roznyai, Farhad Teydaye-Saheli, Shane Neth and Michael Lindmark
“SATPLAN04”