Determination of structurally constrained controllors

This paper reports on determination of structurally constrained controllers for linear uncertain time-invariant systems from state controllers. It is shown that practical structures such as output and decentralized controllers may be derived from state feedback controllers. A previously studied load frequency control of a two-area interconnected power system is considered to illustrate the proposed approach.

Constrained pole placement for linear systems using low-order output feedback controllers

The paper presents a simple approach to the problem of designing low-order output feedback controllers for linear continuous systems. The controller can place all of the closed-loop poles within a circle, C(- , 1/ β) , with centre at - and radius of 1/ β in the left half s-plane. The design method is based on transformation of the original system and then applying the bounded-real-lemma to the transformed system. It is shown that subjected to the solvability of an algebraic Riccati equation (ARE), output feedback controllers can then be systematically derived. Furthermore, the order of the controller is low and equals only the number of the open-loop poles lying outside the circle. A step-by-step design algorithm is given. Numerical examples are given to illustrate the design method.

Constrained coordinated distributed control of smart grid with asynchronous information exchange

Smart grid constrained optimal control is a complex issue due to the constant growth of grid complexity and the large volume of data available as input to smart device control. In this context, traditional centralized control paradigms may suffer in terms of the timeliness of optimization results due to the volume of data to be processed and the delayed asynchronous nature of the data transmission. To address these limits of centralized control, this paper presents a coordinated, distributed algorithm based on distributed, local controllers and a central coordinator for exchanging summarized global state information. The proposed model for exchanging global state information is resistant to fluctuations caused by the inherent interdependence between local controllers, and is robust to delays in information exchange. In addition, the algorithm features iterative refinement of local state estimations that is able to improve local controller ability to operate within network constraints. Application of the proposed coordinated, distributed algorithm through simulation shows its effectiveness in optimizing a global goal within a complex distribution system operating under constraints, while ensuring network operation stability under varying levels of information exchange delay, and with a range of network sizes.

Cutting angle method - a tool for constrained global optimization

Cutting angle method (CAM) is a deterministic global optimization technique applicable to Lipschitz functions f: Rn → R. The method builds a sequence of piecewise linear lower approximations to the objective function f. The sequence of solutions to these relaxed problems converges to the global minimum of f. This article adapts CAM to the case of linear constraints on the feasible domain. We show how the relaxed problems are modified, and how the numerical efficiency of solving these problems can be preserved. A number of numerical experiments confirms the improved numerical efficiency.

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

This paper considers the Cardinality Constrained Quadratic Knapsack Problem (QKP) and the Quadratic Selective Travelling Salesman Problem (QSTSP). The QKP is a generalization of the Knapsack Problem and the QSTSP is a generalization of the Travelling Salesman Problem. Thus, both problems are NP hard. The QSTSP and the QKP can be solved using branch-and-cut methods. Good bounds can be obtained if strong constraints are used. Hence it is important to identify strong or even facet-defining constraints. This paper studies the polyhedral combinatorics of the QSTSP and the QKP, i.e. amongst others we identify facet-defining constraints for the QSTSP and the QKP, and provide mathematical proofs that they do indeed define facets.

Fuzzy terminal attitude guidance controller with angle only measurements

This paper introduces the concept of terminal attitude guidance as an alternative to precision guidance and uses fuzzy control ideas in designing a control strategy for a pursuer in countering a manoeuvreing target. The fuzzy controller uses only angle measurements in the control strategy and produces satisfactory results in comparison to the LQR or H∞ type guidance controllers, although they were addressed in a precision guidance context. Both 2D and 3D cases have been considered.

New cutting-planes for the time-and/or precedence-constrained ATSP and directed VRP

