Receding-horizon control for max-plus linear systems with discrete actions using optimistic planning

Reference:
J. Xu, L. Busoniu, T. van den Boom, and B. De Schutter, "Receding-horizon control for max-plus linear systems with discrete actions using optimistic planning," Proceedings of the 13th International Workshop on Discrete Event Systems, Xi'an, China, pp. 398-403, May-June 2016.

Abstract:
This paper addresses the infinite-horizon optimal control problem for max-plus linear systems where the considered objective function is a sum of discounted stage costs over an infinite horizon. The minimization problem of the cost function is equivalently transformed into a maximization problem of a reward function. The resulting optimal control problem is solved based on an optimistic planning algorithm. The control variables are the increments of system inputs and the action space is discretized as a finite set. Given a finite computational budget, a control sequence is returned by the optimistic planning algorithm. The first control action or a subsequence of the returned control sequence is applied to the system and then a receding-horizon scheme is adopted. The proposed optimistic planning approach allows us to limit the computational budget and also yields a characterization of the level of near-optimality of the resulting solution. The effectiveness of the approach is illustrated with a numerical example. The results show that the optimistic planning approach results in a lower tracking error compared with a finite-horizon approach when a subsequence of the returned control sequence is applied.