Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/158910
Title: Resilient synchronization of networked robotic systems in adversarial environment
Authors: Chen, Hongjian
Keywords: Engineering::Electrical and electronic engineering::Control and instrumentation
Issue Date: 2022
Publisher: Nanyang Technological University
Source: Chen, H. (2022). Resilient synchronization of networked robotic systems in adversarial environment. Master's thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/158910
Abstract: Over the past few decades, there has been considerable research interest in the field of networked robotic systems. One of research focuses is canonical synchronization issues. The consensus issues investigate how to design a distributed controller so that the networked robots can coordinate with each other to make a common decision. However, in adversarial environments, communication between robots can be disturbed by malicious attacks. The malicious information could be from the external attackers or internal non-participant robots. Considering the widespread use of synchronous algorithms in safety-critical systems, the need for resilient algorithms has attracted a lot of research interest. In this project, a composite resilient synchronization protocol for networked Euler-Lagrange systems is designed with the aid of two existing approaches, “safe kernel” and average sampling interval. The mathematical proof and numerical examples are proposed to verify the feasibility of the protocol. Keywords: Resilient synchronization; Euler-Lagrange Systems; Safe Kernel; Average sampling interval
URI: https://hdl.handle.net/10356/158910
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
dissertation_CHEN_HONGJIAN.pdf
  Restricted Access
2.39 MBAdobe PDFView/Open

Page view(s)

33
Updated on Aug 12, 2022

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.