Event-based H∞ consensus control of multi-agent systems with relative output feedback: The finite-horizon case

In this technical note, the H∞ consensus control problem is investigated over a finite horizon for general discrete time-varying multi-agent systems subject to energy-bounded external disturbances. A decentralized estimation-based output feedback control protocol is put forward via the relative output measurements. A novel event-based mechanism is proposed for each intelligent agent to utilize the available information in order to decide when to broadcast messages and update control input. The aim of the problem addressed is to co-design the time-varying controller and estimator parameters such that the controlled multi-agent systems achieve consensus with a disturbance attenuation level γ over a finite horizon [0,T]. A constrained recursive Riccati difference equation approach is developed to derive the sufficient conditions under which the H∞ consensus performance is guaranteed in the framework of event-based scheme. Furthermore, the desired controller and estimator parameters can be iteratively computed by resorting to the Moore-Penrose pseudo inverse. Finally, the effectiveness of the developed event-based H∞ consensus control strategy is demonstrated in the numerical simulation

Event-based recursive distributed filtering over wireless sensor networks

In this technical note, the distributed filtering problem is investigated for a class of discrete time-varying systems with an event-based communication mechanism. Each intelligent sensor node transmits the data to its neighbors only when the local innovation violates a predetermined Send-on-Delta (SoD) data transmission condition. The aim of the proposed problem is to construct a distributed filter for each sensor node subject to sporadic communications over wireless networks. In terms of an event indicator variable, the triggering information is utilized so as to reduce the conservatism in the filter analysis. An upper bound for the filtering error covariance is obtained in form of Riccati-like difference equations by utilizing the inductive method. Subsequently, such an upper bound is minimized by appropriately designing the filter parameters iteratively, where a novel matrix simplification technique is developed to handle the challenges resulting from the sparseness of the sensor network topology and filter structure preserving issues. The effectiveness of the proposed strategy is illustrated by a numerical simulation.This work is supported by National Basic Research Program of China (973 Program) under Grant 2010CB731800, National Natural Science Foundation of China under Grants 61210012, 61290324, 61473163 and 61273156, and Jiangsu Provincial Key Laboratory of E-business at Nanjing University of Jiangsu and Economics of China under Grant JSEB201301

Comparison of constraint-handling techniques for metaheuristic optimization

Many design problems in engineering have highly nonlinear constraints and the proper handling of such constraints can be important to ensure solution quality. There are many different ways of handling constraints and different algorithms for optimization problems, which makes it difficult to choose for users. This paper compares six different constraint-handling techniques such as penalty methods, barrier functions, epsilon-constrained method, feasibility criteria and stochastic ranking. The pressure vessel design problem is solved by the flower pollination algorithm, and results show that stochastic ranking and epsilon-constrained method are most effective for this type of design optimization

Coil combination using linear deconvolution in k-space for phase imaging

Background: The combination of multi-channel data is a critical step for the imaging of phase and susceptibility contrast in magnetic resonance imaging (MRI). Magnitude-weighted phase combination methods often produce noise and aliasing artifacts in the magnitude images at accelerated imaging sceneries. To address this issue, an optimal coil combination method through deconvolution in k-space is proposed in this paper. Methods: The proposed method firstly employs the sum-of-squares and phase aligning method to yield a complex reference coil image which is then used to calculate the coil sensitivity and its Fourier transform. Then, the coil k-space combining weights is computed, taking into account the truncated frequency data of coil sensitivity and the acquired k-space data. Finally, combining the coil k-space data with the acquired weights generates the k-space data of proton distribution, with which both phase and magnitude information can be obtained straightforwardly. Both phantom and in vivo imaging experiments were conducted to evaluate the performance of the proposed method. Results: Compared with magnitude-weighted method and MCPC-C, the proposed method can alleviate the phase cancellation in coil combination, resulting in a less wrapped phase. Conclusions: The proposed method provides an effective and efficient approach to combine multiple coil image in parallel MRI reconstruction, and has potential to benefit routine clinical practice in the future

Segmenting characters from license plate images with little prior knowledge

In this paper, to enable a fast and robust system for automatically recognizing license plates with various appearances, new and simple but efficient algorithms are developed to segment characters from extracted license plate images. Our goal is to segment characters properly from a license plate image region. Different from existing methods for segmenting degraded machine-printed characters, our algorithms are based on very weak assumptions and use no prior knowledge about the format of the plates, in order for them to be applicable to wider applications. Experimental results demonstrate promising efficiency and flexibility of the proposed scheme. © 2010 IEEE

An elitism-based multi-objective evolutionary algorithm for min-cost network disintegration

Network disintegration or strengthening is a significant problem, which is widely used in infrastructure construction, social networks, infectious disease prevention and so on. But most studies assume that the cost of attacking anyone node is equal. In this paper, we investigate the robustness of complex networks under a more realistic assumption that costs are functions of degrees of nodes. A multi-objective, elitism-based, evolutionary algorithm (MOEEA) is proposed for the network disintegration problem with heterogeneous costs. By defining a new unit cost influence measure of the target attack node and combining with an elitism strategy, some combination nodes’ information can be retained. Through an ingenious update mechanism, this information is passed on to the next generation to guide the population to move to more promising regions, which can improve the rate of convergence of the proposed algorithm. A series of experiments have been carried out on four benchmark networks and some model networks, the results show that our method performs better than five other state-of-the-art attack strategies. MOEEA can usually find min-cost network disintegration solutions. Simultaneously, through testing different cost functions, we find that the stronger the cost heterogeneity, the better performance of our algorithm