Abstract
In this paper, we study the optimal control problem of Boolean control networks (BCNs). An optimal input-state transfer graph (OISTG) is defined for BCNs with cost in every stage. Optimal controllers are designed to minimize (or maximize) a given cost (or payoff) function over finite and/or infinite time horizon. In finite time horizon, a sufficient condition is derived for the optimal control problem, and an algorithm with the method of binary decomposition is proposed. Moreover, we prove the existence of optimal control for discounted problems over an infinite time horizon, and a new algorithm is presented to design corresponding optimal controllers. Compared with some existing methods, the new algorithm with OISTG can be used to reduce both space complexity and computational complexity in finding optimal controllers. Numerical examples are presented to illustrate the efficiency of the obtained results.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
