期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Networked Cooperative Distributed Model Predictive Control Based on State Observer
1
作者 Baili Su Yanan Zhao Jinming Huang 《Applied Mathematics》 2016年第10期1148-1164,共17页
Although distributed model predictive control has caused significant attention and received many good results, the results are mostly under the assumption that the system states can be observed. However, the states ar... Although distributed model predictive control has caused significant attention and received many good results, the results are mostly under the assumption that the system states can be observed. However, the states are difficult to be observed in practice. In this paper, a novel distributed model predictive control is proposed based on state observer for a kind of linear discrete-time systems where states are not measured. Firstly, an output feedback control law is designed based on Lyapunov function and state observer. And the stability domain is described. Furthermore, the stability domain as a terminal constraint is added into the constraint conditions of the algorithm to make systems stable outside the stability domain. The simulation results show the effectiveness of the proposed method. 展开更多
关键词 Distributed System Model Predictive Control Lyapunov Function State Observer stable domain Cooperative Control
下载PDF
Domains via Graphs
2
作者 张国强 陈仪香 《Journal of Computer Science & Technology》 SCIE EI CSCD 2001年第6期505-521,共17页
This paper provides a concrete and simple introduction to two pillars of domain theory : (1) solving recursive domain equations, and (2) universal and saturated domains. Our exposition combines Larsen and Winskel'... This paper provides a concrete and simple introduction to two pillars of domain theory : (1) solving recursive domain equations, and (2) universal and saturated domains. Our exposition combines Larsen and Winskel's idea on solving domain equations using information systems with Girard's idea of stable domain theory in the form of coherence spacest or graphs. Detailed constructions are given for universal and even homogeneous objects in two categories of graphs: one representing binary complete, prime algebraic domains with complete primes covering the bottom; the other representing w-algebraic, prime algebraic lattices. The back- and-forth argument in model theory helps to enlighten the constructions. 展开更多
关键词 domain theory category theory graph theory universal objects recursive domain equations coherence spaces stable domains the back-and-forth argument
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部