Minimax real-time heuristic search

DOI10.1016/S0004-3702(01)00103-5zbMath0971.68145OpenAlexW2083104145MaRDI QIDQ5941315

Sven Koenig

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00103-5

zbMATH Keywords

localizationinterleaving planning and plan executionsminimax searchreal-time heuristic searchrobot navigation

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Controlling the learning process of real-time heuristic search

Cites Work

• Planning and acting in partially observable stochastic domains
• Linear-space best-first search
• Rapid concept learning for mobile robots
• Real-time heuristic search
• Planning as heuristic search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimax real-time heuristic search