BDE SIGNED
Beyond Distance Estimates: A New Theory of Heuristics for State-Space Search
Total Cost €
0EC-Contrib. €
0Partnership
0Views
0BDE project word cloud
Explore the words cloud of the BDE project. It provides you a very rough idea of what is the project "BDE" about.
Project "BDE" data sheet
The following table provides information about the project.
| Coordinator |
UNIVERSITAT BASEL
Organization address contact info |
| Coordinator Country | Switzerland [CH] |
| Total cost | 1˙997˙510 € |
| EC max contribution | 1˙997˙510 € (100%) |
| Programme |
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC)) |
| Code Call | ERC-2018-COG |
| Funding Scheme | ERC-COG |
| Starting year | 2019 |
| Duration (year-month-day) | from 2019-02-01 to 2024-01-31 |
Partnership
Take a look of project's partnership.
| # | ||||
|---|---|---|---|---|
| 1 | UNIVERSITAT BASEL | CH (BASEL) | coordinator | 1˙997˙510.00 |
Map
Project objective
'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 IJCAI and AAAI.
Algorithms in the A* family, dating back to 1968, are still the go-to approach for state-space search. A* is a graph search algorithm whose only 'intelligence' stems from a so-called 'heuristic function', which estimates the distance from a state to the nearest goal state. The efficiency of A* depends on the accuracy of this estimate, and decades of research have pushed the envelope in devising increasingly accurate estimates.
In this project, we question the 'A* distance estimator' paradigm and explore three new directions that go beyond the classical approach:
1. We propose a new paradigm of declarative heuristics, where heuristic information is not represented as distance estimates, but as properties of solutions amenable to introspection and general reasoning.
2. We suggest moving the burden of creativity away from the human expert by casting heuristic design as a meta-optimization problem that can be solved automatically.
3. We propose abandoning the idea of exploring sequential paths in state spaces, instead transforming state-space search into combinatorial optimization problems with no explicit sequencing aspect. We argue that the 'curse of sequentiality' is as bad as the curse of dimensionality and must be addressed head-on.'
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "BDE" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "BDE" are provided by the European Opendata Portal: CORDIS opendata.