Optimal control of infinite horizon partially observable decision processes modelled as generators of probabilistic regular languages
DOI10.1080/00207170903193458zbMath1222.93235arXiv0907.2738OpenAlexW2121657248MaRDI QIDQ3578783
No author found.
Publication date: 20 July 2010
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.2738
discrete event systemspartial observationformal language theorylanguage measurepartially observable Markov decision processes (POMDP)
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Discrete event control/observation systems (93C65) Optimal stochastic control (93E20)
Cites Work
- On the complexity of partially observed Markov decision processes
- Structural transformations of probabilistic finite state machines
- Generalised projections in finite state automata and decidability of state determinacy
- Supervisory Control of a Class of Discrete Event Processes
- The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
- Language-measure-theoretic optimal control of probabilistic finite-state systems
- A language measure for partially observed discrete event systems
- Renormalized measure of regular languages
- Probabilistic automata
- Signed real measure of regular languages for discrete event supervisory control
- Fluid stochastic Petri nets augmented with flush-out arcs: Modelling and analysis
This page was built for publication: Optimal control of infinite horizon partially observable decision processes modelled as generators of probabilistic regular languages
