使用智能移动代理在时间限制下动态确定行程

Alex Magalhães, Luciana Rech, L. Lung, R. S. Oliveira
{"title":"使用智能移动代理在时间限制下动态确定行程","authors":"Alex Magalhães, Luciana Rech, L. Lung, R. S. Oliveira","doi":"10.1109/ETFA.2010.5641215","DOIUrl":null,"url":null,"abstract":"Algorithms to determine the itinerary of intelligent agents are fundamental in the context of distributed applications based on mobile agents with time constraints. In order to establish the agent itinerary it is necessary to consider the trade-offs between high-quality of results and meeting the deadline. In this paper, we describe and evaluate adaptive heuristics able to choose the best behaviour to be used for decision making in the itinerary definition. This decision-making is based on a log of benefits collected by the mobile agent in past executions. The paper's objective is to propose a new heuristic able to realize the change in the environment and adapt itself dynamically, changing its behaviour in order to meet the deadline of the mission and to achieve the greatest possible benefit.","PeriodicalId":201440,"journal":{"name":"2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Using intelligent mobile agents to dynamically determine itineraries with time constraints\",\"authors\":\"Alex Magalhães, Luciana Rech, L. Lung, R. S. Oliveira\",\"doi\":\"10.1109/ETFA.2010.5641215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Algorithms to determine the itinerary of intelligent agents are fundamental in the context of distributed applications based on mobile agents with time constraints. In order to establish the agent itinerary it is necessary to consider the trade-offs between high-quality of results and meeting the deadline. In this paper, we describe and evaluate adaptive heuristics able to choose the best behaviour to be used for decision making in the itinerary definition. This decision-making is based on a log of benefits collected by the mobile agent in past executions. The paper's objective is to propose a new heuristic able to realize the change in the environment and adapt itself dynamically, changing its behaviour in order to meet the deadline of the mission and to achieve the greatest possible benefit.\",\"PeriodicalId\":201440,\"journal\":{\"name\":\"2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETFA.2010.5641215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.2010.5641215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在具有时间约束的基于移动代理的分布式应用中,确定智能代理行程的算法是最基本的。为了确定代理行程,必须考虑结果质量和满足最后期限之间的权衡。在本文中,我们描述和评估了能够选择最佳行为的自适应启发式方法,以用于行程定义的决策。这个决策是基于移动代理在过去的执行中收集的收益日志。本文的目标是提出一种新的启发式算法,能够实现环境的变化,并动态地适应自己,改变自己的行为,以满足任务的最后期限,并实现最大可能的利益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Using intelligent mobile agents to dynamically determine itineraries with time constraints
Algorithms to determine the itinerary of intelligent agents are fundamental in the context of distributed applications based on mobile agents with time constraints. In order to establish the agent itinerary it is necessary to consider the trade-offs between high-quality of results and meeting the deadline. In this paper, we describe and evaluate adaptive heuristics able to choose the best behaviour to be used for decision making in the itinerary definition. This decision-making is based on a log of benefits collected by the mobile agent in past executions. The paper's objective is to propose a new heuristic able to realize the change in the environment and adapt itself dynamically, changing its behaviour in order to meet the deadline of the mission and to achieve the greatest possible benefit.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信