arXiv (All)
open access
The BAR-SOT Method: Long-term Average Cost Control as Stochastic Optimal Self-Transport
We reformulate average-cost (ergodic) control of a Markov jump process as a finite-horizon stochastic optimal transport (SOT) problem that jointly optimizes over the controlled evolution and the marginal law from which it starts and returns to (i.e., a self-transport). The constraint relating the ma
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
- Further Approaches of Dynamical Low-Rank Approximation for SDEs#1034060
- Asymptotic log-Harnack inequality for path-distribution dependent SDEs with infinite memory and Dini drift#677392
- Asymptotic log-Harnack inequality for path-distribution dependent SDEs with infinite memory and Dini drift#674195
- A Diffusion-Refined Planner with Reinforcement Learning Priors for Confined-Space Parking#629844
- A Diffusion-Refined Planner with Reinforcement Learning Priors for Confined-Space Parking#627982
Record · ID 1011678
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