共查询到20条相似文献，搜索用时 156 毫秒
1.
提出了二阶多智能体系统快速收敛模型,分析了二阶多智能体系统达到一致性的条件,并对有向网络为动态拓扑结构时多智能体达到一致性的条件给出了理论证明,最后通过仿真对比说明了提出模型的快速性和有效性。 相似文献
2.
3.
4.
《科学学与科学技术管理》2017,(4)
内部知识组合是企业知识创新的重要前因。企业知识基础的一致性与多样性分别从知识组合的难易程度与新知识组合的机率对企业知识创新产生正向影响。同时,研发人员之间的合作关系所形成的合作网络也影响着企业知识组合的特征,其中合作网络的密度与程度中心势从不同方向影响关系网络中异质知识的进入与员工的认知共识。因此,知识基础与合作网络的结构特征可能对企业知识创新有交互影响。通过分析中国20家汽车行业上市公司2000年到2015年申请的24 175个发明专利数据,发现企业知识基础的一致性与多样性正向影响知识创新,企业内部合作网络密度负向调节了企业知识基础一致性、多样性与知识创新的关系,网络程度中心势正向调节知识基础一致性与知识创新的关系。最后,就创新型企业的研发管理对策和相关理论展开了讨论。 相似文献
5.
当前,我国电信网络的主体还是以PSTN网络和IP网络二大独立体系为主,但随着新技术的高速发展和市场竞争的需要,原来的分散业务系统平台越来越不能满足综合业务发展的需要了,因此各大电信运行商都在有计划、有步骤地进行着现有网络向下一代通信网络的演进。 相似文献
6.
提出一种基于应用和用户需求的自适应的副本一致性维护机制,包括更新一致性和归并一致性.系统根据形式化的一致性需求实时调整一致性机制,达到副本一致性、可用性和系统性能之间的动态平衡.实验结果表明,该机制能够在保证一致性需求的情况下,显著降低操作代价并提高副本可用性. 相似文献
7.
张惠民 《内蒙古科技与经济》2007,(21):385-386
UMTS 网络具有应用范围广泛,使用要求不高的特点,UMTS 网络中依靠监控用户的QoS要求,通过性能管理器不断更新系统参数,向用户提供有区别的、有保证的传输质量服务.本文研究了更新系统参数的机制,建立了相应的数学模型,可用于下一步确定QoS 的优化方案. 相似文献
8.
9.
10.
文章介绍了某企业人事部门工资管理系统的设计和实现方案。系统实现了人员信息的集中管理、人员信息的自定义查询、工资查询、工资变更、工资导入、工资对账等功能,形成规模化、规范化的工资管理系统,行使包括工资、人事信息在内的综合管理职能,保证了总分结构企业数据的一致性、完整性和时效性。系统使总分结构企业的工资管理系统实现了资源的充分利用,使总分各部门的共同操作,能够在共同操作的情况下保持数据的一致性、完整性和时效性,使规范的管理通过网络深入到了工资管理整体流程中。 相似文献
11.
This paper investigates the problem of global leader-following consensus of multiple integrator agents subject to control input saturation. A weighted and saturated consensus algorithm is proposed to solve this problem. Both the case of an undirected communication topology and the case of a directed communication topology are considered. It is shown that global consensus of the multiple integrator agents can be reached under a general undirected graph or a detailed balanced directed graph provided that its generated graph contains a directed spanning tree. Numerical examples are provided to demonstrate the theoretical results. 相似文献
12.
Aijuan Wang Wanping Liu Tiehu Li Tingwen Huang 《Journal of The Franklin Institute》2021,358(6):3033-3050
This paper proposes a privacy-preserving consensus algorithm which enables all the agents in the directed network to eventually reach the weighted average of initial states, and while preserving the privacy of the initial state of each agent. A novel privacy-preserving scheme is proposed in our consensus algorithm where initial states are hidden in random values. We also develop detailed analysis based on our algorithm, including its convergence property and the topology condition of privacy leakages for each agent. It can be observed that final consensus point is independent of their initial values that can be arbitrary random values. Besides, when an eavesdropper exists and can intercept the data transmitted on the edges, we introduce an index to measure the privacy leakage degree of agents, and then analyze the degree of privacy leakage for each agent. Similarly, the degree for network privacy leakage is derived. Subsequently, we establish an optimization problem to find the optimal attacking strategy, and present a heuristic optimization algorithm based on the Sequential Least Squares Programming (SLSQP) to solve the proposed optimization problem. Finally, numerical experiments are designed to demonstrate the effectiveness of our algorithm. 相似文献
13.
《Journal of The Franklin Institute》2019,356(18):11581-11604
A solution is provided in this paper for the adaptive approximate consensus problem of nonlinear multi-agent systems with unknown and non-identical control directions assuming an underlying graph topology having a spanning tree. This is achieved with the introduction of a novel variable transformation called PI consensus error transformation. The new variables include the position error of each agent from some reference trajectory chosen by him, which represents the agent’s selection for the desired swarm trajectory, along with an integral term of the weighted total displacement of the agent’s position from all neighbor positions. It is proven that if these new variables are bounded and regulated to zero, then asymptotic approximate consensus among all agents is ensured. Using classical Nussbaum gain based techniques, distributed controllers are designed to regulate the PI consensus error variables to zero and ultimately solve the approximate agreement problem. The proposed approach also allows for a specific calculation of the final consensus trajectory based on the controller parameter selection and the associated graph topology. It is shown that all agent positions converge towards a neighborhood of the weighted average of all agents reference trajectories. Simulation results verify our theoretical derivations. 相似文献
14.
Tianrong Weng Lei Wang Zhikun She Quanyi Liang 《Journal of The Franklin Institute》2019,356(2):883-893
In this paper, a distributed projection algorithm based on the subgradient method is presented to solve the distributed optimization problem with a constrained set over a directed multi-agent network, where the designed protocol is scaled by the left eigenvector associated with the weighted adjacency matrix. By using the property of the projection operation and nonnegative almost supermartingales, we give the convergence analysis of our algorithm and show that the optimal solution is the ultimate consensus state of all agents to be reached. A numerical simulation for a specific optimization problem is given to verify the effectiveness of our algorithm. 相似文献
15.
《Journal of The Franklin Institute》2023,360(14):10706-10727
Distributed optimization over networked agents has emerged as an advanced paradigm to address large-scale control, optimization, and signal-processing problems. In the last few years, the distributed first-order gradient methods have witnessed significant progress and enrichment due to the simplicity of using only the first derivatives of local functions. An exact first-order algorithm is developed in this work for distributed optimization over general directed networks with only row-stochastic weighted matrices. It employs the rescaling gradient method to address unbalanced information diffusion among agents, where the weights on the received information can be arbitrarily assigned. Moreover, uncoordinated step-sizes are employed to magnify the autonomy of agents, and an error compensation term and a heavy-ball momentum are incorporated to accelerate convergency. A linear convergence rate is rigorously proven for strongly-convex objective functions with Lipschitz continuous gradients. Explicit upper bounds of step-size and momentum parameter are provided. Finally, simulations illustrate the performance of the proposed algorithm. 相似文献
16.
Hong-Yong Yang Yize Yang Fujun Han Mei Zhao Lei Guo 《Journal of The Franklin Institute》2019,356(2):752-765
Fractional-order calculus has been studied deeply because many networked systems can only be described with fractional-order dynamics in complex environments. When different agents of networked systems show diverse individual features, fractional-order dynamics with heterogeneous characters will be used to illustrate the multi-agent systems (MAS). Based on the distinguishing behaviors of agents, a compounded fractional-order multi-agent systems(FOMAS) is presented with diverse dynamical equations. Suppose multiple leader agents existing in FOMAS, containment consensus control of FOMAS with directed weighted topologies is studied. By applying frequency domain analysis theory of the fractional-order operator, an upper bound of delays is obtained to ensure containment controls of heterogenous FOMAS with communication delays. The consensus results of delayed fractional-order dynamics in this paper can be expanded to the integer-order models. Finally, the results are verified by simulation examples. 相似文献
17.
《Journal of The Franklin Institute》2023,360(7):4880-4895
In this paper, the event-triggered bipartite consensus problem is investigated for nonlinear multi-agent systems under switching topologies, only part of topologies contain directed spanning tree rooted at the leader. First, a dynamic bipartite compensator is constructed based on relative output information to provide control signal. Then, the time-varying gain method is adopted to propose a compensator-based event-triggered control protocol without Zeno behavior. Notably, the control protocol proposed achieves the bipartite consensus while reducing update frequency effectively. Moreover, a low conservative switching law is designed by the topology-dependent average dwell time strategy, which fully considers the differences among topologies and provides an independent average dwell time for each topology. As an extension, the nonlinear multi-agent systems with non-zero input of leader are further studied. Finally, a practical example is presented to demonstrate the feasibility of proposed control protocol. 相似文献
18.
In this paper, we study the algebraic connectivity of directed complex networks with scale-free property. Algebraic connectivity of a directed graph is the eigenvalue of its Laplacian matrix whose real part is the second smallest. This is known as an important measure for the diffusion speed of many diffusion processes over networks (e.g. consensus, information spreading, epidemics). We propose an algorithm, extending that of Barabasi and Albert, to generate directed scale-free networks, and show by simulations the relations between algebraic connectivity and network size, exponents of in/out-degree distributions, and minimum in/out degrees. The results are moreover compared to directed small-world networks, and demonstrated on a specific diffusion process, reaching consensus. 相似文献
19.
Weighted consensus multi-document summarization 总被引：1，自引：0，他引：1
Multi-document summarization is a fundamental tool for document understanding and has received much attention recently. Given a collection of documents, a variety of summarization methods based on different strategies have been proposed to extract the most important sentences from the original documents. However, very few studies have been reported on aggregating different summarization methods to possibly generate better summary results. In this paper, we propose a weighted consensus summarization method to combine the results from single summarization systems. We evaluate and compare our proposed weighted consensus method with various baseline combination methods. Experimental results on DUC2002 and DUC2004 data sets demonstrate the performance improvement by aggregating multiple summarization systems, and our proposed weighted consensus summarization method outperforms other combination methods. 相似文献
20.
《Journal of The Franklin Institute》2022,359(6):2693-2709
This paper considers the fixed-time bipartite consensus of nonlinear multi-agent systems (MASs) subjected to external disturbances. Under the directed signed networks, several sufficient conditions are proposed to guarantee the fixed-time bipartite consensus of MASs with or without leaders, respectively. Some discontinuous control protocols are developed to realize fixed-time tracking bipartite consensus of MASs with a leader. Moreover, the fixed-time leaderless bipartite consensus under directed signed graph are discussed as well. Two numerical examples are given to verify the effectiveness of the theoretical results. 相似文献