arXiv (All)
open access
Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
We consider the problem of minimizing the worst-case search time for a hidden point target in the plane using multiple mobile agents of differing speeds, all starting from a common origin. The search time is normalized by the target's distance to the origin, following the standard convention in comp
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
- Nearly Complete Characterization of 2-Agent Deterministic Strategyproof Mechanisms for Single Facility Location in $L_p$ Space#1104796
- Game-Theoretic and Learning-Based Approaches in Multi-Agent Systems#176758
- Collision-free Movement on Grids and Beyond#1105657
- Importance of Intent-Sharing for V2X-based Maneuver Coordination#303171
- LongMINT: Evaluating Memory under Multi-Target Interference in Long-Horizon Agent Systems#200536
Record · ID 1063780
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