Multirobot tree and graph exploration
In this paper, we present an algorithm for the exploration of an unknown graph by multiple
robots, which is never worse than depth-first search with a single robot. On trees, we prove …
robots, which is never worse than depth-first search with a single robot. On trees, we prove …
Decision-Theoretic Approaches for Robotic Environmental Monitoring--A Survey
Robotics has dramatically increased our ability to gather data about our environments. This
is an opportune time for the robotics and algorithms community to come together to …
is an opportune time for the robotics and algorithms community to come together to …
[图书][B] The mobile agent rendezvous problem in the ring
E Kranakis, D Krizanc, E Marcou - 2022 - books.google.com
Mobile agent computing is being used in fields as diverse as artificial intelligence,
computational economics and robotics. Agents' ability to adapt dynamically and execute …
computational economics and robotics. Agents' ability to adapt dynamically and execute …
Computing without communicating: Ring exploration by asynchronous oblivious robots
We consider the problem of exploring an anonymous unoriented ring by a team of k
identical, oblivious, asynchronous mobile robots that can view the environment but cannot …
identical, oblivious, asynchronous mobile robots that can view the environment but cannot …
A Survey of Decision-Theoretic Approaches for Robotic Environmental Monitoring
Robotics has dramatically increased our ability to gather data about our environments,
creating an opportunity for the robotics and algorithms communities to collaborate on novel …
creating an opportunity for the robotics and algorithms communities to collaborate on novel …
Distributed exploration of dynamic rings
In the graph exploration problem, a team of mobile computational entities, called agents,
arbitrarily positioned at some nodes of a graph, must cooperate so that each node is …
arbitrarily positioned at some nodes of a graph, must cooperate so that each node is …
Graph explorations with mobile agents
S Das - Distributed Computing by Mobile Entities: Current …, 2019 - Springer
The basic primitive for a mobile agent is the ability to visit all the nodes of the graph in a
systematic manner. This chapter considers the exploration of unknown graphs in full detail …
systematic manner. This chapter considers the exploration of unknown graphs in full detail …
Recognition and reconfiguration of lattice-based cellular structures by simple robots
We consider recognition and reconfiguration of lattice-based cellular structures by very
simple robots with only basic functionality. The underlying motivation is the construction and …
simple robots with only basic functionality. The underlying motivation is the construction and …
Moving and computing models: Robots
P Flocchini, G Prencipe, N Santoro - Distributed Computing by Mobile …, 2019 - Springer
Moving and Computing Models: Robots | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
[PDF][PDF] Mobile agents in distributed computing: Network exploration
S Das - Bulletin of EATCS, 2013 - eatcs.org
One of the recent paradigms in networked distributed computing is the use of mobile agents.
Mobile agents are software robots that can autonomously migrate from node to node within …
Mobile agents are software robots that can autonomously migrate from node to node within …