Circle Formation of Weak Robots and Lyndon Words
Yoann Dieudonné, Franck Petit
Abstract
A Lyndon word is a non-empty word strictly smaller in the lexicographic order than any of its suffixes, except itself and the empty word. In this paper, we show how Lyndon words can be used in the distributed control of a set of n weak mobile robots. By weak, we mean that the robots are anonymous, memoryless, without any common sense of direction, and unable to communicate in an other way than observation. An efficient and simple deterministic protocol to form a regular n-gon is presented and proven for n prime.
Create a lesson
Related papers
Consensus with Stochastic Broadcast
Pierre Fraigniaud, Boaz Patt-Shamir, Sergio Rajsbaum
Decoupled I/O-Dominant Pipelines for Large-Scale Whole-Slide Image Embedding Extraction
Mayanka Chandrashekar, Xi Zhang, Ethan Seefried et al.
Sintr: Safe Interactive Transactions in the Presence of Byzantine Clients
Austin T. Li, Daniel H. Lee, Lorenzo Alvisi et al.
Benchmarking Confidential Computing Performance on NVIDIA Blackwell GPUs
Daniyal Khan, Amean Asad, Ansgar Grunseid
Optimizing API Gateway Placement in Multi-Cloud Kubernetes
Vinoth Punniyamoorthy, Murali Shankar Dulam, Aswathnarayan Muthukrishnan Kirubakaran et al.
VPP: Virtual Pipeline Parallelism for Efficient Chunked Prefill in Long-Context LLM Inference
Yan Shi, Xiaochao Wang, Jingchun Gao et al.