Abstract
In this paper we address the finite-horizon optimal control problem for Boolean control networks (BCNs). By resorting to the algebraic approach recently introduced by D. Cheng and co-authors [1], [3], [4], [5], we first pose the problem of finding the input sequences that minimize a given quadratic cost function. Then, by resorting to the semi-tensor product, we rewrite the cost function as a linear one. The problem solution is obtained by means of a recursive algorithm that represents the analogue for BCNs of the difference Riccati equation for linear systems. A number of apparently more general optimal control problems for BCNs can be easily reframed into the present set-up. In particular, the cost function can be adjusted so as to include penalties on the switchings, provided that we redefine the BCN state variable.
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.
