Shortest Path for K Goals

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

Authors

• Roni Stern
• Meir Goldenberg
• Ariel Felner

Keywords

No keywords are indexed for this paper.