首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14篇
  完全免费   10篇
  自动化技术   24篇
  2017年   2篇
  2016年   2篇
  2015年   4篇
  2014年   2篇
  2012年   4篇
  2011年   4篇
  2010年   1篇
  2007年   3篇
  2006年   1篇
  2005年   1篇
排序方式: 共有24条查询结果,搜索用时 31 毫秒
1.
This paper considers a state estimation problem for a continuous-time uncertain system via a digital communication channel with bit-rate constraints. The estimated state must be quantized, coded and transmitted via a limited capacity digital communication channel. Optimal and suboptimal recursive coder–decoder state estimation schemes are proposed and investigated.  相似文献
2.
Use of fly-by-wire technology for aircraft flight controls have resulted in an improved performance and reliability along with achieving reduction in control system weight. Implementation of full authority digital engine control has also resulted in more intelligent, reliable, light-weight aircraft engine control systems. Greater reduction in weight can be achieved by replacing the wire harness with a wireless communication network. The first step towards fly-by-wireless control systems is likely to be the ...  相似文献
3.
在特定的密钥更新通信开销的情况下,研究了多播通信中基于混合LKH树的安全密钥管理方案问题。混合LKH树方案将含Ⅳ个成员的组划分为若干个含M个成员的簇,并将每个簇安置在密钥管理树的叶子结点上。根据簇大小,本文将组控制器的密钥最小存储开销表示为约束优化问题,再将约束优化问题转化为一个关于簇大小肘的不动点方程。当密钥更新通信开销约束为O(logN)时,证明不动点方程的最大根为簇大小肘的最优值,它使得混合LKH树的密钥存储开销达到最小。同时设计了一个最小化存储开销的算法。  相似文献
4.
Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some fundamental cases such systems can be reduced to quantized control system of type x+=x+u, where the u takes values in a set of 2m+1 integer numbers, symmetric with respect to 0. In this paper we consider these types of systems and analyse the reachable set after K steps. Our aim is to find a set of m input values such that the reachable set after K steps contains an interval of integers [−N, . . . , N] with N as large as possible. For m=2,3 and 4, we completely solve the problem and characterize the metric associated to this quantized control system.  相似文献
5.
讨论了一类存在通信约束和时延的多输入多输出网络控制系统(NCS)的建模和控制问题.该NCS具有多个传感器和执行器,由于网络通信受限,在同一时刻只能允许部分传感器和执行器访问网络.传感器和执行器访问网络的过程可以用两个马尔可夫链来描述,并且在假设传感器—控制器时延和控制器—执行器时延均为短时延的情况下,将整个闭环NCS建模成一个具有两个模式的马尔可夫切换系统.基于LMI技术和李亚普诺夫方法,给出了闭环NCS随机稳定的充分条件,并给出了状态反馈控制器的设计方法.最后的数值算例验证了所提方法的有效性.  相似文献
6.
在特定的密钥更新通信开销的情况下,研究了基于混合单向函数树的高效安全组播密钥管理方案问题。混合单向函数树方案将含N个成员的组划分为若干个含M个成员的簇,并将每个簇安置在密钥管理树的叶子结点上。根据簇大小,将组控制器的密钥最小存储开销表达为约束优化问题,再将约束优化问题转化为一个关于簇大小M的不动点方程,当密钥更新通信开销约束为O(logN)时,证明不动点方程的最大根为簇大小的最优值,它使得混合树的最小密钥存储开销为O(N/logN)。同时设计了一种构造具有最小存储开销的混合单向函数树的算法。  相似文献
7.
Consider a group of agents who seek to simultaneously traverse a graph. Each edge of the graph has an associated weight (e.g., a delay), and the agents seek to minimize the cumulative weight incurred by all agents as each traverses a path of the graph. An edge’s weight is a function of the number of agents that use that edge as well as an inherent random weight. If the agents have no side information about the random component, they will (deterministically) organize themselves so as to optimize their average performance. We consider a generalization of this framework whereby the agents have access to a limited amount of shared side information about the edge weights, and we study the relationship between information quantity and performance.  相似文献
8.
对一类具有随机丢包和通讯限制的网络控制系统的鲁棒故障检测问题进行研究;考虑控制器到执行器间存在通讯限制以及传感器到控制器间存在数据丢包,并将丢包用Bernoulli随机二进制分布进行描述;在此基础上建立带有故障的离散时间模型,基于所建立的模型设计故障检测滤波器,使得残差系统随机稳定,同时滤波误差系统的H∞范数满足给定的衰减水平;所设计的故障检测滤波器不但保证了残差系统对故障的灵敏,同时对系统的外部扰动输入具有鲁棒性;数值算例验证了文章所提方法是可行的.  相似文献
9.
This paper studies the problem of networked H filtering for linear discrete-time systems. A new model is proposed as the filtering error system to simultaneously capture the communication constraint, random packet dropout and quantization effects in the networked systems. A sufficient condition is presented for the filtering error system to be mean square exponentially stable with a prescribed H performance by employing the multiple Lyapunov function method. The obtained condition depends on some parameters of the networked systems, such as the access sequence of nodes, packet dropout rate and quantization density. With these parameters fixed, a design procedure for the desired H filter is also presented based on the derived condition. Finally, an illustrative example is utilized to show the effectiveness of the proposed method.  相似文献
10.
This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise “gossip” communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quantizer, and whether they should use, and how, exact information regarding their own states in the update.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号