Sciweavers

1220 search results - page 138 / 244
» Untraceability of mobile agents
Sort
View
DAM
2008
69views more  DAM 2008»
15 years 6 months ago
Impact of memory size on graph exploration capability
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...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
CDC
2010
IEEE
15 years 1 months ago
A Switching strategy for robust cooperative exploration
Abstract-- This paper develops a switching strategy for networked mobile sensing agents to automatically decide when to perform individual exploration and when to perform cooperati...
Wencen Wu, Fumin Zhang
AI
2011
Springer
15 years 1 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
AAAI
1996
15 years 7 months ago
Noise and the Common Sense Informatic Situation for a Mobile Robot
Any model of the world a robot constructs on the basis of its sensor data is necessarily both incomplete, due to the robot's limited window on the world, and uncertain, due t...
Murray Shanahan
JAIR
1998
195views more  JAIR 1998»
15 years 6 months ago
AntNet: Distributed Stigmergetic Control for Communications Networks
This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in communications networks. AntNet is a distributed, mobile agents based Monte Carlo syst...
Gianni Di Caro, Marco Dorigo