Reciprocal Safety Velocity Cones for Decentralized Collision Avoidance in Multi-Agent Systems
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we solve the inter-agent collision avoidance problem in an arbitrary n-dimensional Euclidean space using reciprocal safety velocity cones (RSVCs). We propose a decentralized feedback control strategy that guarantees simultaneously asymptotic stabilization to a reference and collision avoidance. Our algorithm is purely decentralized in the sense that each agent uses only local information about its neighbouring agents. Moreover, the proposed solution can be implemented using only inter-agent bearing measurements. Therefore, the algorithm is a sensor-based control strategy which is practically implementable using a wide range of sensors such as vision systems and range scanners. Simulation results in a two dimensional environment cluttered with agents shows that the number of possible deadlocks is marginal and decrease with the decrease in the clutteredness of the workspace.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it