Searching k-Optimal Goals for an Orienteering Problem on a Specialized
  Graph with Budget Constraints
  We propose a novel non-randomized anytime orienteering algorithm for finding
k-optimal goals that maximize reward on a specialized graph with budget
constraints. This specialized graph represents a real-world scenario which is
analogous to an orienteering problem of finding k-most optimal goal states.
