1995
DOI: 10.1016/0004-3702(94)00056-7
|View full text |Cite
|
Sign up to set email alerts
|

A situated view of representation and control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

1999
1999
2010
2010

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 125 publications
(29 citation statements)
references
References 4 publications
0
29
0
Order By: Relevance
“…Our approach has some similarities with the situated automata work of Rosenschein and Kaelbling (1995). Rosenschein and Kaelbling model an agent using two functions, a state update function, f , which maps the input (percepts) and the value of the agent's internal state at the last cycle into a new value of the internal state, and an output function, g, that maps the input and the value of the agent's internal state at the last cycle into the output (actions).…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Our approach has some similarities with the situated automata work of Rosenschein and Kaelbling (1995). Rosenschein and Kaelbling model an agent using two functions, a state update function, f , which maps the input (percepts) and the value of the agent's internal state at the last cycle into a new value of the internal state, and an output function, g, that maps the input and the value of the agent's internal state at the last cycle into the output (actions).…”
Section: Related Workmentioning
confidence: 99%
“…Following, for example Rosenschein and Kaelbling (1995), we assume that the agent's state consists of finitely many 'memory locations' l 1 ,. .…”
Section: The Agent-environment Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…The difference is rather like the distinction between interpreted and compiled programming languages. The best-known example of this work is the situated automata paradigm of Leslie Kaelbling and Stanley Rosenschein [48]. A review of the role of logic in intelligent agents may be found in [54].…”
Section: End Function Actionmentioning
confidence: 99%
“…-the agent network architecture developed by Pattie Maes [32,34,35]; -Nilsson's teleo reactive programs [40]; -Rosenchein and Kaelbling's situated automata approach, which is particularly interesting in that it shows how agents can be specified in an abstract, logical framework, and compiled into equivalent, but computationally very simple machines [47,28,27,48]; -Agre and Chapman's pengi system [1]; -Schoppers' universal plans -which are essentially decision trees that can be used to efficiently determine an appropriate action in any situation [52]; -Firby's reactive action packages [17].…”
Section: The Objective Is To Explore a Distant Planet More Concretelmentioning
confidence: 99%