A Randomized Scheduling Framework for Privacy-Preserving Multi-robot Rendezvous given Prior Information
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912749627375616 |
|---|---|
| author | Liu, Le Kawano, Yu Cao, Ming |
| author_facet | Liu, Le Kawano, Yu Cao, Ming |
| contents | Privacy has become a critical concern in modern multi-robot systems, driven by both ethical considerations and operational constraints. As a result, growing attention has been directed toward privacy-preserving coordination in dynamical multi-robot systems. This work introduces a randomized scheduling mechanism for privacy-preserving robot rendezvous. The proposed approach achieves improved privacy even at lower communication rates, where privacy is quantified via pointwise maximal leakage. We show that lower transmission rates provide stronger privacy guarantees and prove that rendezvous is still achieved under the randomized scheduling mechanism. Numerical simulations are provided to demonstrate the effectiveness of the method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_05053 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Randomized Scheduling Framework for Privacy-Preserving Multi-robot Rendezvous given Prior Information Liu, Le Kawano, Yu Cao, Ming Systems and Control Privacy has become a critical concern in modern multi-robot systems, driven by both ethical considerations and operational constraints. As a result, growing attention has been directed toward privacy-preserving coordination in dynamical multi-robot systems. This work introduces a randomized scheduling mechanism for privacy-preserving robot rendezvous. The proposed approach achieves improved privacy even at lower communication rates, where privacy is quantified via pointwise maximal leakage. We show that lower transmission rates provide stronger privacy guarantees and prove that rendezvous is still achieved under the randomized scheduling mechanism. Numerical simulations are provided to demonstrate the effectiveness of the method. |
| title | A Randomized Scheduling Framework for Privacy-Preserving Multi-robot Rendezvous given Prior Information |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2512.05053 |