Pasar al contenido principal

APRENDIZAJE PARA PLANIFICACION SENSIBLE AL HUMANO

PID2021-127647NB-C22

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2021
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Synthesis of procedural models for deterministic transition systems

  • Segovia-Aguas, Javier
  • Ferrer Mestres, Jonathan
  • Sergio, Jiménez
Comunicació presentada a la 26th European Conference on Artificial Intelligence, celebrada del 30 de setembre al 4 d'octubre de 2023 a Kraków, Poland., This paper introduces a general approach for synthesizing procedural models of the state-transitions of a given discrete system. The approach is general in that it accepts different target languages for modeling the state-transitions of a discrete system; different model acquisition tasks with different target languages, such as the synthesis of STRIPS action models, or the update rule of a cellular automaton, fit as particular instances of our general approach. We follow an inductive approach to synthesis meaning that a set of examples of state-transitions, represented as (pre-state, action, post-state) tuples, are given as input. The goal is to synthesize a structured program that, when executed on a given pre-state, outputs its associated post-state. Our synthesis method implements a combinatorial search in the space of well-structured terminating programs that can be built using a Random-Access Machine (RAM), with a minimalist instruction set, and a finite amount of memory. The combinatorial search is guided with functions that asses the complexity of the candidate programs, as well as their fitness to the given input set of examples., This work is supported by the H2020 AIPLAN4EU project #101016442. Javier Segovia-Aguas is funded by TAILOR, AGAUR SGR and the Spanish grant PID2019-108141GB-I00. Jonathan Ferrer-Mestres is supported by the CSIRO MLAI Future Science Platform. Sergio Jiménez is funded by the Spanish MINECO project PID2021-127647NB-C22.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Learning Causality under Uncertainty for Egocentric Action Anticipation

  • Garrido, Antonio|||0000-0002-8219-6777
[EN] Egocentric action anticipation, as the task to infer future actions based on egocentric observations, is very appealing to discover patterns, conducts and, eventually, action causality. In the real world, the observations are usually uncertain, which means they are incomplete and noisy. Consequently, addressing uncertainty implies some kind of optimization. Traditional approaches develop classification tasks to calculate the actions with the highest probability to appear next (maximization problem), but they do not exploit the cause-and-effect relationships. We present here a simple two-step approach. The first step formulates and solves a constraint optimization problem that learns the action causality from a training dataset. Given an observation segment of actions over a new dataset, the second step uses such causality in a matching process to anticipate the highest scored actions. Additionally, this causality can be used to derive the planning action model. The experiments in the EPIC-KITCHENS dataset, a large-scale egocentric benchmark, show that our approach is competitive in terms of accuracy and recall., This work has been partially supported by grant PID2021-127647NB-C22 funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe".
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Synthesis of procedural models for deterministic transition systems

  • Segovia-Aguas, Javier
  • Ferrer Mestres, Jonathan
  • Sergio, Jiménez
Comunicació presentada a la 26th European Conference on Artificial Intelligence, celebrada del 30 de setembre al 4 d'octubre de 2023 a Kraków, Poland., This paper introduces a general approach for synthesizing procedural models of the state-transitions of a given discrete system. The approach is general in that it accepts different target languages for modeling the state-transitions of a discrete system; different model acquisition tasks with different target languages, such as the synthesis of STRIPS action models, or the update rule of a cellular automaton, fit as particular instances of our general approach. We follow an inductive approach to synthesis meaning that a set of examples of state-transitions, represented as (pre-state, action, post-state) tuples, are given as input. The goal is to synthesize a structured program that, when executed on a given pre-state, outputs its associated post-state. Our synthesis method implements a combinatorial search in the space of well-structured terminating programs that can be built using a Random-Access Machine (RAM), with a minimalist instruction set, and a finite amount of memory. The combinatorial search is guided with functions that asses the complexity of the candidate programs, as well as their fitness to the given input set of examples., This work is supported by the H2020 AIPLAN4EU project #101016442. Javier Segovia-Aguas is funded by TAILOR, AGAUR SGR and the Spanish grant PID2019-108141GB-I00. Jonathan Ferrer-Mestres is supported by the CSIRO MLAI Future Science Platform. Sergio Jiménez is funded by the Spanish MINECO project PID2021-127647NB-C22.