<s>
The	O
Stanford	B-Application
Research	I-Application
Institute	I-Application
Problem	I-Application
Solver	I-Application
,	O
known	O
by	O
its	O
acronym	O
STRIPS	O
,	O
is	O
an	O
automated	B-Application
planner	I-Application
developed	O
by	O
Richard	O
Fikes	O
and	O
Nils	O
Nilsson	O
in	O
1971	O
at	O
SRI	O
International	O
.	O
</s>
<s>
This	O
language	O
is	O
the	O
base	O
for	O
most	O
of	O
the	O
languages	O
for	O
expressing	O
automated	B-Application
planning	I-Application
problem	O
instances	O
in	O
use	O
today	O
;	O
such	O
languages	O
are	O
commonly	O
known	O
as	O
action	B-Application
languages	I-Application
.	O
</s>
<s>
The	O
above	O
language	O
is	O
actually	O
the	O
propositional	O
version	O
of	O
STRIPS	O
;	O
in	O
practice	O
,	O
conditions	O
are	O
often	O
about	O
objects	O
:	O
for	O
example	O
,	O
that	O
the	O
position	O
of	O
a	O
robot	O
can	O
be	O
modeled	O
by	O
a	O
predicate	B-Algorithm
,	O
and	O
means	O
that	O
the	O
robot	O
is	O
in	O
Room1	O
.	O
</s>
<s>
Identifying	O
new	O
macro	O
operators	O
for	O
a	O
domain	O
can	O
be	O
realized	O
with	O
genetic	B-Algorithm
programming	I-Algorithm
.	O
</s>
<s>
Similar	O
to	O
the	O
definition	O
within	O
AI	B-Application
planning	I-Application
,	O
the	O
idea	O
is	O
,	O
to	O
provide	O
a	O
temporal	O
abstraction	O
(	O
span	O
over	O
a	O
longer	O
period	O
)	O
and	O
to	O
modify	O
the	O
game	O
state	O
directly	O
on	O
a	O
higher	O
layer	O
.	O
</s>
