Results 231 to 240 of about 1,951 (305)

Distributed Task Allocation With Minimum Makespan for Heterogeneous Multiplayer Pursuit–Evasion Games

IEEE Transactions on Automatic Control
In the domain of multiplayer pursuit–evasion games, it is crucial to address the practical aspects of the players' heterogeneity, the distributed control manner, and the pursuers' goal of minimum makespan.
Guangming Xie, Jinan Sun, Chen Wang
exaly   +2 more sources

Equilibrium Policy Generalization: A Reinforcement Learning Framework for Cross-Graph Zero-Shot Generalization in Pursuit-Evasion Games [PDF]

Neural Information Processing Systems
Equilibrium learning in adversarial games is an important topic widely examined in the fields of game theory and reinforcement learning (RL). Pursuit-evasion game (PEG), as an important class of real-world games from the fields of robotics and security ...
Runyu Lu, Peng Zhang, Ruo-Chuan Shi, Yuanheng Zhu, Dongbin Zhao, Yang Liu, Dong Wang, C. Alippi   +7 more
semanticscholar   +2 more sources

Preface to the Special Issue on “Advances on Pursuit and Evasion Games and Applications” [PDF]

Dynamic Games and Applications
M. Ferrara, G. Ibragimov, Shravan Luckraz, B. Pansera   +3 more
semanticscholar   +2 more sources

Learned Controllers for Agile Quadrotors in Pursuit-Evasion Games [PDF]

arXiv.org
In this letter we study 1v1 quadrotor pursuit-evasion, where a pursuer and an evader are trained via reinforcement learning (RL) by competing against each other.
Alejandro Sanchez Roncero, Yi-Xi Cai, Olov Andersson, Petter Ogren   +3 more
semanticscholar   +2 more sources

Guaranteed Pursuit and Evasion Times in Hilbert Space Differential Games [PDF]

Journal of Quality Measurement and Analysis
Chika Samson Odiliobi, Risman Mat Hasim, Gafurjan Ibragimov   +2 more
semanticscholar   +2 more sources

Pursuit—Evasion games on graphs

Journal of Graph Theory, 1988
AbstractTwo players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then pay Blue an amount equal to the distance between the vertices chosen. In this note, we investigate the value ν(G)of this pursuit‐evasion game for various classes of graphs G, as well as those optimal mixed strategies for achieving ν(G).
Fan R. K. Chung, Joel E. Cohen, Ronald L. Graham   +2 more
openaire   +3 more sources

Uncertain pursuit-evasion game

Soft Computing, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yanghe Feng, Lanruo Dai, Jinwu Gao, Guangquan Cheng   +3 more
openaire   +1 more source

A Note on Generalized Pursuit-Evasion Games

SIAM Journal on Control, 1975
Two player zero sum differential games are an extension of optimal control problems. When the cost or payoff is the integral of some function h up to the first time the trajectory enters a “terminal set” the differential game is one of survival. If $h \equiv 1$, the payoff is just the time elapsed up to the “capture time” and the game is one of pursuit
Elliott, Robert J., Friedman, Avner
openaire   +2 more sources

Nash–Minmax Strategies for Multiagent Pursuit–Evasion Games With Reinforcement Learning

IEEE Transactions on Cybernetics
This article investigates the pursuit-evasion games for target capture in multiagent systems. To address this challenge, a novel data-driven optimal control policy is proposed, leveraging off-policy reinforcement learning and Nash-minmax strategies ...
Yuhan Wang, Hao Zhang, Zhuping Wang, Huai-Cheng Yan   +3 more
semanticscholar   +1 more source

Harbor attack: A pursuit-evasion game

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2011
This paper studies a concrete pursuit-evasion game in which the evader, a.k.a. the intruder, tries to reach a harbor via a rectangular channel, while the pursuer, a.k.a. the defender, tries to stop him. Our goal is to develop insight into the nature of this game, the impact of the quality of information, and the potential evasion and defense numerical ...
Jean C. Walrand, Elijah Polak, Hoam Chung   +2 more
openaire   +2 more sources