• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 2
  • 2
  • 1
  • Tagged with
  • 8
  • 8
  • 8
  • 7
  • 5
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Raffinement des intentions / Refinement of Intentions

Xiao, Zhanhao 12 December 2017 (has links)
Le résumé en français n'a pas été communiqué par l'auteur. / Le résumé en anglais n'a pas été communiqué par l'auteur.
2

Artificiell intelligens : Prestanda hos beteendeträd och Hierarchical Task Network / Artificial intelligence : Performance of behavior trees and Hierarchical Task Network.

Juvél, Joel January 2014 (has links)
Detta arbete undersöker skillnader i tidseffektivitet mellan beteendeträd ochHierarchical Task Network. En enklare spelprototyp av typen top-down 2D shoot-emup implementerades. Spelprototypen använder två typer av autonom motspelare så kallade botar. En bot för beteendeträd och en bot för Hierarchical Task Network. Spelprototypen mäter körtiden för varje typ av bot i sex olika situationer. Varje situation svarar mot ett bestämt beteende hos boten. Ett beteende kan brytas ned i en samling uppgifter som boten kan utföra. Spelprototypen mäter körtiden för att bestämma ett enskilt beteende i en specifik situation. Resultaten från mätningarna tyder på att beteendeträd har bättre tidseffektivitet än Hierarchical Task Network.
3

Využití evolučních technik v hierarchickém plánování / Evolutionary techniques utilization in hierarchical task network

Řeháková, Lucie January 2016 (has links)
This master thesis describes the design and the implementation of the algorithm solving the domain- independent partial order simple task network planning problem using the tree-based genetic programming. The work contains comparison of several possible approaches to the problem --- it compares different representations, ways of evaluation and approaches to the partial ordering. It defines heuristics to improve the efficiency of the algorithm, including the distance heuristic, the local search and the individual equivalency. The implementation was tested on several experiments to show the abilities, strengths and weaknesses of the algorithm. Powered by TCPDF (www.tcpdf.org)
4

Customizing the Composition of Web Services and Beyond

Sohrabi Araghi, Shirin 16 December 2013 (has links)
Web services provide a standardized means of publishing diverse, distributed applications. Increasingly, corporations are providing services or programs within and between organizations either on corporate intranets or on the cloud. Many of these services can be composed together, ideally automatically, to provide value-added service. Automated Web service composition is an example of such automation where given a specification of an objective to be realized and some knowledge of the state of the world, the problem is to automatically select, integrate, and invoke multiple services to achieve the specified objective. A popular approach to the Web service composition problem is to conceive it as an Artificial Intelligence planning task. This enables us to bring to bear many of the theoretical and computational advances in reasoning about actions to the task of Web service composition. However, Web service composition goes far beyond the reaches of classical planning, presenting a number of interesting challenges relevant to a large body of problems related to the composition of actions, programs, and services. Among these, an important challenge is generating not only a composition, but a high-quality composition tailored to user preferences. In this thesis, we present an approach to the Web service composition problem with a particular focus on the customization of compositions. We claim that there is a correspondence between generating a customized composition of Web services and non-classical Artificial Intelligence planning where the objective of the planning problem is specified as a form of control knowledge, such as a workflow or template, together with a set of constraints to be optimized or enforced. We further claim that techniques in (preference-based) planning can provide a computational basis for the development of effective, state-of-the-art techniques for generating customized compositions of Web services. To evaluate our claim, we characterize the Web service composition problem with customization as a non-classical planning problem, exploit and advance preference specification languages and preference-based planning, develop algorithms tailored to the Web service composition problem, prove formal properties of these algorithms, implement proof-of-concept systems, and evaluate these systems experimentally. While our research has been motivated by Web services, the theory and techniques we have developed are amenable to analogous problems in such diverse sectors as multi-agent systems, business process modeling, component software composition, and social and computational behaviour modeling and verification.
5

Customizing the Composition of Web Services and Beyond

Sohrabi Araghi, Shirin 16 December 2013 (has links)
Web services provide a standardized means of publishing diverse, distributed applications. Increasingly, corporations are providing services or programs within and between organizations either on corporate intranets or on the cloud. Many of these services can be composed together, ideally automatically, to provide value-added service. Automated Web service composition is an example of such automation where given a specification of an objective to be realized and some knowledge of the state of the world, the problem is to automatically select, integrate, and invoke multiple services to achieve the specified objective. A popular approach to the Web service composition problem is to conceive it as an Artificial Intelligence planning task. This enables us to bring to bear many of the theoretical and computational advances in reasoning about actions to the task of Web service composition. However, Web service composition goes far beyond the reaches of classical planning, presenting a number of interesting challenges relevant to a large body of problems related to the composition of actions, programs, and services. Among these, an important challenge is generating not only a composition, but a high-quality composition tailored to user preferences. In this thesis, we present an approach to the Web service composition problem with a particular focus on the customization of compositions. We claim that there is a correspondence between generating a customized composition of Web services and non-classical Artificial Intelligence planning where the objective of the planning problem is specified as a form of control knowledge, such as a workflow or template, together with a set of constraints to be optimized or enforced. We further claim that techniques in (preference-based) planning can provide a computational basis for the development of effective, state-of-the-art techniques for generating customized compositions of Web services. To evaluate our claim, we characterize the Web service composition problem with customization as a non-classical planning problem, exploit and advance preference specification languages and preference-based planning, develop algorithms tailored to the Web service composition problem, prove formal properties of these algorithms, implement proof-of-concept systems, and evaluate these systems experimentally. While our research has been motivated by Web services, the theory and techniques we have developed are amenable to analogous problems in such diverse sectors as multi-agent systems, business process modeling, component software composition, and social and computational behaviour modeling and verification.
6

