The Role of Heterogeneity in Autonomous Perimeter Defense Problems

Adler, Aviv; Mickelin, Oscar; Ramachandran, Ragesh K.; Sukhatme, Gaurav S.; Karaman, Sertaç

doi:10.1007/978-3-031-21090-7_8

Cited by 5 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, both of the papers 13,14 did not consider any sensing capability for the intruders and consequently overlooked the evasive maneuver of the intruder team. Other works 15,16 considered a problem where the intruders are tasked to breach the target while not having any information regarding the defender. These works lack the communication/coordination among the intruder team.…”

Section: Introductionmentioning

confidence: 99%

Target defense against a sequentially arriving cooperative intruder team

Pourghorban¹,

Maity²

2023

Open Architecture/Open Business Model Net-Centric Systems and Defense Transformation 2023

View full text Add to dashboard Cite

We consider a variant of the target defense problem where a single defender is tasked to guard a target region from a sequence of incoming intruders. Each intruder's objective is to breach the target boundary without being captured and the defender's objective is to capture as many intruders as possible. The intruders appear sequentially on a fixed circle surrounding the target, resulting in a sequence of 1-vs-1 games between the defender and the intruders. Each 1-vs-1 game is terminated when the target is breached or the intruder is captured. The defender has to start the next game as soon as the current game ends. Each intruder knows the entry point of the last intruder and this information is used to find an optimal entry point. Each game is analyzed by dividing it into two phases: partial information and full information phase. We utilize the notions of engagement surface and capture circle to analyze the strategies for the defender as well as the intruders. Furthermore, we analytically compute the capture percentage for both finite and infinite sequences of intruder arrivals. Finally, the theoretical results are verified through numerical examples using Monte-Carlo type random trials of experiments.

show abstract

Section: Introductionmentioning

confidence: 99%

Target defense against a sequentially arriving cooperative intruder team

Pourghorban¹,

Maity²

2023

Open Architecture/Open Business Model Net-Centric Systems and Defense Transformation 2023

View full text Add to dashboard Cite

show abstract

“…However, this work did not consider any sensing capability for the intruders and therefore, the intruders are restricted in terms of the evasive strategies they can deploy. Similarly, in [15] and [16] among many others, the intruders attempting to breach a target perimeter are tasked with simple and fixed a priori strategies. These works also do not consider the sensing capability which enables the intruders to evade from the defender instead of just being captured on their direct path toward the target.…”

Section: Introductionmentioning

confidence: 99%

Target Defense against Sequentially Arriving Intruders

Pourghorban

Dorothy

Shishika

et al. 2022

2022 IEEE 61st Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

We consider a variant of pursuit-evasion games where a single defender is tasked to defend a static target from a sequence of periodically arriving intruders. The intruders' objective is to breach the boundary of a circular target without being captured and the defender's objective is to capture as many intruders as possible. At the beginning of each period, a new intruder appears at a random location on the perimeter of a fixed circle surrounding the target and moves radially towards the target center to breach the target. The intruders are slower in speed compared to the defender and they have their own sensing footprint through which they can perfectly detect the defender if it is within their sensing range. Considering the speed and sensing limitations of the agents, we analyze the entire game by dividing it into partial information and full information phases. We address the defender's capturability using the notions of engagement surface and capture circle. We develop and analyze three efficient strategies for the defender and derive a lower bound on the capture fraction. Finally, we conduct a series of simulations and numerical experiments to compare and contrast the three proposed approaches.

show abstract