Position control of DC motors with experience mapping based prediction controller

The paper presents a new controller inspired by the human experience based, voluntary body action control (dubbed motor control) learning mechanism. The controller is called Experience Mapping based Prediction Controller (EMPC). EMPC is designed with auto-learning features without the need for the plant model. The core of the controller is formed around the motor action prediction-control mechanism of humans based on past experiential learning with the ability to adapt to environmental changes intelligently. EMPC is utilized for high precision position control of DC motors. The simulation results are presented to show that accurate position control is achieved using EMPC for step and dynamic demands. The performance of EMPC is compared with conventional PD controller and MRAC based position controller under different system conditions. Position Control using EMPC is practically implemented and the results are presented.

Gonadotropin regulation of rat ovarian lysosomes: Existence of a hormone specific dual control mechanism

Gonadotropic hormones PMSG (15 IU/rat), FSH (3 mgrg/rat), LH (9 mgrg/rat) and hCG (3 mgrg/rat) were shown to decrease the free cytosolic lysosomal enzymes during the acute phase of hormone action in rat ovaries. When isolated cells from such rats were analyzed for the cathepsin-D activity, the granulosa cells of the ovary showed a reduction in the free as well as in the total lysosomal enzyme activities in response to FSH/PMSG; the stromal and thecal compartment of the ovary showed a reduction only in the free activity in response to hCG/PMSG. The results suggest the presence of two distinct, target cell specific, mechanisms by which the lysosmal activity of the ovary is regulated by gonadotropins.

A single network adaptive critic (SNAC) architecture for optimal control synthesis for a class of nonlinear systems

Even though dynamic programming offers an optimal control solution in a state feedback form, the method is overwhelmed by computational and storage requirements. Approximate dynamic programming implemented with an Adaptive Critic (AC) neural network structure has evolved as a powerful alternative technique that obviates the need for excessive computations and storage requirements in solving optimal control problems. In this paper, an improvement to the AC architecture, called the �Single Network Adaptive Critic (SNAC)� is presented. This approach is applicable to a wide class of nonlinear systems where the optimal control (stationary) equation can be explicitly expressed in terms of the state and costate variables. The selection of this terminology is guided by the fact that it eliminates the use of one neural network (namely the action network) that is part of a typical dual network AC setup. As a consequence, the SNAC architecture offers three potential advantages: a simpler architecture, lesser computational load and elimination of the approximation error associated with the eliminated network. In order to demonstrate these benefits and the control synthesis technique using SNAC, two problems have been solved with the AC and SNAC approaches and their computational performances are compared. One of these problems is a real-life Micro-Electro-Mechanical-system (MEMS) problem, which demonstrates that the SNAC technique is applicable to complex engineering systems.

Optimal control of arrivals to queues with delayed queue length information

We consider discrete-time versions of two classical problems in the optimal control of admission to a queueing system: i) optimal routing of arrivals to two parallel queues and ii) optimal acceptance/rejection of arrivals to a single queue. We extend the formulation of these problems to permit a k step delay in the observation of the queue lengths by the controller. For geometric inter-arrival times and geometric service times the problems are formulated as controlled Markov chains with expected total discounted cost as the minimization objective. For problem i) we show that when k = 1, the optimal policy is to allocate an arrival to the queue with the smaller expected queue length (JSEQ: Join the Shortest Expected Queue). We also show that for this problem, for k greater than or equal to 2, JSEQ is not optimal. For problem ii) we show that when k = 1, the optimal policy is a threshold policy. There are, however, two thresholds m(0) greater than or equal to m(1) > 0, such that mo is used when the previous action was to reject, and mi is used when the previous action was to accept.

Reinforcement Learning With Function Approximation for Traffic Signal Control

We propose, for the first time, a reinforcement learning (RL) algorithm with function approximation for traffic signal control. Our algorithm incorporates state-action features and is easily implementable in high-dimensional settings. Prior work, e. g., the work of Abdulhai et al., on the application of RL to traffic signal control requires full-state representations and cannot be implemented, even in moderate-sized road networks, because the computational complexity exponentially grows in the numbers of lanes and junctions. We tackle this problem of the curse of dimensionality by effectively using feature-based state representations that use a broad characterization of the level of congestion as low, medium, or high. One advantage of our algorithm is that, unlike prior work based on RL, it does not require precise information on queue lengths and elapsed times at each lane but instead works with the aforementioned described features. The number of features that our algorithm requires is linear to the number of signaled lanes, thereby leading to several orders of magnitude reduction in the computational complexity. We perform implementations of our algorithm on various settings and show performance comparisons with other algorithms in the literature, including the works of Abdulhai et al. and Cools et al., as well as the fixed-timing and the longest queue algorithms. For comparison, we also develop an RL algorithm that uses full-state representation and incorporates prioritization of traffic, unlike the work of Abdulhai et al. We observe that our algorithm outperforms all the other algorithms on all the road network settings that we consider.

Towards the concept of hydrodynamic cavitation control

A careful study of the existing literature available in the field of cavitation reveals the potential of ultrasonics as a tool for controlling and, if possible, eliminating certain types of hydrodynamic cavitation through the manipulation of nuclei size present in a flow. A glass venturi is taken to be an ideal device to study the cavitation phenomenon at its throat and its potential control. A piezoelectric transducer, driven at the crystal resonant frequency, is used to generate an acoustic pressure field and is termed an �ultrasonic nuclei manipulator (UNM)�. Electrolysis bubbles serve as artificial nuclei to produce travelling bubble cavitation at the venturi throat in the absence of a UNM but this cavitation is completely eliminated when a UNM is operative. This is made possible because the nuclei, which pass through the acoustic field first, cavitate, collapse violently and perhaps fragment and go into dissolution before reaching the venturi throat. Thus, the potential nuclei for travelling bubble cavitation at the venturi throat seem to be systematically destroyed through acoustic cavitation near the UNM. From the solution to the bubble dynamics equation, it has been shown that the potential energy of a bubble at its maximum radius due to an acoustic field is negligible compared to that for the hydrodynamic field. Hence, even though the control of hydrodynamic macro cavitation achieved in this way is at the expense of acoustic micro cavitation, it can still be considered to be a significant gain. These are some of the first results in this direction.

Flexible implementation of power system corrective topology control

This paper proposes a novel decision making framework for optimal transmission switching satisfying the AC feasibility, stability and circuit breaker (CB) reliability requirements needed for practical implementation. The proposed framework can be employed as a corrective tool in day to day operation planning scenarios in response to potential contingencies. The switching options are determined using an efficient heuristic algorithm based on DC optimal power flow, and are presented in a multi-branch tree structure. Then, the AC feasibility and stability checks are conducted and the CB condition monitoring data are employed to perform a CB reliability and line availability assessment. Ultimately, the operator will be offered multiple AC feasible and stable switching options with associated benefits. The operator can use this information, other operating conditions not explicitly considered in the optimization, and his/her own experience to implement the best and most reliable switching action(s). The effectiveness of the proposed approach is validated on the IEEE-118 bus test system. (C) 2015 Elsevier B.V. All rights reserved.