Shortest Path for K Goals

  title={Shortest Path for K Goals},
  author={Roni Stern and Meir Goldenberg and Ariel Felner},
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.  
1 Citations

Figures from this paper

Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery

This work makes Token Passing even more efficient and effective by using a novel combinatorial search algorithm, called Safe Interval Path Planning with Reservation Table (SIPPwRT), for single-agent path planning, which takes kinematic constraints of real robots into account directly during planning.



Computing the shortest path: A search meets graph theory

Experimental results show that the most efficient of the new shortest path algorithms outperforms previous algorithms, in particular A* search with Euclidean bounds, by a wide margin on road networks and on some synthetic problem families.

Faster Batched Shortest Paths in Road Networks

It is concluded that a new extension of PHAST (a recent one-to-all algorithm), called RPHAST, has the best performance in most cases, often by orders of magnitude.

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

Tree-Adaptive A* is the first incremental heuristic search algorithm that combines the principles of both classes of incrementalHeuristic search algorithms, and is thus potentially more efficient than Path- adaptive A* since it uses information from all previous searches and not just the last one.

Searching for the M Best Solutions in Graphical Models

This paper presents a new algorithm m-A*, extending the well-known A* to the m-best task, and for the first time proves that all its desirable properties, including soundness, completeness and optimal efficiency, are maintained.

Improved Heuristic Search for Sparse Motion Planning Data Structures

This work shows how to extend sparse methods achieving asymptotic near-optimality using multiple-goal heuristic search during graph constuction to produce identical output to the existing Incremental Roadmap Spanner approach but in an order of magnitude less time.

Benchmarks for Grid-Based Pathfinding

  • Nathan R Sturtevant
  • Computer Science
    IEEE Transactions on Computational Intelligence and AI in Games
  • 2012
The goal is that these test sets will be useful to many researchers, making experimental results more comparable across papers, and improving the quality of research on grid-based domains.

Predicting Internet network distance with coordinates-based approaches

  • T. NgHui Zhang
  • Computer Science
    Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
  • 2002
This work proposes using coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay), and proposes the GNP approach, based on absolute coordinates computed from modeling the Internet as a geometric space.

Memory-Based Heuristics for Explicit State Spaces

This work provides a number of techniques for using and improving true distance heuristics such that most of the benefits of the all-pairs shortest-path computation can be gained with less than 1% of the memory.