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): 29
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.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Computing programs for generalized planning using a classical planner

  • Segovia-Aguas, Javier
  • Jiménez, Sergio
  • Jonsson, Anders
Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). This paper adapts the 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 program-based solution space for GP that is independent of the number of planning instances in a GP problem, and the size of these instances. Second, the paper defines the BFGP algorithm for GP, that implements a best-first search in our programbased solution space, and that is guided by different evaluation and heuristic functions.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Tesis doctoral (DoctoralThesis)

Inference and Learning with Planning Models

  • Aineto García, Diego
[ES] Inferencia y aprendizaje son los actos de razonar sobre evidencia recogida con el fin de alcanzar conclusiones lógicas sobre el proceso que la originó. En el contexto de un modelo de espacio de estados, inferencia y aprendizaje se refieren normalmente a explicar el comportamiento pasado de un agente, predecir sus acciones futuras, o identificar su modelo. En esta tesis, presentamos un marco para inferencia y aprendizaje en el modelo de espacio de estados subyacente al modelo de planificación clásica, y formulamos una paleta de problemas de inferencia y aprendizaje bajo este paraguas unificador. También desarrollamos métodos efectivos basados en planificación que nos permiten resolver estos problemas utilizando algoritmos de planificación genéricos del estado del arte. Mostraremos que un gran número de problemas de inferencia y aprendizaje claves que han sido tratados como desconectados se pueden formular de forma cohesiva y resolver siguiendo procedimientos homogéneos usando nuestro marco. Además, nuestro trabajo abre las puertas a nuevas aplicaciones para tecnología de planificación ya que resalta las características que hacen que el modelo de espacio de estados de planificación clásica sea diferente a los demás modelos., [CA] Inferència i aprenentatge són els actes de raonar sobre evidència arreplegada a fi d'aconseguir conclusions lògiques sobre el procés que la va originar. En el context d'un model d'espai d'estats, inferència i aprenentatge es referixen normalment a explicar el comportament passat d'un agent, predir les seues accions futures, o identificar el seu model. En esta tesi, presentem un marc per a inferència i aprenentatge en el model d'espai d'estats subjacent al model de planificació clàssica, i formulem una paleta de problemes d'inferència i aprenentatge davall este paraigua unificador. També desenrotllem mètodes efectius basats en planificació que ens permeten resoldre estos problemes utilitzant algoritmes de planificació genèrics de l'estat de l'art. Mostrarem que un gran nombre de problemes d'inferència i aprenentatge claus que han sigut tractats com desconnectats es poden formular de forma cohesiva i resoldre seguint procediments homogenis usant el nostre marc. A més, el nostre treball obri les portes a noves aplicacions per a tecnologia de planificació ja que ressalta les característiques que fan que el model d'espai d'estats de planificació clàssica siga diferent dels altres models., [EN] Inference and learning are the acts of reasoning about some collected evidence in order to reach a logical conclusion regarding the process that originated it. In the context of a state-space model, inference and learning are usually concerned with explaining an agent's past behaviour, predicting its future actions or identifying its model. In this thesis, we present a framework for inference and learning in the state-space model underlying the classical planning model, and formulate a palette of inference and learning problems under this unifying umbrella. We also develop effective planning-based approaches to solve these problems using off-the-shelf, state-of-the-art planning algorithms. We will show that several core inference and learning problems that previous research has treated as disconnected can be formulated in a cohesive way and solved following homogeneous procedures using the proposed framework. Further, our work opens the way for new applications of planning technology as it highlights the features that make the state-space model of classical planning different from other models., The work developed in this doctoral thesis has been possible thanks to the FPU16/03184 fellowship that I have enjoyed for the duration of my PhD studies. I have also been supported by my advisors’ grants TIN2017-88476-C2-1-R, TIN2014-55637-C2-2-R-AR, and RYC-2015-18009.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Proyecto fin de carrera (BachelorThesis)

Teaching activity recognition in lectures delivered at UPV, Identificación de actividades docentes en asignaturas impartidas en la UPV

  • Romero Fernández, Alberto
