Sayaka Kamei
ABSTRACT
The cooperation of swarming autonomous mobile robots has received significant interests in recent years. The common goal of research on it is to clarify the minimum capabilities for robots to achieve a given task. Thus, algorithms for mobile robots have been considered on a theoretical model with negative assumptions about each robot capabilities[4, 6]. Concerning the assumptions, each robot is identical (i.e., all robots run the same algorithm), anonymous (i.e., each robot has no IDs to distinguish two robots), oblivious (i.e., each robot has no memory to record past situation) and silent (i.e., each robot has no direct means of communication).
In the initial model described above, because of fundamentally weak capabilities, it is known that most tasks cannot be solved without some additional assumptions even if the model considers the unlimited visibility. However, we may not need to assume completely oblivious robots considering their implementations on real devices because persistent memory is widely available. Thus, recently, luminous robots have attracted attention in order to improve robot capability [1, 7]. A luminous robot maintains a non-volatile visible light, and emits the chosen light color among a set of colors to other robots. That is, a luminous robot uses the light to memorize its state and communicate with other robots. On the other hand, for the assumption of unlimited visibility of the initial model, each robot has a too strong observation device. Therefore, several recent studies focus on myopic robots to consider the implementation of the robot system [2, 3, 5]. A myopic robot has limited visibility, i.e., it can take a snapshot only within a certain fixed distance.
In this talk, we consider myopic robots with lights as a more realistic model and briefly show some recent results on the model.
- Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Masafumi Yamashita. 2016. Autonomous mobile robots with lights. Theor. Comput. Sci. 609(2016), 171–184.Google Scholar
Digital Library
- Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, and Franck Petit. 2013. Ring Exploration with Oblivious Myopic Robots. In SAFECOMP. 335–342.Google Scholar
- Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, and Franck Petit. 2015. Enabling Ring Exploration with Myopic Oblivious Robots. In IPDPS2015. 490–499.Google Scholar
- Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro (Eds.). 2019. Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Springer.Google Scholar
- Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, and Koichi Wada. 2020. Gathering on Rings for Myopic Asynchronous Robots With Lights. In OPODIS2019, Vol. 153. 27:1–27:17.Google Scholar
- Ichiro Suzuki and Masafumi Yamashita. 1999. Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput. 28, 4 (1999), 1347–1363.Google ScholarDigital Library
- Giovanni Viglietta. 2014. Rendezvous of Two Robots with Visible Bits. In ALGOSENSOR2013. 291–306.Google Scholar
Recommendations
Design and implementation of a navigation system for autonomous mobile robots
In this paper, a navigation system for autonomous mobile robots is proposed. Our navigation system is a hybrid of behaviour-based and model-based navigation systems. In our system, a behaviour-based subsystem is in charge of low-level reactive actions, ...
Swarms of Self-assembling Robots
Engineering Environment-Mediated Multi-Agent SystemsIn this talk I present recent research in swarm robotics, the discipline that studies robotic systems composed of swarms of robots tightly interacting and cooperating to reach their goals. In particular, I will present a new type of robot, called swarm-...
Autonomous mobile robots with lights
We consider the well known distributed setting of computational mobile entities, called robots, operating in the Euclidean plane in Look-Compute-Move (LCM) cycles. We investigate the computational impact of expanding the capabilities of the robots by ...
Comments