Modeling or simulating Complex Adaptive Systems (CASs) is both important and challenging. As the name suggests, CASs are systems consisting of large numbers of interacting adaptive compartments. They are studied across a wide range of disciplines and have unique properties. They model such systems as multicellular organisms, ecosystems, social networks, and many more. They are complex, in the sense that they are dynamical, nonlinear, and heterogeneous systems that cannot be simply scaled up/down. However, they are self-organized, in the sense that they can evolve into specific structures/patterns without guidance from outside sources. Modeling/Simulating CASs is challenging, not only because of the high complexity, but also because of the difficulty in explaining the underlying mechanism behind self-organization. The goal of this research is to provide a modeling framework as well as a simulation platform to advance the study of CASs. We argue that there are common principles behind self-organization processes of different systems across different domains. We explore, analyze, and perform experiments into these principles. We propose and implement modeling templates such as short-term and long-term adaptivity. We incorporate techniques from systems theory, employing computing paradigms, including multi-agent system and asynchronous message passing. We also consider an application from the biological domain to model and simulate under our framework, treating it as a CAS for validation purposes. / Ph. D.

The air transportation system has grown significantly during the past few decades. The demand for air travel has increased tremendously as compared to the increase in the supply. The air transportation system can be divided into four subsystems: airports, airlines, air traffic control, and passengers, each of them having different interests. These subsystems interact in a very complex way resulting in various phenomena. On the airport side, there is excessive flight demand during the peak hours that frequently exceeds the airport capacity resulting in serious flight delays. These delays incur costs to the airport, passengers, and airlines. The air traffic pattern is also affected by the characteristics of the air transportation network. The current network structure of most major airlines in United States is a hub-and-spoke network. The airports are interested in reducing congestion, especially during the peak time. The airlines act as direct demand to the airport and as the supplier to the passengers. They sometimes compete with other airlines on certain routes and sometimes they collaborate to maximize revenue. The flight schedule of airlines directly affects the travel demand. The flight schedule that minimizes the schedule delay of passengers in directed and connected flights will attract more passengers. The important factors affecting the airline revenue include ticket price, departure times, frequency, and aircraft type operated on each route. The revenue generated from airline depends also on the behavior of competing airlines, and their flight schedules. The passengers choose their flight based on preferred departure times, offered ticket prices, and willingness of airlines to minimize delay and cost. Hence, all subsystems of air transportation system are inter-connected to each other, meaning, strategy of each subsystem directly affects the performance of other subsystems. This interaction between the subsystems makes it more difficult to analyze the air transportation system. Traditionally, analytical top-down approach has been used to analyze the air transportation problem. In top-down approach, a set of objectives is defined and each subsystem is fixed in the overall scheme. On the other hand, in a bottom-up approach, many issues are addressed simultaneously and each individual system has greater autonomy to make decisions, communicate and to interact with one another to achieve their goals when considering complex air transportation system. Therefore, it seems more appropriate to approach the complex air traffic congestion and airline competition problems using a bottom-up approach. In this research, an agent-based model for the air transportation system has been developed. The developed model considers each subsystem as an independent type of agent that acts based on its local knowledge and its interaction with other agents. The focus of this research is to analyze air traffic congestion and airline competition in a hub-and-spoke network. The simulation model developed is based on evolutionary computation. It seems that the only way for analyzing emergent phenomenon (such as air traffic congestion) is through the development of simulation models that can simulate the behavior of each agent. In the agent-based model developed in this research, agents that represent airports can increase capacity or significantly change landing fee policy, while the agents that represent airlines learn all the time, change their markets, fare structure, flight frequencies, and flight schedules. Such a bottom-up approach facilitates a better understanding of the complex nature of congestion and gains more insights into the competition in air transportation, hence making it easier to understand, predict and control the overall performance of the complex air transportation system. / Ph. D.

Pursuit-evasion problems comprise a set of pursuers that strive to catch oneor several evaders, often in a constrained environment. This thesis proposesand compares heuristic algorithms for pursuit-evasion problems wherein several double integrator agents pursue a single evader in a bounded subset of theEuclidean plane. Different methods for assigning surrounding target points tothe pursuers are tested numerically. In addition, a method which finds the timeoptimal strategy for pursuing a static target in an unconstrained setting is presented, and is then used to pursue the assigned, dynamic, target. Numericalresults show that the time optimal strategy for pursuing a static target translateswell to the dynamic problem.