[EN] In this project, we propose to build a system for recognizing teaching activities from automatic transcriptions of classroom video recordings. To this end, we identified various teaching activities that cover the nature of the lecturer discourse when giving a course eg. ’theoretical explanation’, ’problem solving’, ’real-world practical example’, ’interation lecturer-student’, ’course-related asides’, etc. We labeled a dataset of lecture transcriptions from the VideoApuntes repository of UPV and we solved a classification task with the XLM-RoBERTa model, an improved version of BERT (Bidirectional Encoder Representations from Transformers) with a classification layer on top of it. The results will show the high accuracy in classifying text segments of the discourse. Finally, we aim to conduct an experiment in order to identify the type of teaching activity reflected in a text segment using a binary decision tree., [ES] En el presente TFG se propone la construcción de un sistema para el reconocimiento de actividades docentes a partir de transcripciones de grabaciones de audio en el aula. Para ello, identificamos un conjunto de actividades docentes que cubren todos los tipos de discurso académico que un docente puede emplear en el aula cuando imparte un curso tales como por ejemplo, "teoría", ’resolución de ejercicios",”ejemplos prácticos del mundo real", ”interacción entre profesor y estudiante", ”organización y gestión de la asignatura", etc. Además, creamos un dataset a partir de las transcripciones de clases grabadas con el servicio VideoApuntes de la UPV y etiquetamos segmentos de las transcripciones con el tipo de discurso correspondiente. Posteriormente, diseñamos una tarea de clasificación que se resuelve con el modelo XLM-RoBERTa, una versión mejorada de BERT (Bidirectional Encoder Representations from Transformers) sobre el que se ha diseñado una capa de clasificación. Los resultados muestran un alto nivel de precisión en la clasificación de segmentos de texto del discurso académico que emplean los profesores en la impartición de asignaturas. Por último, se pretende diseñar un método para identificar el tipo de actividad docente que se refleja en un segmento de transcripción a partir de un arbol de clasificación binario., [CA] En el present TFG es proposa la construcció d’un sistema per al reconeixement d’activitats docents a partir de transcripcions d’gravacions d’àudio a l’aula. Per a això, identifiquem un conjunt d’activitats docents que cobreixen tots els tipus de discurs acadèmic que un docent pot emprar a l’aula quan imparteix un curs, com per exemple, "teoria", "resolució d’exercicis", "exemples pràctics del món real", ”interacció entre professor i estudiant", "organització i gestió de l’assignatura", etc. A més, creem un dataset a partir de les transcripcions de classes gravades amb el servei VideoApuntes de la UPV i etiquetem segments de les transcripcions amb el tipus de discurs corresponent. Posteriorment, dissenyem una tasca de classificació que es resol amb el model XLM-RoBERTa, una versió millorada de BERT (Bidirectional Encoder Representations from Transformers) sobre el que s’ha dissenyat una capa de classificació. Els resultats mostren un alt nivell de precisió en la classificació de segments de text del discurs acadèmic que empren els professors en la impartició d’assignatures. Finalment, es pretén dissenyar un mètode per a identificar el tipus d’activitat docent que es reflecteix en un segment de transcripció a partir d’un arbre de classificació binari.
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 Artículo científico (JournalArticle)

Can Tourist Attractions Boost Other Activities Around? A Data Analysis through Social Networks

  • Bustamante, Alexander
  • Sebastiá Tarín, Laura|||0000-0001-8505-9471
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] Promoting a tourist destination requires uncovering travel patterns and destination choices, identifying the profile of visitors and analyzing attitudes and preferences of visitors for the city. To this end, tourism-related data are an invaluable asset to understand tourism behaviour, obtain statistical records and support decision-making for business around tourism. In this work, we study the behaviour of tourists visiting top attractions of a city in relation to the tourist influx to restaurants around the attractions. We propose to undertake this analysis by retrieving information posted by visitors in a social network and using an open access map service to locate the tweets in a influence area of the city. Additionally, we present a pattern recognition based technique to differentiate visitors and locals from the collected data from the social network. We apply our study to the city of Valencia in Spain and Berlin in Germany. The results show that, while in Valencia the most frequented restaurants are located near top attractions of the city, in Berlin, it is usually the case that the most visited restaurants are far away from the relevant attractions of the city. The conclusions from this study can be very insightful for destination marketers., This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Learning cost action planning models with perfect precision via constraint propagation

  • Garrido, Antonio|||0000-0002-8219-6777
[EN] Data-driven AI is rapidly gaining importance. In the context of AI planning, a constraint programming formulation for learning action models in a data-driven fashion is proposed. Data comprises plan observations, which are automatically transformed into a set of planning constraints which need to be satisfied. The formulation captures the essence of the action model and unifies functionalities that are individually supported by other learning approaches, such as costs, noise/uncertainty on actions, information on intermediate state observations and mutex reasoning. Reliability is a key concern in data-driven learning, but existing approaches usually learn action models that can be imprecise, where imprecision here is an error indicator of learning something incorrect. On the contrary, the proposed approach guarantees reliability in terms of perfect precision by using constraint propagation. This means that what is learned is 100% correct (i.e., error-free), not only for the initial observations, but also for future observations. To our knowledge, this is a novelty in action model learning literature. Although perfect precision might potentially limit the amount of learned information, the exhaustive experiments over 20 planning domains show that such amount is comparable, and even better, to ARMS and FAMA, two state-of-the-art benchmarks in action model learning., 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", and by the Spanish MINECO project TIN2017-88476-C2-1-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Tesis doctoral (DoctoralThesis)

