Visible to the public Biblio

Found 1720 results

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Y
Y. Li, S. Phillips, R. G. Sanfelice.  2016.  On Distributed Observers for Linear Time-invariant Systems Under Intermittent Information Constraints. Proceedings of 10th IFAC Symposium on Nonlinear Control Systems. :654–659.
Y. Li, R.G.Sanfelice.  2016.  Results on Finite Time Stability for A Class of Hybrid Systems. Proceedings of the American Control Conference. :4263–4268.
Y. Li, R.G.Sanfelice.  2016.  A Decentralized Consensus Algorithm for Distributed State Observers with Robustness Guarantees. Proceedings of the American Control Conference. :1876–1881.
Y. Ma, G. Zhou, S. Lin, H. Chen.  2017.  RoFi: Rotation-aware WiFi Channel Feedback. IEEE Internet of Things Journal. PP:1-1.
Y. Ma, G. Zhou, S. Lin.  2017.  EliMO: Eliminating Channel Feedback from MIMO. 2017 IEEE International Conference on Smart Computing (SMARTCOMP). :1-8.
Y. Tao, L. Ding, S. Wang, A. Ganz.  2017.  PERCEPT Indoor Wayfinding for Blind and Visually Impaired Users: Navigation Instructions Algorithm and Validation Framework. Int. Conf. Info. and Comm. Technologies for Aging Well and e-Health (ICT4AWE). :143–149.
Y. Zhang, J. Cortes.  2017.  Transient-state feasibility set approximation of power networks against disturbances of unknown amplitude. acc. :2767-2772.

This paper develops methods to efficiently compute the set of disturbances on a power network that do not tip the frequency of each bus and the power flow in each transmission line beyond their respective bounds. For a linearized AC power network model, we propose a sampling method to provide superset and subset approximations with a desired accuracy of the set of feasible disturbances. We also introduce an error metric to measure the approximation gap and design an algorithm that is able to reduce its value without impacting the complexity of the resulting set approximations. Simulations on the IEEE 118-bus power network illustrate our results.

Y. Zhao, V. Gupta, J. Cortes.  2015.  The effect of delayed side information on fundamental limitations of disturbance attenuation. cdc. :1878-1883.

In this paper, we present a fundamental limitation of disturbance attenuation in discrete-time single-input single-output (SISO) feedback systems when the controller has delayed side information about the external disturbance. Specifically, we assume that the delayed information about the disturbance is transmitted to the controller across a finite Shannon-capacity communication channel. Our main result is a lower bound on the log sensitivity integral in terms of open-loop unstable poles of the plant and the characteristics of the channel, similar to the classical Bode integral formula. A comparison with prior work that considers the effect of preview side information of the disturbance at the controller indicates that delayed side information and preview side information play different roles in disturbance attenuation. In particular, we show that for open-loop stable systems, delayed side information cannot reduce the log integral of the sensitivity function whereas it can for open-loop unstable systems, even when the disturbance is a white stochastic process.

Y. Zhao, J. Cortes.  2015.  Reachability metrics for bilinear complex networks. cdc. :4788-4793.

Controllability metrics based on the controllability Gramian have been widely used in linear control theory, and have recently seen renewed interests in the study of complex networks of dynamical systems. For example, the minimum eigenvalue and the trace of the Gramian are related to the worst-case and average minimum input energy, respectively, to steer the state from the origin to a target state. This paper explores similar questions that remain unanswered for bilinear control systems. In the context of complex networks, bilinear systems characterize scenarios where an actuator not only can affect the state of a node, but also can affect the strength of the interconnections among some neighboring nodes. Under the assumption that the infinity norm of the input is bounded by some function of the network dynamic matrices, we derive a lower bound on the minimum input energy to steer the state of a bilinear network from the origin to any reachable target state based on the generalized reachability Gramian of bilinear systems. We also provide a lower bound on the average minimum input energy over all target states on the unit hypersphere in the state space. Based on the reachability metrics proposed, we propose an actuator selection method that provides guaranteed minimum average input energy. Finally, we show that the optimal actuator selection can be found by maximizing a supermodular function under cardinality constraints.

Y. Zhao, F. Pasqualetti, J. Cortes.  2016.  Scheduling of Control Nodes for Improved Network Controllability. {IEEE} Conference on Decision and Control. :1859–1864.