e-Learning is becoming an influential role as an economic method and a flexible mode of study in the institutions of higher education today which has a presence in an increasing number of college and university courses. e-Learning as system of systems is a dynamic and scalable environment. Within this environment, e-learning is still searching for a permanent, comfortable and serviceable position that is to be controlled, managed, flexible, accessible and continually up-to-date with the wider university structure. As most academic and business institutions and training centres around the world have adopted the e-learning concept and technology in order to create, deliver and manage their learning materials through the web, it has become the focus of investigation. However, management, monitoring and collaboration between these institutions and centres are limited. Existing technologies such as grid, web services and agents are promising better results. In this research a new architecture has been developed and adopted to make the e-learning environment more dynamic and scalable by dividing it into regional data grids which are managed and monitored by agents. Multi-agent technology has been applied to integrate each regional data grid with others in order to produce an architecture which is more scalable, reliable, and efficient. The result we refer to as Regionally Distributed Architecture for Dynamic e-Learning Environment (RDADeLE). Our RDADeLE architecture is an agent-based grid environment which is composed of components such as learners, staff, nodes, regional grids, grid services and Learning Objects (LOs). These components are built and organised as a multi-agent system (MAS) using the Java Agent Development (JADE) platform. The main role of the agents in our architecture is to control and monitor grid components in order to build an adaptable, extensible, and flexible grid-based e-learning system. Two techniques have been developed and adopted in the architecture to build LOs' information and grid services. The first technique is the XML-based Registries Technique (XRT). In this technique LOs' information is built using XML registries to be discovered by the learners. The registries are written in Dublin Core Metadata Initiative (DCMI) format. The second technique is the Registered-based Services Technique (RST). In this technique the services are grid services which are built using agents. The services are registered with the Directory Facilitator (DF) of a JADE platform in order to be discovered by all other components. All components of the RDADeLE system, including grid service, are built as a multi-agent system (MAS). Each regional grid in the first technique has only its own registry, whereas in the second technique the grid services of all regional grids have to be registered with the DF. We have evaluated the RDADeLE system guided by both techniques by building a simulation of the prototype. The prototype has a main interface which consists of the name of the system (RDADeLE) and a specification table which includes Number of Regional Grids, Number of Nodes, Maximum Number of Learners connected to each node, and Number of Grid Services to be filled by the administrator of the RDADeLE system in order to create the prototype. Using the RST technique shows that the RDADeLE system can be built with more regional grids with less memory consumption. Moreover, using the RST technique shows that more grid services can be registered in the RDADeLE system with a lower average search time and the search performance is increased compared with the XRT technique. Finally, using one or both techniques, the XRT or the RST, in the prototype does not affect the reliability of the RDADeLE system.

In recent years, there has been a flood of continuously changing information from a variety of web resources such as web databases, web sites, web services and programs. Online Social Networks (OSNs) represent such a field where huge amounts of information are being posted online over time. Due to the nature of OSNs, which offer a productive source for qualitative and quantitative personal information, researchers from various disciplines contribute to developing methods for extracting data from OSNs. However, there is limited research which addresses extracting data automatically. To the best of the author's knowledge, there is no research which focuses on tracking the real time changes of information retrieved from OSN profiles over time and this motivated the present work. This thesis presents different approaches for automated Data Extraction (DE) from OSN: crawler, parser, Multi Agent System (MAS) and Application Programming Interface (API). Initially, a parser was implemented as a centralized system to traverse the OSN graph and extract the profile's attributes and list of friends from Myspace, the top OSN at that time, by parsing the Myspace profiles and extracting the relevant tokens from the parsed HTML source files. A Breadth First Search (BFS) algorithm was used to travel across the generated OSN friendship graph in order to select the next profile for parsing. The approach was implemented and tested on two types of friends: top friends and all friends. In case of top friends, 500 seed profiles have been visited; 298 public profiles were parsed to get 2197 top friends' profiles and 2747 friendship edges, while in case of all friends, 250 public profiles have been parsed to extract 10,196 friends' profiles and 17,223 friendship edges. This approach has two main limitations. The system is designed as a centralized system that controlled and retrieved information of each user's profile just once. This means that the extraction process will stop if the system fails to process one of the profiles; either the seed profile (first profile to be crawled) or its friends. To overcome this problem, an Online Social Network Retrieval System (OSNRS) is proposed to decentralize the DE process from OSN through using MAS. The novelty of OSNRS is its ability to monitor profiles continuously over time. The second challenge is that the parser had to be modified to cope with changes in the profiles' structure. To overcome this problem, the proposed OSNRS is improved through use of an API tool to enable OSNRS agents to obtain the required fields of an OSN profile despite modifications in the representation of the profile's source web pages. The experimental work shows that using API and MAS simplifies and speeds up the process of tracking a profile's history. It also helps security personnel, parents, guardians, social workers and marketers in understanding the dynamic behaviour of OSN users. This thesis proposes solutions for web database processing on data extraction from OSNs by the use of parser and MAS and discusses the limitations and improvements.