Anomalous Diffusion Characterization using Machine Learning Methods

  • Garibo Orts, Óscar
[ES] Durante las últimas décadas el uso del aprendizaje automático (machine learning) y de la inteligencia artificial ha mostrado un crecimiento exponencial en muchas áreas de la ciencia. El hecho de que los ordenadores hayan aumentado sus restaciones a la vez que han reducido su precio, junto con la disponibilidad de entornos de desarrollo de código abierto han permitido el acceso a la inteligencia artificial a un gran rango de investigadores, democratizando de esta forma el acceso a métodos de inteligencia artificial a la comunidad investigadora. Es nuestra creencia que la multidisciplinaridad es clave para nuevos logros, con equipos compuestos de investigadores con diferentes preparaciones y de diferentes campos de especialización. Con este ánimo, hemos orientado esta tesis en el uso de machine learning inteligencia artificial, aprendizaje profundo o deep learning, entendiendo todas las anteriores como parte de un concepto global que concretamos en el término inteligencia artificial, a intentar arrojar luz a algunos problemas de los campos de las matemáticas y la física. Desarrollamos una arquitectura deep learning y la medimos con éxito en la caracterización de procesos de difusión anómala. Mientras que previamente se habían utilizado métodos estadísticos clásicos con este objetivo, los métodos de deep learning han demostrado mejorar las prestaciones de dichos métodos clásicos. Nuestra architectura demostró que puede inferir con precisión el exponente de difusión anómala y clasificar trayectorias entre un conjunto dado de modelos subyacentes de difusión . Mientras que las redes neuronales recurrentes irrumpieron recientemente, los modelos basados en redes convolucionales han sido ámpliamente testados en el campo del procesamiento de imagen durante más de 15 años. Existen muchos modelos y arquitecturas, pre-entrenados y listos para ser usados por la comunidad. No es necesario realizar investigación ya que dichos modelos han probado su valía durante años y están bien documentados en la literatura. Nuestro objetivo era ser capaces de usar esos modelos bien conocidos y fiables, con trayectorias de difusión anómala. Solo necesitábamos convertir una serie temporal en una imagen, cosa que hicimos aplicando gramian angular fields a las trayectorias, poniendo el foco en las trayectorias cortas. Hasta donde sabemos, ésta es la primera vez que dichas técnicas son usadas en este campo. Mostramos cómo esta aproximación mejora las prestaciones de cualquier otra propuesta en la clasificación del modelo subyacente de difusión anómala para trayectorias cortas. Más allá de la física están las matemáticas. Utilizamos nuestra arquitectura basada en redes recurrentes neuronales para inferir los parámetros que definen las trayectorias de Wu Baleanu. Mostramos que nuestra propuesta puede inferir con azonable precisión los parámetros mu y nu. Siendo la primera vez, de nuevo hasta donde llega nuestro conocimiento, que tales técnicas se aplican en este escenario. Extendemos este trabajo a las ecuaciones fraccionales discretas con retardo, obteniendo resultados similares en términos de precisión. Adicionalmente, mostramos que la misma arquitectura se puede usar para discriminar entre trayectorias con y sin retardo con gran confianza. Finalmente, también investigamos modelos fraccionales discretos. Hemos analizado esquemas de paso temporal con la cuadratura de Lubich en lugar del clásico esquema de orden 1 de Euler. En el primer estudio de este nuevo paradigma hemos comparado los diagramas de bifurcación de los mapas logístico y del seno, obtenidos de la discretización de Euler de orden 1, 2 y 1/2., [CA] Durant les darreres dècades l'ús de l'aprenentatge automàtic (machine learning) i de la intel.ligència artificial ha mostrat un creixement exponencial en moltes àrees de la ciència. El fet que els ordinadors hagen augmentat les seues prestacions a la vegada que han reduït el seu preu, junt amb la disponibilitat d'entorns de desenvolupament de codi obert han permès l'accés a la intel.ligència artificial a un gran rang d'investigadors, democratitzant així l'accés a mètodes d'intel.ligència artificial a la comunitat investigadora. És la nostra creença que la multidisciplinaritat és clau per a nous èxits, amb equips compostos d'investigadors amb diferents preparacions i diferents camps d'especialització. Amb aquest ànim, hem orientat aquesta tesi en l'ús d'intel.ligència artificial machine learning, aprenentatge profund o deep learning, entenent totes les anteriors com a part d'un concepte global que concretem en el terme intel.ligència, a intentar donar llum a alguns problemes dels camps de les matemàtiques i la física. Desenvolupem una arquitectura deep learning i la mesurem amb èxit en la caracterització de processos de difusió anòmala. Mentre que prèviament s'havien utilitzat mètodes estadístics clàssics amb aquest objectiu, els mètodes de deep learning han demostrat millorar les prestacions d'aquests mètodes clàssics. La nostra architectura va demostrar que pot inferir amb precisió l'exponent de difusió anòmala i classificar trajectòries entre un conjunt donat de models subjacents de difusió. Mentre que les xarxes neuronals recurrents van irrompre recentment, els models basats en xarxes convolucionals han estat àmpliament testats al camp del processament d'imatge durant més de 15 anys. Hi ha molts models i arquitectures, pre-entrenats i llestos per ser usats per la comunitat. No cal fer recerca ja que aquests models han provat la seva vàlua durant anys i estan ben documentats a la literatura. El nostre objectiu era ser capaços de fer servir aquests models ben coneguts i fiables, amb trajectòries de difusió anòmala. Només necessitàvem convertir una sèrie temporal en una imatge, cosa que vam fer aplicant gramian angular fields a les trajectòries, posant el focus a les trajectòries curtes. Fins on sabem, aquesta és la primera vegada que aquestes tècniques són usades en aquest camp. Mostrem com aquesta aproximació millora les prestacions de qualsevol altra proposta a la classificació del model subjacent de difusió anòmala per a trajectòries curtes. Més enllà de la física hi ha les matemàtiques. Utilitzem la nostra arquitectura basada en xarxes recurrents neuronals per inferir els paràmetres que defineixen les trajectòries de Wu Baleanu. Mostrem que la nostra proposta pot inferir amb raonable precisió els paràmetres mu i nu. Sent la primera vegada, novament fins on arriba el nostre coneixement, que aquestes tècniques s'apliquen en aquest escenari. Estenem aquest treball a les equacions fraccionals discretes amb retard, obtenint resultats similars en termes de precisió. Addicionalment, mostrem que la mateixa arquitectura es pot fer servir per discriminar entre trajectòries amb i sense retard amb gran confiança. Finalment, també investiguem models fraccionals discrets. Hem analitzat esquemes de pas temporal amb la quadratura de Lubich en lloc del clàssic esquema d'ordre 1 d'Euler. Al primer estudi d'aquest nou paradigma hem comparat els diagrames de bifurcació dels mapes logístic i del sinus, obtinguts de la discretització d'Euler d'ordre 1, 2 i 1/2., [EN] During the last decades the use of machine learning and artificial intelligence have showed an exponential growth in many areas of science. The fact that computer's hardware has increased its performance while lowering the price and the availability of open source frameworks have enabled the access to artificial intelligence to a broad range of researchers, hence democratizing the access to artificial intelligence methods to the research community. It is our belief that multi-disciplinarity is the key to new achievements, with teams composed of researchers with different backgrounds and fields of specialization. With this aim, we focused this thesis in using machine learning, artificial intelligence, deep learing, all of them being understood as part of a whole concept we concrete in artificial intelligence, to try to shed light to some problems from the fields of mathematics and physics. A deep learning architecture was developed and successfully benchmarked with the characterization of anomalous diffusion processes. Whereas traditional statistical methods had previously been used with this aim, deep learing methods, mainly based on recurrent neural networks have proved to outperform these clasical methods. Our architecture showed it can precisely infer the anomalous diffusion exponent and accurately classify trajectories among a given set of underlaying diffusion models. While recurrent neural networks irrupted in the recent years, convolutional network based models had been extensively tested in the field of image processing for more than 15 years. There exist many models and architectures, pre-trained and set to be used by the community. No further investigation needs to be done since the architecture have proved their value for years and are very well documented in the literature. Our goal was being able to used this well-known and reliable models with anomalous diffusion trajectories. We only needed to be able to convert a time series into an image, which we successfully did by applying gramian angular fields to the trajectories, focusing on short ones. To our knowledge this is the first time these techniques were used in this field. We show how this approach outperforms any other proposal in the underlaying diffusion model classification for short trajectories. Besides physics it is maths. We used our recurrent neural networks architecture to infer the parameters that define the Wu Baleanu trajectories. We show that our proposal can precisely infer both the mu and nu parameters with a reasonable confidence. Being the first time, to the best of our knowledge, that such techniques were applied to this scenario. We extend this work to the discrete delayed fractional equations, obtaining similar results in terms of precision. Additionally, we showed that the same architecture can be used to discriminate delayed from non-delayed trajectories with a high confidence. Finally, we also searched fractional discrete models. We have considered Lubich's quadrature time-stepping schemes instead of the classical Euler scheme of order 1. As the first study with this new paradigm, we compare the bifurcation diagrams for the logistic and sine maps obtained from Euler discretizations of orders 1, 2, and 1/2., J.A.C. acknowledges support from ALBATROSS project (National Plan for Scientific and Technical Research and Innovation 2017-2020, No. PID2019-104978RB-I00). M.A.G.M. acknowledges funding from the Spanish Ministry of Education and Vocational Training (MEFP) through the Beatriz Galindo program 2018 (BEAGAL18/00203) and Spanish Ministry MINECO (FIDEUA PID2019- 106901GBI00/10.13039/501100011033). We thank M.A. Garc ́ıa-March for helpful comments and discussions on the topic. NF is sup- ported by the National University of Singapore through the Singapore International Graduate Student Award (SINGA) program. OGO and LS acknowledge funding from MINECO project, grant TIN2017-88476-C2-1-R. JAC acknowledges funding from grant PID2021-124618NB-C21 funded by MCIN/AEI/ 10.13039/501100011033 and by “ERDF A way of making Europe”, by the “European Union”. We also thank funding for the open access charges from CRUE-Universitat Politècnica de València.
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 Artículo científico (JournalArticle)

