arXiv (All)
open access
Bearing-based Circumnavigation with Collision Avoidance in Time-varying Graphs under Limited Target Information
In this paper, we study distributed circumnavigation of a stationary target by a heterogeneous team of agents. Each agent is modelled as a disk rather than a point mass to account for its physical dimensions. The target location is assumed to be accessible only to a small subset of agents, called le
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
- Density-Driven Area Coverage for Nonholonomic Multi-Robot Systems with Safety Guarantee#1037351
- TRACS: A Geometry-Aware Framework for Scalable Multi-Agent Path Finding in Warehouses#1048883
- Fast Planning for Multi-object Multi-target Throwing#1233263
- Multi-agent Scaling Across Disjunctive and Compensatory Tasks#1106262
- Solving the Right Problem with Multi-Robot Formations#173964
Record · ID 1354187
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