Dominance Regions of Pursuit-evasion Games in Non-anticipative Information Patterns

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Huang, Weiwen, Liang, Li, Xu, Ningsheng, Deng, Fang
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915138617999360
author Huang, Weiwen
Liang, Li
Xu, Ningsheng
Deng, Fang
author_facet Huang, Weiwen
Liang, Li
Xu, Ningsheng
Deng, Fang
contents The evader's dominance region is an important concept and the foundation of geometric methods for pursuit-evasion games. This article mainly reveals the relevant properties of the evader's dominance region, especially in non-anticipative information patterns. We can use these properties to research pursuit-evasion games in non-anticipative information patterns. The core problem is under what condition the pursuer has a non-anticipative strategy to prevent the evader leaving its initial dominance region before being captured regardless of the evader's strategy. We first define the evader's dominance region by the shortest path distance, and we rigorously prove for the first time that the initial dominance region of the evader is the reachable region of the evader in the open-loop sense. Subsequently, we prove that there exists a non-anticipative strategy by which the pursuer can capture the evader before the evader leaves its initial dominance region's closure in the absence of obstacles. For cases with obstacles, we provide a counter example to illustrate that such a non-anticipative strategy does not always exist, and provide a necessary condition for the existence of such strategy. Finally, we consider a scenario with a single corner obstacle and provide a sufficient condition for the existence of such a non-anticipative strategy. At the end of this article, we discuss the application of the evader's dominance region in target defense games. This article has important reference significance for the design of non-anticipative strategies in pursuit-evasion games with obstacles.
format Preprint
id arxiv_https___arxiv_org_abs_2502_02932
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Dominance Regions of Pursuit-evasion Games in Non-anticipative Information Patterns
Huang, Weiwen
Liang, Li
Xu, Ningsheng
Deng, Fang
Optimization and Control
Computer Science and Game Theory
Systems and Control
The evader's dominance region is an important concept and the foundation of geometric methods for pursuit-evasion games. This article mainly reveals the relevant properties of the evader's dominance region, especially in non-anticipative information patterns. We can use these properties to research pursuit-evasion games in non-anticipative information patterns. The core problem is under what condition the pursuer has a non-anticipative strategy to prevent the evader leaving its initial dominance region before being captured regardless of the evader's strategy. We first define the evader's dominance region by the shortest path distance, and we rigorously prove for the first time that the initial dominance region of the evader is the reachable region of the evader in the open-loop sense. Subsequently, we prove that there exists a non-anticipative strategy by which the pursuer can capture the evader before the evader leaves its initial dominance region's closure in the absence of obstacles. For cases with obstacles, we provide a counter example to illustrate that such a non-anticipative strategy does not always exist, and provide a necessary condition for the existence of such strategy. Finally, we consider a scenario with a single corner obstacle and provide a sufficient condition for the existence of such a non-anticipative strategy. At the end of this article, we discuss the application of the evader's dominance region in target defense games. This article has important reference significance for the design of non-anticipative strategies in pursuit-evasion games with obstacles.
title Dominance Regions of Pursuit-evasion Games in Non-anticipative Information Patterns
topic Optimization and Control
Computer Science and Game Theory
Systems and Control
url https://arxiv.org/abs/2502.02932