Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
How to learn an unknown environment. I: the rectilinear case
Journal of the ACM (JACM)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Computing on anonymous networks with sense of direction
Theoretical Computer Science
Mobile Agents: Basic Concepts, Mobility Models, and the Tracy Toolkit
Mobile Agents: Basic Concepts, Mobility Models, and the Tracy Toolkit
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Theory of Computing Systems
The power of team exploration: two robots can learn unlabeled directed graphs
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A bridge between the asynchronous message passing model and local computations in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Distributed exploration of an unknown graph
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Move-optimal gossiping among mobile agents
Theoretical Computer Science
Election and rendezvous with incomparable labels
Theoretical Computer Science
Mobile Agents Implementing Local Computations in Graphs
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A Distributed Computational Model for Mobile Agents
Agent Computing and Multi-Agent Systems
Mobile agent systems and cellular automata
Autonomous Agents and Multi-Agent Systems
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Rendezvous of mobile agents without agreement on local orientation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
How simple robots benefit from looking back
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
In this paper, we are interested in the computational power of a mobile agent system and, more particularly, in the comparison with a message passing system. First we give formal definitions. Then we explain how a mobile agent algorithm can be simulated by a message passing algorithm.We also prove that any message passing algorithm can be implemented by a mobile agent algorithm. As a consequence of this result, known characterisations of solvable tasks by message passing algorithms can be translated into characterisations of solvable tasks by mobile agent algorithms. We illustrate this result with the election problem.