26 search results - page 4 / 6 » Solving identification problem for asynchronous finite state... |
SIROCCO
2008
13 years 10 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
GECCO
2006
Springer
14 years 7 days ago
2006
Springer
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...
AAAI
1997
13 years 10 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
FORTE
1994
13 years 10 months ago
1994
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
In autonomous agent systems, memory is an important element to handle agent behaviors appropriately. We present the analysis of memory requirements for robotic tasks including wal...