The numerical method for the optimal supporting position and related optimal control for the catalytic reaction system

This paper considers the numerical approximation for the optimal supporting position and related optimal control of a catalytic reaction system with some control and state constraints, which is governed by a nonlinear partial differential equations with given initial and boundary conditions. By the Galerkin finite element method, the original problem is projected into a semi-discrete optimal control problem governed by a system of ordinary differential equations. Then the control parameterization method is applied to approximate the control and reduce the original system to an optimal parameter selection problem, in which both the position and related control are taken as decision variables to be optimized. This problem can be solved as a nonlinear optimization problem by a particle swarm optimization algorithm. The numerical simulations are given to illustrate the effectiveness of the proposed numerical approximation method.     

Inference of S-system models of genetic networks by solving one-dimensional function optimization problems

Voit and Almeida have proposed the decoupling approach as a method for inferring the S-system models of genetic networks. The decoupling approach defines the inference of a genetic network as a problem requiring the solutions of sets of algebraic equations. The computation can be accomplished in a very short time, as the approach estimates S-system parameters without solving any of the differential equations. Yet the defined algebraic equations are non-linear, which sometimes prevents us from finding reasonable S-system parameters. In this study, we propose a new technique to overcome this drawback of the decoupling approach. This technique transforms the problem of solving each set of algebraic equations into a one-dimensional function optimization problem. The computation can still be accomplished in a relatively short time, as the problem is transformed by solving a linear programming problem. We confirm the effectiveness of the proposed approach through numerical experiments.     

Dynamic optimization of bioprocesses: efficient and robust numerical strategies

The dynamic optimization (open loop optimal control) of non-linear bioprocesses is considered in this contribution. These processes can be described by sets of non-linear differential and algebraic equations (DAEs), usually subject to constraints in the state and control variables. A review of the available solution techniques for this class of problems is presented, highlighting the numerical difficulties arising from the non-linear, constrained and often discontinuous nature of these systems. In order to surmount these difficulties, we present several alternative stochastic and hybrid techniques based on the control vector parameterization (CVP) approach. The CVP approach is a direct method which transforms the original problem into a non-linear programming (NLP) problem, which must be solved by a suitable (efficient and robust) solver. In particular, a hybrid technique uses a first global optimization phase followed by a fast second phase based on a local deterministic method, so it can handle the nonconvexity of many of these NLPs. The efficiency and robustness of these techniques is illustrated by solving several challenging case studies regarding the optimal control of fed-batch bioreactors and other bioprocesses. In order to fairly evaluate their advantages, a careful and critical comparison with several other direct approaches is provided. The results indicate that the two-phase hybrid approach presents the best compromise between robustness and efficiency.     

Optimization and Control of Agent-Based Models in Biology: A Perspective

Agent-based models (ABMs) have become an increasingly important mode of inquiry for the life sciences. They are particularly valuable for systems that are not understood well enough to build an equation-based model. These advantages, however, are counterbalanced by the difficulty of analyzing and using ABMs, due to the lack of the type of mathematical tools available for more traditional models, which leaves simulation as the primary approach. As models become large, simulation becomes challenging. This paper proposes a novel approach to two mathematical aspects of ABMs, optimization and control, and it presents a few first steps outlining how one might carry out this approach. Rather than viewing the ABM as a model, it is to be viewed as a surrogate for the actual system. For a given optimization or control problem (which may change over time), the surrogate system is modeled instead, using data from the ABM and a modeling framework for which ready-made mathematical tools exist, such as differential equations, or for which control strategies can explored more easily. Once the optimization problem is solved for the model of the surrogate, it is then lifted to the surrogate and tested. The final step is to lift the optimization solution from the surrogate system to the actual system. This program is illustrated with published work, using two relatively simple ABMs as a demonstration, Sugarscape and a consumer-resource ABM. Specific techniques discussed include dimension reduction and approximation of an ABM by difference equations as well systems of PDEs, related to certain specific control objectives. This demonstration illustrates the very challenging mathematical problems that need to be solved before this approach can be realistically applied to complex and large ABMs, current and future. The paper outlines a research program to address them.     

Dynamic optimization of distributed biological systems using robust and efficient numerical techniques

