1 / 23

A Constant Greedy Approximation Factor for 1.5D Terrain Guarding by Yoav Srebrnik

A Constant Greedy Approximation Factor for 1.5D Terrain Guarding by Yoav Srebrnik. What will we see?. Introduction & Motivation "The Fall" of the greedy algorithm. Notation & Terminology Upward-Looking Case Ben-Moshe's Algorithm King's Algorithm Opppsite-Side Greedy Algorithm Summary.

shouseholder
Download Presentation

A Constant Greedy Approximation Factor for 1.5D Terrain Guarding by Yoav Srebrnik

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Constant Greedy Approximation Factor for 1.5D Terrain Guarding by Yoav Srebrnik

  2. What will we see? • Introduction & Motivation • "The Fall" of the greedy algorithm. • Notation & Terminology • Upward-Looking Case • Ben-Moshe's Algorithm • King's Algorithm • Opppsite-Side Greedy Algorithm • Summary

  3. Motivation – why solve 1.5D? • Terrain Guarding is useful in determining where to place Cellular-Antenna's and Surveillance equipment (Home-Land Security). • Solving 1.5D efficiently may give us a good heuristic to solve the more general and difficult problem of 2.5D.

  4. Problem's Description

  5. Problem's Description • A chain of straight lines between k vertices, defines the terrain – T. • G – the group of guards that are spread over T. • Goal: Find a minimal sub-group of G that can guard every point in G. • If the 'Line of Sight' between two guards doesn't cut the terrain T, then they can see eachother.

  6. The greedy algorithm The basic Greedy algorithm will look similar to : • While there exist un-guarded guards • Add to G' the not-chosen guard which can see the most other not-chosen guards. • End While This Algorithm results in an unbounded approximation factor.

  7. The Greedy Alg. (Cont)

  8. Notation & Terminology • Convex-Hull (CH) – Similar to polygons, chain of lines between (some of) T's maxima-points. • L(p) – The leftmost guard which can see p. • R(p) – The rightmost guard which can see p. • Guard x dominates y - x can see every guard that y can see.

  9. The Upward-Looking Case • In the Upward-Looking Case , for a guard x to see y, the 'line of sight' connecting them can't cut T, and x is not higher than y. • This problem is similar to a Dominating-Set (famous NP-Hard problem) over DAG. • A simple algorithm by King • While There exist an un-guarded p • A = { L(p), p, R(p) } • G' = G' ∪ A • Approximation Factor : 2-Θ(1/n)

  10. The General case – Can we solve in parts? • In the general case, the demand of x to be not higher than y is dropped. • We can use CH(T), to cut the problems into different sub-sections, and solve the problem on them. (i.e – one sub-section of T, can't guard another sub-section of T) • It is always useful to place guards on CH(T) (if possible) because they see two adjacent sub-sections.

  11. Ben-Moshe's algorithm • Given a terrain T, compute its CH, and place guards at its vertices (if possible). Then solve each sub-section seperatly. • Given a sub-section T', Partition it into maximal sub-sections that can be guarded from outside the section, and place guards at end-points of T', and R(al), R(ar), L(bl) & L(br) . • The remaining guards, handle seperatly. First algorithm to show a constant approximation factor.

  12. King's Algorithm • The algorithm repetedly finds the two leftmost unguarded vertices. • In case they both are in CH(T), it place one guard to guard them both. • Otherwise, the algorithm calls a recursive function that can: • place 4 guards to dominate section T. or • Recursively call GuardRight / GuardLeft over T. • The algorithm got his name from the property of placing guards which look right.

  13. King's Algorithm cont'd • The GuardRight function chooses how to place the guards by evaluating the sub-terrain to cover. • If the sub-terrain contains vertices that can't be guarded from the right, it calls a "mirror-like" function : GuardLeft.

  14. King's Algorithm cont'd

  15. Opposite-side Greedy Algorithm • The algorithm classifies each guard into 2 groups – Left & Right guards. • We have a visibility graph which is a "quasi-bisided" graph. • An Edge between x and y, means x sees y. • On that graph we can define 2 different degrees – number of edges to all vertices in the graph D1, number of edges to opposite-side vertices D2.

  16. Opposite-side Greedy Alg – Cont'd • The algorithm: • Build Ĝ – the quasi-bisided graph. • While T is not covered • Order the vertices list by descending D2 value, and then by descending D1 value. • Choose the 1st vertex in the list. • Update Ĝ, D1 and D2 for every remaining vertices. • The algorithm complexity is O(n²logn) But what is the approximation-factor ?

  17. O.S Greedy Algorithm - example

  18. O.S Greedy Algorithm - example

  19. Opposite-side Greedy Alg – Cont'd

  20. Opposite-side Greedy Alg – cont'd • Every terrain can be broken into simple/stair-like pockets, and planar sub-sections. • For every simple pocket, both the Optimal and the Greedy will put 1 guard. • For a stair-like pocket, |Ĝ| <= 1.5 G'-optimal. • For each planar sub-section, the O.S.Greedy algorithm puts up to 1 guards. Total: Approximation factor = 2.5

  21. Opposite-side Greedy alg – Cont'd

  22. Summary • We have seen a constant-factor approximation factor alg for "Upward Looking Case". • We have seen 3 constant-factor approximation factor alg's for the general problem. • We saw that a Greedy heuristic can produce good results in 1.5D terrain guarding.

  23. The End

More Related