A decentralised online multi-agent planning framework for multi-agent systems

Cardoso, Rafael Cau? 27 March 2018 (has links)
Submitted by PPG Ci?ncia da Computa??o (ppgcc@pucrs.br) on 2018-05-08T18:37:11Z No. of bitstreams: 1 RAFAEL_CAU?_CARDOSO_TES.pdf: 14431785 bytes, checksum: 227194ed28a9e55c3ab1fbedebf06922 (MD5) / Approved for entry into archive by Caroline Xavier (caroline.xavier@pucrs.br) on 2018-05-15T19:07:36Z (GMT) No. of bitstreams: 1 RAFAEL_CAU?_CARDOSO_TES.pdf: 14431785 bytes, checksum: 227194ed28a9e55c3ab1fbedebf06922 (MD5) / Made available in DSpace on 2018-05-15T19:14:18Z (GMT). No. of bitstreams: 1 RAFAEL_CAU?_CARDOSO_TES.pdf: 14431785 bytes, checksum: 227194ed28a9e55c3ab1fbedebf06922 (MD5) Previous issue date: 2018-03-27 / Sistemas multiagentes freq?entemente cont?m ambientes complexos e din?micos, nos quais os planos dos agentes podem falhar a qualquer momento durante a execu??o do sistema. Al?m disso, novos objetivos podem aparecer para os quais n?o existem nenhum plano dispon?vel. T?cnicas de planejamento s?o bem adequadas para lidar com esses problemas. H? uma quantidade extensa de pesquisa em planejamento centralizado para um ?nico agente, por?m, at? ent?o planejamento multiagente n?o foi completamente explorado na pr?tica. Plataformas multiagentes tipicamente proporcionam diversos mecanismos para coordena??o em tempo de execu??o, frequentemente necess?rios em planejamento online. Neste contexto, planejamento multiagente descentralizado pode ser eficiente e eficaz, especialmente em dom?nios fracamente acoplados, al?m de garantir algumas propriedades importantes em sistemas de agentes como privacidade e autonomia. N?s abordamos esse problema ao apresentar uma t?cnica para planejamento multiagente online que combina aloca??o de objetivos, planejamento individual utilizando rede de tarefas hier?rquicas (HTN), e coordena??o em tempo de execu??o para apoiar a realiza??o de objetivos sociais em sistemas multiagentes. Especificamente, n?s apresentamos um framework chamado Decentralised Online Multi-Agent Planning (DOMAP). Experimentos com tr?s dom?nios fracamente acoplados demonstram que DOMAP supera quatro planejadores multiagente do estado da arte com respeito a tempo de planejamento e tempo de execu??o, particularmente nos problemas mais dif?ceis. / Multi-agent systems often contain dynamic and complex environments where agents? course of action (plans) can fail at any moment during execution of the system. Furthermore, new goals can emerge for which there are no known plan available in any of the agents? plan library. Automated planning techniques are well suited to tackle both of these issues. Extensive research has been done in centralised planning for singleagents, however, so far multi-agent planning has not been fully explored in practice. Multi-agent platforms typically provide various mechanisms for runtime coordination, which are often required in online planning (i.e., planning during runtime). In this context, decentralised multi-agent planning can be efficient as well as effective, especially in loosely-coupled domains, besides also ensuring important properties in agent systems such as privacy and autonomy. We address this issue by putting forward an approach to online multi-agent planning that combines goal allocation, individual Hierarchical Task Network (HTN) planning, and coordination during runtime in order to support the achievement of social goals in multi-agent systems. In particular, we present a planning and execution framework called Decentralised Online Multi-Agent Planning (DOMAP). Experiments with three loosely-coupled planning domains show that DOMAP outperforms four other state-of-the-art multi agent planners with regards to both planning and execution time, particularly in the most difficult problems.
7

Planejamento instrucional automatizado em aprendizagem colaborativa com suporte computacional utilizando planejamento hierárquico / Automated instructional design in computer-supported collaborative learning using hierarchical planning