ABSTRACT: BACKGROUND: Systems biology allows the analysis of biological systems behavior under different conditions through in silico experimentation. The possibility of perturbing biological systems in different manners calls for the design of perturbations to achieve particular goals. Examples would include, the design of a chemical stimulation to maximize the amplitude of a given cellular signal or to achieve a desired pattern in pattern formation systems, etc. Such design problems can be mathematically formulated as dynamic optimization problems which are particularly challenging when the system is described by partial differential equations. This work addresses the numerical solution of such dynamic optimization problems for spatially distributed biological systems. The usual nonlinear and large scale nature of the mathematical models related to this class of systems and the presence of constraints on the optimization problems, impose a number of difficulties, such as the presence of suboptimal solutions, which call for robust and efficient numerical techniques. RESULTS: Here, the use of a control vector parameterization approach combined with efficient and robust hybrid global optimization methods and a reduced order model methodology is proposed. The capabilities of this strategy are illustrated considering the solution of a two challenging problems: bacterial chemotaxis and the FitzHugh-Nagumo model. CONCLUSIONS: In the process of chemotaxis the objective was to efficiently compute the time-varying optimal concentration of chemotractant in one of the spatial boundaries in order to achieve predefined cell distribution profiles. Results are in agreement with those previously published in the literature. The FitzHugh-Nagumo problem is also efficiently solved and it illustrates very well how dynamic optimization may be used to force a system to evolve from an undesired to a desired pattern with a reduced number of actuators. The presented methodology can be used for the efficient dynamic optimization of generic distributed biological systems.     

Function approximation approach to the inference of reduced NGnet models of genetic networks

Background  

The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of models have been proposed to describe genetic regulatory networks, this study focuses on a set of differential equations since it has the ability to model dynamic behavior of gene expression. When we use a set of differential equations to describe genetic networks, the inference problem can be defined as a function approximation problem. On the basis of this problem definition, we propose in this study a new method to infer reduced NGnet models of genetic networks.     

Parameter identification of the calvin photosynthesis cycle

Summary This article is concerned with the determination of kinetic parameters of the Calvin photosynthesis cycle which is described by seventeen nonlinear ordinary differential equations. It is shown that the task requires dynamic data for several sets of initial conditions. The numerical technique is based upon an algorithm for non-linear optimization and Gear's numerical integration scheme for stiff systems of differential equations. The sensitivity of the parameters to noise in the data is tested with a method adapted from Rosenbrook and Storey. A preliminary set of parameters has been obtained from a preliminary set of experimental data. The numerical methods are then tested with synthetic data derived from these parameters. The mathematical model and the results obtained in the simulation are used as an aid in designing new experiments.     

Static and dynamic optimization solutions for gait are practically equivalent

The proposition that dynamic optimization provides better estimates of muscle forces during gait than static optimization is examined by comparing a dynamic solution with two static solutions. A 23-degree-of-freedom musculoskeletal model actuated by 54 Hill-type musculotendon units was used to simulate one cycle of normal gait. The dynamic problem was to find the muscle excitations which minimized metabolic energy per unit distance traveled, and which produced a repeatable gait cycle. In the dynamic problem, activation dynamics was described by a first-order differential equation. The joint moments predicted by the dynamic solution were used as input to the static problems. In each static problem, the problem was to find the muscle activations which minimized the sum of muscle activations squared, and which generated the joint moments input from the dynamic solution. In the first static problem, muscles were treated as ideal force generators; in the second, they were constrained by their force-length-velocity properties; and in both, activation dynamics was neglected. In terms of predicted muscle forces and joint contact forces, the dynamic and static solutions were remarkably similar. Also, activation dynamics and the force-length-velocity properties of muscle had little influence on the static solutions. Thus, for normal gait, if one can accurately solve the inverse dynamics problem and if one seeks only to estimate muscle forces, the use of dynamic optimization rather than static optimization is currently not justified. Scenarios in which the use of dynamic optimization is justified are suggested.     

Feedback optimization of fed-batch fermentation

The problem of feedback optimization of the feed rate for fed-batch fermentation processes is formulated in the framework of singular control theory and switching hypersurfaces. Using four differential balance equations that describe a general class of fedbatch processes and a general objective function to be minimized, it is shown that under certain restrictions the feedback optimization of the feed rate can be realized as a nonlinear function of the state variables, such as the concentrations of cell mass, substrate and product, and the fermentor volume. The restrictions on the initial conditions, the fermentation kinetics and the objective function, that are needed for realization of the feedback optimization, are provided. Fed-batch fermentation models of lysine and alcohol are used to construct switching curves and to illustrate the feedback optimization of the feed flow rates.     

