By Topic

Optimal Control of Logical Control Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yin Zhao ; Key Lab. of Syst. & Control, Chinese Acad. of Sci., Beijing, China ; Zhiqiang Li ; Daizhan Cheng

This paper considers the infinite horizon optimal control of logical control networks, including Boolean control networks as a special case. Using the framework of game theory, the optimal control problem is formulated. In the sight of the algebraic form of a logical control network, its cycles can be calculated algebraically. Then the optimal control is revealed over a certain cycle. When the games, using memory μ >; 1 (which means the players only consider previous μ steps' action at each step), are considered, the higher order logical control network is introduced and its algebraic form is also presented, which corresponds to a conventional logical control network (i.e., μ = 1 ). Then it is proved that the optimization technique developed for conventional logical control networks is also applicable to this μ-memory case.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 8 )