arXiv (All)
open access
Deep Reinforcement Learning for Reach-Avoid-Stay Problems
Reach-Avoid-Stay (RAS) tasks are essential in applications where systems must safely reach a target set and remain within it under all bounded disturbances. Existing approaches either struggle to compute the maximal robust RAS set, the set of all states from which the RAS task is achievable, or are
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
- Deep Reinforcement Learning for Reach-Avoid-Stay Problems#920175
- Provably Optimal Reinforcement Learning under Safety Filtering#1034680
- Learning State-Action Control Barrier Functions for Model-Free Control under Constraints#1012019
- Reliability Theory for AI Control#1062313
- Reliability Theory for AI Control#1043148
Record · ID 924406
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