Abstract
Flocking algorithms for multi-agent systems are distributed algorithms that generate complex formational movement despite having simple rules for each agent. These algorithms, known as swarmintelligence, are flexible and robust. However, to exploit these features to generate flexible behavior in an autonomous system, greater flexibility is needed. To achieve this, these algorithms are extended to enable arbitrary lattice formation. In addition, extended flocking algorithms can be assumed to be the aggregation of oscillators and observed the behavior of synchronization. It is difficult to explain the behavior of extended flocking algorithms as a consensus problem but, by assuming the flock as the set of oscillators, it can be explained as a synchronization phenomenon.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Advanced Computational Intelligence and Intelligent Informatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
