A Probabilistic Theory for Balance Dynamics

2008 ◽  
Vol 65 (9) ◽  
pp. 2949-2960 ◽  
Author(s):  
Gregory J. Hakim

Abstract Balance dynamics are proposed in a probabilistic framework, assuming that the state variables and the master, or control, variables are random variables described by continuous probability density functions. Balance inversion, defined as recovering the state variables from the control variables, is achieved through Bayes’ theorem. Balance dynamics are defined by the propagation of the joint probability of the state and control variables through the Liouville equation. Assuming Gaussian statistics, balance inversion reduces to linear regression of the state variables onto the control variables, and assuming linear dynamics, balance dynamics reduces to a Kalman filter subject to perfect observations given by the control variables. Example solutions are given for an elliptical vortex in shallow water having unity Rossby and Froude numbers, which produce an outward-propagating pulse of inertia–gravity wave activity. Applying balance inversion to the potential vorticity reveals that, because potential vorticity and divergence share well-defined patterns of covariability, the inertia–gravity wave field is recovered in addition to the vortical field. Solutions for a probabilistic balance dynamics model applied to the elliptical vortex reveal smaller errors (“imbalance”) for height control compared to potential vorticity control. Important attributes of the probabilistic balance theory include quantification of the concept of balance manifold “fuzziness,” and clear state-independent definitions of balance and imbalance in terms of the range of the probabilistic inversion operators. Moreover, the theory provides a generalization of the notion of balance that may prove useful for problems involving moist physics, chemistry, and tropical circulations.

2008 ◽  
Vol 16 (1) ◽  
pp. 36-41 ◽  
Author(s):  
Cândida Caniçali Primo ◽  
Maria Helena Costa Amorim

This experimental study aimed to evaluate the effect of relaxation techniques on anxiety levels, and the relation between anxiety and the concentration of Immunoglobulin A. The study was carried out in a maternity hospital in a city of the State of Espírito Santo, Brazil. The sample was composed of 60 puerperae. The information on the variables: age, education, marital status, type of childbirth, and parity were collected with a specific form; the trait and state of anxiety were based on the State Trait Anxiety Inventory (STAI/IDATE); and the level of salivary IgA was obtained through immunoturbidimetry. The application of the Mann-Whitney, Wilcoxon, and Pearson's correlation statistical tests showed a significant reduction in the levels of the state of anxiety in the experimental group (p = 0.01); there was no correlation between the trait and state variables of anxiety and the salivary IgA level; both groups (experimental and control) showed trait and state of medium-intensity anxiety.


2011 ◽  
Vol 1 ◽  
pp. 387-394 ◽  
Author(s):  
Zhen Yu Han ◽  
Shu Rong Li

This paper presents a numerical method based on quasilinearization and rationalized Haar functions for solving nonlinear optimal control problems including terminal state constraints, state and control inequality constraints. The optimal control problem is converted into a sequence of quadratic programming problems. The rationalized Haar functions with unknown coefficients are used to approximate the control variables and the derivative of the state variables. By adding artificial controls, the number of state and control variables is equal. Then the quasilinearization method is used to change the nonlinear optimal control problems with a sequence of constrained linear-quadratic optimal control problems. To show the effectiveness of the proposed method, the simulation results of two constrained nonlinear optimal control problems are presented.


2011 ◽  
Vol 10 (5) ◽  
pp. 1241-1256 ◽  
Author(s):  
Guo-Kang Er ◽  
Vai Pan Iu

AbstractThe probabilistic solutions of the nonlinear stochastic dynamic (NSD) systems with polynomial type of nonlinearity are investigated with the subspace-EPC method. The space of the state variables of large-scale nonlinear stochastic dynamic system excited by white noises is separated into two subspaces. Both sides of the Fokker-Planck-Kolmogorov (FPK) equation corresponding to the NSD system is then integrated over one of the subspaces. The FPK equation for the joint probability density function of the state variables in another subspace is formulated. Therefore, the FPK equation in low dimensions is obtained from the original FPK equation in high dimensions and it makes the problem of obtaining the probabilistic solutions of large-scale NSD systems solvable with the exponential polynomial closure method. Examples about the NSD systems with polynomial type of nonlinearity are given to show the effectiveness of the subspace-EPC method in these cases.


