首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   39篇
  国内免费   1篇
  完全免费   34篇
  自动化技术   74篇
  2018年   9篇
  2017年   11篇
  2016年   11篇
  2015年   7篇
  2014年   5篇
  2013年   7篇
  2012年   5篇
  2011年   6篇
  2010年   4篇
  2009年   3篇
  2008年   5篇
  2007年   1篇
排序方式: 共有74条查询结果,搜索用时 125 毫秒
1.
In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.  相似文献
2.
This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repeatedly using the same state information at two time-steps. We show that those protocols can solve consensus problems under milder conditions than the popular consensus algorithm proposed by Jadbabaie et al., specifically, the presented protocols allow for the case that agents can only use delayed information of themselves, whereas the popular one is invalid. It is proved that if the union of the interaction topologies across the time interval with some given length always has a spanning tree, then in the presence of bounded time-varying delays, those protocols solve consensus problems.  相似文献
3.
This paper studies the mean square consentability problem for a network of double-integrator agents with stochastic switching topology. It is proved that in Markov-switching topologies, the network is mean square consentable under linear consensus protocol if and only if the union of graphs in the switching topology set has globally reachable nodes. A necessary and sufficient condition of the mean square consensus is obtained. Finally, an LMI approach to the design of the consensus protocol is presented. Numerical simulations are given to illustrate the results.  相似文献
4.
移动机器人编队自修复的切换拓扑控制   总被引:1,自引:0,他引:1       下载免费PDF全文
针对机器人缺失后的移动机器人编队自修复问题, 构建了结合切换拓扑和交互动力模型的移动机器人编队模型, 通过分析机器人缺失后的拓扑变化情况, 提出了网络切换拓扑控制, 该算法利用递归实现自修复, 并且是收敛的. 通过设计相应的分布式算法, 本文将拓扑控制转化为基于局部交互的递归自修复个体控制, 证明了编队自修复个体控制的稳定性. 最后针对编队任务, 通过仿真验证了切换拓扑控制的有效性, 和其他方法比较具有低恢复时间和低功率消耗的优点.  相似文献
5.
In this paper, a leader-following consensus problem of second-order multi-agent systems with fixed and switching topologies as well as non-uniform time-varying delays is considered. For the case of fixed topology, a necessary and sufficient condition is obtained. For the case of switching topology, a sufficient condition is obtained under the assumption that the total period over which the leader is globally reachable is sufficiently large. We not only prove that a consensus is reachable asymptotically but also give an estimation of the convergence rate. An example with simulation is presented to illustrate the theoretical results.  相似文献
6.
This paper investigates consensus problems for directed networks of agents with external disturbances and model uncertainty on fixed and switching topologies. Both networks with and without time-delay are taken into consideration. In doing the analysis, we first perform a model transformation and turn the original system into a reduced-order system. Based on this reduced-order system, we then present conditions under which all agents reach consensus with the desired H performance. Finally, simulation results are provided to demonstrate the effectiveness of our theoretical results.  相似文献
7.
Cheng-Lin Liu  Fei Liu 《Automatica》2011,(9):2130-2133
Consensus seeking is investigated for the discrete-time heterogeneous multi-agent systems composed of first-order agents and second-order agents, and two stationary consensus algorithms are constructed for the first-order agents and the second-order agents, respectively. Based on the properties of nonnegative matrices, sufficient consensus criteria are obtained for the agents with bounded communication delays under fixed topology and switching topologies, respectively. With some prerequisites on the coupling weights and the sampling interval, the asymptotic consensus achievement of the dynamic agents is independent of the communication delay, but strictly depends on the connectedness of the interconnection topology. Simulation results illustrate the correctness of the results.  相似文献
8.
受损多智能体系统的信息一致性   总被引:1,自引:1,他引:0       下载免费PDF全文
严卫生  李俊兵  王银涛 《自动化学报》2012,38(11):1880-1884
针对受损多智能体系统的信息一致性问题, 基于代数图论提出了联合r连通概念, 给出了当系统中的部分成员受损或离开后不能继续原有工作时, 其余成员仍可实现一致性的充要条件. 研究结果表明, 在此条件下系统可失去成员的数量取决于系统的通信能力. 仿真实例验证了理论分析结果的正确性和有效性.  相似文献
9.
多个体协调控制问题综述   总被引:1,自引:0,他引:1       下载免费PDF全文
闵海波  刘源  王仕成  孙富春 《自动化学报》2012,38(10):1557-1570
对多个体协调控制问题的研究现状进行综述. 介绍了多个体协调控制领域的基本问题, 并结合系统中网络与动力学不确定性, 对该领域当前的研究热点和前沿进行分析阐述. 进一步, 对工程中广为应用的Euler-Lagrange系统协调控制最新研究成果进行归纳总结. 最后指出该研究领域存在的问题及今后的研究方向.  相似文献
10.
In this paper, two kinds of consensus problems for second-order agents under directed and arbitrarily switching topologies are investigated, that is, the cases without and with communication delay. For the former, by constructing a new kind of digraph and employing a new graphic method, we can specify the least convergence rate for all the agents to reach consensus. For the latter, in virtue of a matrix inequality method, a sufficient condition in the form of feasible matrix inequalities is presented for all the agents to reach consensus. This, on the other hand, shows that consensus can be reached if the delay is small enough. Finally, two numerical examples are given to demonstrate the effectiveness and advantages of the proposed results.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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