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

Autor:	Sharma, Abhinav, Deshpande, Advait, Wang, Yanming, Xu, Xinyi, Madumal, Prashan, Hou, Anbin
Rok vydání:	2020
Předmět:	Computer Science - Artificial Intelligence
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2011.00781 Zobrazit plný text záznamu View this record from Arxiv