基于可扩展多目标安全博弈的可证明空间离散化进化搜索

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Hong Qian , Yu-Peng Wu , Rong-Jun Qin , Xin An , Yi Chen , Aimin Zhou
{"title":"基于可扩展多目标安全博弈的可证明空间离散化进化搜索","authors":"Hong Qian ,&nbsp;Yu-Peng Wu ,&nbsp;Rong-Jun Qin ,&nbsp;Xin An ,&nbsp;Yi Chen ,&nbsp;Aimin Zhou","doi":"10.1016/j.swevo.2024.101770","DOIUrl":null,"url":null,"abstract":"<div><div>In the field of security, multi-objective security games (MOSGs) allow defenders to simultaneously protect targets from multiple heterogeneous attackers. MOSGs aim to simultaneously maximize all the heterogeneous payoffs, e.g., life, money, and crime rate, without merging heterogeneous attackers. In real-world scenarios, the number of targets and heterogeneous attackers may exceed the capability of most existing state-of-the-art (SOTA) methods, i.e., MOSGs are limited by the issue of scalability. In fact, there is still a lack of algorithms to improve scalability while ensuring accuracy. To this end, this paper proposes a general framework named Space Discretization based Evolutionary Search (SDES) based on many/multi-objective evolutionary algorithms (MOEAs) to scale up MOSGs to large-scale targets and heterogeneous attackers. SDES consists of four consecutive key components, i.e., discretization, optimization, evaluation, and refinement. Specifically, SDES first discretizes the originally high-dimensional continuous solution space to the low-dimensional discrete one by the maximal indifference property in game theory. This property helps EAs bypass the high-dimensional step function and simplify the solution of large-scale MOSGs. Then, MOEAs are used for optimization in the low-dimensional discrete solution space to obtain a well-spaced Pareto front. To evaluate solutions, SDES restores solutions back to the original space via greedily optimizing a novel divergence measurement. Finally, the refinement in SDES boosts the optimization performance with acceptable cost. Theoretically, we prove the optimization consistency and convergence of SDES. Experiment results show that SDES is the first linear-time MOSG algorithm for both large-scale attackers and targets. SDES can solve up to 20 attackers and 100 targets MOSG problems, while SOTA methods can only solve up to 8 attackers and 25 targets. An ablation study verifies the necessity of all components in SDES.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"92 ","pages":"Article 101770"},"PeriodicalIF":8.2000,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Provable space discretization based evolutionary search for scalable multi-objective security games\",\"authors\":\"Hong Qian ,&nbsp;Yu-Peng Wu ,&nbsp;Rong-Jun Qin ,&nbsp;Xin An ,&nbsp;Yi Chen ,&nbsp;Aimin Zhou\",\"doi\":\"10.1016/j.swevo.2024.101770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In the field of security, multi-objective security games (MOSGs) allow defenders to simultaneously protect targets from multiple heterogeneous attackers. MOSGs aim to simultaneously maximize all the heterogeneous payoffs, e.g., life, money, and crime rate, without merging heterogeneous attackers. In real-world scenarios, the number of targets and heterogeneous attackers may exceed the capability of most existing state-of-the-art (SOTA) methods, i.e., MOSGs are limited by the issue of scalability. In fact, there is still a lack of algorithms to improve scalability while ensuring accuracy. To this end, this paper proposes a general framework named Space Discretization based Evolutionary Search (SDES) based on many/multi-objective evolutionary algorithms (MOEAs) to scale up MOSGs to large-scale targets and heterogeneous attackers. SDES consists of four consecutive key components, i.e., discretization, optimization, evaluation, and refinement. Specifically, SDES first discretizes the originally high-dimensional continuous solution space to the low-dimensional discrete one by the maximal indifference property in game theory. This property helps EAs bypass the high-dimensional step function and simplify the solution of large-scale MOSGs. Then, MOEAs are used for optimization in the low-dimensional discrete solution space to obtain a well-spaced Pareto front. To evaluate solutions, SDES restores solutions back to the original space via greedily optimizing a novel divergence measurement. Finally, the refinement in SDES boosts the optimization performance with acceptable cost. Theoretically, we prove the optimization consistency and convergence of SDES. Experiment results show that SDES is the first linear-time MOSG algorithm for both large-scale attackers and targets. SDES can solve up to 20 attackers and 100 targets MOSG problems, while SOTA methods can only solve up to 8 attackers and 25 targets. An ablation study verifies the necessity of all components in SDES.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"92 \",\"pages\":\"Article 101770\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2024-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650224003080\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224003080","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

在安全领域,多目标安全博弈(MOSGs)允许防御者同时保护目标免受多个异质攻击者的攻击。多目标安全博弈的目标是在不合并异质攻击者的情况下,同时使所有异质回报(如生命、金钱和犯罪率)最大化。在现实世界中,目标和异质攻击者的数量可能会超出大多数现有先进(SOTA)方法的能力,也就是说,MOSGs 受限于可扩展性问题。事实上,目前仍缺乏既能提高可扩展性又能确保准确性的算法。为此,本文提出了一个基于多目标进化算法(MOEAs)的通用框架,命名为基于空间离散化的进化搜索(SDES),以将 MOSGs 扩展到大规模目标和异构攻击者。SDES 包括四个连续的关键部分,即离散化、优化、评估和细化。具体来说,SDES 首先利用博弈论中的最大无偏好特性,将原本的高维连续解空间离散为低维离散空间。这一特性有助于 EA 绕过高维阶跃函数,简化大规模 MOSG 的求解过程。然后,在低维离散解空间中使用 MOEA 进行优化,以获得间隔良好的帕累托前沿。为了评估解决方案,SDES 通过贪婪地优化新颖的发散测量,将解决方案恢复到原始空间。最后,SDES 中的细化以可接受的成本提高了优化性能。我们从理论上证明了 SDES 的优化一致性和收敛性。实验结果表明,SDES 是首个适用于大规模攻击者和目标的线性时间 MOSG 算法。SDES 可以解决多达 20 个攻击者和 100 个目标的 MOSG 问题,而 SOTA 方法只能解决多达 8 个攻击者和 25 个目标的问题。一项消融研究验证了 SDES 中所有组件的必要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Provable space discretization based evolutionary search for scalable multi-objective security games
In the field of security, multi-objective security games (MOSGs) allow defenders to simultaneously protect targets from multiple heterogeneous attackers. MOSGs aim to simultaneously maximize all the heterogeneous payoffs, e.g., life, money, and crime rate, without merging heterogeneous attackers. In real-world scenarios, the number of targets and heterogeneous attackers may exceed the capability of most existing state-of-the-art (SOTA) methods, i.e., MOSGs are limited by the issue of scalability. In fact, there is still a lack of algorithms to improve scalability while ensuring accuracy. To this end, this paper proposes a general framework named Space Discretization based Evolutionary Search (SDES) based on many/multi-objective evolutionary algorithms (MOEAs) to scale up MOSGs to large-scale targets and heterogeneous attackers. SDES consists of four consecutive key components, i.e., discretization, optimization, evaluation, and refinement. Specifically, SDES first discretizes the originally high-dimensional continuous solution space to the low-dimensional discrete one by the maximal indifference property in game theory. This property helps EAs bypass the high-dimensional step function and simplify the solution of large-scale MOSGs. Then, MOEAs are used for optimization in the low-dimensional discrete solution space to obtain a well-spaced Pareto front. To evaluate solutions, SDES restores solutions back to the original space via greedily optimizing a novel divergence measurement. Finally, the refinement in SDES boosts the optimization performance with acceptable cost. Theoretically, we prove the optimization consistency and convergence of SDES. Experiment results show that SDES is the first linear-time MOSG algorithm for both large-scale attackers and targets. SDES can solve up to 20 attackers and 100 targets MOSG problems, while SOTA methods can only solve up to 8 attackers and 25 targets. An ablation study verifies the necessity of all components in SDES.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信