A Fast Formation Flocking Scheme for a Group of Interactive Distributed Mobile Nodes in Autonomous Networks

Authors:
Naixue Xiong;Yan Zhang;Laurence T. Yang;Sang-Soo Yeo;Lei Shu;Fan Yang
Affiliations:
Depa. of Computer Science, Georgia State University, Atlanta, USA;Simula Research Laboratory, Fornebu, Norway;Depa. of Computer Science, St. Francis Xavier University, Antigonish, Canada;Mokwon University, Daejeon, Korea;Digital Enterprise Research Institute, National University of Ireland, Galway, Ireland;School of Information, Zhongnan University of Economics and Law, Wuhan, China
Venue:
Mobile Networks and Applications
Year:
2010

Citing 6
Cited 0

Toward a robot architecture integrating cooperation between mobile robots: application to indoor environment

International Journal of Robotics Research
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

SIAM Journal on Computing
Robotics: Introduction, Programming, and Projects

Robotics: Introduction, Programming, and Projects
From Natural to Artificial Swarm Intelligence

From Natural to Artificial Swarm Intelligence
Flocking by a Set of Autonomous Mobile Robots

Flocking by a Set of Autonomous Mobile Robots
Coordination without communication: the case of the flocking problem

Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ubi-Com promises to provide a diversity of services at anytime and anyplace. The mobile nodes are envisioned to cooperate freely and move on a plane with the help of the efficient control and distributed coordination strategies. To achieve this goal, mobile nodes group communications in Ubi-Com is becoming increasing important and challenging. In this paper, we focus on the formation flocking in a group of autonomous mobile nodes. In the scenario, there are two kinds of nodes: the leader node and the follower nodes. The follower nodes are required to follow the leader node wherever it goes (following), while keeping a particular formation they are given in input (flocking). A novel scheme is proposed on the basis of the relative motion theory. Extensive theoretical analysis and simulation results have demonstrated that this scheme provides the follower nodes an efficient and timely method to follow the leader with the shortest path and the shortest time. In addition, the reported scheme is scalable in the sense that the processing load in each node is not increasing with more nodes in a group.