Dissertação de Mestrado em Sistemas Multiagentes

Contato

Publicado em: 25/11/2013

UNIVERSIDADE FEDERAL DO RIO GRANDE DO SUL

INSTITUTO DE INFORMÁTICA

PROGRAMA DE PÓS-GRADUAÇÃO EM COMPUTAÇÃO

———————————————————

DEFESA DE DISSERTAÇÃO DE MESTRADO

Aluno: Vinicius de Antoni

Orientador: Prof. Dr. Álvaro Freitas Moreira

Título: An asynchronous Algorithm to Improve Scheduling Quality in the Multiagent Simple Temporal Problem

Linha de Pesquisa: Inteligência Artificial e Sistemas Multiagentes

Data: 29/11/2013

Hora: 13h30min

Local: 43412 – Sala 215 – Instituto de Informática

Banca Examinadora:

Prof. Dr. Marcus Rolf Peter Ritt (UFRGS)

Prof. Dr. Luís da Cunha Lamb (UFRGS)

Prof. Dr. Felipe Rech Meneguzzi (PUCRS)

Presidente da Banca: Prof. Dr. Álvaro Freitas Moreira

Resumo:

In order to schedule an activity that depends on other people, we very often end up wasting precious time trying to find compatible times and evaluating if they are accepted by all involved. Even though modeling and solving multiagent scheduling problems seem completely understood and several algorithms can be found in the literature, one limitation still stands up: How to find a compatible time slot for an activity shared by many users without requiring the users themselves to spend time going through their calendar and choosing time slots until everybody agrees. The main contribution of this work is an algorithm called Asynchronous Time Finder (ATF) based on the Asynchronous Backtracking (ABT) that enables applications to find compatible times when scheduling shared activities among several users while requiring minimal user interaction.This dissertation starts by revisiting the Simple Temporal Problem (STP) and its multiagent version (MaSTP), it then shows how they can be used to solve the problem of managing agendas and then finally it presents the algorithm giving an experimental evaluation and the analysis of its complexity.

Palavras-chave: Multiagent Systems, Simple Temporal Problem.

UNIVERSIDADE FEDERAL DO RIO GRANDE DO SUL
INSTITUTO DE INFORMÁTICA
PROGRAMA DE PÓS-GRADUAÇÃO EM COMPUTAÇÃO
———————————————————
DEFESA DE DISSERTAÇÃO DE MESTRADO

Aluno: Vinicius de Antoni
Orientador: Prof. Dr. Álvaro Freitas Moreira
Título: An asynchronous Algorithm to Improve Scheduling Quality in the Multiagent Simple Temporal Problem Linha de Pesquisa: Inteligência Artificial e Sistemas Multiagentes

Data: 29/11/2013
Hora: 13h30min
Local: 43412 – Sala 215 – Instituto de Informática

Banca Examinadora:
Prof. Dr. Marcus Rolf Peter Ritt (UFRGS)
Prof. Dr. Luís da Cunha Lamb (UFRGS)
Prof. Dr. Felipe Rech Meneguzzi (PUCRS)

Presidente da Banca: Prof. Dr. Álvaro Freitas Moreira

Resumo:In order to schedule an activity that depends on other people, we very often end up wasting precious time trying to find compatible times and evaluating if they are accepted by all involved. Even though modeling and solving multiagent scheduling problems seem completely understood and several algorithms can be found in the literature, one limitation still stands up: How to find a compatible time slot for an activity shared by many users without requiring the users themselves to spend time going through their calendar and choosing time slots until everybody agrees. The main contribution of this work is an algorithm called Asynchronous Time Finder (ATF) based on the Asynchronous Backtracking (ABT) that enables applications to find compatible times when scheduling shared activities among several users while requiring minimal user interaction.This dissertation starts by revisiting the Simple Temporal Problem (STP) and its multiagent version (MaSTP), it then shows how they can be used to solve the problem of managing agendas and then finally it presents the algorithm giving an experimental evaluation and the analysis of its complexity.
Palavras-chave: Multiagent Systems, Simple Temporal Problem.