skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Vertical perimeter versus horizontal perimeter
Award ID(s):
1612061
PAR ID:
10054913
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Annals of Mathematics
Volume:
188
Issue:
1
ISSN:
0003-486X
Page Range / eLocation ID:
171 to 279
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
  2. We investigate the problem of optimally assigning a large number of robots (or other types of autonomous agents) to guard the perimeters of closed 2D regions, where the perimeter of each region to be guarded may contain multiple disjoint polygonal chains. Each robot is responsible for guarding a subset of a perimeter and any point on a perimeter must be guarded by some robot. In allocating the robots, the main objective is to minimize the maximum 1D distance to be covered by any robot along the boundary of the regions. For this optimization problem which we call optimal perimeter guarding (OPG), thorough structural analysis is performed, which is then exploited to develop fast exact algorithms that run in guaranteed low polynomial time. In addition to formal analysis and proofs, experimental evaluations and simulations are performed that further validate the correctness and effectiveness of our algorithmic results. 
    more » « less
  3. Abstract Motivated by many applications, optimal control problems with integer controls have recently received a significant attention. Some state-of-the-art work uses perimeter-regularization to derive stationarity conditions and trust-region algorithms. However, the discretization is difficult in this case because the perimeter is concentrated on a set of dimension$$d - 1$$ d - 1 for a domain of dimensiond. This article proposes a potential way to overcome this challenge by using the fractional nonlocal perimeter with fractional exponent$$0<\alpha <1$$ 0 < α < 1 . In this way, the boundary integrals in the perimeter regularization are replaced by volume integrals. Besides establishing some non-trivial properties associated with this perimeter, a$$\Gamma $$ Γ -convergence result is derived. This result establishes convergence of minimizers of fractional perimeter-regularized problem, to the standard one, as the exponent$$\alpha $$ α tends to 1. In addition, the stationarity results are derived and algorithmic convergence analysis is carried out for$$\alpha \in (0.5,1)$$ α ( 0.5 , 1 ) under an additional assumption on the gradient of the reduced objective. The theoretical results are supplemented by a preliminary computational experiment. We observe that the isotropy of the total variation may be approximated by means of the fractional perimeter functional. 
    more » « less