Optimal Control of Logical Control Networks

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...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 56; no. 8; pp. 1766 - 1776
Main Authors Zhao, Yin, Li, Zhiqiang, Cheng, Daizhan
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.08.2011
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Aerospace electronics
Algebra
Applied sciences
Automata. Abstract machines. Turing machines
Automatic control
Biological system modeling
Boolean algebra
Boolean network
Computer science; control theory; systems
Control systems
Control theory. Systems
cycle
Exact sciences and technology
Game theory
Games
higher order logical control network
Humans
Information retrieval. Graph
logical control network
Mathematical analysis
Networks
Optimal control
Optimization
Studies
System theory
Theoretical computing
Trajectory
Boolean logic
Boolean Network
Optimal control
Distributed control
higher order logical control network
Infinite horizon
Control theory
Optimal control (mathematics)
Game theory
cycle
logical control network
Optimization
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2010.2092290