Sort:
Issue
Embodied Intelligent Game: Models and Algorithms for Autonomous Interactions Among Heterogeneous Agents
Unmanned Systems 2025, 13(5): 1365-1394
Published: 16 September 2025
Abstract Collect

Game-theoretic methods play a vital role for characterizing interactions among self-interested heterogeneous agents, and enhancing decision-making efficiency in embodied intelligent systems. This work reviews the research progress of embodied intelligent games with applications in many areas such as intelligent transportation, aircraft confrontation, and active perception games. In particularly, it explores how current research integrates classical game models with artificial intelligence (AI) methodologies to address the bidirectional feedback between cognitional space and physical space of embodied systems. First, within the framework of mathematical game models, we provide a theoretical foundation for embodied interactive decision-making. Then we discusses typical applications of embodied games from the perspectives of geospatial dimensions and task types. Subsequently, we discuss key challenges in solving embodied games, including opponent intention recognition and equilibrium computation under uncertain information, followed by a comprehensive survey of existing resolution methods. Finally, we discuss future trends in embodied game-theoretic approaches, particularly their potential and challenges in technological developments and practical applications.

Open Access Issue
A Survey on Noncooperative Games and Distributed Nash Equilibrium Seeking over Multi-Agent Networks
CAAI Artificial Intelligence Research 2022, 1(1): 8-27
Published: 28 August 2022
Abstract PDF (1.2 MB) Collect
Downloads:1364

The work gives a review on the distributed Nash equilibrium seeking of noncooperative games in multi-agent networks, which emerges as one of the frontier research topics in the area of systems and control community. Firstly, we give the basic formulation and analysis of noncooperative games with continuous action spaces, and provide the motivation and basic setting for distributed Nash equilibrium seeking. Then we introduce both the gradient-based algorithms and best-response based algorithms for various type of games, including zero-sum games, aggregative games, potential games, monotone games, and multi-cluster games. In addition, we provide some applications of noncooperative games.

Total 2