Efficient Algorithms for Optimal Perimeter Guarding

05/11/2019
by   Si Wei Feng, et al.
0

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.

READ FULL TEXT

page 1

page 9

page 10

page 11

research
12/17/2019

Optimal Perimeter Guarding with Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms

We perform structural and algorithmic studies of significantly generaliz...
research
02/19/2020

Optimally Guarding Perimeters and Regions with Mobile Range Sensors

We investigate the problem of using mobile robots equipped with 2D range...
research
09/24/2017

SEAR: A Polynomial-Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee

We study the labeled multi-robot path planning problem in continuous 2D ...
research
09/24/2017

SEAR: A Polynomial-Time Expected Constant-Factor Optimal Algorithmic Framework for Multi-Robot Path Planning

This work studies the labeled multi-robot path and motion planning probl...
research
01/29/2019

A Minimalistic Approach to Segregation in Robot Swarms

We present a decentralized algorithm to achieve segregation into an arbi...
research
10/06/2018

Redundant Robot Assignment on Graphs with Uncertain Edge Costs

We provide a framework for the assignment of multiple robots to goal loc...
research
05/11/2021

Rearrangement on Lattices with Pick-n-Swaps: Optimality Structures and Efficient Algorithms

We investigate a class of multi-object rearrangement problems in which a...

Please sign up or login with your details

Forgot password? Click here to reset