← Back to all news
arXiv Machine Learning By Hrithika Deepu Nair, Kayvan Karim

LLM-Guided Reinforcement Learning for Adaptive NPC Behavior in Multi-Agent Combat Games

Read the original on arXiv Machine Learning →

The paper explores a runtime strategy-selection framework where a large language model (LLM) guides a pre‑trained reinforcement learning (RL) policy for non‑player characters (NPCs) in a Unity combat game without altering the underlying policy. Five NPC agents sharing a PPO policy were compared in a baseline setup and an LLM‑augmented setup, where a locally hosted Mistral 7B model assigns one of four tactical tags every five seconds based on live game state. Across 600 episodes against three scripted opponents, the LLM‑augmented agents more than doubled their win rate against a Balanced opponent, improved performance against an Evasive opponent, but struggled against an Aggressive opponent due to over‑reliance on encirclement; analysis of 2,430 strategy selections revealed limited zero‑shot differentiation with the model favoring Surround in 83.8% of cases.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
Jun 19

Hierarchical Control in Multi-Agent Games: LLM-based Planning and RL Execution

arXiv:2606. 20014v1 Announce Type: cross Abstract: Reinforcement learning (RL) has achieved strong performance in sequential decision-making, yet scaling to complex multi-agent environments remains challenging due to sparse rewards, large state-action spaces, and the difficulty of learning coordinated strategies.

By Jannik H\"osch, Alessandro Sestini, Florian Fuchs, Amir Baghi, Joakim Bergdahl, Konrad Tollmar, Jean-Philippe Barrette-LaPierre, Linus Gissl\'en
llmsagentsreinforcement-learning
More like this →
arXiv AI
Oct 9

Constrained Command-Conditioned Reinforcement Learning with Bandit Strategy Selection in Real-Time Strategy Games

The paper presents a constrained command‑conditioned Proximal Policy Optimization (PPO) executor for the MicroRTS real‑time strategy environment, enabling a single execution policy to follow diverse strategic commands. A Thompson‑sampling bandit strategist selects command tuples based on in‑game observations of the opponent’s strategy, rather than relying on opponent identity. In controlled experiments, the strategist‑executor system outperforms a flat PPO baseline against three of the four strongest opponents on a training map, including two held‑out opponents, while showing no significant difference against the remaining opponents.

By Nick Leenders, Roy Lindelauf, Joost van Oijen, Boris Cule
agentsreinforcement-learning
More like this →
arXiv AI
Oct 9

Can AI Agents Learn Their Way to the Top? Evaluating Heuristic Learning in a Long-Running Game Agent Competition

The paper introduces Adversarial Heuristic Learning (AHL), a framework that uses AI agents to refine game policies without changing model weights. It presents AAArena, a benchmark of 12 adversarial games and 1,920 human programs, where agents analyze replays, select opponents, and revise policies to maximize ranking within limited budgets. Experiments show that certain configurations achieve gold medals, while performance drops in games with complex rules, highlighting challenges in game understanding and long‑horizon policy development.

By Kaisen Yang, Qingle Liu, Kejin Wang, Yicheng Zhao, Jieming Li, Shenghan Zheng, Ruize Yang, Bojun Yang, Heng Gong, Xiang Gao, Lanyue Zhang, Kaiyu Zhong, Zhuo Liu, Shaoxuan Li, Chengxi Li, Yong Yan, Weixuan Zhang, Tianwei Luo, Situ Wang, Youjie Zheng, Sihan Zhao, Shengyuan Wang, Huan-ang Gao, Jiazheng Xu, Xiaohui Xie, Wentao Han, Hongning Wang
llmsagentsreinforcement-learningbenchmarkssafety
More like this →
arXiv AI
Oct 19

Porimon: An LLM-Based Pok\'emon Battle Agent Enhanced by Long/Short-Term Knowledge Augmented Generation

The paper introduces Porimon, an LLM-based agent for Pokémon Battles that uses Long/Short-Term Knowledge Augmented Generation (LSTKAG) to incorporate past states of the current task and retrieve experience summaries from similar previous instances. Porimon also employs an external API for precise damage calculation and detailed game information. Experimental results from 15,000 simulated battles show that Porimon, with hyperparameter optimization, outperforms both the earlier PokéLLMon agent and a rule-based heuristic player, and ablation studies confirm the benefit of the game information retrieval extension, though the impact of Long-Term KAG remains inconclusive.

By Dongyin Zhuo, Fengjunjie Pan, Nenad Petrovic, Alois Knoll
llmsagentsfine-tuningbenchmarks
More like this →