1 paper
Abhinav Sharma, Advait Deshpande, Yanming Wang +3
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 g…