Efficient parametric analysis of the chemical master equation through model order reduction

ABSTRACT: BACKGROUND: Stochastic biochemical reaction networks are commonly modelled by the chemical master equation, and can be simulated as first order linear differential equations through a finite state projection. Due to the very high state space dimension of these equations, numerical simulations are computationally expensive. This is a particular problem for analysis tasks requiring repeated simulations for different parameter values. Such tasks are computationally expensive to the point of infeasibility with the chemical master equation. RESULTS: In this article, we apply parametric model order reduction techniques in order to construct accurate low-dimensional parametric models of the chemical master equation. These surrogate models can be used in various parametric analysis task such as identifiability analysis, parameter estimation, or sensitivity analysis. As biological examples, we consider two models for gene regulation networks, a bistable switch and a network displaying stochastic oscillations. CONCLUSIONS: The results show that the parametric model reduction yields efficient models of stochastic biochemical reaction networks, and that these models can be useful for systems biology applications involving parametric analysis problems such as parameter exploration, optimization, estimation or sensitivity analysis.     

Feedback identification of continuous microbial growth systems

The fundamental problem of dynamic modeling of continuous culture systems for process control and optimization is addressed. Forcing a system to bifurcation via feedback control is a very promising method for model discrimination and identification. Dynamic information is obtained by using this technique, the dynamic behavior of the chemostat as predicted by unstructured models, the model with delay, and a structured model has been analyzed. The method exposes significant differences in the nonlinear dynamic structure of the various models and can be implemented to discriminate between various possible models for a continuous culture system.     

一类生物种群投资的最优采收控制

在原有的Gauss白噪声刻画环境噪声项的基础上,考虑环境不可预知的跳跃性变化,运用Lévy白噪声建立了有界环境中的随机生物种群模型.并且,引入随机奇异控制来描述投资者的最优采收策略.进一步地,构造一族有着不同起点的控制问题,利用动态规划的思想,给出了最优采收控制问题解的充分条件,进而,将随机控制问题的求解转化为确定型偏微分方程的求解.     

Predictive algorithms for neuromuscular control of human locomotion.

The problem of quantifying muscular activity of the human body can be formulated as an optimal control problem. The current methods used with large-scale biomechanical systems are non-derivative techniques. These methods are costly, as they require numerous integrations of the equations of motion. Additionally, the convergence is slow, making them impractical for use with large systems. We apply an efficient numerical algorithm to the biomechanical optimal control problem. Using direct collocation with a trapezoidal discretization, the equations of motion are converted into a set of algebraic constraint equations. An augmented Lagrangian formulation is used for the optimization problem to handle both equality and inequality constraints. The resulting min-max problem is solved with a generalized Newton method. In contrast to the prevalent optimal control implementations, we calculate analytical first- and second-derivative information and obtain local quadratic convergence. To demonstrate the efficacy of the method, we solve a steady-state pedaling problem with 7 segments and 18 independent muscle groups. The computed muscle activations compare well with experimental EMG data. The computational effort is significantly reduced and solution times are a fraction of those of the non-derivative techniques.     

A general-purpose framework to simulate musculoskeletal system of human body: using a motion tracking approach*

Computation of muscle force patterns that produce specified movements of muscle-actuated dynamic models is an important and challenging problem. This problem is an undetermined one, and then a proper optimization is required to calculate muscle forces. The purpose of this paper is to develop a general model for calculating all muscle activation and force patterns in an arbitrary human body movement. For this aim, the equations of a multibody system forward dynamics, which is considered for skeletal system of the human body model, is derived using Lagrange–Euler formulation. Next, muscle contraction dynamics is added to this model and forward dynamics of an arbitrary musculoskeletal system is obtained. For optimization purpose, the obtained model is used in computed muscle control algorithm, and a closed-loop system for tracking desired motions is derived. Finally, a popular sport exercise, biceps curl, is simulated by using this algorithm and the validity of the obtained results is evaluated via EMG signals.     

Simple nonsingular control approach to fed-batch fermentation optimization

