Pasar al contenido principal

RECONOCIMIENTO DE ACTIVIDADES Y PLANIFICACION AUTOMATICA PARA EL DISEÑO DE ASISTENTES INTELIGENTES

TIN2017-88476-C2-1-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2017
Plan Estatal 2017-2020 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): 8
Encontrada(s) 1 página(s)

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

Generalized planning as heuristic search

  • Segovia-Aguas, Javier
  • Jiménez, Sergio
  • Jonsson, Anders, 1973-
Comunicació presentada a ICAPS2021, celebrat del 2 a 13 d'agost de 2021 de manera virtual., Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). Planning as heuristic search traditionally addresses the computation of sequential plans by searching in a grounded state-space. On the other hand, GP aims at computing algorithm-like plans that can branch and loop, and that generalize to a (possibly infinite) set of planning instances. This paper adapts the {\em planning as heuristic search} paradigm to the particularities of GP and presents the first native heuristic search approach to GP. First, the paper defines a novel GP solution space that is independent of the number of planning instances in a GP problem, and the size of these instances. Second, the paper defines several evaluation and heuristic functions, that do not require grounding, for guiding a combinatorial search in the GP solution space, making it possible to handle state variables with large numerical domains (e.g. integers). Lastly, the paper defines an algorithm for GP called Best-First Generalized Planning (BFGP), that implements a best-first search in the solution space guided by our evaluation/heuristic functions., Javier Segovia-Aguas is supported by TAILOR, a project funded by EU H2020 research and innovation programme no. 952215, an ERC Advanced Grant no. 885107, and grant TIN-2015-67959-P from MINECO, Spain. Sergio Jiménez is supported by the Ramon y Cajal program, RYC-2015-18009, the Spanish MINECO project TIN2017-88476-C2-1-R. Anders Jonsson is partially supported by Spanish grants PID2019-108141GB-I00 and PCIN-2017-082.
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.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Predicting Emotion Dynamics Sequence on Twitter via Deep Learning Approach

  • Naskar, Debashis
  • Singh, Sanasam Ranbir
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
[EN] Exploring the mechanism about users' emotion dynamics towards social events and further predicting their future emotions have attracted great attention to the researchers. Despite the concreteness of the online expressions in written form, it remains unpredictable which kinds of emotions will be expressed in individual messages of Twitter users influenced by his/her friends. To investigate this, we perform an investigation on observing emotions unfolding in a consecutive sequence of tweets for a particular user based on his/her past history. In this paper, we propose an Emotion-based User Sequential Influence Model (E-USIM) on given a set of tweets related with some events (identified by the usage of a hashtag), determines how those sentiments will be distributed on behalf of a person within a conversation. We then apply the developed model to predict users' future emotions by combing of personal and interpersonal influence., This work is partially supported by the Spanish MINECO project TIN2017-88476-C2-1-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

A Decentralized Multi-Agent Coordination Method for Dynamic and Constrained Production Planning

  • Lujak, Marin
  • Fernandez, Alberto
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] In the capacitated production planning problem, quantities of products need to be determined at consecutive periods within a given time horizon when product demands, costs, and production capacities vary through time. We focus on a general formulation of this problem where each product is produced in one step and setup cost is paid at each period of production. Additionally, products can be anticipated or backordered in respect to the demand period. We propose a computationally efficient decentralized approach based on the spillover effect relating to the accumulation of production costs of each product demand through time. The performance of the spillover algorithm is compared against the state-of-the-art mixed integer programming branch-and-bound solver CPLEX 12.8 considering optimality gap and computational time., This work is supported by: the Spanish MINECO projects RTI2018-095390-B-C33 (MCIU/AEI/FEDER, UE) and TIN2017- 88476-C2-1-R, the French ADEME project E-Logistics, and an STSM Grant funded by the European ICT COST Action IC1406, cHiPSet.
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.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Generalized planning as heuristic search

  • Segovia-Aguas, Javier
  • Jiménez, Sergio
  • Jonsson, Anders, 1973-
Comunicació presentada a ICAPS2021, celebrat del 2 a 13 d'agost de 2021 de manera virtual., Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). Planning as heuristic search traditionally addresses the computation of sequential plans by searching in a grounded state-space. On the other hand, GP aims at computing algorithm-like plans that can branch and loop, and that generalize to a (possibly infinite) set of planning instances. This paper adapts the {\em planning as heuristic search} paradigm to the particularities of GP and presents the first native heuristic search approach to GP. First, the paper defines a novel GP solution space that is independent of the number of planning instances in a GP problem, and the size of these instances. Second, the paper defines several evaluation and heuristic functions, that do not require grounding, for guiding a combinatorial search in the GP solution space, making it possible to handle state variables with large numerical domains (e.g. integers). Lastly, the paper defines an algorithm for GP called Best-First Generalized Planning (BFGP), that implements a best-first search in the solution space guided by our evaluation/heuristic functions., Javier Segovia-Aguas is supported by TAILOR, a project funded by EU H2020 research and innovation programme no. 952215, an ERC Advanced Grant no. 885107, and grant TIN-2015-67959-P from MINECO, Spain. Sergio Jiménez is supported by the Ramon y Cajal program, RYC-2015-18009, the Spanish MINECO project TIN2017-88476-C2-1-R. Anders Jonsson is partially supported by Spanish grants PID2019-108141GB-I00 and PCIN-2017-082.