摘要: In this paper we study the k goal search problem (kGS), which is of solving shortest path problems that share same start state. Two fundamental heuristic approaches are analyzed: searching for goals one at a time, or all together in single pass. Key theoretical properties established and preliminary experimental evaluation performed.
参考文章(0)