Fault-tolerant multi-agent tracking consensus under reference values
In this document, a fault-tolerant consensus algorithm is proposed for the agents of a distributed network to reach a consensus in the presence of adversarial or misbehaving nodes. Previous results have indicated the need for non-local knowledge of communications or redundant connectivity to counter...
- Autores:
-
Díaz Dávila, Juan Esteban
- Tipo de recurso:
- Trabajo de grado de pregrado
- Fecha de publicación:
- 2020
- Institución:
- Universidad de los Andes
- Repositorio:
- Séneca: repositorio Uniandes
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.uniandes.edu.co:1992/51560
- Acceso en línea:
- http://hdl.handle.net/1992/51560
- Palabra clave:
- Tolerancia a los fallos (Informática)
Sistemas computacionales
Fallas de sistema para computadora
Algoritmos (Computadores)
Redes de computadores
Ingeniería
- Rights
- openAccess
- License
- https://repositorio.uniandes.edu.co/static/pdf/aceptacion_uso_es.pdf
| Summary: | In this document, a fault-tolerant consensus algorithm is proposed for the agents of a distributed network to reach a consensus in the presence of adversarial or misbehaving nodes. Previous results have indicated the need for non-local knowledge of communications or redundant connectivity to countermand the impact of adversaries. However, the inclusion of reference nodes as a variant of the W-MSR algorithm allows consensus to be reached on a known reference value even with the removal of information. This document presents the conditions for reference agents to guide non-malicious agents towards consensus in the presence of adversaries and presents simulations for data fusion application scenarios against adversaries. The system used is represented as a graph in which the agents or nodes communicate with each other through communication links or edges... |
|---|