The compressed differential heuristic

DOI10.3233/AIC-170743MaRDI QIDQ5145426zbMATH OpenOpenAlexFDO

Authors Meir Goldenberg, Ariel Felner, Alon Palombo, Nathan R. Sturtevant, Jonathan Schaeffer

Publication date 20 January 2021

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-170743

zbMATH Keywords

compressionheuristicheuristic searchinconsistent heuristic

Mathematics Subject Classification ID

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

Recommendations

• Heuristic search in restricted memory
• scientific article; zbMATH DE number 1759719
• scientific article; zbMATH DE number 4162311
• Breadth-first heuristic search
• Remarks on the \(\mathrm A^{\ast\ast}\) algorithm

Cites work

• A heuristic search algorithm with modifiable estimate
• Case-based subgoaling in real-time heuristic search for video game pathfinding
• Compressed pattern databases
• Compressing optimal paths with run length encoding
• Computing the shortest path: A^ search meets graph theory
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Dynamic control in real-time heuristic search
• Fast Routing in Road Networks with Transit Nodes
• Hierarchical hub labelings for shortest paths
• scientific article; zbMATH DE number 2243373 (Why is no real title available?)
• Inconsistent heuristics in theory and practice
• Reach for A^*: shortest path algorithms with preprocessing
• The quickhull algorithm for convex hulls

Cited in

(2)

• A Heuristic for Finding Compatible Differential Paths with Application to HAS-160
• Heuristic search for one-to-many shortest path queries

Describes a project that uses

Uses Software

• Qhull
• DIMACS

This page was built for publication: The compressed differential heuristic

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