期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
一个面向复杂任务的多机器人分布式协调系统 被引量:19
1
作者 陈卫东 席裕庚 +1 位作者 顾冬雷 董胜龙 《控制理论与应用》 EI CAS CSCD 北大核心 2002年第4期505-510,共6页
基于多智能体系统理论 ,研究在非结构、不确定环境下面向复杂任务的多机器人分布式协调系统的实现原理、方法和技术 .提出的递阶混合式协调结构、基于网络的通讯模式和基于有限状态机的规划与控制集成方法 ,充分考虑了复杂任务和真实自... 基于多智能体系统理论 ,研究在非结构、不确定环境下面向复杂任务的多机器人分布式协调系统的实现原理、方法和技术 .提出的递阶混合式协调结构、基于网络的通讯模式和基于有限状态机的规划与控制集成方法 ,充分考虑了复杂任务和真实自然环境的特点 .通过构建一个全实物的多移动机器人实验平台 ,对规划、控制、传感、通讯、协调与合作的各关键技术进行了开发和集成 ,使多机器人分布式协调技术的研究直接面向实际应用 ,编队和物料搬运的演示实验结果展示了多机器人协调技术的广阔应用前景 . 展开更多
关键词 复杂任务 多机器人分布式协调系统 分布式自治系统 递阶混合式协调结构 人工智能 多智能体系统
下载PDF
基于分布式协调系统的并行频繁模式增长算法的优化 被引量:1
2
作者 王洁 戴清灏 李环 《计算机科学》 CSCD 北大核心 2012年第3期170-173,共4页
频繁模式挖掘可以发现数据中频繁出现的模式,是关联规则挖掘的重要步骤。并行频繁模式算法将其应用到并行环境中,以对海量数据进行挖掘。在Apache软件基金会的Mahout项目实现的基础上,对计数和排序阶段以及算法的执行顺序提出了新的优... 频繁模式挖掘可以发现数据中频繁出现的模式,是关联规则挖掘的重要步骤。并行频繁模式算法将其应用到并行环境中,以对海量数据进行挖掘。在Apache软件基金会的Mahout项目实现的基础上,对计数和排序阶段以及算法的执行顺序提出了新的优化策略。优化后的设计将计数信息存储在分布式协调系统上,充分地利用了分布式协调系统的高可用性、适宜存储元数据信息的特点。该设计减小了小文件在分布式文件系统(HDFS)上的开销,同时保留了其优点,还能使计数过程和排序过程并行执行,减小了计算节点的内存开销。对比了文件系统I/O的开销,并分析了实现设计中的难点,为未来的工作打下了基础。 展开更多
关键词 频繁模式增长算法 并行数据挖掘 分布式协调系统 性能优化
下载PDF
Convergence Analysis and Its Application in the Fixed Point Formulation of Medium Access in Wireless Network
3
作者 周安福 刘敏 焦学武 《China Communications》 SCIE CSCD 2011年第1期43-49,共7页
In the Internet of things, it is of critical importance to fully utilize the potential capacity of the network with efficient medium access control (MAC) mechanisms. In this paper, we study the convergence property ... In the Internet of things, it is of critical importance to fully utilize the potential capacity of the network with efficient medium access control (MAC) mechanisms. In this paper, we study the convergence property of the fixed point formulation of distributed coordination function (DCF), which is widely used for medium access control in wireless networks. We first Kind that the fixed point could be repelling, which means that it is impossible for an MAC system to converge at its fixed point. Next, we show the existence of periodic points to prove that the fixed point function will oscillate between two periodic points when the fixed point is repelling. We also find that the average of the two periodic points is a close approximation of the fixed point. Based on the findings, we propose an algorithm to compute the fixed point efficiently. Simulation results verify the accuracy and efficiency of our algorithm compared with the previous fixed point computing method. 展开更多
关键词 resource allocation in wireless networks DCF fixed point formulation convergence property
下载PDF
Optimal design of coordination control strategy for distributed generation system
4
作者 王爱华 Norapon Kanjanapadit 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2009年第1期51-56,共6页
This paper presents a novel design procedure for optimizing the power distribution strategy in distributed generation system. A coordinating controller, responsible to distribute the total load power request among mul... This paper presents a novel design procedure for optimizing the power distribution strategy in distributed generation system. A coordinating controller, responsible to distribute the total load power request among multiple DG units, is suggested based on the conception of hierarchical control structure in the dynamic system. The optimal control problem was formulated as a nonlinear optimization problem subject to set of constraints. The resulting problem was solved using the Kuhn-Tucker method. Computer simulation results demonstrate that the proposed method can provide better efficiency in terms of reducing total costs compared to existing methods. In addition, the proposed optimal load distribution strategy can be easily implemented in real-time thanks to the simplicity of closed-form solutions. 展开更多
关键词 distributed generation coordination control strategy Kuhn-Tucker method
下载PDF
Distributed coordination in multi-agent systems: a graph Laplacian perspective 被引量:6
5
作者 Zhi-min HAN Zhi-yun LIN +1 位作者 Min-yue FU Zhi-yong CHEN 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2015年第6期429-448,共20页
This paper reviews some main results and progress in distributed multi-agent coordination from a graph Laplacian perspective. Distributed multi-agent coordination has been a very active subject studied extensively by ... This paper reviews some main results and progress in distributed multi-agent coordination from a graph Laplacian perspective. Distributed multi-agent coordination has been a very active subject studied extensively by the systems and control community in last decades, including distributed consensus, formation control, sensor localization, distributed optimization, etc. The aim of this paper is to provide both a comprehensive survey of existing literature in distributed multi-agent coordination and a new perspective in terms of graph Laplacian to categorize the fundamental mechanisms for distributed coordination. For different types of graph Laplacians, we summarize their inherent coordination features and specific research issues. This paper also highlights several promising research directions along with some open problems that are deemed important for future study. 展开更多
关键词 Multi-agent systems Distributed coordination Graph Laplacian
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部