A Floyd-like algorithm for optimization of mix-valued logical control networks

Proceedings of the 30th Chinese Control Conference, CCC 2011

Volumn , Issue , 2011, Pages 1972-1977

  Zhao, Yin ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Floyd Algorithm; Input State Incidence Matrix; Mix Valued Logical Control Network; Optimal Control

Indexed keywords

CONTROL NETWORK; DYNAMIC NETWORK; FLOYD ALGORITHM; HIGHER ORDER; INCIDENCE MATRICES; LOGICAL CONTROL; NUMERICAL EXAMPLE; OPTIMAL CONTROLS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTROL; NUMERICAL ANALYSIS;

OPTIMIZATION;

EID: 80053065998     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Y. Mu, L. Guo. Optimization and identification in a nonequilibrium dynamic game[C]// Proc. CDC-CCC'09. Shanghai, 2009: 5750-5755.
2. D. Laschov, M. Margaliot. A maximum principle for singleinput Boolean control networks[J]. IEEE Trans. Aut. Contr., 2011, 56(4): 913-917.
3. Y. Zhao, Z. Li, D. Cheng. Optimal control of logical control networks[J], IEEE Trans. Aut. Contr., Doi:10.1109/TAC.2010.2092290, to appear. (regular paper)
4. J.M. Alexander. Random Boolean networks and evolutionary game theory[J]. Philosophy of Science, 2002, 70: 1289-1304.
5. S.A. Kauffman. Metabolic stability and epigenesis in randomly constructed genetic nets[J]. J. Theoretical Biology, 1969, 22: 437-467.
6. S.A. Kauffman. The Origins of Order, Self-Organization and Selection in Evolution[M]. New York: Oxford Univ. Press, 1993.
7. A. Data, A. Choudhary, M.L. Bittner, E.R. Dougherty. External control in Markovian genetic regulatory networks: The imperfect information case[J]. Bioinformatics, 2004, 20: 924-930.
8. R. Pal, A. Datta, M.L. Bittner, E.R. Dougherty. Optimal infinitehorizon control for probabilistic Boolean networks[J]. IEEE Trans. Signal Process, 2006, 54: 2375-2387.
9. T. Akutsu, M. Hayashida, W.K. Ching, M. K. Ng. Control of Boolean networks: Hardness results and algorithms for tree structured networks[J]. J. Theoretical Biology, 2007, 244: 670-679.
10. T. Ideker, T. Galitski, L. Hood. A new approach to decoding life: systems biology[J]. Annu. Rev. Genomics Hum. Genet., 2001, 2: 343-372.
11. R.W. Floyd. Algorithm 97: Shortest Path[J]. Communications of the ACM, 1962, 5: 345.
12. B. Roy. Transitivit et connexit[J]. C. R. Acad. Sci. Paris, 1959, 249: 216-218.
13. S. Warshall. A theorem on Boolean matrices[J]. Journal of the ACM, 1962, 9(1): 11C12.
14. E.W. Dijkstra. A note on two problems in connexion with graphs[J]. Numerische Mathematik, 1959, 1: 269C271.
15. D.B. Johnson. Efficient algorithms for shortest paths in sparse networks[J]. Journal of the ACM, 1977, 24(1): 1C13.
16. Y. Zhao, H. Qi, D. Cheng. Input-state incidence matrix of Boolean control networks and its applications[J]. Sys. Contr. Lett., 2010, 46(12): 767-774.
17. D. Cheng. Semi-tensor product of matrices and its applications- A survey[C]// ICCM 2007. 2007, 3: 641-668.
18. D. Cheng, H. Qi. A linear representation of dynamics of Boolean networks[J]. IEEE Trans. Aut. Contr., 2010, 55(10): 2251-2258.
19. D. Cheng. Input-state approach to Boolean networks[J]. IEEE Trans. Neural Network, 2009, 20(3): 512-521.
20. D. Cheng, H. Qi. Controllability and observability of Boolean control networks[J]. Automatica, 2009, 45(7): 1659-1667.
21. D. Cheng, Z. Li, H. Qi. Realization of Boolean control networks[J]. Automatica, 2010, 46(1): 62-69.
22. D. Cheng, H. Qi, Z. Li. Disturbance decoupling of Booleancontrol networks[J]. IEEE Trans. Aut. Contr., 2011, 56(1): 2-10.
23. Z. Li, D. Cheng. Algebraic Approach to Dynamics of Multivalued Networks[J]. Int. J. Bifurcat. Chaos, 2010, 20(3): 375-381.