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

TL;DR

This paper introduces a new anytime algorithm for the orienteering problem that efficiently finds k-optimal goals on a specialized graph with budget constraints, applicable to real-world scenarios.

Contribution

It presents a novel non-randomized anytime algorithm tailored for k-optimal goal search in a specialized graph with budget constraints, advancing orienteering problem solutions.

Findings

Algorithm effectively finds k-optimal goals within budget constraints

Applicable to real-world scenarios with specialized graph structures

Demonstrates improved efficiency over existing methods

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.