arXiv CS
open access
Capturing a Moving Target on Star Graphs by Two Communicating Mobile Agents
We study a problem of searching for a mobile target in an $m$-ray star graph, a natural generalization of linear search to multiple directions. The target is placed adversarially on one of the rays and may move with constant speed. We investigate a two-robot setting, where cooperation and communicat
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
- Capturing a Moving Target on Star Graphs by Two Communicating Mobile Agents#1249235
- MAPLE-RF: Efficient Probabilistic RF Source Localization in Partially Explored Environments#1034996
- Bearing-based Circumnavigation with Collision Avoidance in Time-varying Graphs under Limited Target Information#1354187
- Solving the Right Problem with Multi-Robot Formations#173964
- A geometric approach for distributed multi-hop target localization in cooperative networks#236594
Record · ID 1257930
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