首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   27篇
  国内免费   2篇
  完全免费   8篇
  自动化技术   37篇
  2018年   1篇
  2017年   1篇
  2015年   2篇
  2014年   1篇
  2013年   3篇
  2012年   1篇
  2011年   2篇
  2010年   2篇
  2009年   2篇
  2008年   2篇
  2007年   6篇
  2006年   3篇
  2005年   2篇
  2004年   4篇
  2002年   1篇
  2001年   1篇
  2000年   1篇
  1999年   2篇
排序方式: 共有37条查询结果,搜索用时 76 毫秒
1.
用遗传算法实现多智能体联盟的形成   总被引:8,自引:0,他引:8  
在多Agent系统中,当单个Agent不能或不能有效完成特定的任务时,任务就必需分配给一组Agent,即Agent将形成联盟。本文将讨论Agent联盟的形成,并将遗传算法应用于Agent联盟形成中,希望可以快速、高效地找出合适的Agent联盟。  相似文献
2.
基于Agent能力自信度的任务分配问题研究   总被引:8,自引:0,他引:8  
曾广周  杨公平  王晓琳 《计算机学报》2007,30(11):1922-1929
借助结盟的任务分配机制是多Agent系统研究中的一个热点问题.文中通过任务需求和Agent能力的ECA规则表示,定义了一种Agent能力自信度,并给出了基于合同网协议和Agent能力自信度的任务分配算法和应用示例,其中,任务需求ECA规则中的C项表示Agent执行该任务时必须做出的付出,能力ECA规则中的C项表示Agent可以为该任务做出的承诺,付出/承诺关系揭示了Agent的能力自信度,ECA规则使得Agent能力自信度具有良好的可计算性.  相似文献
3.
基于Agent联盟机制的网格资源协同分配   总被引:5,自引:0,他引:5  
在网格计算环境,许多应用的执行经常需要同时协同分配多个资源以满足性能需求。文中提出了一种新的基于Agent联盟机制的资源协同分配方法。首先,对Globus和Legion的资源协同分配的方法进行了比较。然后,描述了一个基于Agent的网格资源管理结构。最后,设计了一个Agent联盟机制用于有效的资源协同分配。  相似文献
4.
Climate Coalitions in an Integrated Assessment Model   总被引:4,自引:0,他引:4  
An analytically tractable approximation of a numerical model is used toinvestigate coalition formation between nine major world regions withregard to their policies for greenhouse gas emission reduction. Fullcooperation is not individually rational. Assuming non-transferableutility, side payments do not ensure full cooperation either. Withoutside payments, the largest stable coalitions are small and consist ofsimilar regions. With side payments, the largest stable coalitionsexclude either the main culprits or the main victims of climate change.In all cases, optimal emission control is modest.  相似文献
5.
帅典勋  王亮 《计算机学报》2002,25(8):853-859
当多Agent系统(MAS)中Agent之间存在多种复杂的随机的社会交互行为时,当各Agent表现出不同程度的自治性和理性时,难以用现有的方法描述和求解MAS问题,即使对仅仅存在竞争和合作这两种社会交互行为,并且不考虑Agent之间自治程度的本质性差异时,现有的基于结盟的MAS问题求解算法也具有极高的计算复杂性,该文提出一种新的复合弹簧网络模型和方法,利用分布式弹性动力学方程,将MAS分布式问题求解过程转变对应的复合弹簧网络形变过程,这种模型和方法能够处理各种社会交互行为以及Agent不同程度的自治性,分析和仿真实验表明,在计算复杂性和适用性等许多方面,该文的分布并行算法优于文献[7,8]的Shehory-Kraus算法。  相似文献
6.
组合电子市场中多Agent联盟形成的动态特性分析   总被引:3,自引:0,他引:3       下载免费PDF全文
龚勇  姚莉  沙基昌 《软件学报》2007,18(3):657-668
在给出一种多Agent中介系统控制的组合电子市场模型的基础上,利用基于群集智能的多Agent系统分析方法,针对中介主导的组合电子市场中大量消费者联盟形成的问题,从组合市场的宏观层次将其抽象为一个具有随机特性的群集系统,为多Agent间交互的动态特性作出宏观层次的定量分析.根据群集系统的速率方程,首先给出了一个反映组合市场中市场结构动态变化的微分方程,然后通过数值仿真,验证了组合贸易中多Agent联盟形成的可行性和有效性,分析了中介主导型商务系统这种新的电子市场模式存在的价值,并通过与相关工作的比较证明了多  相似文献
7.
基于Agent的电子市场结伴购买算法   总被引:2,自引:1,他引:1  
韩伟  王云  王成道 《计算机应用》2004,24(8):145-147
以电子商务市场中买方Agent的结伴购买为背景,研究了自利主体的动态结盟问题。基于博弈论,考虑协商花费为常数情况,若所有Agent都采用“底线”策略,存在唯一的纳什平衡解。最后给出了计算底线值的方法及算法。  相似文献
8.
Searching for overlapping coalitions in multiple virtual organizations   总被引:2,自引:0,他引:2  
Coalition formation is an active and essential component for multi-agent systems (MAS) in task-oriented domains in which tasks can be too complicated to be accomplished by a single agent with insufficient resources. By forming a coalition, agents are able to cooperate and combine resources to complete tasks that are impossible to accomplish alone within a given time bound. For example, in virtual enterprises, small and agile enterprises can provide more services and make more profits than an individual can. In many multi-task environments, especially in parallel multi-task environments, an individual abundant in resources is inclined to undertake more than one task to make more profits and participate in multiple virtual organizations (MVOs) at the same time, where every member has to decide how to allocate different parts of its resources to serve multiple different project tasks. Such overlapping property is a very intractable problem in practical decision making, and to the best of our knowledge, current coalition formation algorithms typically exclude the possibility of having overlapping coalitions, that is an agent can only be a member of one coalition at any given time, leading to waste of resources, preventing the system from efficiently allocating all agents’ resources, and limiting the scope of their applications in real-world scenarios. Indeed, overlapping coalition formation (OCF) is an important research question, because MVOs are very crucial and beneficial in parallel multi-task domains where only a few selected individuals have rare, but highly demanded, resources. With this in mind, we develop a discrete particle swarm optimization based algorithm to solve the OCF problem in MVOs, applicable for more complex virtual enterprises environments. We introduce a two-dimensional binary encoding scheme and propose a novel repairing strategy for resolving conflicts over the usage of joint resources among overlapping coalitions. With this novel strategy for cooperative conflict resolution, any invalid encoding can be adjusted into a valid one without any resource conflict. Finally, simulations are conducted to show the efficiency of the proposed algorithm.  相似文献
9.
Cooperating and sharing resources by creating coalitions of agents are important ways for autonomous agents to execute tasks and to maximize payoff. Such coalitions will form only if each member of a coalition gains more by joining the coalition than it could gain otherwise. There are several ways of creating such coalitions and dividing the joint payoff among the members. In this paper we present algorithms for coalition formation and payoff distribution in nonsuperadditive environments. We focus on a low-complexity kernel-oriented coalition formation algorithm. The properties of this algorithm were examined via simulations. These have shown that the model increases the benefits of the agents within a reasonable time period, and more coalition formations provide more benefits to the agents.
  相似文献
10.
Automated negotiation and coalition formation among self-interested agents are playing an increasingly important role in electronic commerce. Such agents cannot be coordinated by externally imposing their strategies. Instead the interaction protocols have to be designed so that each agent is motivated to follow the strategy that the protocol designer wants it to follow. This paper reviews six component technologies that we have developed for making such interactions less manipulable and more efficient in terms of the computational processes and the outcomes: 1. OCSM-contracts in marginal cost based contracting, 2. leveled commitment contracts, 3. anytime coalition structure generation with worst case guarantees, 4. trading off computation cost against optimization quality within each coalition, 5. distributing search among insincere agents, and 6. unenforced contract execution. Each of these technologies represents a different way of battling self-interest and combinatorial complexity simultaneously. This is a key battle when multi-agent systems move into large-scale open settings.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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