Spillover Algorithm: A decentralised coordination approach for multi-robot production planning in open shared factories

  • Lujak, Marin
  • Fernandez Gil, Alberto
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] Open and shared manufacturing factories typically dispose of a limited number of industrial robots and/or other production resources that should be properly allocated to tasks in time for an effective and efficient system performance. In particular, we deal with the dynamic capacitated production planning problem with sequence independent setup costs where quantities of products to manufacture need to be determined at consecutive periods within a given time horizon and products can be anticipated or back-ordered related to the demand period. We consider a decentralised multi-agent variant of this problem in an open factory setting with multiple owners of robots as well as different owners of the items to be produced, both considered self-interested and individually rational. Existing solution approaches to the classic constrained lot-sizing problem are centralised exact methods that require sharing of global knowledge of all the participants' private and sensitive information and are not applicable in the described multi-agent context. Therefore, we propose a computationally efficient decentralised approach based on the spillover effect that solves this NP-hard problem by distributing decisions in an intrinsically decentralised multi-agent system environment while protecting private and sensitive information. To the best of our knowledge, this is the first decentralised algorithm for the solution of the studied problem in intrinsically decentralised environments where production resources and/or products are owned by multiple stakeholders with possibly conflicting objectives. To show its efficiency, the performance of the Spillover Algorithm is benchmarked against state-of-the-art commercial solver CPLEX 12.8., This work has been partially supported by the "E-Logistics'' project funded by the French Agency for Environment and Energy Management (ADEME) and by the "AGRIFLEETS'' project ANR-20-CE10-0001 funded by the French National Research Agency (ANR) and by the STSM Grant funded by the European ICT COST Action IC1406, ``cHiPSeT'', and by the Spanish MINECO projects RTI2018-095390-BC33 (MCIU/AEI/FEDER, UE) and TIN2017-88476-C2-1-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Constraint-based Approach to Learn Temporal Features on Action Models from Multiple Plans

  • Garrido, Antonio|||0000-0002-8219-6777
