An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks
From MaRDI portal
Publication:665166
DOI10.1016/j.automatica.2011.01.035zbMath1235.93260OpenAlexW2003746073MaRDI QIDQ665166
Kunihiko Hiraishi, Koichi Kobayashi
Publication date: 5 March 2012
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2011.01.035
optimal controlinteger programmingbiological networkscontext-sensitive probabilistic Boolean networks
Related Items (15)
State feedback based output tracking control of probabilistic Boolean networks ⋮ Dual mean field search for large scale linear and quadratic knapsack problems ⋮ Optimal intervention in semi-Markov-based asynchronous probabilistic Boolean networks ⋮ Asymptotical stability and stabilisation of probabilistic Boolean networks subject to function perturbation ⋮ Optimal control for probabilistic Boolean networks using discrete-time Markov decision processes ⋮ Optimization-based approaches to control of probabilistic Boolean networks ⋮ Stabilization of probabilistic Boolean networks via pinning control strategy ⋮ Observability conditions of Boolean control networks ⋮ State feedback design for set stabilization of probabilistic Boolean control networks ⋮ Design of reduced-order and pinning controllers for probabilistic Boolean networks using reinforcement learning ⋮ Bayesian selection probability estimation for probabilistic Boolean networks ⋮ State feedback stabilization for probabilistic Boolean networks ⋮ Controllability of Markovian jump Boolean control networks ⋮ Optimal reconstruction of noisy dynamics and selection probabilities in Boolean networks ⋮ Static output feedback set stabilization for context-sensitive probabilistic Boolean control networks
Cites Work
- Unnamed Item
- Modeling and integer programming techniques applied to propositional calculus
- Control of systems integrating logic, dynamics, and constraints
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- Minimalilty of Finite Automata Representation in Hybrid Systems Control
This page was built for publication: An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks