Robust Controllability of Boolean Control Networks via Dynamic Programming

This article presents a novel dynamic programming approach to determine the robust controllability of Boolean control networks (BCNs) subject to stochastic disturbances. By applying Bellman's optimality principle, we derive the recurrence relation for computing the optimal time matrix, a crucia...

Full description

Bibliographic Details

Published in:	IEEE transaction on neural networks and learning systems Vol. 36; no. 9; pp. 17448 - 17461
Main Authors:	Li, Yakun, Gao, Shuhua, Gao, Yiming, Wu, Jianliang, Feng, Jun-e, Xiang, Cheng
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.09.2025
Subjects:	Boolean control networks (BCNs) Computational efficiency Computational modeling Controllability Dynamic programming Heuristic algorithms Perturbation methods robust controllability State feedback Sufficient conditions Time complexity Vectors
ISSN:	2162-237X, 2162-2388, 2162-2388
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!