[EN] Learning in AI planning tries to recognize past conducts to predict features that help improve action models. We propose a constraint programming approach for learning the temporal features, i.e., the distribution of conditions/effects and durations, of actions in an expressive temporal planning model with overlapping actions, which makes it suitable for knowledge-based multi-agent systems. We automatically build a purely declarative formulation that models time-stamps for durative actions, causal link relationships, threats and effect interferences from an arbitrary number of input plans: from just a unique single trace to many. We accommodate different degrees of input knowledge and support a different range of expressiveness, subsuming the PDDL2.1 temporal semantics. The formulation is simple but effective, and is not only valid for learning, but also for plan validation, as shown in its evaluation that returns high precision and accuracy values., This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Non-cooperative Game-Theoretic Approach for Conflict Resolution in Multi-agent Planning

  • Jordán, Jaume|||0000-0003-0400-9136
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
  • Torreño Lerma, Alejandro
  • de Weerdt, Mathijs
[EN] This paper presents FENOCOP, a game-theoretic approach for solving non-cooperative planning problems that involve a set of self-interested agents. Each agent wants to execute its own plan in a shared environment but the plans may be rendered infeasible by the appearance of potential conflicts; agents are willing to coordinate their plans in order to avoid conflicts during a joint execution. In order to attain a conflict-free combination of plans, agents must postpone the execution of some of their actions, which negatively affects their individual utilities. FENOCOP is a two-level game approach: the General Game selects a Nash equilibrium among several combinations of plans, and the Scheduling Game generates, for a combination of plans, an executable outcome by introducing delays in the agents¿ plans. For the Scheduling Game, we developed two algorithms that return a Pareto optimal and fair equilibrium from which no agent would be willing to deviate., This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R. Jaume Jordan is funded by grant APOSTD/2018/010 of Generalitat Valenciana - Fondo Social Europeo and by UPV PAID-06-18 project.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Learning action models with minimal observability

  • Aineto, Diego
  • Jiménez-Celorrio, Sergio|||0000-0003-0561-4880
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] This paper presents FAMA, a novel approach for learning STRIPS action models from observations of plan executions that compiles the learning task into a classical planning task. Unlike all existing learning systems, FAMA is able to learn when the actions of the plan executions are partially or totally unobservable and information on intermediate states is partially provided. This flexibility makes FAMA an ideal learning approach in domains where only sensoring data are accessible. Additionally, we leverage the compilation scheme and extend it to come up with an evaluation method that allows us to assess the quality of a learned model syntactically, that is, with respect to the actual model; and, semantically, that is, with respect to a set of observations of plan executions. We also show that the extended compilation scheme can be used to lay the foundations of a framework for action model comparison. FAMA is exhaustively evaluated over a wide range of IPC domains and its performance is compared to ARMS, a state-of-the-art benchmark in action model learning. (C) 2019 Elsevier B.V. All rights reserved., This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R. Diego Aineto is partially supported by the FPU16/03184 and Sergio Jimenez by the RYC15/18009, both programs funded by the Spanish government.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

