ERC Consolidator Grant · 2018
Beyond Distance Estimates: A New Theory of Heuristics for State-Space Search
Many problems in computer science can be cast as state-space search, where the objective is to find a path from an initial state to a goal state in a directed graph called a "state space". State-space search is challenging due to the state explosion problem a.k.a. "curse of dimensionality": interesting state spaces are often astronomically large, defying brute-force exploration. State-space search has been a core research problem in Artificial Intelligence since its early days and is alive as ever. Every year, a substantial fraction of research published at the ICAPS and SoCS conferences is concerned with state-space search, and the topic is very active at general AI conferences such as…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.