Theory of optimal control using bisimulations
The authors developed a computationally appealing technique for synthesizing optimal controls for continuous feedback systems, by reducing substantially the complexity of the problem. An algorithmic solution is obtained by translating the hybrid automaton to a finite automaton using a bisimulation and formulating a dynamic programming problem with extra conditions to ensure non-Zenoness of trajectories. The main result shows that the discrete value function converges to the viscosity solution of the Hamilton-Jacobi-Bellman equation as a discretization parameter tends to zero. For the entire collection see [Zbl 0934.00029].
- Optimal control of discrete-time hybrid automata under safety and liveness constraints
- Hybrid control of networked embedded systems
- Controller synthesis for bisimulation equivalence
- Bisimulation relations for dynamical and control systems
- Reachability and optimal control for linear hybrid automata: a quantifier elimination approach
- Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
- Automated generation of optimal controllers through model checking techniques
- scientific article; zbMATH DE number 1794369 (Why is no real title available?)
- scientific article; zbMATH DE number 1827823 (Why is no real title available?)
- From Bellman to Dijkstra: set-oriented construction of globally optimal controllers
- Efficient Solution of Optimal Control Problems Using Hybrid Systems
- A set oriented approach to global optimal control
- Approximate bisimulation: a bridge between computer science and control theory
This page was built for publication: Theory of optimal control using bisimulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953385)