2018
DOI: 10.1007/978-3-319-78449-6_11
|View full text |Cite
|
Sign up to set email alerts
|

Resilient Self-Triggered Network Synchronization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…Remark 2: Although the paper focuses on networks of dynamical systems of the form (1), it is not hard to tackle synchronization problems involving linear dynamics as in [30], since synchronization can be reduced to a consensus problem by means of suitable coordinate transformations. For the noisefree case self-triggered algorithms for the synchronization of linear systems have been studied in [31], and for the noisefree case with packet dropouts in [32]. These algorithms can be modified in the spirit of ( 6)- (10) for the case of noisy measurements and the analysis carried out in the rest of the paper can be extended to the synchronization problem of linear systems.…”
Section: B Control Action and Triggering Timesmentioning
confidence: 99%
“…Remark 2: Although the paper focuses on networks of dynamical systems of the form (1), it is not hard to tackle synchronization problems involving linear dynamics as in [30], since synchronization can be reduced to a consensus problem by means of suitable coordinate transformations. For the noisefree case self-triggered algorithms for the synchronization of linear systems have been studied in [31], and for the noisefree case with packet dropouts in [32]. These algorithms can be modified in the spirit of ( 6)- (10) for the case of noisy measurements and the analysis carried out in the rest of the paper can be extended to the synchronization problem of linear systems.…”
Section: B Control Action and Triggering Timesmentioning
confidence: 99%
“…The last couple of years have instead witnessed tremendous efforts to extend analysis and design methodologies to distributed systems which are the quintessential form of network systems. Most of the research in this area has been developed for consensus-like problems [13][14][15][40][41][42][43]. In this section, we first present a distributed consensus algorithm which is resilient to DoS, and then we discuss some of the (many) open problems in this area.…”
Section: Distributed Systemsmentioning
confidence: 99%
“…As mentioned at the beginning of Sect. 3.4, most of the research in this area has been developed for consensus-like problems [13][14][15][40][41][42][43]. Problems of this type are somehow "manageable" in the sense that they involve systems with stable or neutrally stable dynamics (like integrators in the context of consensus), which considerably simplifies analysis and design.…”
Section: Network With Complex Dynamicsmentioning
confidence: 99%