you're reading...

SACT Seminar: Approximation Algorithms for 2D Barrier Coverage

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.



No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers

%d bloggers like this: