Reducing the Learning Time of Reinforcement Learning for the Supervisory Control of Discrete Event Systems

Reinforcement learning (RL) can obtain the supervisory controller for discrete-event systems modeled by finite automata and temporal logic. The published methods often have two limitations. First, a large number of training data are required to learn the RL controller. Second, the RL algorithms do not consider uncontrollable events, which are essential for supervisory control theory (SCT). To address the limitations, we first apply SCT to find the supervisors for the specifications modeled by automata. These supervisors remove illegal training data violating these specifications and hence reduce the exploration space of the RL algorithm. For the remaining specifications modeled by temporal logic, the RL algorithm is applied to search for the optimal control decision within the confined exploration space. Uncontrollable events are considered by the RL algorithm as uncertainties in the plant model. The proposed method can obtain a nonblocking supervisor for all specifications with less learning time than the published methods.

Automated summary

Reinforcement learning can obtain supervisory controller for discrete-event systems and address the limitations of large training data requirement and neglecting uncontrollable events by applying supervisory control theory and reducing exploration space. The proposed method achieves a nonblocking supervisor for all specifications with shorter learning time compared to existing methods.