FMAP: A platform for the development of distributed multi-agent planning systems

  • Torreño Lerma, Alejandro
  • Sapena Vercher, Oscar|||0000-0003-0533-5603
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] The development of cooperative Multi-Agent Planning (MAP) solvers in a distributed context encompasses the design and implementation of decentralized algorithms that make use of multi-agent communication protocols. In this paper, we present FMAP, a platform aimed at developing distributed MAP solvers such as MAP-POP, FMAP and MH-FMAP, among others. (C) 2018 Elsevier B.V. All rights reserved., This work is supported by the Spanish MINECO under projects TIN2014-55637-C2-2-R and TIN2017-88476-C2-1-R. The first author was funded by the Spanish SEPE.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Comprehensive Framework for Learning Declarative Action Models

  • Aineto, Diego
  • Jiménez-Celorrio, Sergio|||0000-0003-0561-4880
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] A declarative action model is a compact representation of the state transitions of dynamic systems that generalizes over world objects. The specification of declarative action models is often a complex hand-crafted task. In this paper we formulate declarative action models via state constraints, and present the learning of such models as a combinatorial search. The comprehensive framework presented here allows us to connect the learning of declarative action models to well-known problem solving tasks. In addition, our framework allows us to characterize the existing work in the literature according to four dimensions: (1) the target action models, in terms of the state transitions they define; (2) the available learning examples; (3) the functions used to guide the learning process, and to evaluate the quality of the learned action models; (4) the learning algorithm. Last, the paper lists relevant successful applications of the learning of declarative actions models and discusses some open challenges with the aim of encouraging future research work., This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R and partially supported by the EU ICT-48 2020 project TAILOR (No. 952215). 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 Artículo científico (JournalArticle)

Deliberative Context-Aware Ambient Intelligence System for Assisted Living Homes

  • Babli, Mohannad
  • Rincón-Arango, Jaime Andrés
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Julian, Vicente|||0000-0002-2743-6037
[EN] Monitoring wellbeing and stress is one of the problems covered by ambient intelligence, as stress is a significant cause of human illnesses directly affecting our emotional state. The primary aim was to propose a deliberation architecture for an ambient intelligence healthcare application. The architecture provides a plan for comforting stressed seniors suffering from negative emotions in an assisted living home and executes the plan considering the environment¿s dynamic nature. Literature was reviewed to identify the convergence between deliberation and ambient intelligence and the latter¿s latest healthcare trends. A deliberation function was designed to achieve context-aware dynamic human-robot interaction, perception, planning capabilities, reactivity, and context-awareness with regard to the environment. A number of experimental case studies in a simulated assisted living home scenario were conducted to demonstrate the approach¿s behavior and validity. The proposed methods were validated to show classification accuracy. The validation showed that the deliberation function has effectively achieved its deliberative objectives., This work is supported by the Spanish MINECO Project (No. TIN2017-88476-C2-1-R) and the Universitat Politecnica de Valencia Research (Grant No. PAID-10-19).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A unified constraint-based approach for plan and goal recognition from unreliable observations

  • Garrido, Antonio|||0000-0002-8219-6777
