The Experts below are selected from a list of 59199 Experts worldwide ranked by ideXlab platform

Tielong Shen - One of the best experts on this subject based on the ideXlab platform.

  • A Finite Convergence Criterion for the Discounted Optimal Control of Stochastic Logical Networks
    IEEE Transactions on Automatic Control, 2018
    Co-Authors: Tielong Shen
    Abstract:

    Stochastic logical networks (SLNs) are discrete-time stochastic dynamical systems with Boolean (or multivalued) logical state variables. The discounted infinite horizon optimal control problem for SLN is addressed in this paper. By resorting to the equivalent Markov decision process description, the infinite horizon optimization problem is presented in Algebraic Form. Then using the increasing-dimension technique, an improved finite convergence criterion, which can find the optimal stationary policy, is derived for value iteration approach. To demonstrate the theoretical value of this approach, it is applied to the optimization problems of the human–machine game and the p53-Mdm2 gene network.

  • Finite convergence of value iteration algorithm for discounted infinite horizon optimal control of stochastic logical systems
    2016 35th Chinese Control Conference (CCC), 2016
    Co-Authors: Yuhu Wu, Wei Wang, Tielong Shen
    Abstract:

    This paper investigates the discounted infinite horizon optimal control problem for the stochastic multi-valued logical dynamical systems with finite states. After giving the equivalent descriptions of the stochastic logical dynamical system in terms of Markov decision process, the infinite horizon optimization problem is presented in an Algebraic Form. Based on the semi-tensor product of matrices and the increasing-dimension technique, it is proved that the optimal stationary policy is obtained by a finite horizon value iteration process, and an exact horizon length estimation for the finite horizon approach is derived. As an application, the optimization problem of Human-machine game is investigated.

  • an Algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems
    Systems & Control Letters, 2015
    Co-Authors: Tielong Shen
    Abstract:

    Abstract This paper investigates the finite horizon optimal control problem for the stochastic logical dynamical systems with finite states. After giving the equivalent descriptions of stochastic logical dynamical system in term of Markov process, the finite horizon optimization problem is presented in an Algebraic Form. Based on semi-tensor product of matrix and the increasing dimensional technique, a succinct Algebraic expression of dynamic programming algorithm is derived to solve the optimal control problem. Examples, including an application on stochastic Kleene’s logical optimization problem, are presented to show the effectiveness of our main result.

  • a matrix expression of infinite horizon optimal control problem for stochastic logical dynamical systems
    IFAC Proceedings Volumes, 2014
    Co-Authors: Tielong Shen
    Abstract:

    Abstract The stochastic logical control dynamical system with finite state is considered. After giving two equivalent descriptions of stochastic logical dynamical system: in term of discrete-time evolution equation and in term of Markov process, the infinite horizon optimization problem is presented in an Algebraic Form. Based on semi-tensor product of matrix and the increasing dimensional technique, we establish a succinct matrix expression of dynamic programming and Bellman's equation for the optimal control problem.

June Feng - One of the best experts on this subject based on the ideXlab platform.

  • function perturbation of mix valued logical networks with impacts on limit sets
    Neurocomputing, 2016
    Co-Authors: Min Meng, June Feng
    Abstract:

    In this paper, function perturbation of mix-valued logical networks is first proposed and investigated via semi-tensor product (STP) of matrices. Motivated by the concept of one-bit perturbation in Boolean networks, the definition of general perturbation in mix-valued logical networks is presented and the Algebraic expression of the perturbed networks is given by STP. The impacts of function perturbation on fixed points and limit cycles are discussed by analyzing the changes of transition matrix in Algebraic Form. In addition to identifying one perturbation in mix-valued logical networks, a new way to identify multi-perturbation is given. This new method can be used in producing or removing fixed points and thus exerting effects on limit cycles. All of the theoretical results also hold for Boolean and k-valued logical networks. Finally, the results of perturbation identification are applied to the WNT5A gene network, which shows broad prospects of application.

  • function perturbations in boolean networks with its application in a d melanogaster gene network
    European Journal of Control, 2014
    Co-Authors: Min Meng, June Feng
    Abstract:

    Abstract This paper considers the impacts on attractors of function perturbations in Boolean networks via semi-tensor product of matrices. Two types of function perturbations: one-bit perturbation and modifications of update schedule, are investigated. First, the Algebraic Form of perturbed Boolean networks under one-bit perturbation is given, based on which several necessary and sufficient conditions of different kinds of effects on state transition and attractors are obtained. Besides, a Boolean network with update schedule is studied and the definition of its adjacent diagraph is first presented in this paper. Furthermore, transition matrix of the updated network is calculated to analyze the changes of fixed points and limit cycles. At last, identifying function perturbations with its application in a Drosophila melanogaster segmentation polarity gene network is shown to demonstrate the practicability and effectiveness of the theoretical results.

