DocumentCode
1665957
Title
Average consensus with arbitrarily coarse logarithmic quantizers
Author
Shuai Liu ; Lihua Xie
Author_Institution
SinBerBEST Program, Berkeley Educ. Alliance for Res. in Singapore, Singapore, Singapore
fYear
2012
Firstpage
1681
Lastpage
1685
Abstract
This paper considers the average consensus problem for multi-agent systems with continuous-time first-order dynamics. The communication channels among the agents are constrained in which the exchanged information is quantized. In this paper, logarithmic quantization is considered in the communication channels, and sampled-data based protocol is applied. It is shown that as long as the sampling interval is small enough, the consensus protocol is admissible under arbitrarily coarse quantization. To be specific, the consensus error is uniformly bounded and is proportional to the quantization error and averaged initial value. Numerical examples are given to demonstrate the effectiveness of the protocol.
Keywords
continuous time systems; directed graphs; matrix algebra; multi-robot systems; quantisation (signal); signal sampling; telecommunication channels; Laplacian matrix; agent communication channel; arbitrarily coarse logarithmic quantizer; arbitrarily coarse quantization; average consensus problem; average initial value; consensus protocol; continuous-time first-order dynamics; directed graph; information exchange; information quantization; logarithmic quantization; multiagent system; quantization error; sampled-data based protocol; sampling interval; uniformly bounded consensus error; Communication channels; Encoding; Multi-agent systems; Nickel; Protocols; Quantization (signal); Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Automation Robotics & Vision (ICARCV), 2012 12th International Conference on
Conference_Location
Guangzhou
Print_ISBN
978-1-4673-1871-6
Electronic_ISBN
978-1-4673-1870-9
Type
conf
DOI
10.1109/ICARCV.2012.6485401
Filename
6485401
Link To Document