A Monte-Carlo Tree Search based Tracking Control Approach for Timed Petri Nets

Abstract

Abstract In this paper, an approach for the tracking control problem for discrete event systems modeled by timed Petri nets (TPN) is proposed. The approach applies the Monte-Carlo Tree Search to the tracking control problem for TPN to find a firing sequence from an initial marking to the desired destination marking that minimizes the required duration. The proposed tracking control method randomly searches a small part of the reachability graph and incrementally constructs a search tree to find the optimal solution. This reduces the computational effort and allows the approach to solve the tracking control problem for larger systems. The approach has capabilities for deadlock avoidance and can be applied to a wide range of control problems like reachability analysis, fault-tolerant control and scheduling problems.