The work presented herein focuses on the design of distributed autonomous controllers for collective behaviour of Micro-unmanned Aerial Vehicles (MAVs). Two alternative approaches to this topic are introduced: one based upon the Evolutionary Robotics (ER) paradigm, the other one upon flocking principles. Three computer simulators have been developed in order to carry out the required experiments, all of them having their focus on the modelling of fixed-wing aircraft flight dynamics. The employment of fixed-wing aircraft rather than the omni-directional robots typically employed in collective robotics significantly increases the complexity of the challenges that an autonomous controller has to face. This is mostly due to the strict motion constraints associated with fixed-wing platforms, that require a high degree of accuracy by the controller. Concerning the ER approach, the experimental setups elaborated have resulted in controllers that have been evolved in simulation with the following capabilities: (1) navigation across unknown environments, (2) obstacle avoidance, (3) tracking of a moving target, and (4) execution of cooperative and coordinated behaviours based on implicit communication strategies. The design methodology based upon flocking principles has involved tests on computer simulations and subsequent experimentation on real-world robotic platforms. A customised implementation of Reynolds’ flocking algorithm has been developed and successfully validated through flight tests performed with the swinglet MAV. It has been notably demonstrated how the Evolutionary Robotics approach could be successfully extended to the domain of fixed-wing aerial robotics, which has never received a great deal of attention in the past. The investigations performed have also shown that complex and real physics-based computer simulators are not a compulsory requirement when approaching the domain of aerial robotics, as long as proper autopilot systems (taking care of the ”reality gap” issue) are used on the real robots.

