arXiv (All)
open access
Probabilistic Reachable Set Estimation for Saturated Systems with Unbounded Additive Disturbances
In this paper, we present an analytical approach for the synthesis of ellipsoidal probabilistic reachable sets of saturated systems subject to unbounded additive noise. Using convex optimization methods, we compute a contraction factor of the saturated error dynamics that allows us to tightly bound
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
- Set-based state estimation of nonlinear discrete-time systems using constrained zonotopes and polyhedral relaxations#986774
- Optimal Deterministic First-Order Oracle Complexity for Nonconvex-Concave Minimax Optimization#1083692
- Rethinking Traffic Matrix Completion: Estimate the Process, Not the Entries#155203
- A polynomial time algorithm for almost bounded denumerant#612421
- A polynomial time algorithm for almost bounded denumerant#610944
Record · ID 1130154
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