639 search results - page 2 / 128 » A Finite State Mobile Agent Computation Model |
DALT
2005
Springer
13 years 10 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
AAAI
2008
13 years 7 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
DAM
2008
13 years 5 months ago
2008
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
TCIAIG
2010
12 years 11 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
FASE
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. A Sentient Computing environment is one in which the system is able to perceive the state of the physical world and use this information to customise its behaviour. Mobil...