com.graphhopper.routing

Class AStarBidirection

java.lang.Object

com.graphhopper.routing.AbstractBidirAlgo

com.graphhopper.routing.AbstractNonCHBidirAlgo

com.graphhopper.routing.AStarBidirection

All Implemented Interfaces:

BidirRoutingAlgorithm, RoutingAlgorithm

Direct Known Subclasses:

AlternativeRoute

public class AStarBidirection
extends AbstractNonCHBidirAlgo

This class implements a bidirectional A* algorithm. It is interesting to note that a bidirectional dijkstra is far more efficient than a single direction one. The same does not hold for a bidirectional A* as the heuristic can not be as tight.

See http://research.microsoft.com/apps/pubs/default.aspx?id=64511 http://i11www.iti.uni-karlsruhe.de/_media/teaching/sommer2012/routenplanung/vorlesung4.pdf http://research.microsoft.com/pubs/64504/goldberg-sofsem07.pdf http://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf

and

1. Ikeda, T., Hsu, M.-Y., Imai, H., Nishimura, S., Shimoura, H., Hashimoto, T., Tenmoku, K., and Mitoh, K. (1994). A fast algorithm for finding better routes by ai search techniques. In VNIS, pages 291–296.

2. Whangbo, T. K. (2007). Efficient modified bidirectional a* algorithm for optimal route- finding. In IEA/AIE, volume 4570, pages 344–353. Springer.

or could we even use this three phase approach? www.lix.polytechnique.fr/~giacomon/papers/bidirtimedep.pdf

Author:

Peter Karich, jansoe

Field Summary

Fields inherited from class com.graphhopper.routing.AbstractNonCHBidirAlgo

additionalEdgeFilter, edgeExplorer, graph, nodeAccess, weighting

Fields inherited from class com.graphhopper.routing.AbstractBidirAlgo

bestBwdEntry, bestFwdEntry, bestWeight, bestWeightMapFrom, bestWeightMapOther, bestWeightMapTo, currFrom, currTo, finishedFrom, finishedTo, from, fromOutEdge, maxVisitedNodes, to, toInEdge, traversalMode, updateBestPath

Constructor Summary

Constructors

Constructor and Description
AStarBidirection(Graph graph, Weighting weighting, TraversalMode tMode)

Method Summary

Modifier and Type	Method and Description
protected double	calcWeight(EdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected SPTEntry	createEntry(EdgeIteratorState edge, double weight, SPTEntry parent, boolean reverse) Creates a new entry of the shortest path tree (a SPTEntry or one of its subclasses) during a dijkstra expansion.
protected SPTEntry	createStartEntry(int node, double weight, boolean reverse) Creates the root shortest path tree entry for the forward or backward search.
protected boolean	finished()
WeightApproximator	getApproximation()
String	getName()
AStarBidirection	setApproximation(WeightApproximator approx)

Methods inherited from class com.graphhopper.routing.AbstractNonCHBidirAlgo

accept, createEmptyPath, createPathExtractor, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, getInEdgeWeight, postInitFrom, postInitTo, toString

Methods inherited from class com.graphhopper.routing.AbstractBidirAlgo

bwdSearchCanBeStopped, calcPath, calcPath, calcPaths, checkAlreadyRun, fromEntryCanBeSkipped, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getIncomingEdge, getVisitedNodes, initCollections, initFrom, initTo, isMaxVisitedNodesExceeded, postInit, runAlgo, setMaxVisitedNodes, setUpdateBestPath, toEntryCanBeSkipped, updateBestPath

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface com.graphhopper.routing.BidirRoutingAlgorithm

calcPath

Methods inherited from interface com.graphhopper.routing.RoutingAlgorithm

calcPath, calcPaths, getVisitedNodes, setMaxVisitedNodes

Constructor Detail

AStarBidirection

public AStarBidirection(Graph graph,
                        Weighting weighting,
                        TraversalMode tMode)

Method Detail

finished

protected boolean finished()

Overrides:

finished in class AbstractBidirAlgo

createStartEntry

protected SPTEntry createStartEntry(int node,
                                    double weight,
                                    boolean reverse)

Description copied from class: AbstractBidirAlgo

Creates the root shortest path tree entry for the forward or backward search.

Specified by:

createStartEntry in class AbstractBidirAlgo

createEntry

protected SPTEntry createEntry(EdgeIteratorState edge,
                               double weight,
                               SPTEntry parent,
                               boolean reverse)

Description copied from class: AbstractNonCHBidirAlgo

Creates a new entry of the shortest path tree (a SPTEntry or one of its subclasses) during a dijkstra expansion.

Specified by:

createEntry in class AbstractNonCHBidirAlgo

Parameters:

edge - the edge that is currently processed for the expansion

weight - the weight the shortest path three entry should carry

parent - the parent entry of in the shortest path tree

reverse - true if we are currently looking at the backward search, false otherwise

calcWeight

protected double calcWeight(EdgeIteratorState iter,
                            SPTEntry currEdge,
                            boolean reverse)

Overrides:

calcWeight in class AbstractNonCHBidirAlgo

getApproximation

public WeightApproximator getApproximation()

setApproximation

public AStarBidirection setApproximation(WeightApproximator approx)

getName

public String getName()

Specified by:

getName in interface RoutingAlgorithm

Overrides:

getName in class AbstractBidirAlgo

Returns:

name of this algorithm