arXiv (All)
open access
Receding Horizon Multi-Agent Deceptive Path Planner
Deceptive path planning enables autonomous agents to obscure their true goals from observers by deviating from an expected optimal path. Prior work largely solves full-horizon, end-to-end optimization for single agents, which is expensive to recompute online and difficult to scale or adapt en route.
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
- Repeated Deceptive Path Planning against Learnable Observer#1049826
- Convex Density Constraints for Computing Plausible Counterfactual Explanations#779200
- Smoothing the Semantic Landscape: Generalizable AI-Generated Image Detection via Text-Induced Flatness#1116218
- Coercion and Deception in AI-to-AI Management: An Agentic Benchmark of Unprompted Escalation#381700
- Digital Twins of Deception: A Framework for Adaptive AI-Mediated Manipulation and the Trust Divergence Problem#689159
Record · ID 1062903
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