AINov 2, 2020
Searching k-Optimal Goals for an Orienteering Problem on a Specialized Graph with Budget Constraints
arXiv:2011.00781v1
AI Analysis
This addresses an orienteering problem for applications requiring optimal goal selection under constraints, but appears incremental as it adapts existing methods to a specialized graph.
The paper tackles the problem of finding k-optimal goals to maximize reward on a specialized graph with budget constraints, proposing a novel non-randomized anytime orienteering algorithm for this scenario.
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.