Minyue Fu

University of Newcastle, Newcastle, New South Wales, Australia

Are you Minyue Fu?

Claim your profile

Publications (281)334.29 Total impact

  • Source
    Tianju Sui, Keyou You, Minyue Fu
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper studies a networked state estimation problem for a spatially large linear system with a distributed array of sensors, each of which offers partial state measurements. A lossy communication network is used to transmit the sensor measurements to a central estimator where the minimum mean square error (MMSE) state estimate is computed. Under a Markovian packet loss model, we provide necessary and sufficient conditions for the stability of the estimator for any diagonalizable system in the sense that the mean of the state estimation error covariance matrix is uniformly bounded. In particular, the stability conditions for the second-order systems with an i.i.d. packet loss model are explicitly expressed as simple inequalities in terms of the largest open-loop pole and the packet loss rate.
    Automatica 03/2015; 53. DOI:10.1016/j.automatica.2014.12.022 · 3.13 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The paper studies the general circumnavigation problem for a team of unicycle-type agents, with the goal of achieving specific circular formations and circling on different orbits centered at a target of interest. A novel distributed solution is proposed, in which the control laws are heterogeneous for the agents such that some agents are repellant from the target while attractive to its unique neighbor and some agents are attractive to the target while repellant from its neighbor. A systematic procedure is developed to design the control parameters according to the specific radii of the orbits and the formations that the agents are desired to converge to. Moreover, this control scheme uses a minimum number of information flow links between the agents and local measurements of relative position only. Based on the block diagonalization of circulant matrices by a Fourier transform, asymptotic convergence properties are analyzed rigorously. The validity of the proposed control algorithm is also demonstrated through numerical simulations.
    Automatica 03/2015; 53. DOI:10.1016/j.automatica.2014.11.012 · 3.13 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Plug-in hybrid electric vehicles (PHEV) are expected to become widespread in the near future. However, high penetration of PHEVs can overload the distribution system. In smart grid, the charging of PHEVs can be controlled to reduce the peak load, known as demand-side management (DSM). In this paper, we focus on the DSM for PHEV charging at low-voltage transformers (LVTs). The objective is to flatten the load curve of LVTs, while satisfying each consumer’s requirement for their PHEV to be charged to the required level by the specified time. We first formulate this problem as a convex optimization problem and then propose a decentralized water-filling-based algorithm to solve it. A moving horizon approach is utilized to handle the random arrival of PHEVs and the inaccuracy of the forecast nonPHEV load. We focus on decentralized solutions so that computational load can be shared by individual PHEV chargers and the algorithm is scalable. Numerical simulations are given to demonstrate the effectiveness of our algorithm.
    IEEE Transactions on Smart Grid 03/2015; 6(2):726-736. DOI:10.1109/TSG.2014.2363096 · 4.33 Impact Factor
  • IEEE Transactions on Automatic Control 01/2015; DOI:10.1109/TAC.2015.2411911 · 3.17 Impact Factor
  • Zhiyun Lin, Minyue Fu, Yingfei Diao
    IEEE Transactions on Signal Processing 01/2015; DOI:10.1109/TSP.2015.2432739 · 3.20 Impact Factor
  • 01/2015; DOI:10.1109/TCNS.2015.2426772
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper studies an optimal state estimation (Kalman filtering) problem under the assumption that output measurements are subject to random time delays caused by network transmissions without time stamping. We first propose a random time delay model which mimics many practical digital network systems. We then study the so-called unbiased, uniformly bounded linear state estimators and show that the estimator structure is given based on the average of all received measurements at each time for different maximum time delays. The estimator gains can be derived by solving a set of recursive discrete-time Riccati equations. The estimator is guaranteed to be optimal in the sense that it is unbiased with uniformly bounded estimation error covariance. A simulation example shows the effectiveness of the proposed algorithm.Copyright © 2013 John Wiley & Sons, Ltd.
    International Journal of Robust and Nonlinear Control 11/2014; 24(17). DOI:10.1002/rnc.3016 · 2.65 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper studies the state estimation problem for a stochastic discrete-time system over a lossy channel where the packet loss is modeled as an independent and identically distributed binary process. To counter the effect of random packet loss, we propose a linear coding method to preprocess the measured output, and prove that the coded output is information preserving when packet loss is void and is information enhancing when packet loss is present. An optimal state estimator under the minimum mean square error (MMSE) criterion is derived for the coded output when subject to packet loss. The maximum packet loss rate for ensuring a stable estimator is then derived and shown to be very close to a well-known lower bound. Also considered is a compressed linear coding method where the measured output is first compressed onto a lower dimensional space before encoding, and it is shown that the similar packet rate condition for stability holds.
    Automatica 11/2014; 51. DOI:10.1016/j.automatica.2014.10.086 · 3.13 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods.
    Automatica 11/2014; 51. DOI:10.1016/j.automatica.2014.10.077 · 3.13 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses the stability of a Kalman filter when measurements are intermittently available due to constraints in the communication channel between the sensor and the estimator. We give a necessary condition and a sufficient condition, with a trivial gap between them, for the boundedness of the expected value of the estimation error covariance. These conditions are more general than the existing ones in the sense that they only require the state matrix of the system to be diagonalizable and the sequence of packet losses to be a stationary finite order Markov process. Hence, we extend the class of systems for which these conditions are known in two directions, namely, by including degenerate systems, and by considering network models more general than i.i.d. and Gilbert-Elliott. We show that these conditions recover known results from the literature when evaluated for non-degenerate systems under the assumption of i.i.d. or Gilbert-Elliott packet loss models.
    IEEE Transactions on Automatic Control 10/2014; 59(10). DOI:10.1109/TAC.2014.2328183 · 3.17 Impact Factor
  • Keyou You, Tianju Sui, Minyue Fu
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study the mean square stability of Kalman filtering of a discrete-time stochastic system under two periodically switching sensors. The sensor measurements are sent to a remote estimator over a lossy channel whose packet loss process is independent and identically distributed. We prove that the problem can be converted into the stability analysis of Kalman filtering using two sensors at each time, and the measurements of each sensor are transmitted to the estimator via an independent lossy channel of the same packet loss rate. Some necessary and/or sufficient conditions for stability of the estimation error covariance matrices are derived. Moreover, the effect of the sensor switching on the filter stability is revealed. Their implications and relationships with related results in the literature are discussed.
    Asian Journal of Control 09/2014; 17(1). DOI:10.1002/asjc.975 · 1.41 Impact Factor
  • Yingfei Diao, Zhiyun Lin, Minyue Fu
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper studies the problem of determining the sensor locations in a large sensor network using only relative distance (range) measurements. Based on a generalized barycentric coordinate representation, our work generalizes the DILOC algorithm to the localization problem under arbitrary deployments of sensor nodes and anchor nodes. First, a criterion and algorithm are developed to determine a generalized barycentric coordinate of a node with respect to its neighboring nodes, which do not require the node to be inside the convex hull of its neighbors. Next, for the localization problem based on the generalized barycentric coordinate representation, a necessary and sufficient condition for the localizability of a sensor network with a generic configuration is obtained. Finally, a new linear iterative algorithm is proposed to ensure distributed implementation as well as global convergence to the true coordinates.
    IEEE Transactions on Signal Processing 09/2014; 62(18):4760-4771. DOI:10.1109/TSP.2014.2339797 · 3.20 Impact Factor
  • Source
    Tingrui Han, Zhiyun Lin, Minyue Fu
    [Show abstract] [Hide abstract]
    ABSTRACT: The paper studies the formation merging problem for a leader-follower network. That is, how to control a team of agents called followers so that they are merged with a team of agents called leaders to form a larger globally rigid formation. Under the premise that a group of leaders move in a globally rigid formation with their synchronized velocity known to the followers, we show that the followers can asymptotically merge themselves to the formation for arbitrarily initial configurations. Each follower selects its neighbors and also its control law according to the target formation they aim to achieve and thus it allows directed and time-varying switching topologies. It is shown that a globally rigid formation can be merged asymptotically for the leader-follower network in a setup with directed and time-varying graphs if and only if every follower frequently has a joint path from at least a leader.
    19th World Congress of the International Federation of Automatic Control; 08/2014
  • Source
  • [Show abstract] [Hide abstract]
    ABSTRACT: The paper concentrates on the fundamental coordination problem that requires a network of agents to achieve a specific but arbitrary formation shape. A new technique based on complex Laplacian is introduced to address the problems of which formation shapes specified by inter-agent relative positions can be formed and how they can be achieved with distributed control ensuring global stability. Concerning the first question, we show that all similar formations subject to only shape constraints are those that lie in the null space of a complex Laplacian satisfying certain rank condition and that a formation shape can be realized almost surely if and only if the graph modeling the inter-agent specification of the formation shape is 2-rooted. Concerning the second question, a distributed and linear control law is developed based on the complex Laplacian specifying the target formation shape, and provable existence conditions of stabilizing gains to assign the eigenvalues of the closed-loop system at desired locations are given. Moreover, we show how the formation shape control law is extended to achieve a rigid formation if a subset of knowledgable agents knowing the desired formation size scales the formation while the rest agents do not need to re-design and change their control laws.
    IEEE Transactions on Automatic Control 07/2014; 59(7):1765-1777. DOI:10.1109/TAC.2014.2309031 · 3.17 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper investigates the formation merging problem for a leader-follower network. The objective is to control a group of agents called followers and modeled by double-integrator dynamics so that they are merged with another group of agents called leaders to form a single globally rigid formation. With the assumption that leaders move in a globally rigid formation with their synchronized velocity known to the followers, we show that a globally rigid formation can be merged. Each follower selects its neighbors and control law according to the target configuration and thus it allows directed and time-varying switching topologies. We provide a necessary and sufficient condition such that a globally rigid formation can be merged asymptotically for the leader-follower network in a setup with directed and time-varying graphs.
    11th IEEE International Conference on Control & Automation (ICCA); 06/2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we introduce a set of sensor networks, called the cascading quadrilateral network, and study how to compute the positions of its nodes in a cooperative way. We investigate the condition for determining whether all the sensor nodes are localizable. If not, we provide a method to detect the un-localizable nodes for the whole network. The necessary and sufficient conditions for the network localizability and node localizability are given from the view of algebraic property, respectively. Specifically, we provide algorithms to show how to detect un-localizable nodes from a partially localizable network. Numerical simulation is provided to show the effectiveness of the developed method of computing positions.
    2014 11th IEEE International Conference on Control & Automation (ICCA); 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper studies optimal control designs for networked linear discrete-time systems with quantization effects and/or fading channel. The quantization errors and/or fading channels are modeled as multiplicative noises. The H2 optimal control in mean-square sense is formulated. The necessary and sufficient condition to the existence of the mean-square stabilizing solution to a modified algebraic Riccati equation (MARE) is presented. The optimal H2 control via state feedback for the systems is designed by using the solution to the MARE. It is a nature extension for the result in standard optimal discrete-time H2 state feedback design. It is shown that this optimal state feedback design problem is eigenvalue problem (EVP) and the optimal design algorithm is developed.
    2014 26th Chinese Control And Decision Conference (CCDC); 05/2014
  • IEEE/ASME Transactions on Mechatronics 01/2014; DOI:10.1109/TMECH.2014.2352647 · 3.65 Impact Factor
  • IEEE Transactions on Power Systems 01/2014; DOI:10.1109/TPWRS.2014.2376935 · 3.53 Impact Factor

