Advertisement

Artificial Life and Robotics

, Volume 23, Issue 4, pp 564–570 | Cite as

Agreement algorithm using the trial and error method at the macrolevel

  • Nhuhai PhungEmail author
  • Masao Kubo
  • Hiroshi Sato
  • Saori Iwanaga
Original Article
  • 32 Downloads

Abstract

The best-of-n problem (Valentini et al. in Front Robot AI 4(9):1–18, 2017) is one of the decision-making problems in which many robots (agents) select the best option among a set of n alternatives and are focused on the field of Swarm Robotics. Almost all of the previous studies focused on binary decision-making scenarios (\(n = 2\)) and could not be applied without any change in the case of \(n> 2\). It is necessary to satisfy constraints on the number of robots N, or the time required for reaching the best option is abruptly increased. Therefore, it is required to construct a method that can deal with \(n> 2\). In this paper, we propose an algorithm (BRT model, bias and rising threshold model) in which the time and the possibility of reaching agreement are not dependent on the number of robots N even when \(n> 2\). By computer experiments, our claims are verified within the tested parameter ranges.

Keywords

Robotic swarm Agreement algorithm Trial and error The best-of-n problem 

References

  1. 1.
    Valentini G, Ferrante E, Dorigo M (2017) The best-of-n problem in robot swarms: formalization, state of the art, and novel perspectives. Front Robot AI 4(9):1–18Google Scholar
  2. 2.
    Reynolds CW (1987) Flocks, herds and schools: a distributed behavioral model. ACM SIGGRAPH Comput Graph 21(4):25–34CrossRefGoogle Scholar
  3. 3.
    Olfati-Saber R, Murray RM (2004) Consensus problems in networks of agents with switching topology and time-delays. IEEE Trans Autom Control 49(9):1520–1533MathSciNetCrossRefGoogle Scholar
  4. 4.
    Iwanaga S, Namatame A (2002) The complexity of collective decision. Nonlinear Dyn Psychol Life Sci 6(2):137–158CrossRefGoogle Scholar
  5. 5.
    Wessnitzer J, Melhuish C (2003) Collective decision-making and behaviour transitions in distributed ad hoc wireless networks of mobile robots: target-hunting. In: Banzhaf W, Ziegler J, Christaller T, Dittrich P, Kim JT (eds) Advances in artificial life, ECAL 2003, lecture notes in computer science, vol 2801. Springer, BerlinGoogle Scholar
  6. 6.
    Parker CAC, Zhang H (2009) Cooperative decision-making in decentralized multiple-robot systems: the best-of-n problem. IEEE/ASME Trans Mechatron 14:240–251.  https://doi.org/10.1109/TMECH.2009.2014370 CrossRefGoogle Scholar
  7. 7.
    Todd Peter M (1997) Searching for the next best mate, simulating social phenomena. Springer, Berlin, pp 419–436CrossRefGoogle Scholar
  8. 8.
    Phung NH, Kubo M, Sato H, Iwanaga S, Namatame A (2017) Agreement algorithm using the trial and error method at the macro level. In: Proceedings of SWARM 2017: the second international symposium on swarm behavior and bio-inspired robotics. pp 82–85Google Scholar
  9. 9.
    Namatame A (2001) Strategic decision making (In Japanese). Asakura Publisher, Tokyo, pp 119–149Google Scholar
  10. 10.
    Kubo M, Phung NH, Sato H, Namatame A (2015) Direction switch behavior to enclose a pack of targets based on phase transition. In: Proceedings of SWARM 2015: the first international symposium on swarm behavior and bio-inspired robotics. pp 295–298Google Scholar
  11. 11.
    Phung NH, Kubo M, Sato H, Iwanaga S, Namatame A (2015) Enclosing of target zone. In: Proceedings of SWARM 2015: the first international symposium on swarm behavior and bio-inspired roboticsGoogle Scholar

Copyright information

© ISAROB 2018

Authors and Affiliations

  • Nhuhai Phung
    • 1
    Email author
  • Masao Kubo
    • 1
  • Hiroshi Sato
    • 1
  • Saori Iwanaga
    • 2
  1. 1.Department of Computer ScienceNational Defense Academy of JapanYokosukaJapan
  2. 2.The Faculty of Maritime Safety TechnologyJapan Coast Guard AcademyHiroshimaJapan

Personalised recommendations