Skip to main content

GESTION DE METAS PARA AUTONOMIA A LARGO PLAZO EN CIUDADES INTELIGENTES

TIN2014-55637-C2-2-R

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos I+D+i Retos de Investigación
Call year 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication 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
Publication Artículo científico (JournalArticle)

Defeasible-argumentation-based multi-agent planning

  • Pajares Ferrando, Sergio
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] This paper presents a planning system that uses defeasible argumentation to reason about context information during the construction of a plan. The system is designed to operate in cooperative multi-agent environments where agents are endowed with planning and argumentation capabilities. Planning allows agents to contribute with actions to the construction of the plan, and argumentation is the mechanism that agents use to defend or attack the planning choices according to their beliefs. We present the formalization of the model and we provide a novel specification of the qualification problem. The multi-agent planning system, which is designed to be domain-independent, is evaluated with two planning tasks from the problem suites of the International Planning Competition. We compare our system with a non-argumentative planning framework and with a different approach of planning and argumentation. The results will show that our system obtains less costly and more robust solution plans., This work has been partly supported by the Spanish MINECO under project TIN2014-55637-C2-2-R and the Valencian project PROMETEO II/2013/019.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Parallel heuristic search in forward partial-order planning

  • Sapena Vercher, Oscar|||0000-0003-0533-5603
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
  • Torreño Lerma, Alejandro
[EN] Most of the current top-performing planners are sequential planners that only handle total-order plans. Although this is a computationally efficient approach, the management of total-order plans restrict the choices of reasoning and thus the generation of flexible plans. In this paper, we present FLAP2, a forward-chaining planner that follows the principles of the classical POCL (Partial-Order Causal-Link Planning) paradigm. Working with partial-order plans allows FLAP2 to easily manage the parallelism of the plans, which brings several advantages: more flexible executions, shorter plan durations (makespan) and an easy adaptation to support new features like temporal or multi-agent planning. However, one of the limitations of POCL planners is that they require far more computational effort to deal with the interactions that arise among actions. FLAP2 minimizes this overhead by applying several techniques that improve its performance: the combination of different state-based heuristics and the use of parallel processes to diversify the search in different directions when a plateau is found. To evaluate the performance of FLAP2, we have made a comparison with four state-of-the-art planners: SGPlan, YAHSP2, Temporal Fast Downward and OPTIC. Experimental results show that FLAP2 presents a very acceptable trade-off between time and quality and a high coverage on the current planning benchmarks., This work has been partially supported by the Spanish MINECO project TIN2014-55637-C2-2-R and cofounded by FEDER.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On the use of case-based planning for e-learning personalization

  • Garrido, Antonio|||0000-0002-8219-6777
  • Morales, Lluvia
  • Serina, Iván
In this paper we propose myPTutor, a general and effective approach which uses AI planning techniques to create fully tailored learning routes, as sequences of Learning Objects (LOs) that fit the pedagogical and students’ requirements. myPTutor has a potential applicability to support e-learning personalization by producing, and automatically solving, a planning model from (and to) e-learning standards in a vast number of real scenarios, from small to medium/large e-learning communities. Our experiments demonstrate that we can solve scenarios with large courses and a high number of students. Therefore, it is perfectly valid for schools, high schools and universities, especially if they already use Moodle, on top of which we have implemented myPTutor. It is also of practical significance for repairing unexpected discrepancies (while the students are executing their learning routes) by using a Case-Based Planning adaptation process that reduces the differences between the original and the new route, thus enhancing the learning process. © 2016 Elsevier Ltd. All rights reserved., This work has been partially funded by the Consolider AT project CSD2007-0022 INGENIO 2010 of the Spanish Ministry of Science and Innovation, the MICINN project TIN2011-27652-C03-01, the MINECO and FEDER project TIN2014-55637-C2-2-R, the Mexican National Council of Science and Technology, the Valencian Prometeo project II/2013/019 and the BW5053 research project of the Free University of Bozen-Bolzano.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication 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
Publication Artículo científico (JournalArticle)

