I. Suzuki and M. Yamashita. Distributed Anonymous Mobile Robots - Formation and Agreement Problems. Proc. Third Colloq. on Struc. Information and Communication Complexity (SIROCCO), pages 313--330, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Hard Tasks for Weak Robots: The Role of Common.. - Flocchini.. (1999) (2 citations) (Correct)
....robots can or cannot do. An investigation with this flavor has been undertaken within the AI community by Durfee [2] who argues in favor of limiting the knowledge that an intelligent agent must possess in order to be able to coordinate its behavior with others. The work of Suzuki and Yamashita [7, 8, 9] is closest to our study (and, with this focus, a rarity in the mobile robots literature) it gives a nice and systematic account on the algorithmics of pattern formation for robots, under several assumptions on the power of the indivdual robot. The models that we use differ from those of [7, 8, ....
....[7, 8, 9] is closest to our study (and, with this focus, a rarity in the mobile robots literature) it gives a nice and systematic account on the algorithmics of pattern formation for robots, under several assumptions on the power of the indivdual robot. The models that we use differ from those of [7, 8, 9] in the fact that our robots are as weak as possible in every single aspect of their behavior. The reason is that we want to identify the role of the robots common knowledge of the world for performing a task. In contrast with [7, 8, 9] we do not assume that on a move, we know ahead of time the ....
[Article contains additional citation context not shown here]
I. Suzuki and M. Yamashita. Distributed Anonymous Mobile Robots - Formation and Agreement Problems. Proc. Third Colloq. on Struc. Information and Communication Complexity (SIROCCO), pages 313--330, 1996.
Pattern Formation by Autonomous Robots without Chirality - Flocchini, Prencipe.. (2001) (Correct)
....sweep the terrain in formation, etc. Pattern formation by a collection of such robots has been studied by researchers in robotics and in artificial intelligence (e.g. see [1, 3, 4] Concerns on computability and complexity of the problem have recently motivated also algorithmic investigations [2, 6, 7, 8]; the basic difference is that in [7, 8] any action by the robots, including moving, is instantaneous. In this paper, like in [2, 6] there is no such an assumption. The capacity to solve the pattern formation problem seems to depend not only to the robots (computing and motorial) capabilities ....
.... formation by a collection of such robots has been studied by researchers in robotics and in artificial intelligence (e.g. see [1, 3, 4] Concerns on computability and complexity of the problem have recently motivated also algorithmic investigations [2, 6, 7, 8] the basic difference is that in [7, 8], any action by the robots, including moving, is instantaneous. In this paper, like in [2, 6] there is no such an assumption. The capacity to solve the pattern formation problem seems to depend not only to the robots (computing and motorial) capabilities but also and especially on the level of ....
I. Suzuki and M. Yamashita. Distributed Anonymous Mobile Robots - Formation and Agreement Problems. In Proc. of SIROCCO, pages 313--330, 1996.
Fault Tolerant Coordination of Robot Teams - Coble, Cook (1998) (Correct)
No context found.
Suzuki, I. And Yamashita, M., Distributed Anonymous Mobile Robots---Formation and Agreement Problems, in the Proceedings of the 3rd International Colloquium on Structural Information and Communication Complexity (SIROCCO '96), Siena, Italy, June 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC