Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Target Defense against Sequentially Arriving Intruders (2212.06628v1)

Published 13 Dec 2022 in cs.RO and cs.MA

Abstract: We consider a variant of the target defense problem where a single defender is tasked to capture a sequence of incoming intruders. The intruders' objective is to breach the target boundary without being captured by the defender. As soon as the current intruder breaches the target or gets captured by the defender, the next intruder appears at a random location on a fixed circle surrounding the target. Therefore, the defender's final location at the end of the current game becomes its initial location for the next game. Thus, the players pick strategies that are advantageous for the current as well as for the future games. Depending on the information available to the players, each game is divided into two phases: partial information and full information phase. Under some assumptions on the sensing and speed capabilities, we analyze the agents' strategies in both phases. We derive equilibrium strategies for both the players to optimize the capture percentage using the notions of engagement surface and capture circle. We quantify the percentage of capture for both finite and infinite sequences of incoming intruders.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Arman Pourghorban (3 papers)
  2. Michael Dorothy (16 papers)
  3. Daigo Shishika (31 papers)
  4. Alexander Von Moll (23 papers)
  5. Dipankar Maity (41 papers)
Citations (14)

Summary

We haven't generated a summary for this paper yet.