Challco, Geiser Chalco 11 September 2012 (has links)
Em Aprendizagem Colaborativa com Suporte Computacional (ACSC), o planejamento instrucional consiste em obter uma sequência de interações instrucionais que definem o conteúdo instrucional como a representação do que deve ser ensinado e da forma em que os participantes devem interagir, denominada informação de planejamento instrucional. O desenvolvimento, adaptação e personalização de unidades concisas de estudo compostas por recursos instrucionais e informação de planejamento instrucional, denominadas unidades de aprendizagem, envolve um processo de planejamento instrucional complexo que consome muito tempo e apresenta um conjunto de tarefas repetitivas a serem efetuadas pelos projetistas instrucionais. Neste trabalho, o planejamento instrucional em ACSC é modelado como um problema de planejamento hierárquico para dar suporte ao desenvolvimento, adaptação e personalização das unidades de aprendizagem de forma automática. A modelagem consiste na representação do domínio a ser ensinado, das caraterísticas dos estudantes e das estratégias de planejamento instrucional na linguagem do sistema JSHOP2ip, um sistema de planejamento hierárquico desenvolvido para dar solução aos problemas específicos de planejamento instrucional. Para avaliar a modelagem proposta, efetuamos o desenvolvimento de um gerador de cursos colaborativos como um serviço Web usando a modelagem proposta e o sistema JSHOP2ip, no qual foram avaliados o desempenho, a modelagem das estratégias e a saída do planejador. Além disso, para demonstrar a viabilidade do modelo proposto em situações reais, efetuamos o desenvolvimento de uma ferramenta de autoria de unidades de aprendizagem que emprega o gerador de cursos colaborativos. / In Computer Supported Collaborative Learning (CSCL), the goal of instructional design is to obtain a instructional interaction sequence that define the instructional content as a representation of what should be taught and the way in which participants must interact, called instructional planning information. The development, adaptation and personalization of basic units of study comprised of the instructional resources and instructional planning information, called units of learning, that involves a complex instructional planning process, time consuming and repetitive. In this work, the instructional design in CSCL is modeled as hierarchical planning problem to support the development, adaptation and personalization for units of learning. The modeling is the representation of the domain to be taught, the characteristics of students and instructional strategies in JSHOP2ip, an independent hierarchical planning system designed to solve problems of instructional design. To evaluate the proposed model, we developed a collaborative course generator as a Web service using the proposed model and JSHOP2ip system, upon which we evaluated the performance, modeling strategies and the output scheduler. Furthermore, to demonstrate the feasibility of the proposed model in real situations, we developed an authoring tool for units of learning employing the collaborative course generator
8

Planejamento instrucional automatizado em aprendizagem colaborativa com suporte computacional utilizando planejamento hierárquico / Automated instructional design in computer-supported collaborative learning using hierarchical planning

Geiser Chalco Challco 11 September 2012 (has links)
Em Aprendizagem Colaborativa com Suporte Computacional (ACSC), o planejamento instrucional consiste em obter uma sequência de interações instrucionais que definem o conteúdo instrucional como a representação do que deve ser ensinado e da forma em que os participantes devem interagir, denominada informação de planejamento instrucional. O desenvolvimento, adaptação e personalização de unidades concisas de estudo compostas por recursos instrucionais e informação de planejamento instrucional, denominadas unidades de aprendizagem, envolve um processo de planejamento instrucional complexo que consome muito tempo e apresenta um conjunto de tarefas repetitivas a serem efetuadas pelos projetistas instrucionais. Neste trabalho, o planejamento instrucional em ACSC é modelado como um problema de planejamento hierárquico para dar suporte ao desenvolvimento, adaptação e personalização das unidades de aprendizagem de forma automática. A modelagem consiste na representação do domínio a ser ensinado, das caraterísticas dos estudantes e das estratégias de planejamento instrucional na linguagem do sistema JSHOP2ip, um sistema de planejamento hierárquico desenvolvido para dar solução aos problemas específicos de planejamento instrucional. Para avaliar a modelagem proposta, efetuamos o desenvolvimento de um gerador de cursos colaborativos como um serviço Web usando a modelagem proposta e o sistema JSHOP2ip, no qual foram avaliados o desempenho, a modelagem das estratégias e a saída do planejador. Além disso, para demonstrar a viabilidade do modelo proposto em situações reais, efetuamos o desenvolvimento de uma ferramenta de autoria de unidades de aprendizagem que emprega o gerador de cursos colaborativos. / In Computer Supported Collaborative Learning (CSCL), the goal of instructional design is to obtain a instructional interaction sequence that define the instructional content as a representation of what should be taught and the way in which participants must interact, called instructional planning information. The development, adaptation and personalization of basic units of study comprised of the instructional resources and instructional planning information, called units of learning, that involves a complex instructional planning process, time consuming and repetitive. In this work, the instructional design in CSCL is modeled as hierarchical planning problem to support the development, adaptation and personalization for units of learning. The modeling is the representation of the domain to be taught, the characteristics of students and instructional strategies in JSHOP2ip, an independent hierarchical planning system designed to solve problems of instructional design. To evaluate the proposed model, we developed a collaborative course generator as a Web service using the proposed model and JSHOP2ip system, upon which we evaluated the performance, modeling strategies and the output scheduler. Furthermore, to demonstrate the feasibility of the proposed model in real situations, we developed an authoring tool for units of learning employing the collaborative course generator

Page generated in 0.0886 seconds