Pasar al contenido principal

COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

RYC-2015-18009

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Estatal de Promoción del Talento y su Empleabilidad en I+D+i
Subprograma Subprograma Estatal de Incorporación
Convocatoria Ramón y Cajal
Año convocatoria 2015
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Investigación, Desarrollo e Innovación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Learning Temporal Action Models via Constraint Programming

  • Garrido, Antonio|||0000-0002-8219-6777
  • Jiménez-Celorrio, Sergio|||0000-0003-0561-4880
[EN] We present a solver-independent Constraint Programming (CP) formulation for learning action models in temporal planning scenarios beyond PDDL2.1. Inspired by the CP approach for temporal planning, our formulation bases on a temporal plan trace and represents observations (as time-stamped states), actions, causal-link relationships, condition threats and effect interferences. This formulation is very expressive and supports a wide range of input knowledge. It also evidences the connection between the tasks of: i) action model learning, ii) plan validation, and iii) plan synthesis. Our experiments evaluate the quality of the learned models under different learning scenarios and in different planning domains., This work is supported by the Spanish MINECO project TIN2017- 88476-C2-1-R. S. Jimenez is partly supported by the RYC15/18009.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Observation Decoding with Sensor Models: Recognition Tasks via Classical Planning

  • Aineto, Diego
  • Jiménez-Celorrio, Sergio|||0000-0003-0561-4880
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] Observation decoding aims at discovering the underlyingstate trajectory of an acting agent from a sequence of observa-tions. This task is at the core of various recognition activitiesthat exploit planning as resolution method but there is a gen-eral lack of formal approaches that reason about the partialinformation received by the observer or leverage the distri-bution of the observations emitted by the sensors. In this pa-per, we formalize the observation decoding task exploiting aprobabilistic sensor model to build more accurate hypothesisabout the behaviour of the acting agent. Our proposal extendsthe expressiveness of former recognition approaches by ac-cepting observation sequences where one observation of thesequence can represent the reading of more than one variable,thus enabling observations over actions and partially observ-able states simultaneously. We formulate the probability dis-tribution of the observations perceived when the agent per-forms an action or visits a state as a classical cost planningtask that is solved with an optimal planner. The experimentswill show that exploiting a sensor model increases the accu-racy of predicting the agent behaviour in four different con-texts, This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R. D. Aineto is partially supported by the FPU16/03184 and S. Jimenez by the RYC15/18009
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Generalized Planning with Positive and Negative Examples

  • Segovia-Aguas, Javier
  • Jonsson, Anders
  • Jiménez-Celorrio, Sergio|||0000-0003-0561-4880
[EN] Generalized planning aims at computing an algorithm-like structure (generalized plan) that solves a set of multiple planning instances. In this paper we define negative examples for generalized planning as planning instances that must not be solved by a generalized plan. With this regard the paper extends the notion of validation of a generalized plan as the problem of verifying that a given generalized plan solves the set of input positives instances while it fails to solve a given input set of negative examples. This notion of plan validation allows us to define quantitative metrics to asses the generalization capacity of generalized plans. The paper also shows how to incorporate this new notion of plan validation into a compilation for plan synthesis that takes both positive and negative instances as input. Experiments show that incorporating negative examples can accelerate plan synthesis in several domains and leverage quantitative metrics to evaluate the generalization capacity of the synthesized plans., The research leading to these results has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement no. 731761, IMAGINE; and it is partially supported by grant TIN-2015- 67959 and the Maria de Maeztu Units of Excellence Programme MDM-2015-0502, MEC, Spain. Sergio Jimenez is supported by the Ramon y Cajal program, RYC-2015- 18009, the Spanish MINECO project TIN2017-88476-C2- 1-R, and the generalitat valenciana project GV/2019/082. Anders Jonsson is partially supported by the Spanish grants TIN2015-67959 and PCIN-2017-082.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Generalized planning with positive and negative examples

  • Segovia-Aguas, Javier
  • Jiménez, Sergio
  • Jonsson, Anders
Trabajo presentado en la 34th AAAI Conference on Artificial Intelligence (AAAI), celebrada en New York (Estados Unidos), del 7 al 12 de febrero de 2020, Generalized planning aims at computing an algorithm-like structure (generalized plan) that solves a set of multiple planning instances. In this paper we define negative examples for generalized planning as planning instances that must not be solved by a generalized plan. With this regard the paper extends the notion of validation of a generalized plan as the problem of verifying that a given generalized plan solves the set of input positives instances while it fails to solve a given input set of negative examples. This notion of plan validation allows us to define quantitative metrics to asses the generalization capacity of generalized plans. The paper also shows how to incorporate this new notion of plan validation into a compilation for plan synthesis that takes both positive and negative instances as input. Experiments show that incorporating negative examples can accelerate plan synthesis in several domains and leverage quantitative metrics to evaluate the generalization capacity of the synthesized plans., The research leading to these results has received funding from the European Unions Horizon 2020 research and innovation programme under grant agreement no. 731761, IMAGINE; and it is partially supported by grant TIN-2015- 67959 and the Maria de Maeztu Units of Excellence Programme MDM-2015-0502, MEC, Spain. Sergio Jimenez ´ is supported by the Ramon y Cajal program, RYC-2015- 18009, the Spanish MINECO project TIN2017-88476-C2- 1-R, and the generalitat valenciana project GV/2019/082. Anders Jonsson is partially supported by the Spanish grants TIN2015-67959 and PCIN-2017-082.