Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control
Fuad, Raihan
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering Energy Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
An Adaptive Swarm Clustering Algorithm for Game AI Based on Reinforcement Learning Godot and Particle Swarm Optimization (RLGPSO) Gelar, Trisna; Awaludin, Iwan; Pasya, Raditya; Fuad, Raihan; Solahudin, Muhammad Rizqi
Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control Vol. 11, No. 2, May 2026 (Article in Progress)
Publisher : Universitas Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22219/kinetik.v11i2.2480

Abstract

Managing extensive agent swarms presents a significant difficulty in dynamic, real-time situations, especially in gaming artificial intelligence, such as real-time strategy. Traditional Particle Swarm Optimization (PSO) techniques, while effective for optimization tasks, often exhibit suboptimal convergence and inadequate flexibility in complex, demanding situations. This study introduces an innovative hybrid approach that integrates Reinforcement Learning (RL) with PSO to create an adaptive swarm clustering system. This approach employs a Deep Deterministic Policy Gradient (DDPG) agent to dynamically modify PSO parameters, enabling the swarm to adeptly maneuver and cluster within a procedurally generated 2D simulation environment featuring physical obstacles, in contrast to earlier studies that depend on static mathematical benchmarks. A rigorous quantitative analysis using Mixed Linear Model Regression (MLMR) demonstrates that this hybrid method significantly and statistically outperforms conventional, manually tuned PSO in terms of convergence time and diversity value. For example, the RLGPSO model achieved an 11.46% reduction in convergence time on high-complexity maps, a result confirmed as statistically significant with a p-value of 0.002 from the MLMR analysis. This study offers a pragmatic approach for the implementation of intelligent, self-organizing agent swarms, directly applicable to improving the realism and efficacy of present-day gaming AI.
Co-Authors Gelar, Trisna Iwan Awaludin Pasya, Raditya Solahudin, Muhammad Rizqi