Heuristic search when time matters

DOI10.1613/JAIR.4047MaRDI QIDQ2846568zbMATH OpenOpenAlexWikidataFDO

Authors Ethan Burns, Wheeler Ruml, Minh B. Do

Publication date 6 September 2013

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4047

Mathematics Subject Classification ID

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

Recommendations

• Anytime heuristic search
• Anytime heuristic search for partial satisfaction planning
• Real-time heuristic search
• Dynamic control in real-time heuristic search
• scientific article; zbMATH DE number 5547847

Cited in

(7)

• Increasing search efficiency using multiple heuristics
• Rational deployment of multiple heuristics in optimal state-space search
• Real-time heuristic search
• Systems of Bounded Rational Agents with Information-Theoretic Constraints
• Anytime heuristic search
• Anytime heuristic search for partial satisfaction planning
• Heuristics for search sequencing under time-dependent probabilities of existence

This page was built for publication: Heuristic search when time matters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846568)