Controlling the learning process of real-time heuristic search

DOI10.1016/S0004-3702(03)00012-2zbMath1082.68814MaRDI QIDQ814454

Toru Ishida, Masashi Shimbo

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Adaptive learningConvergence processRational agentReal-time heuristic searchResource-boundedness

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Incorporating weights into real-time heuristic search ⋮ Properties of the DGS-auction algorithm ⋮ Escaping depressions in LRTS based on incremental refinement of encoded quad-trees ⋮ Hardness measures for gridworld benchmarks and performance analysis of real-time heuristic search algorithms

Cites Work

• Linear-space best-first search
• The \((n^ 2-1)\)-puzzle and related relocation problems
• Depth-first iterative-deepening: An optimal admissible tree search
• Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases
• Agent searching in a tree and the optimality of iterative deepening
• The heuristic search under conditions of error
• Heuristic search viewed as path finding in a graph
• Real-time heuristic search
• Planning as heuristic search
• Minimax real-time heuristic search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Controlling the learning process of real-time heuristic search