Huiliang Zhang, C. Miao, Shell-Ying Huang, Zhiqi Shen, Xudong Luo
{"title":"BDI代理的响应速度有多快?","authors":"Huiliang Zhang, C. Miao, Shell-Ying Huang, Zhiqi Shen, Xudong Luo","doi":"10.1109/WI-IAT.2010.248","DOIUrl":null,"url":null,"abstract":"It is very important to know how fast a BDI agent can react to and process incoming event sequences if we want to apply such autonomous agents into time-sensitive applications like the Close-In weapon system in air-carriers. In [15], we proposed an analysis method for traditional sequential agents. In this paper we extend the theoretical analysis method to parallel BDI agents. Our method can estimate the average response time using the average attributes of a sequence of events based on probability and queueing theory. The simulation experiments show that our theoretical analysis method is effective. We also show by an experiment that an agent that dynamically allocates its computational time resources perform better than one that does not. Thus, the theoretical method suggests a way to quickly estimate the performance of an agent if the average attributes of the incoming event sequence are known in advance. Such an analysis of average response time can definitely benefit constructing more efficient BDI agents that situate in time-sensitive environments.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"How Fast Can a BDI Agent Respond?\",\"authors\":\"Huiliang Zhang, C. Miao, Shell-Ying Huang, Zhiqi Shen, Xudong Luo\",\"doi\":\"10.1109/WI-IAT.2010.248\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is very important to know how fast a BDI agent can react to and process incoming event sequences if we want to apply such autonomous agents into time-sensitive applications like the Close-In weapon system in air-carriers. In [15], we proposed an analysis method for traditional sequential agents. In this paper we extend the theoretical analysis method to parallel BDI agents. Our method can estimate the average response time using the average attributes of a sequence of events based on probability and queueing theory. The simulation experiments show that our theoretical analysis method is effective. We also show by an experiment that an agent that dynamically allocates its computational time resources perform better than one that does not. Thus, the theoretical method suggests a way to quickly estimate the performance of an agent if the average attributes of the incoming event sequence are known in advance. Such an analysis of average response time can definitely benefit constructing more efficient BDI agents that situate in time-sensitive environments.\",\"PeriodicalId\":340211,\"journal\":{\"name\":\"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WI-IAT.2010.248\",\"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/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IAT.2010.248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
It is very important to know how fast a BDI agent can react to and process incoming event sequences if we want to apply such autonomous agents into time-sensitive applications like the Close-In weapon system in air-carriers. In [15], we proposed an analysis method for traditional sequential agents. In this paper we extend the theoretical analysis method to parallel BDI agents. Our method can estimate the average response time using the average attributes of a sequence of events based on probability and queueing theory. The simulation experiments show that our theoretical analysis method is effective. We also show by an experiment that an agent that dynamically allocates its computational time resources perform better than one that does not. Thus, the theoretical method suggests a way to quickly estimate the performance of an agent if the average attributes of the incoming event sequence are known in advance. Such an analysis of average response time can definitely benefit constructing more efficient BDI agents that situate in time-sensitive environments.