{"title":"A multi-agent method for periodicity detection in distributed events","authors":"A. Opalinski","doi":"10.1109/EUROCON.2015.7313704","DOIUrl":null,"url":null,"abstract":"Multi-agent systems working in constantly changing environments may be challenged by instantaneous unavailability of their autonomous agents caused e.g. by limited computing resources. A new method of self-organization of distributed service components is proposed, suitable for multi-agent systems. This method relies on particular agents carrying out separate analyzes of their individual processing loads or other specific events. Analysis is done separately by each agent, and is based only on information about agent's own history of involvements in former tasks' execution. Agents can also decide to replace peers should such need arise. The superposition of individual agents' readiness periods emerges as a collective forecast of service load. By individual agents' decisions appropriate amounts of agents get ready to execute forthcoming tasks.","PeriodicalId":133824,"journal":{"name":"IEEE EUROCON 2015 - International Conference on Computer as a Tool (EUROCON)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE EUROCON 2015 - International Conference on Computer as a Tool (EUROCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUROCON.2015.7313704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Multi-agent systems working in constantly changing environments may be challenged by instantaneous unavailability of their autonomous agents caused e.g. by limited computing resources. A new method of self-organization of distributed service components is proposed, suitable for multi-agent systems. This method relies on particular agents carrying out separate analyzes of their individual processing loads or other specific events. Analysis is done separately by each agent, and is based only on information about agent's own history of involvements in former tasks' execution. Agents can also decide to replace peers should such need arise. The superposition of individual agents' readiness periods emerges as a collective forecast of service load. By individual agents' decisions appropriate amounts of agents get ready to execute forthcoming tasks.