Time: 1:00 pm Tuesday, 7th February 2017.
Location: SIT 459
Speaker: Andrew Cherry, University of Sydney
Title: Approximation Algorithms for 2D Barrier Coverage
Given barriers represented by line segments and sensors with circular radius initially located in arbitrary locations we want to move a group of sensors to arbitrary locations on the barriers so that the barriers are completely covered and the sum of sensor movements is minimised. This problem is NP-complete.
We find approximation algorithms that allow solutions when sensors have uniform radii.