1 / 24

Start and Discrete Preference Map

Utilize Discrete Map & Accumulation Surface to find optimal route with least cost for efficient navigation within large project areas. The process involves identifying the best locations using a scale from good to bad.

ralejandro
Download Presentation

Start and Discrete Preference Map

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. Discrete Map – identifies the relative preference for locating a route at any location (1= Good through 9= bad) Discrete Map Good Easy Favor Bad Difficult Avoid Start and Discrete Preference Map Start – identifies the beginning of the route as an existing transmission line in this case Accumulation Surface

  2. X = …the Geometric Distance of is multiplied by the Discrete Cost for each potential step to determine the Effective Distance at each wave front increment. The optimal movement is the lowest accumulated effective distance value. Accumulation Surface (0 TO 1) Accumulation Surface – identifies the “total cost” for locating the preferred route from the starting location to everywhere in a project area Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  3. Accumulation Surface (0 TO 2) …wave front of increasing distance respects the relative “goodness” for route location …advance wave front to determine accumulated Effective Distance …if less than any previous value at a location, then assign as “Least Cost Path” value continue to advance wave front  Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  4. Accumulation Surface (0 TO 3) …wave front of increasing distance respects the relative “goodness” for route location …advance wave front to determine accumulated Effective Distance …if less than any previous value at a location, then assign as “Least Cost Path” value continue to advance wave front  Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  5. Accumulation Surface (0 TO 4) …wave front of increasing distance respects the relative “goodness” for route location …advance wave front to determine accumulated Effective Distance …if less than any previous value at a location, then assign as “Least Cost Path” value continue to advance wave front  Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  6. Accumulation Surface (0 TO 5) …wave front of increasing distance respects the relative “goodness” for route location …advance wave front to determine accumulated Effective Distance …if less than any previous value at a location, then assign as “Least Cost Path” value continue to advance wave front  Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  7. Accumulation Surface (0 TO 6) …wave front of increasing distance respects the relative “goodness” for route location …advance wave front to determine accumulated Effective Distance …if less than any previous value at a location, then assign as “Least Cost Path” value continue to advance wave front  Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  8. Accumulation Surface (0 TO 7) …wave front of increasing distance respects the relative “goodness” for route location …advance wave front to determine accumulated Effective Distance …if less than any previous value at a location, then assign as “Least Cost Path” value continue to advance wave front  Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  9. Accumulation Surface (0 TO 8) …wave front of increasing distance respects the relative “goodness” for route location …advance wave front to determine accumulated Effective Distance …if less than any previous value at a location, then assign as “Least Cost Path” value continue to advance wave front  Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  10. Accumulation Surface (0 TO 9) …wave front of increasing distance respects the relative “goodness” for route location …advance wave front to determine accumulated Effective Distance …if less than any previous value at a location, then assign as “Least Cost Path” value continue to advance wave front  Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  11. …advance wave front to determine accumulated Effective Distance …if less than any previous value at a location, then assign as “Least Cost Path” value continue to advance wave front  Accumulation Surface (0 TO 10) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Good Easy Favor Bad Difficult Avoid Accumulation Surface

  12. Accumulation Surface (0 TO 25) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  13. Accumulation Surface (0 TO 50) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  14. Accumulation Surface (0 TO 75) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  15. Accumulation Surface (0 TO 100) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  16. Accumulation Surface (0 TO 125) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  17. Accumulation Surface (0 TO 150) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  18. Accumulation Surface (0 TO 175) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  19. Accumulation Surface (0 TO 200) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  20. Accumulation Surface (0 TO 225) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  21. Accumulation Surface (0 TO 250) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  22. Accumulation Surface (0 TO 275) …wave front of increasing distance respects the relative “goodness” for route location Discrete Map Accumulation Surface

  23. Accumulation Surface (0 TO 300) …wave front of increasing distance respects the relative “goodness” for route location Farthest away Routing location Discrete Map Accumulation Surface

  24. Accumulation Surface (Bowl Shape) …while the Accumulation Surface looks like a terrain surface, it always forms a “bowl shape” with the lowest values around the Starting location that progressively increase as the wave front moves away ….the value at every location on the surface indicates how “far away” the location considering the “relative goodness” for siting a route at any location in the project area (1= Good through 9= Bad) Discrete Map Accumulation Surface

More Related