Computer Science ›› 2021, Vol. 48 ›› Issue (6): 288-295.doi: 10.11896/jsjkx.201000137

• Computer Network • Previous Articles     Next Articles

Matrix Theory Aided Convergence Analysis of Consensus Behavior in FANET with Beacon Loss

HUANG Xin-quan, LIU Ai-jun, LIANG Xiao-hu, WANG Heng   

  1. Department of Space-based Information System,College of Communication Engineering,Army Engineering University,Nanjing 210007,China
  • Received:2020-10-25 Revised:2020-12-22 Online:2021-06-15 Published:2021-06-03
  • About author:HUANG Xin-quan,born in 1993,postgraduate.His main research interests include multi-agent systems and flying ad-hoc network.(huangxinquan1993@sina.com)
    LIU Ai-jun,born in 1970,professor.His main research interests include satellite communication system theory,signal processing,channel coding and information theory.
  • Supported by:
    National Natural Science Foundation of China(61671476, 61901516),Natural Science Foundation of Jiangsu Province of China(BK20180578) and China Postdoctoral Science Foundation(2019M651648).

Abstract: Flying Ad-Hoc Network(FANET) which is a field of wireless Ad-Hoc network formed by small unmanned aerial vehicles(UAVs),is critical in achieving UAV swarm system.Beacon mechanism in FANET plays the fundamental role in performing consensus behavior of UAV swarm.However,the wireless link failures of practical FANET will introduce beacon loss which will affect the convergence rate or convergence time,which describe how fast all UAV states reach the common value.To achieve optimal consensus behavior,it is important to know how beacon mechanism affects the consensus behavior.To solve above-mentioned problem,this paper has investigated the analytical relation between the convergence rate/time of consensus behavior and the beacon loss probability.In the analytical work,information flow topology at each period is modeled by random directed graph,and one indicator matrix weighted is designed to model the Laplacian matrix of the graph.Based on the knowledge of matrix theory and spectrum radius of a matrix,the analytical work in this paper firstly gives an analytical expression of expected consensus va-lue of the consensus process.Utilizing the expected consensus value,a novel quantification of convergence rate based on the expected final consensus value is provided.Different from existing analytical work,the convergence rate is quantified based on the expected consensus value,rather than to the average value of all states at each period.Finally,utilizing the knowledge of matrix theory and spectrum radius of a matrix,the proposed analytical work analyzes the relation between the convergence rate/time and the beacon loss probability.Simulation results show that,the proposed analytical model can accurately capture the convergence rate along with time in practical FANETs.Moreover,the proposed model can accurately capture the effect of average link failure probability on each link,initial state distribution and the number of UAVs on the convergence time.Moreover,compared with exis-ting analytical model,the proposed analytical model can capture the convergence performance in practical FANET more precisely.

Key words: Consensus control algorithm, Convergence rate, Convergence time, Flying Ad-Hoc Network, Random directed graph

CLC Number: 

  • TN927