[EN] Given a sequence of observations over a plan execution, plan and goal recognition are considered as interchangeable tasks in AI planning. However, strictly speaking, the former tries to identify a plan, and the latter a set of goals, that explain the observations. Both recognition tasks are data-driven, where data comprises the plan observations, and are specially useful in proactive systems. Depending on the source of knowledge about the agents under observation, these tasks are traditionally solved by two different approaches, which require a large plan library or a planning model. In between these approaches, we propose a unified novel constraint-based approach, which distinguishes between the two tasks but is valid for both. We present a formulation, based on Partial Order Causal Link planning, that is compiled from a small plan library, to approximate a model that learns the essential causality of the original planning model. We deal with unreliable observations, which include missing and noisy observations on the real world. Modeling the observations in our formulation is straightforward. The use of the learned model allows us to address a data-driven optimization task to find the plans that most satisfy those observations (plan recognition) and the goals that are sufficiently supported by the causal relationships of the observations (goal recognition). We perform a complete evaluation of our approach in IPC domains under several indicators (accuracy, spread and ROC curves) with varying degrees of partial observability and noise on the observations. We also perform a comparison with other model-based approaches from literature., 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", and by the Spanish MINECO project TIN2017-88476-C2-1-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the Influence of Renewable Energy Sources in Electricity Price Forecasting in the Iberian Market

  • Aineto, Diego
  • Iranzo-Sánchez, Javier
  • Lemus Zúñiga, Lenin Guillermo|||0000-0002-6361-6019
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
  • Urchueguía Schölzel, Javier Fermín|||0000-0002-3054-3431
[EN] The mainstream of EU policies is heading towards the conversion of the nowadays electricity consumer into the future electricity prosumer (producer and consumer) in markets in which the production of electricity will be more local, renewable and economically efficient. One key component of a local short-term and medium-term planning tool to enable actors to efficiently interact in the electric pool markets is the ability to predict and decide on forecast prices. Given the progressively more important role of renewable production in local markets, we analyze the influence of renewable energy production on the electricity price in the Iberian market through historical records. The dependencies discovered in this analysis will serve to identify the forecasts to use as explanatory variables for an electricity price forecasting model based on recurrent neural networks. The results will show the wide impact of using forecasted renewable energy production in the price forecasting., This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R. D. Aineto is partially supported by the FPU16/03184.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A common framework for learning causality

  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
  • Jiménez-Celorrio, Sergio|||0000-0003-0561-4880
  • Aineto, Diego
[EN] Causality is a fundamental part of reasoning to model the physics of an application domain, to understand the behaviour of an agent or to identify the relationship between two entities. Causality occurs when an action is taken and may also occur when two happenings come undeniably together. The study of causal inference aims at uncovering causal dependencies among observed data and to come up with automated methods to find such dependencies. While there exist a broad range of principles and approaches involved in causal inference, in this position paper we argue that it is possible to unify different causality views under a common framework of symbolic learning., This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R. Diego Aineto is partially supported by the FPU16/03184 and Sergio Jimenez by the RYC15/18009, both programs funded by the Spanish government.
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 Artículo científico (JournalArticle)

BITOUR: A Business Intelligence Platform for Tourism Analysis

  • Bustamante, Alexander
  • Sebastiá Tarín, Laura|||0000-0001-8505-9471
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] Integrating collaborative data in data-driven Business Intelligence (BI) system brings an opportunity to foster the decision-making process towards improving tourism competitiveness. This article presents BITOUR, a BI platform that integrates four collaborative data sources (Twitter, Openstreetmap, Tripadvisor and Airbnb). BITOUR follows a classical BI architecture and provides functionalities for data transformation, data processing, data analysis and data visualization. At the core of the data processing, BITOUR offers mechanisms to identify tourists in Twitter, assign tweets to attractions and accommodation sites from Tripadvisor and Airbnb, analyze sentiments in opinions issued by tourists, and all this using geolocation objects in Openstreetmap. With all these ingredients, BITOUR enables data analysis and visualization to answer questions like the most frequented places by tourists, the average stay length or the view of visitors of some particular destination., This work has been supported by COLCIENCIAS through a PhD scholarship. This work is supported by the Spanish MINECO project TIN2017-88476-C2-1-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Learning temporal action models from multiple plans: A constraint satisfaction approach

  • Garrido, Antonio|||0000-0002-8219-6777
