On semantics of STRIPS By Vladimir Lifschitz Presented by Forrest Sheng Bao

advertisement
On semantics of STRIPS
By Vladimir Lifschitz
Presented by Forrest Sheng Bao
KR Seminar, Dept. of Computer Science, Texas Tech University
Oct. 7, 2011
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
1 / 16
Outline
1
Introduction to STRIPS
2
Semantics of STRIPS
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
2 / 16
The STRIPS
STRIPS: n. 1) An automated planner by Fikes and Nilsson in
1971 2)
The input language of the planner.
It operates on world models, represented by sets of formulas of
rst-order logic.
World model are changed by
KR Seminar (TTU)
operators.
On semantics of STRIPS
Oct. 7, 2011
3 / 16
The STRIPS
STRIPS: n. 1) An automated planner by Fikes and Nilsson in
1971 2)
The input language of the planner.
It operates on world models, represented by sets of formulas of
rst-order logic.
World model are changed by
KR Seminar (TTU)
operators.
On semantics of STRIPS
Oct. 7, 2011
3 / 16
The STRIPS
STRIPS: n. 1) An automated planner by Fikes and Nilsson in
1971 2)
The input language of the planner.
It operates on world models, represented by sets of formulas of
rst-order logic.
World model are changed by
KR Seminar (TTU)
operators.
On semantics of STRIPS
Oct. 7, 2011
3 / 16
Building blocks of STRIPS
Start with an arbitrary rst-order language
L.
world model is any set of sentences of L.
An operator description is a triple of sentences
A
I
I
I
of
L, hP , D , Ai
P : precondition
D : delete list
A: add list
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
4 / 16
Building blocks of STRIPS
Start with an arbitrary rst-order language
L.
world model is any set of sentences of L.
An operator description is a triple of sentences
A
I
I
I
of
L, hP , D , Ai
P : precondition
D : delete list
A: add list
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
4 / 16
Building blocks of STRIPS
Start with an arbitrary rst-order language
L.
world model is any set of sentences of L.
An operator description is a triple of sentences
A
I
I
I
of
L, hP , D , Ai
P : precondition
D : delete list
A: add list
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
4 / 16
STRIPS system
A STRIPS systemΣ consists of
an initial world model
a set
Op
M0
of symbols called operators
a family of operator descriptions
KR Seminar (TTU)
{Pα , Dα , Aα }α∈Op
On semantics of STRIPS
Oct. 7, 2011
5 / 16
STRIPS system
A STRIPS systemΣ consists of
an initial world model
a set
Op
M0
of symbols called operators
a family of operator descriptions
KR Seminar (TTU)
{Pα , Dα , Aα }α∈Op
On semantics of STRIPS
Oct. 7, 2011
5 / 16
STRIPS system
A STRIPS systemΣ consists of
an initial world model
a set
Op
M0
of symbols called operators
a family of operator descriptions
KR Seminar (TTU)
{Pα , Dα , Aα }α∈Op
On semantics of STRIPS
Oct. 7, 2011
5 / 16
An example
modied from original STRIPS paper
operator
pushto (X , Y ): robot pushes object X next to Y
Precondition:
pushable (X ) ∧ nextto (robot , X )
Delete list:
atrobot ($), nextto (robot , $), nextto ($, X ), at (X , $), nextto (X , $)
Add list:
nextto (X , Y ), nextto (Y , X ), nextto (robot , X )
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
6 / 16
An example
modied from original STRIPS paper
operator
pushto (X , Y ): robot pushes object X next to Y
Precondition:
pushable (X ) ∧ nextto (robot , X )
Delete list:
atrobot ($), nextto (robot , $), nextto ($, X ), at (X , $), nextto (X , $)
Add list:
nextto (X , Y ), nextto (Y , X ), nextto (robot , X )
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
6 / 16
An example
modied from original STRIPS paper
operator
pushto (X , Y ): robot pushes object X next to Y
Precondition:
pushable (X ) ∧ nextto (robot , X )
Delete list:
atrobot ($), nextto (robot , $), nextto ($, X ), at (X , $), nextto (X , $)
Add list:
nextto (X , Y ), nextto (Y , X ), nextto (robot , X )
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
6 / 16
Plans in STRIPS
For a STRIPS system
operators, denoted as
∀i ∈ 1..N .
Σ, a plan is any nite sequence of
ᾱ = (α1 , . . . , αN ) where αi ∈ Op ,
its
M0 , M1 , . . . , MN ,
Mi = (Mi −1 \Dαi ) ∪ Aαi ,
A plan denes a sequence of world models
M0 is
∀i ∈ 1..N .
where
ᾱ
the initial world model and
is accepted by the system if
We call
MN
KR Seminar (TTU)
Mi −1 ` Pαi , ∀i ∈ 1..N .
the result of executing
ᾱ
On semantics of STRIPS
and denote it as
R (ᾱ).
Oct. 7, 2011
7 / 16
Plans in STRIPS
For a STRIPS system
operators, denoted as
∀i ∈ 1..N .
Σ, a plan is any nite sequence of
ᾱ = (α1 , . . . , αN ) where αi ∈ Op ,
its
M0 , M1 , . . . , MN ,
Mi = (Mi −1 \Dαi ) ∪ Aαi ,
A plan denes a sequence of world models
M0 is
∀i ∈ 1..N .
where
ᾱ
the initial world model and
is accepted by the system if
We call
MN
KR Seminar (TTU)
Mi −1 ` Pαi , ∀i ∈ 1..N .
the result of executing
ᾱ
On semantics of STRIPS
and denote it as
R (ᾱ).
Oct. 7, 2011
7 / 16
Plans in STRIPS
For a STRIPS system
operators, denoted as
∀i ∈ 1..N .
Σ, a plan is any nite sequence of
ᾱ = (α1 , . . . , αN ) where αi ∈ Op ,
its
M0 , M1 , . . . , MN ,
Mi = (Mi −1 \Dαi ) ∪ Aαi ,
A plan denes a sequence of world models
M0 is
∀i ∈ 1..N .
where
ᾱ
the initial world model and
is accepted by the system if
We call
MN
KR Seminar (TTU)
Mi −1 ` Pαi , ∀i ∈ 1..N .
the result of executing
ᾱ
On semantics of STRIPS
and denote it as
R (ᾱ).
Oct. 7, 2011
7 / 16
Plans in STRIPS
For a STRIPS system
operators, denoted as
∀i ∈ 1..N .
Σ, a plan is any nite sequence of
ᾱ = (α1 , . . . , αN ) where αi ∈ Op ,
its
M0 , M1 , . . . , MN ,
Mi = (Mi −1 \Dαi ) ∪ Aαi ,
A plan denes a sequence of world models
M0 is
∀i ∈ 1..N .
where
ᾱ
the initial world model and
is accepted by the system if
We call
MN
KR Seminar (TTU)
Mi −1 ` Pαi , ∀i ∈ 1..N .
the result of executing
ᾱ
On semantics of STRIPS
and denote it as
R (ᾱ).
Oct. 7, 2011
7 / 16
Interpreted STRIPS system
The world described by language
L
at any instant is in a
state .
An action is a partial function from from states to states.
If
f (s )
is dened, we say that
is the result of action
f.
f
We assume that each operator
f
is
α
applicable
in state
s
and
f (s )
in STRIPS is associated with
an action α .
A STRIPS system along with the information above is called an
interpreted
STRIPS system.
ᾱ = (α1 , . . . , αN ) of an interpreted STRIPS
dene fᾱ to be the composite action fαN . . . fα1 .
For each plan
system, we
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
8 / 16
Interpreted STRIPS system
The world described by language
L
at any instant is in a
state .
An action is a partial function from from states to states.
If
f (s )
is dened, we say that
is the result of action
f.
f
We assume that each operator
f
is
α
applicable
in state
s
and
f (s )
in STRIPS is associated with
an action α .
A STRIPS system along with the information above is called an
interpreted
STRIPS system.
ᾱ = (α1 , . . . , αN ) of an interpreted STRIPS
dene fᾱ to be the composite action fαN . . . fα1 .
For each plan
system, we
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
8 / 16
Interpreted STRIPS system
The world described by language
L
at any instant is in a
state .
An action is a partial function from from states to states.
If
f (s )
is dened, we say that
is the result of action
f.
f
We assume that each operator
f
is
α
applicable
in state
s
and
f (s )
in STRIPS is associated with
an action α .
A STRIPS system along with the information above is called an
interpreted
STRIPS system.
ᾱ = (α1 , . . . , αN ) of an interpreted STRIPS
dene fᾱ to be the composite action fαN . . . fα1 .
For each plan
system, we
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
8 / 16
Interpreted STRIPS system
The world described by language
L
at any instant is in a
state .
An action is a partial function from from states to states.
If
f (s )
is dened, we say that
is the result of action
f.
f
We assume that each operator
f
is
α
applicable
in state
s
and
f (s )
in STRIPS is associated with
an action α .
A STRIPS system along with the information above is called an
interpreted
STRIPS system.
ᾱ = (α1 , . . . , αN ) of an interpreted STRIPS
dene fᾱ to be the composite action fαN . . . fα1 .
For each plan
system, we
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
8 / 16
Interpreted STRIPS system
The world described by language
L
at any instant is in a
state .
An action is a partial function from from states to states.
If
f (s )
is dened, we say that
is the result of action
f.
f
We assume that each operator
f
is
α
applicable
in state
s
and
f (s )
in STRIPS is associated with
an action α .
A STRIPS system along with the information above is called an
interpreted
STRIPS system.
ᾱ = (α1 , . . . , αN ) of an interpreted STRIPS
dene fᾱ to be the composite action fαN . . . fα1 .
For each plan
system, we
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
8 / 16
Interpreted STRIPS system
The world described by language
L
at any instant is in a
state .
An action is a partial function from from states to states.
If
f (s )
is dened, we say that
is the result of action
f.
f
We assume that each operator
f
is
α
applicable
in state
s
and
f (s )
in STRIPS is associated with
an action α .
A STRIPS system along with the information above is called an
interpreted
STRIPS system.
ᾱ = (α1 , . . . , αN ) of an interpreted STRIPS
dene fᾱ to be the composite action fαN . . . fα1 .
For each plan
system, we
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
8 / 16
Soundness
How sound is STRIPS in describing a world?
Denition A
(P , D , A) is sound relative
P is satised in s ,
state s ,
An operator description
for every state
f
s
is applicable in
every sentence that is satised in
satised in
A
Σ
f (s ),
is satised in
s
and does not belong to
M0 is satised in the initial state s0 ,
(Pα , Dα , Aα ) is sound relative to fα .
KR Seminar (TTU)
f
if,
D
is
f (s ).
is sound if
description
to an action
such that
On semantics of STRIPS
and each operator
Oct. 7, 2011
9 / 16
Soundness
How sound is STRIPS in describing a world?
Denition A
(P , D , A) is sound relative
P is satised in s ,
state s ,
An operator description
for every state
f
s
is applicable in
every sentence that is satised in
satised in
A
Σ
f (s ),
is satised in
s
and does not belong to
M0 is satised in the initial state s0 ,
(Pα , Dα , Aα ) is sound relative to fα .
KR Seminar (TTU)
f
if,
D
is
f (s ).
is sound if
description
to an action
such that
On semantics of STRIPS
and each operator
Oct. 7, 2011
9 / 16
Soundness
How sound is STRIPS in describing a world?
Denition A
(P , D , A) is sound relative
P is satised in s ,
state s ,
An operator description
for every state
f
s
is applicable in
every sentence that is satised in
satised in
A
Σ
f (s ),
is satised in
s
and does not belong to
M0 is satised in the initial state s0 ,
(Pα , Dα , Aα ) is sound relative to fα .
KR Seminar (TTU)
f
if,
D
is
f (s ).
is sound if
description
to an action
such that
On semantics of STRIPS
and each operator
Oct. 7, 2011
9 / 16
Soundness
How sound is STRIPS in describing a world?
Denition A
(P , D , A) is sound relative
P is satised in s ,
state s ,
An operator description
for every state
f
s
is applicable in
every sentence that is satised in
satised in
A
Σ
f (s ),
is satised in
s
and does not belong to
M0 is satised in the initial state s0 ,
(Pα , Dα , Aα ) is sound relative to fα .
KR Seminar (TTU)
f
if,
D
is
f (s ).
is sound if
description
to an action
such that
On semantics of STRIPS
and each operator
Oct. 7, 2011
9 / 16
Soundness
How sound is STRIPS in describing a world?
Denition A
(P , D , A) is sound relative
P is satised in s ,
state s ,
An operator description
for every state
f
s
is applicable in
every sentence that is satised in
satised in
A
Σ
f (s ),
is satised in
s
and does not belong to
M0 is satised in the initial state s0 ,
(Pα , Dα , Aα ) is sound relative to fα .
KR Seminar (TTU)
f
if,
D
is
f (s ).
is sound if
description
to an action
such that
On semantics of STRIPS
and each operator
Oct. 7, 2011
9 / 16
Soundness cond.
Is this semantics good?
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
10 / 16
Problems
Atoms in the delete list of
pushto (X , Y )
are obviously not the
only sentences that may become false after action execution.
Their conjunction or disjunction, e.g,
A ∧ F (A
atrobot ($) ∧ nextto (X , $),
or any sentence of the form
is an atom in delete list
and
is also a such sentence. By
F
is any sentence in
L)
denition A, the delete list will be innite.
Can we limit sentences in delete list as atoms only?
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
11 / 16
Problems
Atoms in the delete list of
pushto (X , Y )
are obviously not the
only sentences that may become false after action execution.
Their conjunction or disjunction, e.g,
A ∧ F (A
atrobot ($) ∧ nextto (X , $),
or any sentence of the form
is an atom in delete list
and
is also a such sentence. By
F
is any sentence in
L)
denition A, the delete list will be innite.
Can we limit sentences in delete list as atoms only?
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
11 / 16
Problems
Atoms in the delete list of
pushto (X , Y )
are obviously not the
only sentences that may become false after action execution.
Their conjunction or disjunction, e.g,
A ∧ F (A
atrobot ($) ∧ nextto (X , $),
or any sentence of the form
is an atom in delete list
and
is also a such sentence. By
F
is any sentence in
L)
denition A, the delete list will be innite.
Can we limit sentences in delete list as atoms only?
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
11 / 16
Non-atomic sentences in world model
Non-atomic sentences in world model will never be removed!
Thus, they have to be satised in all states.
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
12 / 16
Non-atomic sentences in world model
Non-atomic sentences in world model will never be removed!
Thus, they have to be satised in all states.
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
12 / 16
Second try on semantics
Denition B
(P , D , A) is sound relative to an action f if,
every state s such that P is satised in s ,
f is applicable in state s ,
every atomic sentence that is satised in s and does not belong
to D is satised in f (s ),
A is satised in f (s ) and every non-atomic sentence in A is
An operator description
for
satised in all states of the (future) world.
M0 is satised in the initial state s0 , each operator
description (Pα , Dα , Aα ) is sound relative to fα , and every
non-atomic sentence in M0 is satised in all states of the world.
Σ
is sound if
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
13 / 16
Second try on semantics
Denition B
(P , D , A) is sound relative to an action f if,
every state s such that P is satised in s ,
f is applicable in state s ,
every atomic sentence that is satised in s and does not belong
to D is satised in f (s ),
A is satised in f (s ) and every non-atomic sentence in A is
An operator description
for
satised in all states of the (future) world.
M0 is satised in the initial state s0 , each operator
description (Pα , Dα , Aα ) is sound relative to fα , and every
non-atomic sentence in M0 is satised in all states of the world.
Σ
is sound if
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
13 / 16
One more thing
The delete list of
nextto ($, robot ).
push(X , Y )
includes
nextto (robot , $)
but not
This is a trick carefully planned by the authors.
nextto ($, robot )
never appears in initial model or add list of any
operator.
We need to slightly modify Denition B.
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
14 / 16
One more thing
The delete list of
nextto ($, robot ).
push(X , Y )
includes
nextto (robot , $)
but not
This is a trick carefully planned by the authors.
nextto ($, robot )
never appears in initial model or add list of any
operator.
We need to slightly modify Denition B.
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
14 / 16
One more thing
The delete list of
nextto ($, robot ).
push(X , Y )
includes
nextto (robot , $)
but not
This is a trick carefully planned by the authors.
nextto ($, robot )
never appears in initial model or add list of any
operator.
We need to slightly modify Denition B.
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
14 / 16
One more thing
The delete list of
nextto ($, robot ).
push(X , Y )
includes
nextto (robot , $)
but not
This is a trick carefully planned by the authors.
nextto ($, robot )
never appears in initial model or add list of any
operator.
We need to slightly modify Denition B.
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
14 / 16
The general semantics of STRIPS
Suppose we have a special set
is called
essential.
E
of ground atoms. Formulas from
E
Denition C
(P , D , A) is sound relative to an action f if,
P is satised in s ,
f is applicable in state s ,
every essential sentence that is satised in s and does not belong
to D is satised in f (s ),
A is satised in f (s ) and every non-essential sentence in A is
An operator description
for every state
s
such that
satised in all states of the world.
M0 is satised in the initial state s0 , each operator
description (Pα , Dα , Aα ) is sound relative to fα , and every
non-essential sentence in M0 is satised in all states of the world.
Σ
is sound if
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
15 / 16
The general semantics of STRIPS
Suppose we have a special set
is called
essential.
E
of ground atoms. Formulas from
E
Denition C
(P , D , A) is sound relative to an action f if,
P is satised in s ,
f is applicable in state s ,
every essential sentence that is satised in s and does not belong
to D is satised in f (s ),
A is satised in f (s ) and every non-essential sentence in A is
An operator description
for every state
s
such that
satised in all states of the world.
M0 is satised in the initial state s0 , each operator
description (Pα , Dα , Aα ) is sound relative to fα , and every
non-essential sentence in M0 is satised in all states of the world.
Σ
is sound if
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
15 / 16
The general semantics of STRIPS
Suppose we have a special set
is called
essential.
E
of ground atoms. Formulas from
E
Denition C
(P , D , A) is sound relative to an action f if,
P is satised in s ,
f is applicable in state s ,
every essential sentence that is satised in s and does not belong
to D is satised in f (s ),
A is satised in f (s ) and every non-essential sentence in A is
An operator description
for every state
s
such that
satised in all states of the world.
M0 is satised in the initial state s0 , each operator
description (Pα , Dα , Aα ) is sound relative to fα , and every
non-essential sentence in M0 is satised in all states of the world.
Σ
is sound if
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
15 / 16
In memory of
KR Seminar (TTU)
On semantics of STRIPS
Oct. 7, 2011
16 / 16
Download