http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Fuyang Chen,Zheng Wang,Bin Jiang,Changyun Wen 제어·로봇·시스템학회 2015 International Journal of Control, Automation, and Vol.13 No.3
In this paper, an improved nonlinear model for a 3-DOF helicopter and its self-repairing control scheme are investigated via quantum information technique. Firstly, adopting the mechanism analysis, a modified dynamic model is developed, in which the couplings among axes are considered. Such a modeling scheme is useful for applications when the accuracy of original model can not be satisfied. Then, a reconfigurable control scheme is designed for the twin rotor helicopter with multiple faults and parametric uncertainties, which combines active disturbance rejection control method with model reference adaptive control method. In addition, quantum information technique is used to increase the accuracy of self-repairing control of helicopter. Finally, simulation verification is presented in both aspects of modeling and control. The effectiveness and feasibility of the proposed scheme are verified by comparative simulations.
Leitao Gao,Guangshe Zhao,Guoqi Li,Yuming Liu,Jiangshuai Huang,Changyun Wen 제어·로봇·시스템학회 2019 International Journal of Control, Automation, and Vol.17 No.1
In this paper, we consider how to determine the minimum number of leaders with allocation and how toachieve consensus over directed networks consisting of time-varying nonlinear multi-agents. Firstly, the problemof finding minimum number of leaders is formulated as a minimum spanning forest problem, i.e., finding theminimum population of trees in the network. By introducing a toll station connecting with each agent, this problemis converted to a minimum spanning tree problem. In this way, the minimum number of leaders is determined andthese leaders are found locating at the roots of each tree in the obtained spanning forest. Secondly, we describe avirtual leader connected with the allocated leaders, which indicates that the number of edges connected the followeragents with the virtual leader is the least in an arbitrary directed network. This method is different from the existingconsensus problem of redundant leaders or edges that connect the follower with one leader in special networks. A distributed consensus protocol is revisited for achieving final global consensus of all agents. It is theoreticallyshown that such a protocol indeed ensures consensus. Simulation examples in real-life networks are also providedto show the effectiveness of the proposed methodology. Our works enable studying and extending application ofconsensus problems in various complex networks.