Searching k-Optimal Goals for an Orienteering Problem on a Specialized Graph with Budget Constraints

2 Nov 2020  ·  Abhinav Sharma, Advait Deshpande, Yanming Wang, Xinyi Xu, Prashan Madumal, Anbin Hou ·

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...

PDF Abstract
No code implementations yet. Submit your code now



  Add Datasets introduced or used in this paper

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.


No methods listed for this paper. Add relevant methods here