[EN] Learning, as a discovery task from past observations, is interesting in engineering contexts for identifying structures and improving accuracy. Learning in planning scenarios aims at recognizing past behavior to predict action models to improve decisions. This is appealing because practical scenarios are usually complex, sometimes difficult to be described formally, which require expert knowledge and engineering that becomes impractical in real-world applications. We introduce a Constraint Satisfaction formulation for learning PDDL2.1 temporal action models in planning. Given a collection of observations on multiple plans and a set of empty operators, we automatically create a learning task that identifies which conditions+effects are necessary, together with their temporal annotation, and induces durations and costs. Our formulation encapsulates planning (causal links, threats and effect interferences) and mutex (to avoid contradictions) constraints to be fully satisfied from the observed plans. The formulation is simple, but it proves very effective and easily adaptable to different levels of expressiveness. We evaluate such effectiveness in different IPC domains and compare the quality of the learning vs. other state-of-the-art learning approaches., This work is 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.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Gramian angular fields for leveraging pretrained computer vision models with anomalous diffusion trajectories

  • Garibo-i-Orts, Óscar
  • Firbas, Nicolás
  • Sebastiá Tarín, Laura|||0000-0001-8505-9471
  • Conejero, J. Alberto|||0000-0003-3681-7533
[EN] Anomalous diffusion is present at all scales, from atomic to large ones. Some exemplary systems are ultracold atoms, telomeres in the nucleus of cells, moisture transport in cement-based materials, arthropods' free movement, and birds' migration patterns. The characterization of the diffusion gives critical information about the dynamics of these systems and provides an interdisciplinary framework with which to study diffusive transport. Thus, the problem of identifying underlying diffusive regimes and inferring the anomalous diffu-sion exponent alpha with high confidence is critical to physics, chemistry, biology, and ecology. Classification and analysis of raw trajectories combining machine learning techniques with statistics extracted from them have widely been studied in the Anomalous Diffusion Challenge [Munoz-Gil et al. , Nat. Commun. 12 , 6253 (2021)]. Here we present a new data-driven method for working with diffusive trajectories. This method utilizes Gramian angular fields (GAF) to encode one-dimensional trajectories as images (Gramian matrices), while preserving their spatiotemporal structure for input to computer-vision models. This allows us to leverage two well-established pretrained computer-vision models, ResNet and MobileNet, to characterize the underlying diffusive regime and infer the anomalous diffusion exponent alpha. Short raw trajectories of lengths between 10 and 50 are commonly encountered in single-particle tracking experiments and are the most difficult ones to characterize. We show that GAF images can outperform the current state-of-the-art while increasing accessibility to machine learning methods in an applied setting., We thank M. A. Garcia-March for helpful comments and discussions on the topic. N.F. is supported by the National University of Singapore through the Singapore International Graduate Student Award (SINGA) program. O.G.O. and L.S. also acknolwedges support from European Comission, project EU ICT-48 2020 project TAILOR (No. 952215) funding from MINECO project, Grant No. TIN2017-88476-C2-1-R. J.A.C. acknowledges funding from Grant No. PID2021-124618NB-C21 funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe," by the "European Union."
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Computing programs for generalized planning using a classical planner

  • Segovia-Aguas, Javier
  • Jonsson, Anders
  • Jiménez-Celorrio, Sergio|||0000-0003-0561-4880
[EN] Generalized planning is the task of generating a single solution (a generalized plan) that is valid for multiple planning instances. In this paper we introduce a novel formalism for representing generalized plans that borrows two mechanisms from structured programming: control flow and procedure calls. On one hand, control flow structures allow to compactly represent generalized plans. On the other hand, procedure calls allow to represent hierarchical and recursive solutions as well as to reuse existing generalized plans. The paper also presents a compilation from generalized planning into classical planning which allows us to compute generalized plans with off-the-shelf planners. The compilation can incorporate prior knowledge in the form of auxiliary procedures which expands the applicability of the approach to more challenging tasks. Experiments show that a classical planner using our compilation can compute generalized plans that solve a wide range of generalized planning tasks, including sorting lists of variable size or DFS traversing variable-size binary trees. Additionally the paper presents an extension of the compilation for computing generalized plans when generalization requires a high-level state representation that is not provided a priori. This extension brings a new landscape of benchmarks to classical planning since classification tasks can naturally be modeled as generalized planning tasks, and hence, as classical planning tasks. Finally the paper shows that the compilation can be extended to compute control knowledge for off-the-shelf planners and solve planning instances that are difficult to solve without such additional knowledge., Anders Jonsson is partially supported by the grants TIN2015-67959 and PCIN-2017-082 of the Spanish Ministry of Science. Sergio Jimenez is partially supported by the grants, RYC-2015-18009 and TIN2017-88476-C2-1-R of the Spanish Ministry of Science.
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.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Computing programs for generalized planning using a classical planner

  • Segovia-Aguas, Javier
  • Jiménez, Sergio
  • Jonsson, Anders
Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). This paper adapts the 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 program-based solution space for GP that is independent of the number of planning instances in a GP problem, and the size of these instances. Second, the paper defines the BFGP algorithm for GP, that implements a best-first search in our programbased solution space, and that is guided by different evaluation and heuristic functions.