Y. T. Chew - One of the best experts on this subject based on the ideXlab platform.

  • SIMULATION OF NATURAL CONVECTION IN A SQUARE CAVITY BY TAYLOR SERIES EXPANSION- AND LEAST SQUARES-BASED LATTICE BOLTZMANN METHOD
    International Journal of Modern Physics C, 2002
    Co-Authors: Yan Peng, Y. T. Chew
    Abstract:

    The Taylor series expansion- and least squares-based lattice Boltzmann method (TLLBM) was used in this paper to extend the current thermal model to an arbitrary geometry so that it can be used to solve practical thermo-hydrodynamics in the incompressible limit. The new explicit method is based on the standard lattice Boltzmann method (LBM), Taylor series expansion and the least squares approach. The final Formulation is an Algebraic Form and essentially has no limitation on the mesh structure and lattice model. Numerical simulations of natural convection in a square cavity on both uniForm and nonuniForm grids have been carried out. Favorable results were obtained and compared well with the benchmark data. It was found that, to get the same order of accuracy, the number of mesh points used on the nonuniForm grid is much less than that used on the uniForm grid.

  • taylor series expansion and least squares based lattice boltzmann method two dimensional Formulation and its applications
    Physical Review E, 2002
    Co-Authors: C Shu, Xiaodong Niu, Y. T. Chew
    Abstract:

    An explicit lattice Boltzmann method (LBM) is developed in this paper to simulate flows in an arbitrary geometry. The method is based on the standard LBM, Taylor-series expansion, and the least-squares approach. The final Formulation is an Algebraic Form and essentially has no limitation on the mesh structure and lattice model. Theoretical analysis for the one-dimensional (1D) case showed that the version of the LBM could recover the Navier-Stokes equations with second order accuracy. A generalized hydrodynamic analysis is conducted to study the wave-number dependence of shear viscosity for the method. Numerical simulations of the 2D lid-driven flow in a square cavity and a polar cavity flow as well as the "no flow" simulation in a square cavity have been carried out. Favorable results were obtained and compared well with available data in the literature, indicating that the present method has good prospects in practical applications.

Tasawar Hayat - One of the best experts on this subject based on the ideXlab platform.

  • semi tensor product method to a class of event triggered control for finite evolutionary networked games
    Iet Control Theory and Applications, 2017
    Co-Authors: Peilian Guo, Huaxiang Zhang, Fuad E Alsaadi, Tasawar Hayat
    Abstract:

    Using the approach of semi-tensor product of matrices, this study studies a class of event-triggered control for finite evolutionary networked games, where the control only works at some certain individual states. First, by identifying `control does not work' as a new specific control strategy, the controlled game dynamics is converted into an Algebraic Form. Second, to make the game converge globally, two necessary and sufficient conditions for the existence of event-triggered control are obtained. Meanwhile, a constructive procedure is proposed to design state feedback control strategy and an adjustment method is presented to minimise the control times. Finally, the developed theory results are illustrated by a numerical method.

Min Meng - One of the best experts on this subject based on the ideXlab platform.

  • function perturbation of mix valued logical networks with impacts on limit sets
    Neurocomputing, 2016
    Co-Authors: Min Meng, June Feng
    Abstract:

    In this paper, function perturbation of mix-valued logical networks is first proposed and investigated via semi-tensor product (STP) of matrices. Motivated by the concept of one-bit perturbation in Boolean networks, the definition of general perturbation in mix-valued logical networks is presented and the Algebraic expression of the perturbed networks is given by STP. The impacts of function perturbation on fixed points and limit cycles are discussed by analyzing the changes of transition matrix in Algebraic Form. In addition to identifying one perturbation in mix-valued logical networks, a new way to identify multi-perturbation is given. This new method can be used in producing or removing fixed points and thus exerting effects on limit cycles. All of the theoretical results also hold for Boolean and k-valued logical networks. Finally, the results of perturbation identification are applied to the WNT5A gene network, which shows broad prospects of application.

  • function perturbations in boolean networks with its application in a d melanogaster gene network
    European Journal of Control, 2014
    Co-Authors: Min Meng, June Feng
    Abstract:

    Abstract This paper considers the impacts on attractors of function perturbations in Boolean networks via semi-tensor product of matrices. Two types of function perturbations: one-bit perturbation and modifications of update schedule, are investigated. First, the Algebraic Form of perturbed Boolean networks under one-bit perturbation is given, based on which several necessary and sufficient conditions of different kinds of effects on state transition and attractors are obtained. Besides, a Boolean network with update schedule is studied and the definition of its adjacent diagraph is first presented in this paper. Furthermore, transition matrix of the updated network is calculated to analyze the changes of fixed points and limit cycles. At last, identifying function perturbations with its application in a Drosophila melanogaster segmentation polarity gene network is shown to demonstrate the practicability and effectiveness of the theoretical results.