Teses

A jogabilidade dos jogos de estratégia em tempo real (RTS) parece estar confinada a um padrão onde a micro gestão económica é tão importante, senão mais, como a estratégia de combate. Nem todos os jogos seguem esta tendência, tornando-se alguns bem sucedidos por oferecerem exactamente o contrário: jogabilidade focada em estratégia. Contudo, esta jogabilidade é normalmente conseguida removendo aspectos característicos do género, como a recolha de recursos ou a criação de infra-estruturas e unidades, permitindo o jogador focar-se na estratégia de combate. Uma possível maneira de criar jogos RTS focados em estratégia sem o sacrifício destes aspectos característicos é automatizando as tarefas repetitivas e consumidoras de tempo. O jogador manterá o controlo total mas precisará de menos tempo para executar as tarefas. Neste trabalho apresentamos um primeiro passo para esta solução: um sistema para o planeamento de produção de unidades, o qual acreditamos possibilitar a exploração de novos paradigmas de jogabilidade. Para ser aceite pelo jogador o sistema deve, entre outras coisas, ser eficiente e robusto, o que não é trivial considerando o ambiente altamente dinâmico característico deste género de jogos. Para superar o desafio, propomos um sistema inspirado na inteligência colectiva demonstrada pelos insectos sociais, mais concretamente vespas. Da avaliação efectuada neste trabalho verificou-se que a solução proposta atingiu resultados muito satisfatórios em comparação com o algoritmo global centralizado. Apesar de possuir limitações em certas situações, identificámos as condições que possibilitam o seu melhor desempenho, recomendando o seu uso para problemas em que estas sejam observadas.

With the increasing of computers in the daily life of everyone highlights the relationships we develop with them and the importance of these relationships. In order to provide synthetic characters with relationships, it is important to use the psycho-sociological background of the human relationships and strategies used by humans to create and manage those relationships. We have developed a model of relationships that uses the processes involved in these relationships in several dimensions. For this purpose we have based our research in both computational systems that include relationships and in theoretical theories of the psycho-sociology of human relationships. In this way, our model was constructed according to the three main concepts identified in our research: stages: fixed set of levels that different relationships go through; filters: sequence of decisions where we make a choice to maintain or exclude someone from the relationship; strategies: the evolution of a relationship is not a static process but a consequence of interactions by someone and the perception and validation of that interaction by the other relationship partner. As a way to validate and test our model, we have introduced the intimacy relationship and conducted an experiment with eight users where they interacted with a prototype of a game where they to develop a relationship with one character. The evaluation of the experiment results showed that, from all the test conditions, the one that included our model presented the better results, for all the three variables of measure, in the relationship establishment.

In this document, we present a videogame that adapts its content to the player. Such a game needs to infer the player's type from his behavior, and then select how content is managed and presented to the player based on that type. In this work we focus on the later aspect, assuming we already know the player type. We also propose how such information can be used to enhance the player?s experience. After revising the literature on the subject, we decided to use the Demographic Game Design (DGD) model as our player model. Therefore, before playing our game, the player has to fill a questionnaire to assess his Myer-Briggs personality type. From this questionnaire, the game classifies the player according to the DGD model. The game is then adjusted according to this player type, which will influence how the information of the game is presented to the player, in three main aspects: presentation, difficulty management and depth of control over aspects of the game. To evaluate our approach, we asked different types of players to play our game under different conditions and evaluated the experience using a final questionnaire based on the GameFlow model. The evaluation suggests that the player enjoyment is higher when the game is using our framework to adapt to the player.

The objective of this thesis was to create a model for agent memory retrieval of emotionally relevant episodes. Additionally we wished to assess if including such a system in an architecture would improve the agents' believability. We reviewed some core concepts concerning human memory, appraisal theories and believability. Then we analyzed agent architectures that support memory and emotions, realizing that none fulfilled all our requirements for memory retrieval. We proceeded by describing our retrieval model consisting of two main steps: "ecphory", in which the perceived stimuli (retrieval cues) are matched with memories; and "recollective experience" that re-appraises memories that had a positive match. We proposed a location ecphory approximation, in which locations serve as indirect retrieval cues. We described how we implemented our model and used it to drive the behavior of characters in a game application. We implemented the location ecphory approximation, and the recollective experience consisting of a reactive appraisal module with reaction rules for events generated by the former. We recorded the application running and used the videos to create a non-interactive evaluation. The evaluation's structure was a between-groups pre-test/post-test one with two control groups, and we had 96 participants. The evaluation's results are consistent with our hypothesis that agents modeled by our architecture would be perceived as more believable than agents modeled in similar architectures without episodic retrieval.