Skip to content

Commit 30d1f01

Browse files
authored
Merge pull request #58 from dasc-lab/test_joon
adding Joon's ACC paper
2 parents 0793233 + abe8afa commit 30d1f01

2 files changed

Lines changed: 29 additions & 0 deletions

File tree

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
---
2+
layout: papers
3+
# specify the title of the paper
4+
title: "Partial Resilient Leader-Follower Consensus in Time-Varying Graphs"
5+
# specify the date it was published
6+
date: 2026-05-26
7+
# list the authors. if a "/people/id" page exists for the person, it will be linked. If not, the author's name is printed exactly as you typed it.
8+
authors:
9+
- haejoonl
10+
- dimitrapanagou
11+
# give the main figure location, relative to /static/
12+
image: /images/partial.png
13+
# specify the conference or journal that it was published in
14+
venue: "IEEE ACC 2026"
15+
# link to publisher site (optional)
16+
link:
17+
# link to arxiv (optional)
18+
arxiv: https://arxiv.org/pdf/2510.01144
19+
# link to github (optional)
20+
code: https://github.com/joonlee16/partial_resilient_leader_follower_consensus
21+
# link to video (optional)
22+
video:
23+
# link to pdf (optional)
24+
pdf: https://arxiv.org/pdf/2510.01144
25+
# abstract
26+
abstract: "This work studies resilient leader-follower consensus with a bounded number of adversaries. Existing approaches typically require robustness conditions of the entire network to guarantee resilient consensus. However, the behavior of such systems when these conditions are not fully met remains unexplored. To address this gap, we introduce the notion of partial leader-follower consensus, in which a subset of non-adversarial followers successfully tracks the leader’s reference state despite insufficient robustness. We propose a novel distributed algorithm - the Bootstrap Percolation and Mean Subsequence Reduced (BP-MSR) algorithm --- and establish sufficient conditions for individual followers to achieve consensus via the BP-MSR algorithm in arbitrary time-varying graphs. We validate our findings through simulations, demonstrating that our method guarantees partial leader-follower consensus, even when standard resilient consensus algorithms fail.
27+
# bib entry (optional). the |- is used to allow for multiline entry."
28+
bib:
29+
---

static/images/partial.png

94.7 KB
Loading

0 commit comments

Comments
 (0)