No abstract

In this paper, the sparse sensor placement problem for least-squares estimation is considered, and the previous novel approach of the sparse sensor selection algorithm is extended. The maximization of the determinant of the matrix which appears in pseudo-inverse matrix operations is employed as an objective function of the problem in the present extended approach. The procedure for the maximization of the determinant of the corresponding matrix is proved to be mathematically the same as that of the previously proposed QR method when the number of sensors is less than that of state variables (undersampling). On the other hand, the authors have developed a new algorithm for when the number of sensors is greater than that of state variables (oversampling). Then, a unified formulation of the two algorithms is derived, and the lower bound of the objective function given by this algorithm is shown using the monotone submodularity of the objective function. The effectiveness of the proposed algorithm on the problem using real datasets is demonstrated by comparing with the results of other algorithms. The numerical results show that the proposed algorithm improves the estimation error by approximately 10% compared with the conventional methods in the oversampling case, where the estimation error is defined as the ratio of the difference between the reconstructed data and the full observation data to the full observation. For the NOAA-SST sensor problem, which has more than ten thousand sensor candidate points, the proposed algorithm selects the sensor positions in few seconds, which required several hours with the other algorithms in the oversampling case on a 3.40 GHz computer.

This paper proposes an eigenvector-based method for analysis and design of hierarchical networks for multi-agent systems. We first define the concept of eigen-connection by characterizing low rank information flow between layers based on the eigenvector of lower level interconnection structures. It is shown that the resulting intergroup interconnections affect only a few eigenvalues of interconnection structures in the lower layer, and we derive explicit expressions for shifted eigenvalues. Then a procedure for designing hierarchical networks that result in desirable eigenvalue distributions is proposed, where the eigen-connection is used for a key to move undesirable eigenvalues selectively. The effectiveness of the procedure is demonstrated by a numerical example.

No abstract

No abstract