In this paper, we introduce five classes of new valid cutting planes for the precedence-constrained (PC) and/or time-window-constrained (TW) Asymmetric Travelling Salesman Problems (ATSPs) and directed Vehicle Routing Problems (VRPs). We show that all five classes of new inequalities are facet-defining for the directed VRP-TW, under reasonable conditions and the assumption that vehicles are identical. Similar proofs can be developed for the VRP-PC. As ATSP-TW and PC-ATSP can be formulated as directed identical-vehicle VRP-TW and PC-VRP, respectively, this provides a link to study the polyhedral combinatorics for the ATSP-TW and PC-ATSP. The first four classes of these new cutting planes are cycle-breaking inequalities that are lifted from the well-known D^-_k and D⁺_k inequalities (see Grötschel and Padberg in Polyhedral theory. The traveling salesman problem: a guided tour of combinatorial optimization, Wiley, New York, 1985). The last class of new cutting planes, the TW ₂ inequalities, are infeasible-path elimination inequalities. Separation of these constraints will also be discussed. We also present prelimanry numerical results to demonstrate the strengh of these new cutting planes.

Eccentricity and hardness control in cold rolling mills with a dynamically constructed neural controller

The main objective of a steel strip rolling process is to produce high quality steel at a desired thickness.  Thickness reduction is the result of the speed difference between the incoming and the outgoing steel strip and the application of the large normal forces via the backup and the work rolls.  Gauge control of a cold rolled steel strip is achieved using the gaugemeter principle that works adequately for the input gauge changes and the strip hardness changes.  However, the compensation of some factors is problematic, for example, eccentricity of the backup rolls.  This cyclic eccentricity effect causes a gauge deviation, but more importantly, a signal is passed to the gap position control so to increase the eccentricity deviation.  Consequently, the required high product tolerances are severely limited by the presence of the roll eccentricity effects.
In this paper a direct model reference adaptive control (MRAC) scheme with dynamically constructed neural controller was used.  The aim here is to find the simplest controller structure capable of achieving an optimal performance.  The stability of the adaptive neural control scheme (i.e. the requirement of persistency of excitation and bounded learning rates) is addressed by using as the inputs to the reference model the plant's state variables.  In such a case, excitation is due to actual plant signals (states) affected by plant disturbances and noise.  In addition, a reference model in the form of a filter with a desired transfer function using Modulus Optimum design was used to ensure variance in the desired dynamic characteristics of the system.  The gradually decreasing learning rate employed by the neural controller in this paper is aimed at eliminating controller instability resulting from over-aggressive control.  The moving target problem (i.e. the difficulty of global neural networks to perfrom several separate computational tasks in closed -loop control) is addressed by the localized architecture of the controller.  The above control scheme and learning algorithm offers a method for automatic discovery of an efficient controller.
The resulting neural controller produces an excellent disturbance rejection in both cases of eccentricity and hardness disturbances, reducing the gauge deviation due to eccentricity disturbance from 33.36% to 4.57% on average, and the gauge deviation due to hardness disturbance from 12.59% to 2.08%.

An alternative approach to understanding second-order conditions for constrained optimization - lagrange multipliers

This paper presents an alternative approach to solving a standard problem, frequently encountered in advanced microeconomics, using the technique of Lagrange multipliers. The objective is to enhance the understanding of students as to the derivation of the second-order conditions.

Controller area network (CAN) modelling for automotive body control applications

This research details methods to improve upon current worst-case message response time analysis of CAN networks. Also, through the development of a CAN network model, and using modern simulation software, methods were shown to provide more realistic analyses of both sporadic and periodic messages on CAN networks prior to implementation.

Bearing-only localization using geometrically constrained optimization

We examine the problem of optimal bearing-only localization of a single target using synchronous measurements from multiple sensors. We approach the problem by forming geometric relationships between the measured parameters and their corresponding errors in the relevant emitter localization scenarios. Specifically, we derive a geometric constraint equation on the measurement errors in such a scenario. Using this constraint, we formulate the localization task as a constrained optimization problem that can be performed on the measurements in order to provide the optimal values such that the solution is consistent with the underlying geometry. We illustrate and confirm the advantages of our approach through simulation, offering detailed comparison with traditional maximum likelihood (TML) estimation.