Publication Stats

4k Citations
334.29 Total Impact Points

Institutions

  • 1994–2015
    • University of Newcastle
      • • School of Electrical Engineering and Computer Science
      • • Centre for Complex Dynamic Systems and Control
      • • Department of Electrical Engineering
      • • Department of Computer Engineering
      Newcastle, New South Wales, Australia
  • 2009–2013
    • Zhejiang University
      • Department of Control Science and Engineering
      Hang-hsien, Zhejiang Sheng, China
  • 2010
    • Shandong University
      Chi-nan-shih, Shandong Sheng, China
  • 2004–2009
    • Nanyang Technological University
      • School of Electrical and Electronic Engineering
      Tumasik, Singapore
    • National ICT Australia Ltd
      Sydney, New South Wales, Australia
  • 2008
    • Pontifícia Universidade Católica do Rio Grande do Sul
      Pôrto de São Francisco dos Casaes, Rio Grande do Sul, Brazil
  • 2006
    • Australian National University
      Canberra, Australian Capital Territory, Australia
  • 1997–2006
    • Newcastle University
      Newcastle-on-Tyne, England, United Kingdom
    • Universiteit Twente
      • Department of Applied Mathematics
      Enschede, Provincie Overijssel, Netherlands
  • 2003
    • Federal University of Santa Catarina
      Nossa Senhora do Destêrro, Santa Catarina, Brazil
  • 1994–2002
    • University of Iowa
      • Department of Electrical and Computer Engineering
      Iowa City, IA, United States
  • 1996
    • Illinois Institute of Technology
      • Department of Electrical & Computer Engineering
      Chicago, IL, United States
  • 1995
    • Catholic University of Louvain
      Walloon Region, Belgium
    • Tel Aviv University
      • Department of Electrical Engineering - Systems
      Tell Afif, Tel Aviv, Israel