972 resultados para Optimal placements
Resumo:
This paper develops a technique for improving the region of attraction of a robust variable horizon model predictive controller. It considers a constrained discrete-time linear system acted upon by a bounded, but unknown time-varying state disturbance. Using constraint tightening for robustness, it is shown how the tightening policy, parameterised as direct feedback on the disturbance, can be optimised to increase the volume of an inner approximation to the controller's true region of attraction. Numerical examples demonstrate the benefits of the policy in increasing region of attraction volume and decreasing the maximum prediction horizon length. © 2012 IEEE.
Resumo:
This paper is concerned with time-domain optimal control of active suspensions. The optimal control problem formulation has been generalised by incorporating both road disturbances (ride quality) and a representation of driver inputs (handling quality) into the optimal control formulation. A regular optimal control problem as well as a risk-sensitive exponential optimal control performance index is considered. Emphasis has been given to practical considerations including the issue of state estimation in the presence of load disturbances (driver inputs). © 2012 IEEE.
Resumo:
We solve the problem of steering a three-level quantum system from one eigen-state to another in minimum time and study its possible extension to the time-optimal control problem for a general n-level quantum system. For the three-level system we find all optimal controls by finding two types of symmetry in the problem: ℤ2 × S3 discrete symmetry and S1 continuous symmetry, and exploiting them to solve the problem through discrete reduction and symplectic reduction. We then study the geometry, in the same framework, which occurs in the time-optimal control of a general n-level quantum system. © 2007 IEEE.
Resumo:
We solve the problem of steering a three-level quantum system from one eigen-state to another in minimum time and study its possible extension to the time-optimal control problem for a general n-level quantum system. For the three-level system we find all optimal controls by finding two types of symmetry in the problems: ℤ × S3 discrete symmetry and 51 continuous symmetry, and exploiting them to solve the problem through discrete reduction and symplectic reduction. We then study the geometry, in the same framework, which occurs in the time-optimal control of a general n-level quantum system. Copyright ©2007 Watam Press.
Resumo:
The numbers of spawning sites for Chinese sturgeon have been drastically reduced since the construction of the Gezhouba Dam across the Yangtze River. This dam has blocked migration of Chinese sturgeon to their historic spawning ground causing a significant decline of the Chinese sturgeon population. We conducted a VORTEX population viability analysis to estimate the sustainability of the population and to quantify the efficiency of current and alternative conservation procedures. The model predicted the observed decline of Chinese sturgeon, resulting from the effect of the Gezhouba Dam. These simulations demonstrated the potential interest of two conservation measures: increasing spawning area and reducing predation on sturgeon eggs. The simulations also demonstrated that the actual restocking program is not sufficient to sustain sturgeon population as the artificial reproduction program induce the loss of more wild mature adults that the recruitment expected by the artificial reproduction.
Optimal displacement mechanisms beneath shallow foundations on linear-elastic perfectly plastic soil
Resumo:
An energy method for a linear-elastic perfectly plastic method utilising the von Mises yield criterion with associated flow developed in 2013 by McMahon and co-workers is used to compare the ellipsoidal cavity-expansion mechanism, from the same work, and the displacement fields of other research by Levin, in 1995, and Osman and Bolton, in 2005, which utilise the Hill and Prandtl mechanisms respectively. The energy method was also used with a mechanism produced by performing a linear-elastic finite-element analysis in Abaqus. At small values of settlement and soil rigidity the elastic mechanism provides the lowest upper-bound solution, and matches well with finite-element analysis results published in the literature. At typical footing working loads and settlements the cavity-expansion mechanism produces a more optimal solution than the displacement fields within the Hill and Prandtl mechanisms, and also matches well with the published finite-element analysis results in this range. Beyond these loads, at greater footing settlements, or soil rigidity, the Prandtl mechanism is shown to be the most appropriate.
Resumo:
This work considers the problem of fitting data on a Lie group by a coset of a compact subgroup. This problem can be seen as an extension of the problem of fitting affine subspaces in n to data which can be solved using principal component analysis. We show how the fitting problem can be reduced for biinvariant distances to a generalized mean calculation on an homogeneous space. For biinvariant Riemannian distances we provide an algorithm based on the Karcher mean gradient algorithm. We illustrate our approach by some examples on SO(n). © 2010 Springer -Verlag Berlin Heidelberg.
Resumo:
A venerable history of classical work on autoassociative memory has significantly shaped our understanding of several features of the hippocampus, and most prominently of its CA3 area, in relation to memory storage and retrieval. However, existing theories of hippocampal memory processing ignore a key biological constraint affecting memory storage in neural circuits: the bounded dynamical range of synapses. Recent treatments based on the notion of metaplasticity provide a powerful model for individual bounded synapses; however, their implications for the ability of the hippocampus to retrieve memories well and the dynamics of neurons associated with that retrieval are both unknown. Here, we develop a theoretical framework for memory storage and recall with bounded synapses. We formulate the recall of a previously stored pattern from a noisy recall cue and limited-capacity (and therefore lossy) synapses as a probabilistic inference problem, and derive neural dynamics that implement approximate inference algorithms to solve this problem efficiently. In particular, for binary synapses with metaplastic states, we demonstrate for the first time that memories can be efficiently read out with biologically plausible network dynamics that are completely constrained by the synaptic plasticity rule, and the statistics of the stored patterns and of the recall cue. Our theory organises into a coherent framework a wide range of existing data about the regulation of excitability, feedback inhibition, and network oscillations in area CA3, and makes novel and directly testable predictions that can guide future experiments.
Resumo:
We study the optimal teleportation based on Bell measurements via the thermal states of a two-qubit Heisenberg XXX chain in the presence of the Dzyaloshinsky-Moriya (DM) anisotropic antisymmetric interaction and obtain an optimal unitary transformation. The explicit expressions of the output state and the teleportation fidelity are presented and compared with those of the standard protocol. It is shown that in this protocol the teleportation fidelity is always larger and the unit fidelity is achieved at zero temperature. The DM interaction can enhance the teleportation fidelity at finite temperatures, as opposed to the effect of the interaction in the standard protocol. Cases with other types of anisotropies are also discussed. Copyright (C) EPLA, 2009