arXiv (All)
open access
Asynchronous Indulgent Gathering of Opaque Robots
We consider the benchmarking problem of gathering in an $(N,f)$-fault system consisting of $N$ robots, of which at most $f$ may fail at any execution. The {\em traditional} version asks $N-f$ non-faulty robots to gather at a point not known a priori. The recently studied {\em indulgent} version asks
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Seeing Through the Displaced Frame: Privileged Noise Distillation for Vision-Force Precision Assembly#1217120
- Few-Shot Adaptation for Anomalous Sound Detection at Low False-Positive Rate#1354575
- Probabilistic Modelling of Operational Design Domains, A New Approach for Testing AI Systems#1050576
- DiffSAC: Diffusion-guided Sampling for Consensus-based Robust Estimation#818667
- DiffSAC: Diffusion-guided Sampling for Consensus-based Robust Estimation#808675
Record · ID 1357039
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive