Corpus ID: 1970734

Shortest Path for K Goals

@inproceedings{Stern2017ShortestPF,
  title={Shortest Path for K Goals},
  author={Roni Stern and Meir Goldenberg and Ariel Felner},
  booktitle={SOCS},
  year={2017}
}
  • Roni Stern, Meir Goldenberg, Ariel Felner
  • Published in SOCS 2017
  • Computer Science
  • 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. 

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES

    Reusing cost-minimal paths for goal-directed navigation in partially known terrains

    VIEW 2 EXCERPTS

    Benchmarks for Grid-Based Pathfinding

    • Nathan R. Sturtevant
    • Computer Science
    • IEEE Transactions on Computational Intelligence and AI in Games
    • 2012
    VIEW 1 EXCERPT

    Predicting Internet network distance with coordinates-based approaches

    • T. S. Eugene Ng, Hui Zhang
    • Computer Science
    • Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
    • 2002
    VIEW 1 EXCERPT