# Designing Efficient Algorithms for Sensor Placement

## Location

Presentation- College of Science and Mathematics

## Document Type and Release Option

Thesis Presentation (Restricted to Georgia Southern)

Dr. Hua Wang

## Faculty Mentor Email

hwang@georgiasouthern.edu

2021

## Start Date

26-4-2021 12:00 AM

## End Date

30-4-2021 12:00 AM

## Keywords

Georgia Southern University, Honors Symposium, Presentation

## Description

Sensor placement has many applications and uses that can be seen everywhere you go. These include, but are not limited to, monitoring the structural health of buildings and bridges and navigating Unmanned Aerial Vehicles (UAV). We study ways that lead to efficient algorithms that will place as few as possible sensors to cover an entire area. We will tackle the problem from both 2-dimensional and 3-dimensional points of view. Two famous related problems are discussed: the art gallery problem and the terrain guarding problem. From the top view an area presents a 2-D image which will enable us to partition polygonal shapes and use graph theoretical results in coloring. We explore this approach in details and discuss potential generalizations. We will also look at the area from a side view and use methods from the terrain guarding problem to determine where any more sensors should be placed. We provide a simple greedy algorithm for this. Lastly, we briefly discuss the combination of the above techniques and potential further generalizations to suit specific problems where the limitation of sensors (such as range and angle) are taken into consideration.

College of Science and Mathematics

Files over 10MB may be slow to open. For best results, right-click and select "Save as..."

## Share

COinS

Apr 26th, 12:00 AM Apr 30th, 12:00 AM

Designing Efficient Algorithms for Sensor Placement

Presentation- College of Science and Mathematics

Sensor placement has many applications and uses that can be seen everywhere you go. These include, but are not limited to, monitoring the structural health of buildings and bridges and navigating Unmanned Aerial Vehicles (UAV). We study ways that lead to efficient algorithms that will place as few as possible sensors to cover an entire area. We will tackle the problem from both 2-dimensional and 3-dimensional points of view. Two famous related problems are discussed: the art gallery problem and the terrain guarding problem. From the top view an area presents a 2-D image which will enable us to partition polygonal shapes and use graph theoretical results in coloring. We explore this approach in details and discuss potential generalizations. We will also look at the area from a side view and use methods from the terrain guarding problem to determine where any more sensors should be placed. We provide a simple greedy algorithm for this. Lastly, we briefly discuss the combination of the above techniques and potential further generalizations to suit specific problems where the limitation of sensors (such as range and angle) are taken into consideration.