Heuristic Search Algorithm
Jump to navigation
Jump to search
A Heuristic Search Algorithm is an approximate search algorithm that is a heuristic algorithm.
- Context:
- It can range from being a Real-Time Heuristic Search Algorithm to being a Offline Heuristic Search Algorithm.
- Example(s):
- Counter-Examples(s):
- See: Search Algorithm, Dynamic Programming Algorithm, String Searching Algorithm, Shortest Path Identification Algorithm.
References
2017
- (Sammut & Webb, 2017) ⇒ (2017) Real-Time Dynamic Programming. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA.
- QUOTE: RTDP combines strengths of heuristic search and DP. Like heuristic search – and unlike conventional DP – it does not have to evaluate the entire state space in order to produce an optimal solution. Like DP – and unlike most heuristic search algorithms – it is applicable to nondeterministic problems. Additionally, RTDP's performance as an anytime algorithm is better than conventional DP and heuristic search algorithms. ARTDP extends these strengths to problems for which a good model is not initially available.
1990
- (Korf, 1990) ⇒ Richard E. Korf. (1990). “Real-time Heuristic Search.” In: Artificial Intelligence Journal, 42(2-3). doi:10.1016/0004-3702(90)90054-4
- QUOTE: Existing heuristic search algorithms are not applicable to real-time applications because they cannot commit to a move before an entire solution is found.