Automatic generation of optimally rigid formations using decentralized methods

Authors:
Rui Ren;Yu-Yan Zhang;Xiao-Yuan Luo;Shao-Bao Li
Affiliations:
Academy of Armored Forces Engineering, Beijing, PRC 100072;Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004;Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004;Institute of Electrical Engineering, Yanshan University, Qinhuangdao, PRC 066004
Venue:
International Journal of Automation and Computing
Year:
2010

Citing 4
Cited 1

Decentralized cooperative control of heterogeneous vehicle groups

Robotics and Autonomous Systems
Automatic generation of persistent formations for multi-agent networks under range constraints

Proceedings of the 1st international conference on Robot communication and coordination
An obstacle-avoidance technique for autonomous underwater vehicles based on BK-products of fuzzy relation

Fuzzy Sets and Systems
A Multiagent Swarming System for Distributed Automatic Target Recognition Using Unmanned Aerial Vehicles

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Topology control based on optimally rigid graph in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, decentralized methods of optimally rigid graphs generation for formation control are researched. The notion of optimally rigid graph is first defined in this paper to describe a special kind of rigid graphs. The optimally rigid graphs can be used to decrease the topology complexity of graphs while maintaining their shapes. To minimize the communication complexity of formations, we study the theory of optimally rigid formation generation. First, four important propositions are presented to demonstrate the feasibility of using a decentralized method to generate optimally rigid graphs. Then, a formation algorithm for multi-agent systems based on these propositions is proposed. At last, some simulation examples are given to show the efficiency of the proposed algorithm.