arXiv (All)
open access
Min-Max Uniform Circle Formation by Asynchronous Mobile Robots
Given a set of point robots $\mathcal{R}$ in the Euclidean plane and a target circle $\mathbf C$ enclosing all robot positions, the \textsc{Min-Max Uniform Circle Formation (MMUCF)} problem requires the robots to move to distinct positions on $\mathbf C$ such that the final configuration forms a reg
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
- Min-Max Uniform Circle Formation by Asynchronous Mobile Robots#1194401
- A Randomized Scheduling Framework for Privacy-Preserving Multi-robot Rendezvous given Prior Information#665597
- A Randomized Scheduling Framework for Privacy-Preserving Multi-robot Rendezvous given Prior Information#664097
- Inverse kinematic solution for generic 3R positional robots using Conformal Geometric Algebra#819766
- Inverse kinematic solution for generic 3R positional robots using Conformal Geometric Algebra#809770
Record · ID 1200659
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