Reinforcement Learning with ABC Algorithm-Optimized Rewards for Dynamic Difficulty Adjustment in Cognitive Memory Games using Synthetic Data Augmentation

Conference proceedings article


ผู้เขียน/บรรณาธิการ


กลุ่มสาขาการวิจัยเชิงกลยุทธ์


รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่งWarissara Limpornchitwilai, Boonserm Kaewkamnerdpong

ปีที่เผยแพร่ (ค.ศ.)2025

หน้าแรก410

หน้าสุดท้าย415

จำนวนหน้า6

URLhttps://ieeexplore.ieee.org/document/11301373


ดูบนเว็บไซต์ของสำนักพิมพ์


บทคัดย่อ

Sustaining engagement in cognitive monitoring for aging populations requires assessment tools that continuously adapt to individual performance. We proposed a dynamic difficulty adjustment (DDA) framework for a tablet-based memory-matching game, leveraging synthetic data generation, swarm intelligence, and reinforcement learning. Addressing typical data limitations, we generated behaviorally consistent synthetic gameplay trajectories via parametric sampling, augmenting an original dataset from healthy cognitive (HC) and possible Mild Cognitive Impairment (pMCI) participants. This augmented data allowed us to robustly train a Q-learning agent. Its reward function integrated performance metrics, error rates, and difficulty changes, with parameter weights optimized using the Artificial Bee Colony (ABC) algorithm. The agent’s policies, refined over multiple training episodes to Q-table convergence, closely aligned with expert-defined suitability criteria for difficulty adjustments. Upon evaluation using a test dataset, the system yielded 98.55% positive rewards in the HC group and 94.29% in the pMCI group. This high positive feedback rate across diverse participant groups underscores the DDA framework’s success in promoting player success and fostering an encouraging environment, vital for long-term engagement in cognitive monitoring.


คำสำคัญ

Artificial Bee Colony (ABC)Cognitive GameDynamic Difficulty AdjustmentElderlyQ-learning


อัพเดทล่าสุด 2026-04-02 ถึง 00:00