This dissertation presents a cartographic approach to the dynamic vehicle routing problem with time windows and stochastic customers (DVRPTWSC). The objectives are to minimize the total travel time and maximize the number of new requests served. Addressing the DVRPTWSC requires solving the vehicle routing problem with time windows (VRPTW). A memetic algorithm (MA) for the VRPTW is proposed. The MA prunes the search space using the information gathered by a clustering procedure, which is applied to customers spatial data. The cartographic approach to the DVRPTWSC is incorporated into a multiagent system where a dispatcher agent plans the routes for vehicle agents. Before creating the initial routing plan, a cartographic processing is applied. This procedure uses hierarchical clustering to divide the region where customers are located into a hierarchy of nested regions. The initial routing plan considers known requests and potential requests sampled from known probability distributions. It is created using the search operators of the MA, which in turn use the information obtained from the hierarchical clustering to perform the search. Over the planning horizon, the dispatcher updates the routing plan: Potential requests that were included in the initial routing plan and do not materialize are removed and new requests are processed using the assignation of requests based on nested regions (ARNR). The ARNR procedure is aimed at reducing the number of vehicles considered for serving new requests. It tries to assign the requests among the vehicles that can serve them at low detour costs. The nested regions created in the cartographic processing are used to identify such vehicles. Experimental results show that the proposed MA performs competitively with state-of-the-art heuristics for the VRPTW. The proposed approach to the DVRPTWSC outperforms approaches that do not include potential requests in the initial routing plan. The use of the ARNR procedure significantly reduces the number of vehicles considered for serving new requests, and it yields solutions similar to those obtained when considering all vehicles in operation. The proposed approach performs consistently under three levels of dynamism: low, medium, and high. / Esta dissertação apresenta uma abordagem cartográfica para o problema de roteamento de veículos dinâmico com janelas de tempo e clientes estocásticos (DVRPTWSC, por sua sigla em inglês). Os objetivos considerados são minimizar o tempo total de viagem e maximizar o número de pedidos novos atendidos. Para abordar o DVRPTWSC é necessário resolver o problema de roteamento de veículos com janelas de tempo (VRPTW, por sua sigla em inglês). Assim, para tratar o VRPTW propõe-se um algoritmo memético (MA, por sua sigla em inglês). O MA reduz o espaço de busca usando informação obtida por meio de um procedimento de clusterização, o qual é aplicado aos dados espaciais dos clientes. Para o DVRPTWSC, a abordagem cartográfica é incorporada em um sistema multiagente, no qual um agente roteirizador planeja as rotas para os agentes veículos. O processamento cartográfico é aplicado antes de criar o plano de rotas inicial para o DVRPTWSC. Este procedimento usa clusterização hierárquica para dividir a região onde estão os clientes em uma hierarquia de regiões encaixadas. O plano de rotas inicial considera pedidos conhecidos e pedidos potenciais amostrados de distribuições de probabilidade conhecidas. Para obter o plano de rotas inicial, usam-se os operadores de busca do MA, os quais utilizam a informação obtida da clusterização hierárquica para fazer a busca. Ao longo do horizonte de planejamento, o roteirizador atualiza o plano de rotas: Pedidos potenciais que foram considerados no plano de rotas inicial e que não foram consolidados são removidos e novos pedidos são incluídos usando o procedimento assignation of requests based on nested regions (ARNR). O procedimento ARNR visa reduzir o número de veículos considerados para atender novos pedidos. Para isso, tenta designar os novos pedidos aos veículos disponíveis para o atendimento que possuem os menores custos de desvio da rota pré-determinada. As regiões encaixadas criadas no processamento cartográfico são utilizadas para identificar esses veículos. Para o VRPTW, resultados experimentais mostram que o MA proposto é competitivo com métodos do estado da arte. A abordagem proposta para o DVRPTWSC supera abordagens que não incluem pedidos potenciais no plano de rotas inicial. O uso do procedimento ARNR reduz significativamente o número de veículos considerados para atender novos pedidos, e produz soluções similares às produzidas quando se consideram todos os veículos em operação. A abordagem desenvolvida para o DVRPTWSC tem um desempenho consistente para três níveis de dinamismo: baixo, médio e alto.

Real-Time Optimization (RTO) is a family of techniques that pursue to improve the performance of chemical processes. As general scheme, the method reevaluates the process conditions in a frequent basis and tries to adjust some selected variables, taking into account the plant state, actual operational constraints and optimization objectives. Several RTO approaches have born from the academy research and industrial practices, at the same time that more applications have been implemented in real facilities. Between the main motivations to apply RTO are the dynamic of markets, the seek for quality in the process results and environmental sustainability. That is why the interest on deeply understand the phases and steps involved in an RTO application has increased in recent years. Nevertheless, the fact that most of the existing RTO systems have been developed by commercial organizations makes it difficult to meet that understanding. This work studies the nature of RTO systems from a software point of view. Software requirements for a generic system are identied. Based on that, a software architecture is proposed that could be adapted for specfic cases. Benefits of the designed architecture are listed. At the same time, the work proposes a new approach to implement that architecture as a Multi-Agent System (MAS). Two RTO system prototypes were developed then, one for a well-know academic case study and the other oriented to be used in a real unit. The benefits of the MAS approach and the architecture, for researching on the RTO field and implementation on real plants, are analyzed in the text. A sub-product of the development, a software framework covering main concepts from the RTO ontology, is proposed as well. As the framework was designed to be generic, it can be used in new applications development and extended to very specific scenarios. / Otimização em Tempo Real (OTR) é uma família de técnicas que buscam melhorar o desempenho dos processos químicos. Como esquema geral, o método reavalia frequentemente as condições do processo e tenta ajustar algumas variáveis selecionadas, levando em considera ção o estado da planta, restrições operacionais e os objetivos da otimização. Várias abordagens para OTR t^em surgido da pesquisa acadêmica e das práticas industriais, ao mesmo tempo em que mais aplicações têm sido implementadas em plantas reais. As principais motivações para aplicar OTR são: a dinâmica dos mercados, a busca de qualidade nos resultados dos processos e a sustentabilidade ambiental. É por isso que o interesse em entender as fases e etapas envolvidas em uma aplicação OTR cresceu nos últimos anos. No entanto, o fato de que a maioria dos sistemas OTR em operação foram desenvolvidos por organizações comerciais dificulta o caminho para chegar nesse entendimento. Este trabalho analisa a natureza dos sistemas OTR desde o ponto de vista do software. Os requerimentos para um sistema genérico são levantados. Baseado nisso, é proposta uma arquitetura de software que pode ser adaptada para casos específicos. Os benefícios da arquitetura projetada foram listados. Ao mesmo tempo, o trabalho propõe uma nova abordagem para implementar essa arquitetura: Sistema Multi-Agentes (SMA). Dois protótipos de sistema OTR foram desenvolvidos. O primeiro aplicado num estudo de caso bem conhecido na literatura acadêmica. O segundo voltado para ser usado em uma unidade industrial. Os benefícios da abordagem SMA e da arquitetura, tanto na pesquisa relacionada com OTR, quanto na implementação em plantas reais, são analisados no texto. Um arcabouço de software que abrange os principais conceitos da ontologia OTR é proposto como resultado derivado do desenvolvimento. O arcabouço foi projetado para ser genérico, possibilitando seu uso no desenvolvimento de novas aplicações OTR e sua extensão a cenários muito específicos.

