Skip to content

Commit 435e0a7

Browse files
authored
Merge pull request #19 from dasc-lab/test_joon
Added Joon's CDC and ICRA papers.
2 parents c0e3489 + 963fb4e commit 435e0a7

File tree

4 files changed

+58
-0
lines changed

4 files changed

+58
-0
lines changed
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: "Construction of the Sparsest Maximally r-Robust Graphs"
5+
# specify the date it was published
6+
date: 1900-01-01
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/n_r_robust_graphs.png
13+
# specify the conference or journal that it was published in
14+
venue: "IEEE CDC 2024"
15+
# link to publisher site (optional)
16+
link:
17+
# link to arxiv (optional)
18+
arxiv: https://arxiv.org/abs/2409.19465
19+
# link to github (optional)
20+
code:
21+
# link to video (optional)
22+
video:
23+
# link to pdf (optional)
24+
pdf:
25+
# abstract
26+
abstract: "In recent years, the notion of r-robustness for the communication graph of the network has been introduced to address the challenge of achieving consensus in the presence of misbehaving agents. Higher r-robustness typically implies higher tolerance to malicious information towards achieving resilient consensus, but it also implies more edges for the communication graph. This in turn conflicts with the need to minimize communication due to limited resources in real-world applications (e.g., multi-robot networks). In this paper, our contributions are twofold. (a) We provide the subgraph structures and tight lower bounds on the number of edges required for graphs with a given number of nodes to reach the maximum robustness. (b) We then use the results of (a) to introduce two classes of graphs that utilize the least number of edges to maintain maximum robustness. Our work is validated through a series of simulations."
27+
# bib entry (optional). the |- is used to allow for multiline entry.
28+
bib:
29+
---

content/papers/strong_r_icra.md

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: "Maintaining Strong r-Robustness in Reconfigurable Multi-Robot Networks using Control Barrier Functions"
5+
# specify the date it was published
6+
date: 1900-01-01
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/strong_r_icra.png
13+
# specify the conference or journal that it was published in
14+
venue:
15+
# link to publisher site (optional)
16+
link:
17+
# link to arxiv (optional)
18+
arxiv: https://arxiv.org/abs/2409.14675
19+
# link to github (optional)
20+
code:
21+
# link to video (optional)
22+
video:
23+
# link to pdf (optional)
24+
pdf:
25+
# abstract
26+
abstract:
27+
# bib entry (optional). the |- is used to allow for multiline entry.
28+
bib:
29+
---

static/images/n_r_robust_graphs.png

432 KB
Loading

static/images/strong_r_icra.png

2.78 MB
Loading

0 commit comments

Comments
 (0)