arXiv (All)
open access
Safe Exploration of Arbitrary Dynamic Dangerous Networks
Given a team of agents on the nodes of a graph-based network, the exploration problem requires each node to be visited by at least one agent. In the classical distributed setting of static networks, agents do not know the topology of the network; in the more recently investigated setting of dynamic
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
- Safe Exploration of Arbitrary Dynamic Dangerous Networks#978397
- Error and attack tolerance of complex networks#6544
- Safety Anchor: Defending Harmful Fine-tuning via Geometric Bottlenecks#160729
- An Uncertainty-Aware Resilience Micro-Agent for Causal Observability in the Computing Continuum#175194
- Safe and efficient active network programming#328672
Record · ID 1014893
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