705 research outputs found
Target Defense against Periodically Arriving Intruders
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.Comment: To be presented at the 2023 American Control Conference - May 31 -
June 2, 2023, in San Diego, CA, US
Universal Guard Problems
We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points ("guards") that are "universal" in their ability to guard any of a set of possible polygonal domains in the plane. We give upper and lower bounds on the number of universal guards that are always sufficient to guard all polygons having a given set of n vertices, or to guard all polygons in a given set of k polygons on an n-point vertex set. Our upper bound proofs include algorithms to construct universal guard sets of the respective cardinalities
- …