Multi-agent systems have been used in a wide range of applications from computer-based simulations and mobile robots to agent-oriented programming and intelligent systems in real environments. However, the largest environment in which software agents can interact is, without any doubt, the World Wide Web and ever since its birth agents have been used in various applications such as search engines, e-commerce, and most recently the semantic web. However, agents have yet to be used on the Web in a way that leverages the full power of artificial intelligence and multi-agent systems, which have the potential of making life much easier for humans. This thesis investigates how this can be changed, and how agents can be brought to the core of the online experience in the sense that we want people to talk and interact with agents instead of "just using yet another application or website". We analyze what makes it hard to develop intelligent agents on the web and we propose a web agent model (WAM) inspired by recent results in multi-agent systems. Nowadays, a simple conceptual model is the key for widespread adoption of new technologies and this is why we have chosen the MASQ meta-model as the basis for our approach, which provides the best compromise in terms of simplicity of concepts, generality and applicability to the web. Since until now the model was introduced only in an informal way, we also provide a clear formalization of the MASQ meta-model.Next, we identify the three main challenges that need to be addressed when building web agents: integration of bodies, web semantics and user friendliness. We focus our attention on the first two and we propose a set of principles to guide the development of what we call strong web agents. Finally, we validate our proposal through the implementation of an award winning platform called Kleenk. Our work is just a step towards fulfilling the vision of having intelligent web agents mediate the interaction with the increasingly complex World Wide Web. / Multi-agent systems have been used in a wide range of applications from computer-based simulations and mobile robots to agent-oriented programming and intelligent systems in real environments. However, the largest environment in which software agents can interact is, without any doubt, the World Wide Web and ever since its birth agents have been used in various applications such as search engines, e-commerce, and most recently the semantic web. However, agents have yet to be used on the Web in a way that leverages the full power of artificial intelligence and multi-agent systems, which have the potential of making life much easier for humans. This thesis investigates how this can be changed, and how agents can be brought to the core of the online experience in the sense that we want people to talk and interact with agents instead of "just using yet another application or website". We analyze what makes it hard to develop intelligent agents on the web and we propose a web agent model (WAM) inspired by recent results in multi-agent systems. Nowadays, a simple conceptual model is the key for widespread adoption of new technologies and this is why we have chosen the MASQ meta-model as the basis for our approach, which provides the best compromise in terms of simplicity of concepts, generality and applicability to the web. Since until now the model was introduced only in an informal way, we also provide a clear formalization of the MASQ meta-model.Next, we identify the three main challenges that need to be addressed when building web agents: integration of bodies, web semantics and user friendliness. We focus our attention on the first two and we propose a set of principles to guide the development of what we call strong web agents. Finally, we validate our proposal through the implementation of an award winning platform called Kleenk. Our work is just a step towards fulfilling the vision of having intelligent web agents mediate the interaction with the increasingly complex World Wide Web.

