Informed Search

Informed search tries to reduce the amount of search that must be done by making intelligent choices for the nodes that are selected for expansion.

Parameters

Filters

Displaying 19 of 19 algorithms


Jump Point Search (JPS)	2011	$O(b^d)$	$O(b^d)$
Block A*	2011	$O(b^d)$	$O(b^d)$
Theta*	2010	$O(b^d)$	$O(b^d)$
Time-Bounded A* (TBA*)	2009	$O(b^d)$	$O(b^d)$
Fringe Saving A* (FSA*)	2008	$O(b^d)$	$O(b^d)$
Generalized Adaptive A* (GAA*)	2008	$O(b^d)$	$O(b^d)$
Bidirectional A* Algorithm	2007	$O(b^{(d/2)})$	$O(b^{d/2})$
Field D*	2006	$O(b^d)$	$O(b^d)$
Anytime Repairing A* (ARA*)	2005	$O(b^d)$	$O(b^d)$
Fringe	2005	$O(b^d)$	$O(b^d)$
Anytime Dynamic A* (ADA*)	2005	O(b^d)	O(b^d)
D* Lite	2005	O(b^d)	O(b^d)
Focused D*	2005	O(b^d)	O(b^d)
Lifelong Planning A* (LPA*)	2001	$O(b^d)$	$O(b^d)$
D*	1994	$O(b^d)$	$O(b^d)$
Simplified Memory-Bounded A* (SMA*)	1992	$O(b^d)$	$O(b^d)$
Iterative Deepening A* (IDA*)	1985	$O(b^d)$	$O(b^d)$
A* Algorithm	1968	$O(b^d)$	$O(b^d)$
Greedy Best-First Search	1959	$O(b^d)$	$O(b^d)$

Insuffient Data to display table

Insuffient Data to display table