34 resultados para Murray-Darling
Resumo:
This article introduces Periodically Controlled Hybrid Automata (PCHA) for modular specification of embedded control systems. In a PCHA, control actions that change the control input to the plant occur roughly periodically, while other actions that update the state of the controller may occur in the interim. Such actions could model, for example, sensor updates and information received from higher-level planning modules that change the set point of the controller. Based on periodicity and subtangential conditions, a new sufficient condition for verifying invariant properties of PCHAs is presented. For PCHAs with polynomial continuous vector fields, it is possible to check these conditions automatically using, for example, quantifier elimination or sum of squares decomposition. We examine the feasibility of this automatic approach on a small example. The proposed technique is also used to manually verify safety and progress properties of a fairly complex planner-controller subsystem of an autonomous ground vehicle. Geometric properties of planner-generated paths are derived which guarantee that such paths can be safely followed by the controller. © 2012 ACM.
Resumo:
This paper introduces Periodically Controlled Hybrid Automata (PCHA) for describing a class of hybrid control systems. In a PCHA, control actions occur roughly periodically while internal and input actions may occur in the interim changing the discrete-state or the setpoint. Based on periodicity and subtangential conditions, a new sufficient condition for verifying invariance of PCHAs is presented. This technique is used in verifying safety of the planner-controller subsystem of an autonomous ground vehicle, and in deriving geometric properties of planner generated paths that can be followed safely by the controller under environmental uncertainties.
Resumo:
This paper considers a group of agents that aim to reach an agreement on individually received time-varying signals by local communication. In contrast to static network averaging problem, the consensus considered in this paper is reached in a dynamic sense. A discrete-time dynamic average consensus protocol can be designed to allow all the agents tracking the average of their reference inputs asymptotically. We propose a minimal-time dynamic consensus algorithm, which only utilises a minimal number of local observations of a randomly picked node in a network to compute the final consensus signal. Our results illustrate that with memory and computational ability, the running time of distributed averaging algorithms can be indeed improved dramatically as suggested by Olshevsky and Tsitsiklis. © 2012 AACC American Automatic Control Council).
Resumo:
Ba1.6Ca2.3Y1.1Fe5O13 is an Fe3+ oxide adopting a complex perovskite superstructure, which is an ordered intergrowth between the Ca2Fe2O5 and YBa2Fe3O8 structures featuring octahedral, square pyramidal, and tetrahedral B sites and three distinct A site environments. The distribution of A site cations was evaluated by combined neutron and X-ray powder diffraction. Consistent with the Fe3+ charge state, the material is an antiferromagnetic insulator with a Néel temperature of 480-485 °C and has a relatively low d.c. conductivity of 2.06 S cm-1 at 700 °C. The observed area specific resistance in symmetrical cell cathodes with the samarium-doped ceria electrolyte is 0.87 Ω cm2 at 700 °C, consistent with the square pyramidal Fe3+ layer favoring oxide ion formation and mobility in the oxygen reduction reaction. Density functional theory calculations reveal factors favoring the observed cation ordering and its influence on the electronic structure, in particular the frontier occupied and unoccupied electronic states. © 2010 American Chemical Society.