Volume 2, Issue 3, December 2015, Pages 157 - 161
Probability of mixing up the nearest neighbor robot under target enclosure by robot swarm
Authors
Masao Kubo, Hiroshi Sato, Akihiro Yamaguchi, Eugene Kitamura, Akira Namatame
Corresponding Author
Masao Kubo
Available Online 1 December 2015.
- DOI
- 10.2991/jrnal.2015.2.3.5How to use a DOI?
- Keywords
- target enclosure, swarm robotics, low cost robot design, collective intelligence
- Abstract
This paper analyzes conditions in which a robotic swarm with a simplest communication device can succeed to enclose a target. The robots have to know directions to their each nearest neighbors. Each robot has a same signal emitter like a torch and they can observe the sum of the intensity of their torches. We analyze the probability to the mistake of the direction when a robot adopts the direction of the strongest intensity of the signal as the direction of the nearest neighbor because we expect this approach makes the robot swarm more simple and scalable. The computer simulations show the case of the success.
- Copyright
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - JOUR AU - Masao Kubo AU - Hiroshi Sato AU - Akihiro Yamaguchi AU - Eugene Kitamura AU - Akira Namatame PY - 2015 DA - 2015/12/01 TI - Probability of mixing up the nearest neighbor robot under target enclosure by robot swarm JO - Journal of Robotics, Networking and Artificial Life SP - 157 EP - 161 VL - 2 IS - 3 SN - 2352-6386 UR - https://doi.org/10.2991/jrnal.2015.2.3.5 DO - 10.2991/jrnal.2015.2.3.5 ID - Kubo2015 ER -