Annals of Mathematics and Artificial Intelligence最新文献

Preface special issue on agents and robots for reliable engineered autonomy (AREA 2023) 前言：用于可靠工程自主的代理和机器人特刊（AREA 2023）

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-06-18 DOI: 10.1007/s10472-025-09991-9

Angelo Ferrando, Rafael C. Cardoso

引用次数: 0

Data science meets optimization II 数据科学与优化2

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-04-16 DOI: 10.1007/s10472-025-09980-y

Yingqian Zhang, Tias Guns, Michele Lombardi, Patrick De Causmaecker

引用次数: 0

35 years of math and AI 35年的数学和人工智能

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-10 DOI: 10.1007/s10472-025-09969-7

Martin Charles Golumbic

引用次数: 0

The future starts now 未来从现在开始

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-02-05 DOI: 10.1007/s10472-025-09970-0

Jürgen Dix, Michael Fisher

引用次数: 0

Guest editorial: Revised selected papers from the LION 16 conference 客座编辑：修订了LION 16会议的部分论文

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-01-06 DOI: 10.1007/s10472-024-09958-2

Ilias S. Kotsireas, Panos M. Pardalos

引用次数: 0

A formal approach to attack graphs 攻击图的正式方法

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2025-01-02 DOI: 10.1007/s10472-024-09959-1

Davide Catta, Jean Leneutre, Vadim Malvone, Aniello Murano

引用次数: 0

Preface to the special issue on analogies: from mathematical foundations to applications and interactions with ML and AI 关于类比的特刊前言：从数学基础到应用以及与ML和AI的交互

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-12-28 DOI: 10.1007/s10472-024-09961-7

Miguel Couceiro, Esteban Marquer, Pierre Monnin, Pierre-Alexandre Murena

引用次数: 0

A multi-algorithm pathfinding method: Exploiting performance variations for enhanced efficiency 一种多算法寻路方法：利用性能变化来提高效率

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-11-14 DOI: 10.1007/s10472-024-09957-3

Aya Kherrour, Marco Robol, Marco Roveri, Paolo Giorgini

{"title":"A multi-algorithm pathfinding method: Exploiting performance variations for enhanced efficiency","authors":"Aya Kherrour, Marco Robol, Marco Roveri, Paolo Giorgini","doi":"10.1007/s10472-024-09957-3","DOIUrl":"10.1007/s10472-024-09957-3","url":null,"abstract":"<div><p>This paper presents a performance evaluation of several heuristic search algorithms in the context of pathfinding. Our objective is to assess the performance of these algorithms in various grid-based environments to present how specific domain features influence their efficiency. Additionally, we extend our experiments by incorporating Multi-Agent Path Finding (MAPF) benchmarks, using handcrafted features and features extracted with Convolutional Neural Network (CNN) to characterize the maps. The results of our evaluation were later used to train machine learning models capable of predicting the efficient algorithm for a given pathfinding task based on performance criteria. This multi-algorithm pathfinding method enhances the selection of the best algorithm for different pathfinding problems. Furthermore, we revealed the most important features that impact the selection of the efficient algorithm. We identify the most important characteristics of the grid that affect the selection and performance of the algorithms.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 4","pages":"569 - 588"},"PeriodicalIF":1.0,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-024-09957-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145164952","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

Common equivalence and size of forgetting from Horn formulae 霍恩公式中常见的等效和遗忘量

IF 1.2 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-10-29 DOI: 10.1007/s10472-024-09955-5

Paolo Liberatore

引用次数: 0

Multi-trainer binary feedback interactive reinforcement learning 多训练器二元反馈交互式强化学习

IF 1 4区计算机科学

Annals of Mathematics and Artificial Intelligence Pub Date : 2024-10-02 DOI: 10.1007/s10472-024-09956-4

Zhaori Guo, Timothy J. Norman, Enrico H. Gerding

{"title":"Multi-trainer binary feedback interactive reinforcement learning","authors":"Zhaori Guo, Timothy J. Norman, Enrico H. Gerding","doi":"10.1007/s10472-024-09956-4","DOIUrl":"10.1007/s10472-024-09956-4","url":null,"abstract":"<div><p>Interactive reinforcement learning is an effective way to train agents via human feedback. However, it often requires the <i>trainer</i> (a human who provides feedback to the agent) to know the correct action for the agent. If the trainer is not always reliable, the wrong feedback may hinder the agent’s training. In addition, there is no consensus on the best form of human feedback in interactive reinforcement learning. To address these problems, in this paper, we explore the performance of binary reward as the reward form. Moreover, we propose a novel interactive reinforcement learning system called Multi-Trainer Interactive Reinforcement Learning (MTIRL), which can aggregate binary feedback from multiple imperfect trainers into a reliable reward for agent training in a reward-sparse environment. In addition, the review model in MTIRL can correct the unreliable rewards. In particular, our experiments for evaluating reward forms show that binary reward outperforms other reward forms, including ranking reward, scaling reward, and state value reward. In addition, our question-answer experiments show that our aggregation method outperforms the state-of-the-art aggregation methods, including majority voting, weighted voting, and the Bayesian aggregation method. Finally, we conduct grid-world experiments to show that the policy trained by the MTIRL with the review model is closer to the optimal policy than that without a review model.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"93 4","pages":"491 - 516"},"PeriodicalIF":1.0,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145161045","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