Annals of Mathematics and Artificial Intelligence最新文献_第8页

Altruism in coalition formation games 结盟博弈中的利他主义

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-31 DOI: 10.1007/s10472-023-09881-y

Anna Maria Kerkmann, Simon Cramer, Jörg Rothe

引用次数: 0

An improved multi-task least squares twin support vector machine 一种改进的多任务最小二乘双支持向量机

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-27 DOI: 10.1007/s10472-023-09877-8

H. Moosaei, F. Bazikar, P. Pardalos

引用次数: 0

MADTwin: a framework for multi-agent digital twin development: smart warehouse case study MADTwin:多智能体数字孪生开发框架:智能仓库案例研究

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-25 DOI: 10.1007/s10472-023-09872-z

Hussein Marah, Moharram Challenger

{"title":"MADTwin: a framework for multi-agent digital twin development: smart warehouse case study","authors":"Hussein Marah, Moharram Challenger","doi":"10.1007/s10472-023-09872-z","DOIUrl":"10.1007/s10472-023-09872-z","url":null,"abstract":"<div><p>A Digital Twin (DT) is a frequently updated virtual representation of a physical or a digital instance that captures its properties of interest. Incorporating both cyber and physical parts to build a digital twin is challenging due to the high complexity of the requirements that should be addressed and satisfied during the design, implementation and operation. In this context, we introduce the <b>MADTwin</b> (Multi-Agent Digital Twin) framework driven by a Multi-agent Systems (MAS) paradigm and supported by flexible architecture and extendible upper ontology for modelling agent-based digital twins. A comprehensive case study of a smart warehouse supported by multi-robots has been presented to show the feasibility and applicability of this framework. The introduced framework powered by intelligent agents integrated with enabler technologies enabled us to cope with parts of the challenges imposed by modelling and integrating Cyber-Physical Systems (CPS) with digital twins for multi-robots of the smart warehouse. In this framework, different components of CPS (robots) are represented as autonomous physical agents with their digital twin agents in the digital twin environment. Agents act autonomously and cooperatively to achieve their local goals and the objectives of the whole system. Eventually, we discuss the framework’s strengths and identify areas of improvement and plans for future work.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 4","pages":"975 - 1005"},"PeriodicalIF":1.2,"publicationDate":"2023-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44772092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Agents and Digital Twins for the engineering of Cyber-Physical Systems: opportunities, and challenges 网络物理系统工程中的代理和数字孪生:机遇与挑战

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-20 DOI: 10.1007/s10472-023-09884-9

Stefano Mariani, Marco Picone, Alessandro Ricci

引用次数: 0

Bayesian optimization over the probability simplex 概率单纯形上的贝叶斯优化

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-18 DOI: 10.1007/s10472-023-09883-w

Antonio Candelieri, Andrea Ponti, F. Archetti

引用次数: 1

Modelling a chain of command in the incident command system using sequential characteristic function games 用序列特征函数对策对事故指挥系统中的指挥链进行建模

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-15 DOI: 10.1007/s10472-023-09878-7

Tabajara Krausburg, Rafael H. Bordini, Jürgen Dix

引用次数: 0

Commitment-based negotiation semantics for accountability in multi-agent systems 多智能体系统中基于承诺的协商语义

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-08 DOI: 10.1007/s10472-023-09875-w

Phillip Sloan, Nirav Ajmeri

引用次数: 0

Local critical analysis of inequalities related to the sum of distances between n points on the unit hemisphere for (n=4,5) 单位半球上n点距离和不等式的局部临界分析 $$n=4,5$$

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-06 DOI: 10.1007/s10472-023-09880-z

Yaochen Xu, Zhenbing Zeng, Jian Lu, Yuzheng Wang, Liangyu Chen

