The design of distributed Nash equilibrium seeking strategies for games in which the involved players are of second-order integrator-type dynamics is investigated in this paper. Noticing that velocity signals are usually noisy or not available for feedback control in practical engineering systems, this paper supposes that the velocity signals are not accessible for the players. To deal with the absence of velocity measurements, two estimators are designed. The first estimator is established by employing an observer, which has the same order as the players' dynamics, to estimate the unavailable system states (e.g., the players' velocities). The second estimator is designed based on a high-pass filter and is motivated by the incentive to reduce the order of the estimator which in turn saves the computation costs of the seeking algorithm. On the basis of the designed observers/filters, distributed Nash equilibrium seeking strategies are then established through incorporating them with consensus and gradient algorithms. It is analytically proven that the players' actions can be regulated to the Nash equilibrium point and their velocities can be regulated to zero.
With the incentive to solve Nash equilibrium computation problems for networked games, this article tries to find answers for the following two problems: 1) how to accommodate hybrid games, which contain both continuous-time players and discrete-time players? and 2) are there any other potential perspectives for solving continuous-time networked games except for the consensus-based gradient-like algorithm established in our previous works? With these two problems in mind, the study of this article leads to the following results: 1) a hybrid gradient search algorithm and a consensus-based hybrid gradient-like algorithm are proposed for hybrid games with their convergence results analytically investigated. In the proposed hybrid strategies, continuous-time players adopt continuous-time algorithms for action updating, while discrete-time players update their actions at each sampling time instant and 2) based on the idea of consensus tracking, the Nash equilibrium learning problem for continuous-time games is reformulated and two new computation strategies are subsequently established. Finally, the proposed strategies are numerically validated.
Personally controlled air movement can maintain or enhance thermal comfort in warm environments and reduce energy consumption. Unlike controlling a personal fan, using a system of fans for multiple occupants is difficult as it is hard to find an appropriate fan speed setting that maximizes occupants' satisfaction. Since limited work has been carried out on this issue, in this paper, a novel cooperative control approach for a system of fans is proposed to provide optimized air movement for multiple occupants. This is the first time that a system of fans is controlled cooperatively in the research of built environment. The proposed approach predicts airflow in a cost-effective manner by calibrating the fans in the real environment. The operation of the fans is optimized by minimizing the worst-case deviation between the actual air speed and the desired air speed, which can be determined based on either the PMV – SET model or the occupants' feedback. This minimax-error problem is formulated as an equivalent linear programming problem which can be solved using standard methods. The proposed approach was tested in two different indoor scenarios respectively by 1) measuring air speed directly in a business conference room and 2) involving human subject surveys in a university classroom. In the first experiment, the measured air speeds after optimization are closer to the target values at all tested temperature levels (26°C, 27.5°C, and 29°C) indicating improved thermal comfort. In the second experiment, only 62% of the occupants (totally 34) are satisfied with slightly increased room temperature (around 26.5°C) before optimization, while this number increased to 94% after optimization.
17 December 2019 in IEEE Transactions on Circuits and Systems I: Regular Papers
The Gaussian noise assumption is only an approximation to reality and practical engineering systems are often subject to non-Gaussian disturbances, instrument failures and human errors, which all induce outliers. This paper deals with the problem of robust filter design for discrete-time linear systems with correlated process and measurement noises. In the presence of correlated noises, the impact of outliers may spread through correlations and even cause the breakdown of a robust estimator. To address this issue, the robust estimation problem is formulated as a regularized linear regression problem in which the outliers are explicitly modeled and regularized with ℓ₁-norm to promote sparse solutions. Because of the explicit modeling of outliers, their negative influences propagated through correlations can be estimated and reduced. Hence more accurate estimation results can be expected. By selecting an appropriate regularization parameter, the proposed filter reduces to the well-known Kalman filter and hence is capable of providing a good balance between robustness and optimality. Besides, the extra flexibility of assigning different weights to state and measurement outliers makes it possible to put more focus on outliers from a specific source. Examples using both simulated and experimental data demonstrate the effectiveness of the proposed robust filtering approach.
ARMAX models are widely used in control engineering for both system description and control design. They can accurately describe a large class of real processes with relatively low complexity, but do not take into account observation errors, which can be particularly important in applications like filtering and fault diagnosis. Due to the intrinsic dependence in ARMAX process output, a single outlier may contaminate multiple data entries and completely spoil the conventional least‐squares estimate. In this study, the authors develop a novel Moving Horizon Estimator that is not only robust to outliers but also able to reveal outliers. By utilising the fact that outliers are extreme errors that occur infrequently, the estimation problem is formulated as a least‐squares optimisation problem with outliers explicitly modelled and regularised with ‐norm to induce sparsity. A coordinate descent‐based solver is developed to obtain iterative algorithms with guaranteed convergence and closed‐form solution available to each coordinate sub‐problem per iteration. Due to the explicit modelling of outlier vectors, the impact of an outlier on multiple time instants can be estimated and mitigated. Simulation tests demonstrate that the proposed algorithm can effectively cope with outliers, even for the case when the commonly used Huber's M ‐estimation approach breaks down.