geopro:pedro:situated
Diferenças
Aqui você vê as diferenças entre duas revisões dessa página.
Ambos lados da revisão anteriorRevisão anterior | |||
geopro:pedro:situated [2007/07/06 15:23] – pedro | geopro:pedro:situated [2007/07/31 01:57] (atual) – pedro | ||
---|---|---|---|
Linha 1: | Linha 1: | ||
======A Situated View of Representation and Control====== | ======A Situated View of Representation and Control====== | ||
- | |Rosenschein and Kaelbling, 1995| Artificial Intelligence| [[http:// | + | |Rosenschein and Kaelbling| 1995| Artificial Intelligence| [[http:// |
\\ | \\ | ||
+ | |||
+ | **Abstract: | ||
+ | dynamic and imperfectly predictable. Agents are typically difficult to program because the correctness of a program depend | ||
+ | on details of how the agent is situated in its environment. In this paper, we present a methodology for the design of | ||
+ | situated agents that is based on situated automata theory. This approach allows designers to describe the informational | ||
+ | content of an agent' | ||
+ | runtime symbolic processing. We start by outlining this situated view of representation, | ||
+ | design methodologies for building systems that track perceptual conditions and take purposeful actions in their environments. | ||
{{ http:// | {{ http:// | ||
+ | |||
+ | \\ | ||
Situated agents are very difficult to model because they have close interactions with the environment | Situated agents are very difficult to model because they have close interactions with the environment | ||
- | they belong. | + | they belong. The emphasis on an agent' |
- | of traditional theories of representation and control.// The methodology is based on the //situated automata | + | of traditional theories of representation and control. |
- | theory//. // | + | Knowledge |
- | // The important aspect of situated automata theory is modeling systems such that, for each | + | __Comment: |
+ | //The important aspect of situated automata theory is modeling systems such that, for each | ||
state of the environment E, there will be a corresponding state of the automaton M (by Carneiro).// | state of the environment E, there will be a corresponding state of the automaton M (by Carneiro).// | ||
I understood that a TerraME agent is situated because of the execution of the jump conditions until | I understood that a TerraME agent is situated because of the execution of the jump conditions until | ||
Linha 17: | Linha 29: | ||
the external world.// | the external world.// | ||
- | //We can construct arbitrarily complex machines from machines of two primitive types: pure functions and delay. | + | |
- | Pure functions consists | + | Let the environment be represented as a nondeterministic automaton <S, P, A, //init//, v, // |
- | Delay machines also consists | + | * S is a finite set of states |
- | that the input location had on the previous tick.// | + | * P is a finite set of outputs (there are usefully viewed |
+ | * A is a finite set of actions that the agent can generate as input to the environment; | ||
+ | * //init// is a set of states containing | ||
+ | * v is a relation | ||
+ | * //out// is a function mapping S to P | ||
+ | |||
+ | |||
+ | {{http:// | ||
geopro/pedro/situated.1183735431.txt.gz · Última modificação: 2007/07/06 15:23 por pedro