2021 ◽  
pp. 41-50
Author(s):  
Hasan A. Nagiyev ◽  
Nyubar A. Guliyeva

A reaction-regeneration system is described, which is a hardware part of industrial production and is characterized by an exceptional feature – pronounced nonlinearity in the form of a plurality of stationary solutions of model differential equations. This feature forces one to resort to engineering solutions that are alternative to direct measurements. The problem of indirect estimation of the components of the state vector of the reaction-regeneration system is considered. The incorrectness of the indirect assessment of the state of such objects on the basis of the theory of Kalman filters is shown. The incorrectness is due to the ambiguity of the mapping of the state space into the space of vectors tangent to the trajectories. An approach based on synchronous simulation in dynamics is proposed, which consists in comparing two evolutions “object – model” with minimization of the mismatch. A technique based on the inclusion of the second derivatives of the state variables into the mismatch function is presented. The methodology of the sensitivity of indirect estimation systems based on maximizing the similarity of the compared evolutions “object – model” in the regime of strict synchronization with respect to external disturbances and control levers is considered. It is shown that the accuracy of the indirect estimation of physically unmeasurable coordinates is largely determined by the mathematical aspects of minimizing the mismatch function, which, due to the multiplicity of solutions to model equations, has a complex structure of the response surface.


Author(s):  
Didar Murad ◽  
Noor Badshah ◽  
Muhammad Ali Syed

Background and Objective: For dengue outbreak prevention and vectors reduction, fundamental role of control parameters like vaccination against dengue virus in human population and insecticide in mosquito population have been addressed theoretically and numerically. For this purpose, an existing model was modified to optimize dengue fever. Methodology: Using Pontryagin’s maximum principle, the dynamics of infection for the optimal control problem was addressed, further, defined cost functional, established existence of optimal control, stated Hamiltonian for characterization of optimization. Results: Numerical simulations for optimal state variables and control variables were performed. Conclusion: Our findings demonstrate that with low cost of control variables, state variable such as recovered population increases gradually and decrease other state variables for host and vector population.


2018 ◽  
Vol 62 ◽  
pp. 579-664 ◽  
Author(s):  
Enrique Fernandez-Gonzalez ◽  
Brian Williams ◽  
Erez Karpas

The state of the art practice in robotics planning is to script behaviors manually, where each behavior is typically generated using trajectory optimization. However, in order for robots to be able to act robustly and adapt to novel situations, they need to plan these activity sequences autonomously. Since the conditions and effects of these behaviors are tightly coupled through time, state and control variables, many problems require that the tasks of activity planning and trajectory optimization are considered together. There are two key issues underlying effective hybrid activity and trajectory planning: the sufficiently accurate modeling of robot dynamics and the capability of planning over long horizons. Hybrid activity and trajectory planners that employ mixed integer programming within a discrete time formulation are able to accurately model complex dynamics for robot vehicles, but are often restricted to relatively short horizons. On the other hand, current hybrid activity planners that employ continuous time formulations can handle longer horizons but they only allow actions to have continuous effects with constant rate of change, and restrict the allowed state constraints to linear inequalities. This is insufficient for many robotic applications and it greatly limits the expressivity of the problems that these approaches can solve. In this work we present the ScottyActivity planner, that is able to generate practical hybrid activity and motion plans over long horizons by employing recent methods in convex optimization combined with methods for planning with relaxed plan graphs and heuristic forward search. Unlike other continuous time planners, ScottyActivity can solve a broad class of robotic planning problems by supporting convex quadratic constraints on state variables and control variables that are jointly constrained and that affect multiple state variables simultaneously. In order to support planning over long horizons, ScottyActivity does not resort to time, state or control variable discretization. While straightforward formulations of consistency checks are not convex and do not scale, we present an efficient convex formulation, in the form of a Second Order Cone Program (SOCP), that is very fast to solve. We also introduce several new realistic domains that demonstrate the capabilities and scalability of our approach, and their simplified linear versions, that we use to compare with other state of the art planners. This work demonstrates the power of integrating advanced convex optimization techniques with discrete search methods and paves the way for extensions dealing with non-convex disjoint constraints, such as obstacle avoidance.


Sign in / Sign up

Export Citation Format

Share Document