Consensus algorithms are input-to-state stable Export

@inproceedings{RenBeardKingston01_ACC05, abstract = {In many cooperative control problems, a shared knowledge of information provides the basis for cooperation. When this information is different for each agent, a state of noncooperation can result. Consensus algorithms ensure that after some time the agents would agree on the information critical for coordination, called the coordination variable. In this paper we show that if the coordination algorithm is input-to-state stable where the input is considered to be the discrepancy between the coordination variable known to each vehicle, then cooperation is guaranteed when a consensus scheme is used to synchronize information. A coordinated timing example is shown in simulation to illustrate the notions of stability when a coordination algorithm is augmented with a consensus strategy.}, author = {Kingston, D. B. and Ren, Wei and Beard, R. W.}, booktitle = {American Control Conference, 2005. Proceedings of the 2005}, citeulike-article-id = {3431572}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/ACC.2005.1470210}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1470210}, doi = {10.1109/ACC.2005.1470210}, journal = {American Control Conference, 2005. Proceedings of the 2005}, keywords = {consensus, input\_to\_state\_stable, kalman\_filter}, pages = {1686--1690 vol. 3}, posted-at = {2008-10-20 20:23:05}, priority = {2}, title = {Consensus algorithms are input-to-state stable}, url = {http://dx.doi.org/10.1109/ACC.2005.1470210}, year = {2005} }

TY - CONF ID - RenBeardKingston01_ACC05 L3 - citeulike-article-id:3431572 N2 - In many cooperative control problems, a shared knowledge of information provides the basis for cooperation. When this information is different for each agent, a state of noncooperation can result. Consensus algorithms ensure that after some time the agents would agree on the information critical for coordination, called the coordination variable. In this paper we show that if the coordination algorithm is input-to-state stable where the input is considered to be the discrepancy between the coordination variable known to each vehicle, then cooperation is guaranteed when a consensus scheme is used to synchronize information. A coordinated timing example is shown in simulation to illustrate the notions of stability when a coordination algorithm is augmented with a consensus strategy. JF - American Control Conference, 2005. Proceedings of the 2005 EP - 1690 vol. 3 TI - Consensus algorithms are input-to-state stable T2 - American Control Conference, 2005. Proceedings of the 2005 SP - 1686 KW - consensus KW - input_to_state_stable KW - kalman_filter AU - Kingston, DB AU - Ren, Wei AU - Beard, RW PY - 2005/// UR - http://dx.doi.org/10.1109/ACC.2005.1470210 ER -