Submitted by PPG Ci?ncia da Computa??o (ppgcc@pucrs.br) on 2018-03-26T18:03:05Z No. of bitstreams: 1 ARTUR_FREITAS_TES.pdf: 1489846 bytes, checksum: 61623f4503a4a916e72487f33c15e294 (MD5) / Approved for entry into archive by Tatiana Lopes (tatiana.lopes@pucrs.br) on 2018-04-06T16:46:51Z (GMT) No. of bitstreams: 1 ARTUR_FREITAS_TES.pdf: 1489846 bytes, checksum: 61623f4503a4a916e72487f33c15e294 (MD5) / Made available in DSpace on 2018-04-06T16:57:00Z (GMT). No. of bitstreams: 1 ARTUR_FREITAS_TES.pdf: 1489846 bytes, checksum: 61623f4503a4a916e72487f33c15e294 (MD5) Previous issue date: 2017-08-31 / A engenharia orientada a modelos fornece abstra??es e nota??es para melhorar a compreens?o e para apoiar a modelagem, codifica??o e verifica??o de aplica??es em dom?nios espec?ficos. As ontologias, por outro lado, fornecem defini??es formais e expl?citas de conceitualiza??es compartilhadas e permitem o uso de racioc?nio sem?ntico. Embora essas ?reas tenham sido desenvolvidas por diferentes comunidades, sinergias importantes podem ser alcan?adas quando ambas s?o combinadas. Essas vantagens podem ser exploradas no desenvolvimento de sistemas multiagentes, dada a sua complexidade e a necessidade de integrar v?rios componentes que s?o frequentemente abordados de diferentes ?ngulos. Este trabalho investiga como aplicar ontologias para engenharia de software orientada a agentes. Inicialmente, apresentamos uma nova abordagem de modelagem onde os sistemas multiagentes s?o projetados usando a ontologia OntoMAS proposta. Ent?o, descrevemos t?cnicas, implementadas em uma ferramenta, para ajudar os programadores a trazer seus conceitos em c?digo e tamb?m gerar c?digo automaticamente a partir de modelos instanciados da ontologia. V?rias vantagens podem ser obtidas a partir dessas novas abordagens para modelar e codificar sistemas multiagentes, como o racioc?nio sem?ntico para realizar infer?ncias e mecanismos de verifica??o. Mas a principal vantagem ? a linguagem de especifica??o unificada de alto n?vel (conhecimento) que permite modelar as tr?s dimens?es que est?o unidas em JaCaMo para que as especifica??es dos sistemas possam ser melhor comunicadas entre equipes em desenvolvimento. As avalia??es dessas propostas indicam que elas contribuem com os diferentes aspectos da engenharia de software orientada a agentes, como a especifica??o, verifica??o e programa??o desses sistemas. / Model-driven engineering provides abstractions and notations for improving the understanding and for supporting the modelling, coding, and verification of applications for specific domains. Ontologies, on the other hand, provide formal and explicit definitions of shared conceptualisations and enable the use of semantic reasoning. Although these areas have been developed by different communities, important synergies can be achieved when both are combined. These advantages can be explored in the development of multi-agent systems, given their complexity and the need for integrating several components that are often addressed from different angles. This work investigates how to apply ontologies for agentoriented software engineering. Initially, we present a new modelling approach where multiagent systems are designed using the proposed OntoMAS ontology. Then, we describe techniques, implemented in a tool, to help programmers bring their concepts into code and also generate code automatically from instantiated ontology models. Several advantages can be obtained from these new approaches to model and code multi-agent systems, such as semantic reasoning to carry out inferences and verification mechanisms. But the main advantage is the unified high (knowledge) level specification language that allows modelling the three dimensions that are united in the JaCaMo framework so that systems specifications can be better communicated across developing teams. The evaluations of these proposals indicate that they contribute with the different aspects of agent-oriented software engineering, such as the specification, verification, and programming of these systems.