Identification of dynamic systems under closed-loop control

This paper introduces a novel modelling framework for identifying dynamic models of systems that are under feedback control. These models are identified under closed-loop conditions and produce a joint representation that includes both the plant and controller models in state space form. The joint plant/controller model is identified using subspace model identification (SMI), which is followed by the separation of the plant model from the identified one. Compared to previous research, this work (i) proposes a new modelling framework for identifying closed-loop systems, (ii) introduces a generic structure to represent the controller and (iii) explains how that the new framework gives rise to a simplified determination of the plant models. In contrast, the use of the conventional modelling approach renders the separation of the plant model a difficult task. The benefits of using the new model method are demonstrated using a number of application studies.

Improvement of the Performance of Hysteresis Compensation in SMA Actuators by Using Inverse Preisach Model in Closed – Loop Control System

The aim of this paper is to increase the performance of hysteresis compensation for Shape Memory Alloy (SMA) actuators by using inverse Preisach model in closed — loop control system. This is used to reduce hysteresis effects and improve accuracy for the displacement of SMA actuators. Firstly, hysteresis is identified by numerical Preisach model implementation. The geometrical interpretation from first order transition curves is used for hysteresis modeling. Secondly, the inverse Preisach model is formulated and incorporated in closed-loop PID control system in order to obtain desired current-to-displacement relationship with hysteresis reducing. The experimental results for hysteresis compensation by using this method are also shown in this paper.

The Bright Side of Manufacturing–Remanufacturing Conflict in a Decentralised Closed-Loop Supply Chain

Researchers and managers broadly agree that original equipment manufacturers (OEMs), which have opportunities to produce both new and remanufactured products, are better off by centrally controlling their manufacturing and remanufacturing activities. Thus, OEMs should not remanufacture used products until the remanufacturing cost is sufficiently low to overcome the negative impact of new product cannibalisation. In this paper, we present a contrasting view of the manufacturing–remanufacturing conflict: OEMs sometimes benefit from the decentralised control mode under which they ignore the internal cannibalisation rather than the remanufacturing option. We consider a decentralised closed-loop supply chain in which one OEM can purchase new components from one supplier to produce new products and collect used products from consumers to produce remanufactured products. The key feature of our model is that the OEM can select a centralised or decentralised control mode to manage its manufacturing and remanufacturing activities before the supplier prices the new component. In a steady state period setting, we analyse the players’ optimal decisions and compare the OEM's profits under centralised and decentralised control modes. Our analytic results reveal that the decentralised control within the OEM can outperform the centralised control when the cost structure of producing new and remanufactured products satisfies certain conditions. Finally, the key findings are distilled in a conceptual framework and its managerial implications are discussed.

Distributed closed-loop spatial multiplexing for uplink multiuser systems

Focusing on the uplink, where mobile users (each with a single transmit antenna) communicate with a base station with multiple antennas, we treat multiple users as antennas to enable spatial multiplexing across users. Introducing distributed closed-loop spatial multiplexing with threshold-based user selection, we propose two uplink channel-assigning strategies with limited feedback. We prove that the proposed system also outperforms the standard greedy scheme with respect to the degree of fairness, measured by the variance of the time averaged throughput. For uplink multi-antenna systems, we show that the proposed scheduling is a better choice than the greedy scheme in terms of the average BER, feedback complexity, and fairness. The numerical results corroborate our findings

Threshold-based substream selection for closed-loop spatial multiplexing

We propose a low-complexity closed-loop spatial multiplexing method with limited feedback over multi-input-multi-output (MIMO) fading channels. The transmit adaptation is simply performed by selecting transmit antennas (or substreams) by comparing their signal-to-noise ratios to a given threshold with a fixed nonadaptive constellation and fixed transmit power per substream. We analyze the performance of the proposed system by deriving closed-form expressions for spectral efficiency, average transmit power, and bit error rate (BER). Depending on practical system design constraints, the threshold is chosen to maximize the spectral efficiency (or minimize the average BER) subject to average transmit power and average BER (or spectral efficiency) constraints, respectively. We present numerical and Monte Carlo simulation results that validate our analysis. Compared to open-loop spatial multiplexing and other approaches that select the best antenna subset in spatial multiplexing, the numerical results illustrate that the proposed technique obtains significant power gains for the same BER and spectral efficiency. We also provide numerical results that show improvement over rate-adaptive orthogonal space-time block coding, which requires highly complex constellation adaptation. We analyze the impact of feedback delay using analytical and Monte Carlo approaches. The proposed approach is arguably the simplest possible adaptive spatial multiplexing system from an implementation point of view. However, our approach and analysis can be extended to other systems using multiple constellations and power levels.

Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns

