1 March 1993 in Automatica
1 June 1995 in Automatica
9 January 2012 in IEEE Transactions on Automatic Control
This paper addresses the mean square stabilization problem for discrete-time networked control systems over fading channels. We show that there exists a requirement on the network over which an unstable plant can be stabilized. In the case of state feedback, necessary and sufficient conditions on the network for mean square stabilizability are derived. Under a parallel transmission strategy and the assumption that the overall mean square capacity of the network is fixed and can be assigned among parallel input channels, a tight lower bound on the overall mean square capacity for mean square stabilizability is presented in terms of the Mahler measure of the plant. The minimal overall capacity for stabilizability is also provided under a serial transmission strategy. For the case of dynamic output feedback, a tight lower bound on the capacity requirement for stabilization of SISO plants is given in terms of the anti-stable poles, nonminimum phase zeros and relative degree of the plant. Sufficient and necessary conditions are further derived for triangularly decoupled MIMO plants. The effect of pre- and post-channel processing and channel feedback is also discussed, where the channel feedback is identified as a key component in eliminating the limitation on stabilization induced by the nonminimum phase zeros and high relative degree of the plant. Finally, the extension to the case with output fading channels and the application of the results to vehicle platooning are presented.
11 August 2021 in IEEE Transactions on Control of Network Systems
A power–water network consists of power plants, water plants, and coproduction plants, which supply power and water collectively. Heterogeneous plants generally have different costs when they produce water and power; thus, an optimization method should be employed to allocate the production tasks of the plants to reduce the total cost of the power–water network. This study investigates a continuous-time distributed algorithm for the economic dispatch problem of the power–water network. A conceptual model is first presented to illustrate the logical relationships within the power–water network, and then, a constrained nonlinear programming model is developed to describe the economic dispatch problem of the power–water network. The model not only includes the generation capacity constraints and supply–demand constraints but also considers the constraints on the power–water production ratios of the coproduction plants. A novel distributed algorithm is developed for the economic dispatch problem, which can guarantee a plug-and-play operation and preserve the privacy information of the plants in the power–water network. Some numerical results are given to demonstrate the performance and effectiveness of the proposed algorithm.
1 February 2009 in Automatica
1 July 1994 in Automatica