Back to Search
Start Over
Searching k-Optimal Goals for an Orienteering Problem on a Specialized Graph with Budget Constraints
- Publication Year :
- 2020
-
Abstract
- 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.
- Subjects :
- Computer Science - Artificial Intelligence
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2011.00781
- Document Type :
- Working Paper