论文标题
搜索具有预算限制的专用图上的定向问题的K-最佳目标
Searching k-Optimal Goals for an Orienteering Problem on a Specialized Graph with Budget Constraints
论文作者
论文摘要
我们提出了一种新颖的非随机定向启动算法，以查找具有预算限制的专用图表上的奖励，以最大程度地提高奖励。该专业图代表了一个现实的场景，该场景类似于找到k个最佳目标状态的定向问题。
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.
