OPTIMAL CONTROL OF FINITE-VALUED NETWORKS

摘要

Control of finite-valued networks, including Boolean networks, is currently a hot topic. In this paper the optimization of the networks with time-discounted performance criterion is discussed. The problem is formulated as a finite strategy game between human and machine. It is first proved that the optimal strategy can be found in the set of essentially periodic strategies, which makes the problem finitely computable, though the computational complexity of exhaustion might be a severe problem. Then an efficient numerical method is develossped to solve the problem. Some interesting examples are presented to demonstrate the efficiency of our results.