Reactive execution for solving plan failures in planning control applications

  • Gúzman Álvarez, César Augusto
  • Castejón Navarro, Pablo
  • Frank, Jeremy
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
We present a novel reactive execution model for planning control applications which repairs plan failures at runtime. Our proposal is a domain-independent regression planning model which provides good-quality responses in a timely fashion. The use of a regressed model allows us to work exclusively with the sufficient and necessary information to deal with the plan failure. The model performs a time-bounded process that continuously operate on the plan to recover from incoming failures. This process guarantees there always exists a plan repair for a plan failure at anytime. The model is tested on a simulation of a real-world planetary space mission and on a well-known vehicle routing problem., This work has been partly supported by the Spanish MICINN under the projects TIN2014-55637-C2-2-R, and the Valencian project PROMETEOII/2013/019.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Temporal landmark graphs for solving overconstrained planning problems

  • Marzal Calatayud, Eliseo Jorge|||0000-0003-0658-1953
  • Sebastiá Tarín, Laura|||0000-0001-8505-9471
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
This paper presents TempLM, a novel approach for handling temporal planning problems with deadlines. The proposal revolves around the concept of temporal landmark, a proposition that must be necessarily true in all solution plans to achieve the problem goals within their deadlines. The temporal landmarks extracted from the problem form a landmarks graph where nodes are landmarks and edges represent temporal as well as causal relationships between landmarks. The graph comprises information about which propositions and when these propositions must be achieved in a solution plan, information that is later used to guide the search process as well as reduce the search space. Thus, the partial plans of the search tree that are not compliant with the information comprised in this graph are pruned. We present an exhaustive experimentation evaluation in overconstrained and unsolvable problems and we compare the performance of TempLM with other state-of-the-art planners. The results will show the efficiency of TempLM in the detection of unsolvable problems. (C) 2016 Elsevier B.V. All rights reserved:, We thank Derek Long for solving our doubts about the modal operators in PDDL3 and Erez Karpas for supplying the compiled domain and problem files with their temporal landmarks. This work has been partially supported by Spanish Government Project MINECO TIN2014-55637-C2-2-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A Better-response Strategy for Self-interested Planning Agents

  • Jordán, Jaume|||0000-0003-0400-9136
  • Torreño Lerma, Alejandro
  • de Weerdt, M.
  • Onaindia De La Rivaherrera, Eva
[EN] When self-interested agents plan individually, interactions that prevent them from executing their actions as planned may arise. In these coordination problems, game-theoretic planning can be used to enhance the agents¿ strategic behavior considering the interactions as part of the agents¿ utility. In this work, we define a general-sum game in which interactions such as conflicts and congestions are reflected in the agents¿ utility. We propose a better-response planning strategy that guarantees convergence to an equilibrium joint plan by imposing a tax to agents involved in conflicts. We apply our approach to a real-world problem in which agents are Electric Autonomous Vehicles (EAVs). The EAVs intend to find a joint plan that ensures their individual goals are achievable in a transportation scenario where congestion and conflicting situations may arise. Although the task is computationally hard, as we theoretically prove, the experimental results show that our approach outperforms similar approaches in both performance and solution quality., This work is supported by the GLASS project TIN2014-55637-C2-2-R of the Spanish MINECO and the Prometeo project II/2013/019 funded by the Valencian Government.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Cooperative Multi-Agent Planning: A survey

  • Torreño Lerma, Alejandro
  • Komenda, Antonín
  • tolba, Michal
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
[EN] Cooperative multi-agent planning (MAP) is a relatively recent research field that combines technologies, algorithms, and techniques developed by the Artificial Intelligence Planning and Multi-Agent Systems communities. While planning has been generally treated as a single-agent task, MAP generalizes this concept by considering multiple intelligent agents that work cooperatively to develop a course of action that satisfies the goals of the group. This article reviews the most relevant approaches to MAP, putting the focus on the solvers that took part in the 2015 Competition of Distributed and Multi-Agent Planning, and classifies them according to their key features and relative performance., This work is supported by the GLASS project Grant No. TIN2014-55637-C2-2-R MINECO of the Spanish Ministerio de Economia, Industria y Competitividad, the Prometeo project II/2013/019 funded by the Valencian Government, and the four-year FPI-UPV research scholarship granted to the first author by the Universitat Politecnica de Valencia. Additionally, this research was partially supported by the Czech Science Foundation under Grant No. 15-20433Y CSF.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Personalized conciliation of clinical guidelines for comorbid patients through multi-agent planning

  • Fernández-Olivares, Juan
  • Castillo Vidal, Luis
  • Cózar, Juan
  • Onaindia De La Rivaherrera, Eva|||0000-0001-6931-8293
  • Jordán, Jaume|||0000-0003-0400-9136
[EN] The conciliation of multiple single-disease guidelines for comorbid patients entails solving potential clinical interactions, discovering synergies in the diagnosis and the recommendations, and managing clinical equipoise situations. Personalized conciliation of multiple guidelines considering additionally patient preferences brings some further difficulties. Recently, several works have explored distinct techniques to come up with an automated process for the conciliation of clinical guidelines for comorbid patients but very little attention has been put in integrating the patient preferences into this process. In this work, a Multi-Agent Planning (MAP) framework that extends previous work on single-disease temporal Hierarchical Task Networks (HTN) is proposed for the automated conciliation of clinical guidelines with patient-centered preferences. Each agent encapsulates a single-disease Computer Interpretable Guideline (CIG) formalized as an HTN domain and conciliates the decision procedures that encode the clinical recommendations of its CIG with the decision procedures of the other agents' CIGs. During conciliation, drug-related interactions, scheduling constraints as well as redundant actions and multiple support interactions are solved by an automated planning process. Moreover, the simultaneous application of the patient preferences in multiple diseases may potentially bring about contradictory clinical decisions and more interactions. As a final step, the most adequate personalized treatment plan according to the patient preferences is selected by a Multi-Criteria Decision Making (MCDM) process. The MAP approach is tested on a case study that builds upon a simplified representation of two real clinical guidelines for Diabetes Mellitus and Arterial Hypertension., This work has been partially supported by Spanish Government Projects MINECO TIN2014-55637-C2-2-R and TIN2015-71618-R.