Abstract

This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only. Existing solutions are based on dynamic programming and multi-parametric programming approaches, while the one proposed in this paper is based on a modified version of performance-driven reachability analyses. The algorithm abstracts the behaviour of the hybrid system by building a 'tree of evolution'. The nodes of the tree represent the reachable states of a process, and the branches correspond to input combinations leading to designated states. A cost-function value is associated with each node and based on this value the exploration of the tree is driven. For any initial state, an input sequence is thus obtained, driving the system optimally over a finite horizon. According to the model predictive strategy, only the first input is actually applied to the system. The number of possible discrete input combinations is finite and the feasible set of the states of the system may be partitioned according to the optimization results. In the proposed approach, the partitioning is performed offline and a probabilistic neural network (PNN) is then trained by the set of points at the borders of the state-space partitions. The trained PNN is used as a system-state-based control-law classifier. Thus, the online computational effort is minimized and the control can be implemented in real time.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call