Determination of the optimal feed rate for fed-batch fermentation is normally a problem in singular control with a state inequality constraint and as such is, in general, difficult to solve, especially for those described by a large number of dynamic mass balance equations. In this article we use a new set of state variables and the culture volume as the control variable. In this way the problem is converted to one of nonsingular control with the magnitude and rate constraints on the manipulated variable and can be numerically solved by a gradient-based technique, thus avoiding the difficulty associated with singular control problems. Examples are given to illustrate the method.     

Optimal models for social change

By assigning coordinates to the environmental function space comprising all physical and mental stimuli, mathematical interpretations can be based on such terms as adaptability, and reactivity which relate to individuals interacting with their environment within a society. These psychometric concepts are incorporated into a framework of functional analysis, which permits the optimization of social change by maximizing the satisfaction integral through the use of variational or dynamic programming methods in conjunction with some optimal social policy. The approach provides a mathematical connection between psychology and sociology, and further demonstrates that existing forms of government are simulated by differential equations belonging to the same general class. The synthesis of new classes of functional equations describing social progress is visualized as a legitimate objective for abstract mathematical sociology.     

A method for solution of the multi-objective inverse problems under uncertainty

We describe a method to solve multi-objective inverse problems under uncertainty. The method was tested on non-linear models of dynamic series and population dynamics, as well as on the spatiotemporal model of gene expression in terms of non-linear differential equations. We consider how to identify model parameters when experimental data contain additive noise and measurements are performed in discrete time points. We formulate the multi-objective problem of optimization under uncertainty. In addition to a criterion of least squares difference we applied a criterion which is based on the integral of trajectories of the system spatiotemporal dynamics, as well as a heuristic criterion CHAOS based on the decision tree method. The optimization problem is formulated using a fuzzy statement and is constrained by penalty functions based on the normalized membership functions of a fuzzy set of model solutions. This allows us to reconstruct the expression pattern of hairy gene in Drosophila even-skipped mutants that is in good agreement with experimental data. The reproducibility of obtained results is confirmed by solution of inverse problems using different global optimization methods with heuristic strategies.     

Evolutionary optimization with data collocation for reverse engineering of biological networks

MOTIVATION: Modern experimental biology is moving away from analyses of single elements to whole-organism measurements. Such measured time-course data contain a wealth of information about the structure and dynamic of the pathway or network. The dynamic modeling of the whole systems is formulated as a reverse problem that requires a well-suited mathematical model and a very efficient computational method to identify the model structure and parameters. Numerical integration for differential equations and finding global parameter values are still two major challenges in this field of the parameter estimation of nonlinear dynamic biological systems. RESULTS: We compare three techniques of parameter estimation for nonlinear dynamic biological systems. In the proposed scheme, the modified collocation method is applied to convert the differential equations to the system of algebraic equations. The observed time-course data are then substituted into the algebraic system equations to decouple system interactions in order to obtain the approximate model profiles. Hybrid differential evolution (HDE) with population size of five is able to find a global solution. The method is not only suited for parameter estimation but also can be applied for structure identification. The solution obtained by HDE is then used as the starting point for a local search method to yield the refined estimates.     

DOTcvpSB, a software toolbox for dynamic optimization in systems biology

Background  

Mathematical optimization aims to make a system or design as effective or functional as possible, computing the quality of the different alternatives using a mathematical model. Most models in systems biology have a dynamic nature, usually described by sets of differential equations. Dynamic optimization addresses this class of systems, seeking the computation of the optimal time-varying conditions (control variables) to minimize or maximize a certain performance index. Dynamic optimization can solve many important problems in systems biology, including optimal control for obtaining a desired biological performance, the analysis of network designs and computer aided design of biological units.     

A 'cheap' optimal control approach to estimate muscle forces in musculoskeletal systems

This paper shows a new method to estimate the muscle forces in musculoskeletal systems based on the inverse dynamics of a multi-body system associated optimal control. The redundant actuator problem is solved by minimizing a time-integral cost function, augmented with a torque-tracking error function, and muscle dynamics is considered through differential constraints. The method is compared to a previously implemented human posture control problem, solved using a Forward Dynamics Optimal Control approach and to classical static optimization, with two different objective functions. The new method provides very similar muscle force patterns when compared to the forward dynamics solution, but the computational cost is much smaller and the numerical robustness is increased. The results achieved suggest that this method is more accurate for the muscle force predictions when compared to static optimization, and can be used as a numerically 'cheap' alternative to the forward dynamics and optimal control in some applications.