Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

BDE

Financiado

Cerrado

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... ver más

31/01/2024

UNIVERSITAT BASEL

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

UNIVERSITAT BASEL No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Ver 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2024-01-31

ERC-2018-COG: ERC Consolidator Grant

I+D

Cerrada hace 6 años

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

2 Participantes

UNIVERSITAT BASEL

2.00M€ | Lider

PLASFI, S.A.

684.66K€ | Participante

Proyectos interesantes

SSX

Artificial Inte...

Data Science

1M€ Cerrado

MCUNLEASH

Software

Data Science

1M€ Cerrado

TED2021-131310B-I00

Software

Data Science

414K€ Cerrado

TIN2012-35632-C02-01

Software

Data Science

25K€ Cerrado

INFSYS

Software

Data Science

1M€ Cerrado

TIN2015-67661-P

Software

Data Science

116K€ Cerrado

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Duración del proyecto: 61 meses Fecha Inicio: 2018-12-18
Fecha Fin: 2024-01-31

Líder del proyecto

UNIVERSITAT BASEL No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto "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."

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores