Optimal output tracking of switched Boolean networks

Abstract

AbstractIn this paper, the optimal output tracking problem for a class of switched Boolean networks is investigated by using a graph‐theoretical method. Firstly, by using the semitensor product of matrices, the algebraic equation of switched Boolean networks is formulated, and then by utilizing the concepts of set stabilization and switching invariant set, the trackability of a switched Boolean network is judged. Furthermore, the optimal switching sequence for optimal output tracking of switched Boolean networks is designed by using the heap‐optimized Dijkstra algorithm and the constructed optimal state transition graph, which enables the system to track a given reference signal with the minimum cost. Finally, a numerical example is given to demonstrate the validity of the presented results.