{"title":"Local critical analysis of inequalities related to the sum of distances between n points on the unit hemisphere for (n=4,5)","authors":"Yaochen Xu, Zhenbing Zeng, Jian Lu, Yuzheng Wang, Liangyu Chen","doi":"10.1007/s10472-023-09880-z","DOIUrl":"10.1007/s10472-023-09880-z","url":null,"abstract":"<div><p>In this paper, we study a geometrical inequality conjecture which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is <span>(4+4sqrt{2})</span>, the best configuration is a regular square inscribed to the equator, and for any five points, the largest sum is <span>(5sqrt{5+2sqrt{5}})</span> and the best configuration is the regular pentagon inscribed to the equator. We prove that the conjectured configurations are local optimal, and construct a rectangular neighborhood of the local maximum point in the related feasible set, whose size is explicitly determined, and prove that (1): the objective function is bounded by a quadratic polynomial which takes the local maximum point as the unique critical point in the neighborhood, and (2): the remaining part of the feasible set can be partitioned into a finite union of a large number of very small cubes so that on each small cube, the conjecture can be verified by estimating the objective function with exact numerical computation. We also explain the method for constructing the neighborhoods and upper-bound quadratic polynomials in detail and describe the computation process outside the constructed neighborhoods briefly.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 6","pages":"865 - 898"},"PeriodicalIF":1.2,"publicationDate":"2023-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09880-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42818484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Controlling weighted voting games by deleting or adding players with or without changing the quota 控制加权投票游戏通过删除或添加玩家，或不改变配额

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-06 DOI: 10.1007/s10472-023-09874-x

Joanna Kaczmarek, Jörg Rothe

{"title":"Controlling weighted voting games by deleting or adding players with or without changing the quota","authors":"Joanna Kaczmarek, Jörg Rothe","doi":"10.1007/s10472-023-09874-x","DOIUrl":"10.1007/s10472-023-09874-x","url":null,"abstract":"<div><p>Weighted voting games are a well-studied class of succinct simple games that can be used to model collective decision-making in, e.g., legislative bodies such as parliaments and shareholder voting. Power indices [1,2,3,4] are used to measure the influence of players in weighted voting games. In such games, it has been studied how a distinguished player’s power can be changed, e.g., by merging or splitting players (the latter is a.k.a. false-name manipulation) [5, 6], by changing the quota [7], or via structural control by adding or deleting players [8]. We continue the work on the structural control initiated by Rey and Rothe [8] by solving some of their open problems. In addition, we also modify their model to a more realistic setting in which the quota is indirectly changed during the addition or deletion of players (in a different sense than that of Zuckerman et al. [7] who manipulate the quota directly without changing the set of players), and we study the corresponding problems in terms of their computational complexity.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 3","pages":"631 - 669"},"PeriodicalIF":1.2,"publicationDate":"2023-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09874-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138520484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Design and implementation of symbolic algorithms for the computation of generalized asymptotes 广义渐近线计算符号算法的设计与实现

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2023-07-03 DOI: 10.1007/s10472-023-09856-z

Marián Fernández de Sevilla, Rafael Magdalena Benedicto, Sonia Pérez-Díaz

{"title":"Design and implementation of symbolic algorithms for the computation of generalized asymptotes","authors":"Marián Fernández de Sevilla, Rafael Magdalena Benedicto, Sonia Pérez-Díaz","doi":"10.1007/s10472-023-09856-z","DOIUrl":"10.1007/s10472-023-09856-z","url":null,"abstract":"<div><p>In this paper we present two algorithms for computing the <i>g-asymptotes</i> or <i>generalized asymptotes</i>, of a plane algebraic curve, <span>(mathscr {C})</span>, implicitly or parametrically defined. The asymptotes of a curve <span>(mathscr {C})</span> reflect the status of <span>(mathscr {C})</span> at points with sufficiently large coordinates. It is well known that an asymptote of a curve <span>(mathscr {C})</span> is a line such that the distance between <span>(mathscr {C})</span> and the line approaches zero as they tend to infinity. However, a curve <span>(mathscr {C})</span> may have more general curves than lines describing the status of <span>(mathscr {C})</span> at infinity. These curves are known as <i>g-asymptotes</i> or <i>generalized asymptotes</i>. The pseudocodes of these algorithms are presented, as well as the corresponding implementations. For this purpose, we use the algebra software <span>Maple</span>. A comparative analysis of the algorithms is carried out, based on some properties of the input curves and their results to analyze the efficiency of the algorithms and to establish comparative criteria. The results presented in this paper are a starting point to generalize this study to surfaces or to curves defined by a non-rational parametrization, as well as to improve the efficiency of the algorithms. Additionally, the methods developed can provide a new and different approach in prediction (regression) or classification algorithms in the machine learning field.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 4","pages":"537 - 561"},"PeriodicalIF":1.2,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09856-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43041329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1