In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this problem. Our method is decentralized in the sense that agents try to achieve their goals without knowledge of the other agents’ goals. We prove that this is a sound method to compute a Pareto optimal pure Nash equilibrium for an interesting class of Boolean games. Experimental results are used to investigate the performance of the algorithm.

Wireless networked control systems with QoS-based sampling

Closing feedback loops using an IEEE 802.11b ad hoc wireless communication network incurs many challenges sensitivity to varying channel conditions and lower physical transmission rates tend to limit the bandwidth of the communication channel. Given that the bandwidth usage and control performance are linked, a method of adapting the sampling interval based on an 'a priori', static sampling policy has been proposed and, more significantly, assuring stability in the mean square sense using discrete-time Markov jump linear system theory. Practical issues including current limitations of the 802.11 b protocol, the sampling policy and stability are highlighted. Simulation results on a cart-mounted inverted pendulum show that closed-loop stability can be improved using sample rate adaptation and that the control design criteria can be met in the presence of channel errors and severe channel contention.

Disturbance attenuation in linear systems via dynamical compensators: A parametric eigenstructure assignment approach

A simple approach is proposed for disturbance attenuation in multivariable linear systems via dynamical output compensators based on complete parametric eigenstructure assignment. The basic idea is to minimise the H-2 norm of the disturbance-output transfer function using the design freedom provided by eigenstructure assignment. For robustness, the closed-loop system is restricted to be nondefective. Besides the design parameters, the closed-loop eigenvalues are also optimised within desired regions on the left-half complex plane to ensure both closed-loop stability and dynamical performance. With the proposed approach, additional closed-loop specifications can be easily achieved. As a demonstration, robust pole assignment, in the sense that the closed-loop eigenvalues are as insensitive as possible to open-loop system parameter perturbations, is treated. Application of the proposed approach to robust control of a magnetic bearing with a pair of opposing electromagnets and a rigid rotor is discussed.

Effect of Selfish Node Behavior on Efficient Topology Design

The problem of topology control is to assign per-node transmission power such that the resulting topology is energy efficient and satisfies certain global properties such as connectivity. The conventional approach to achieve these objectives is based on the fundamental assumption that nodes are socially responsible. We examine the following question: if nodes behave in a selfish manner, how does it impact the overall connectivity and energy consumption in the resulting topologies? We pose the above problem as a noncooperative game and use game-theoretic analysis to address it. We study Nash equilibrium properties of the topology control game and evaluate the efficiency of the induced topology when nodes employ a greedy best response algorithm. We show that even when the nodes have complete information about the network, the steady-state topologies are suboptimal. We propose a modified algorithm based on a better response dynamic and show that this algorithm is guaranteed to converge to energy-efficient and connected topologies. Moreover, the node transmit power levels are more evenly distributed, and the network performance is comparable to that obtained from centralized algorithms.

Partial Cooperative Equilibria: Existence and Characterization

We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to reduced games. We also establish sufficient conditions for which partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria exist in supermodular games. Finally, we provide an application to strategic network formation where such solution concepts may be useful.

Coordination, Efficiency and Two-Sided Cheap Talk

We consider the Battle of the Sexes game with incomplete information and allow two-sided cheap talk before the game is played. We characterise the set of fully revealing symmetric cheap talk equilibria. The best fully revealing symmetric cheap talk equilibrium, when exists, has a desirable characteristic. When the players' types are different, it fully coordinates on the ex-post efficient pure Nash equilibrium. We also analyse the mediated communication equilibria of the game. We find the range of the prior for which this desirable equilibrium exists under unmediated and mediated communication processes.

Ambiguity, social opinion and the use of common property resources

In this paper we argue that ambiguity, combined with social opinion formation, can be used as the foundation of a game-theoretic equilibrium concept that transcends the standard Nash equilibrium concept, applied to a model of the tragedy of the commons. Our approach sheds light on the international environmental crisis and the relevant ongoing international negotiations. We conclude that social opinion formation in most cases has a significant impact on equilibrium common property resource usage.