Optimal Control of Hybrid Systems
This paper presents a method for optimal control of hybrid systems. An inequality of Bellman type is considered and every solution to this inequality gives a lower bound on the optimal value function. A discretization of this ``hybrid Bellman inequality'' leads to a convex optimization problem in terms of finite-dimensional linear programming. From the solution of the discretized problem, a value