Pith. sign in

REVIEW

Two-Player Reconnaissance Game with Half-Planar Target and Retreat Regions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.01364 v2 pith:IMVLJ5GS submitted 2022-10-04 eess.SY cs.SY

Two-Player Reconnaissance Game with Half-Planar Target and Retreat Regions

classification eess.SY cs.SY
keywords gameintruderdefenderregiongoalretreattargetdistance
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper is concerned with the reconnaissance game that involves two mobile agents: the Intruder and the Defender. The Intruder is tasked to reconnoiter a territory of interest (target region) and then return to a safe zone (retreat region), where the two regions are disjoint half-planes, while being chased by the faster Defender. This paper focuses on the scenario where the Defender is not guaranteed to capture the Intruder before the latter agent reaches the retreat region. The goal of the Intruder is to minimize its distance to the target region, whereas the Defender's goal is to maximize the same distance. The game is decomposed into two phases based on the Intruder's myopic goal. The complete solution of the game corresponding to each phase, namely the Value function and state-feedback equilibrium strategies, is developed in closed-form using differential game methods. Numerical simulation results are presented to showcase the efficacy of our solutions.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.