[1]KURIKI Y,NAMERIKAWA T.Consensus-based cooperativeformation control with collision avoidance for a multi-UAV system[C]//Proc.American Control Conf.(ACC’14).2014:2077-2082.
[2]REN W,BEARD R W,ATKINS E M.Information consensus in multivehicle cooperative control[J].IEEE Control Systems Magazine,2007,27(2):71-82.
[3]XU W,DUAN F Y,ZHANG Q J,et al.A new fast consensus algorithm applied in rendezvous of multi-UAV[C]//Proc.Chinese Control and Decision Conf.(CCDC’15).2015:55-60.
[4]SEMNANI S H,BASIR O A.Semi-flocking algorithm for motion control of mobile sensors in large-scale surveillance systems[J].IEEE Transactions on Cybernetics,2015,45(1):129-137.
[5]GARIN F,SCHENATO L.A survey on distributed estimation and control applications using linear consensus algorithms[M].Networked Control Systems.Springer,2010:75-107.
[6]LIU Q,WANG Z,HE X,et al.On Kalman-consensus filtering with random link failures over sensor networks[J].IEEE Transactions on Automatic Control,2018,63(8):2701-2708.
[7]BEKMEZCI I,SAHINGOZ O K,TEMEL C.Flying ad-hoc networks(FANETs):A survey[J].Ad-Hoc Networks,2013,11(3):1254-1270.
[8]FAGNANI F,ZAMPIERI S.Average consensus with packetdrop communication[J].SIAM Journal on Control and Optimization,2009,48(1):102-133.
[9]ZHOU J,WANG Q.Characterizing convergence speed for consensus seeking over dynamically switching directed random networks[C]//Proc.American Control Conference.2009:629-634.
[10]HATANO Y,MESBAHI M.Agreement over random networks[J].IEEE Transactions on Automatic Control,2005,50(11):1867-1872.
[11]HALE M T,EGERSTEDT M.Convergence rate estimates for consensus over random graphs[C]//Proc.American Control Conf.(ACC’17),2017:1024-1029.
[12]PATTERSON S,BAMIEH B,EL ABBADI A.Convergencerates of distributed average consensus with stochastic link fai-lures[J].IEEE Transactions on Automatic Control,2010,55(4):880-892.
[13]SU L.On the Convergence Rate of Average Consensus and Distributed optimization over Unreliable Networks[C]//2018 52nd Asilomar Conference on Signals,Systems,and Computers.2018:43-47.
[14]SABER R O,MURRAY R M.Consensus protocols for networks of dynamic agents[C]//Proc.American Control Conference.2003:951-956.
[15]CHEN Y,QI D,ZHANG J,et al.Study on Distributed Dynamic Average Consensus Algorithm[C]//2019 7th International Conference on Information,Communication and Networks(ICICN).2019:225-229.
[16]YI J,CHAI L,ZHANG J.Average Consensus by Graph Filtering:New Approach,Explicit Convergence Rate,and Optimal Design[J].IEEE Transactions on Automatic Control,2020,65(1):191-206.
[17]ASADI M M,KHOSRAVI M,AGHDAM A G,et al.Expected Convergence Rate to Consensus in Asymmetric Networks:Analy-sis and Distributed Estimation[J].IEEE Transactions on Systems,Man,and Cybernetics:Systems,2020,50(3):972-987.
[18]DAS A,YI Y,PATTERSON S,et al.Convergence Rate of Consensus in a Network of Networks[C]//2018 IEEE Conference on Decision and Control(CDC).2018:459-465.
[19]DONG X,YU B,SHI Z,et al.Time-varying formation control for unmanned aerial vehicles:Theories and applications[J].IEEE Transactions on Control Systems Technology,2015,23(1):340-348.
[20]XIAO L,BOYD S,LALL S.A scheme for robust distributed sensor fusion based on average consensus[C]//Proc.Fourth International Symposium on Information Processing in Sensor Networks.2005:63-70.
[21]REN W,BEARD R W,ATKINS E M.A survey of consensus problems in multi-agent coordination[C]//Proc.American Control Conference.2005:1859-1864.
[22]XIAO L,BOYD S.Fast linear iterations for distributed averaging[J].Systems & Control Letters,2004,53(1):65-78.
[23]REN W,BEARD R W.Consensus seeking in multiagent systems under dynamically changing interaction topologies[J].IEEE Transactions on Automatic Control,2005,50(5):655-661.
[24]BHATIA R.Matrix analysis[M].Springer Science\& Business Media,2013.
[25]OLFATI-SABER R.Flocking for multi-agent dynamic systems:Algorithms and theory[J].IEEE Transactions on Automatic Control,2006,51(3):401-420.
[1] YANG Zhang-lin, XIE Jun, ZHANG Geng-qiang. Review of Directional Routing Protocols for Flying Ad-Hoc Networks Based on Directional Antennas [J]. Computer Science, 2021, 48(11): 334-344.
[2] CHEN Jin-yin, HU Ke-ke,LI Yu-wei. Research on UAV Multi-point Navigation Algorithm Based on MB-RRT* [J]. Computer Science, 2018, 45(6A): 85-90.
[3] JIN Jia-pei, CHEN Xiao-diao, SHI Jia-er and CHEN Li-geng. Reparameterization-based Clipping Method for Root-finding Problem of Non-linear Equations [J]. Computer Science, 2018, 45(3): 63-66.
[4] ZHANG Yue, SUN Hui-xiang, WEI Zheng-lei and HAN Bo. Chaotic Gray Wolf Optimization Algorithm with Adaptive Adjustment Strategy [J]. Computer Science, 2017, 44(Z11): 119-122.
[5] CHEN Jin-yin, LI Yu-wei and DU Wen-yao. UAV Navigation Algorithm Research Based on EB-RRT* [J]. Computer Science, 2017, 44(Z11): 72-79.
[6] HU Qiao-lin, ZHAO Guo-lin, LIU Jian-hao and SHI Zi-yan. iBGP and RCP Routing Protocol Convergence Time Analysis [J]. Computer Science, 2015, 42(Z6): 266-270.
[7] WANG Hao-guang and YU Shi-ming. Improved ITO Algorithm for Solving VRP [J]. Computer Science, 2015, 42(9): 253-256.
[8] CHEN Hai-ping,ZHANG Hang,LU Wei,YANG Liu and ZHOU Xuan. Adaptive Momentum Fast Blind Source Separation Algorithm for Time-varying Mixing System [J]. Computer Science, 2013, 40(Z11): 15-17.
[9] WANG De-yang,WANG Cong-yin,ZHUANG Lei and CHEN Hong-chang. Flow-based Asynchronous Averaging Consensus Protocol on Communication Network [J]. Computer Science, 2013, 40(7): 44-48.
[10] . Improved Quantum Optimal Control in Dynamic Control Field [J]. Computer Science, 2013, 40(1): 233-235.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!