Language-measure-theoretic optimal control of probabilistic finite-state systems
From MaRDI portal
Publication:5423836
DOI10.1080/00207170701286322zbMath1133.93047MaRDI QIDQ5423836
No author found.
Publication date: 31 October 2007
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207170701286322
Related Items
Optimal hybrid fault recovery in a team of unmanned aerial vehicles, Path planning in GPS-denied environments via collective intelligence of distributed sensor networks, Structural transformations of probabilistic finite state machines, Optimal control of infinite horizon partially observable decision processes modelled as generators of probabilistic regular languages, Generalised projections in finite state automata and decidability of state determinacy, Autonomous robot navigation using optimal control of probabilistic regular languages, ν☆: a robot path planning algorithm based on renormalised measure of probabilistic regular languages
Uses Software
Cites Work
- Unnamed Item
- Supervisory control using variable lookahead policies
- Supervisory Control of a Class of Discrete Event Processes
- An Optimal Control Theory for Discrete Event Systems
- A probabilistic language formalism for stochastic discrete-event systems
- Control of stochastic discrete event systems modeled by probabilistic languages
- Optimal supervisory control of finite state automata
- 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
