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.

As exploration in space increases through the use of larger telescopes, more sophisticated structures, and physical exploration, the use of autonomous robots will become instrumental to build and maintain the infrastructures required for this exploration. These systems must be autonomous to deal with the infeasibility of teleoperation due signal delay and task complexity. The reality of using robots in the real world without direct human input will require the autonomous systems to have the capability of responding to errors that occur in an assembly scenario on their own. As such, a system must be in place to allow for the sequencing and allocation of tasks to the robotic workforce autonomously, giving the ability to re-plan in real world stochastic environments. This work presents four contributions towards a system allowing for the autonomous sequencing and allocation of tasks for in-space assembly problems. The first contribution is the development of the Stochastic Assembly Problem Definition (SAPD) to articulate all of the features in an assembly problem that are applicable to the task sequencing and allocation. The second contribution is the formulation of a mixed integer program to solve for assembly schedules that are optimal or a quantifiable measurement from optimal. This contribution is expanded through the development of a genetic algorithm formulation to utilize the stochastic information present in the assembly problem. This formulation extends the state-of-the-art techniques in genetic algorithms to allow for the inclusion of new constraints required for the in-space assembly domain. The third contribution addresses how to estimate a robot's ability to complete a task if the robot must be assigned to a task it was previously not expected to work on. This is accomplished through the development of four metrics and analyzed through the use of screw theory kinematics. The final contribution focuses on a set of metrics to guide the selection of a good scheduling method for different assembly situations. The experiments in this work demonstrate how the developed theory can be utilized and shows the scheduling systems producing the best or close to the best schedules for assemblies. It also shows how the metrics used to quantify and estimate robot ability are applied. The theory developed in this work provides another step towards autonomous systems that are capable of assembling structures in-space without the need for human input. / Doctor of Philosophy / As space exploration continues to progress, autonomous robots are needed to allow for the necessary structures to be built in-space, on Mars, and on the Lunar surface. Since it is not possible to plan for every possible thing that could go wrong or break, the robots must be able to figure out how to build and repair structures without human input. The work presented here develops a framework that allows this in-space assembly problem to be framed in a way the robots can process. It then provides a method for generating assembly schedules that describe very good, if not the best way to complete the assembly quickly while still taking into account randomness that may be present. Additionally, this work develops a way to quantify and estimate how good robots will be at a task they have not attempted before. Finally, a set of considerations are proposed to aid in determining what scheduling method will work best for different assembly scenarios. The experiments in this work demonstrate how the developed theory can be used and shows the scheduling systems producing the best or close to the best schedules for assemblies. It also shows how the methods used to define robot ability are applied. The work developed here provides another step towards autonomous systems that are capable of assembling structures in-space without the need for human input.

Generalized collaborative drones are a technology that has many potential benefits. General purpose drones that can handle exploration, navigation, manipulation, and more without having to be reprogrammed would be an immense breakthrough for usability and adoption of the technology. The ability to develop these multi-task, multi-agent drone systems is limited by the lack of available training environments, as well as deficiencies of multi-task learning due to a phenomenon known as catastrophic forgetting. In this thesis, we present a set of simulation environments for exploring the abilities of multi-task drone systems and provide a platform for testing agents in incremental single-agent and multi-agent learning scenarios. The multi-task platform is an extension of an existing drone simulation environment written in Python using the PyBullet Physics Simulation Engine, with these environments incorporated. Using this platform, we present an analysis of Incremental Learning and detail the beneficial impacts of using the technique for multi-task learning, with respect to multi-task learning speed and catastrophic forgetting. Finally, we introduce a novel algorithm, Incremental Learning with Second-Order Approximation Regularization (IL-SOAR), to mitigate some of the effects of catastrophic forgetting in multi-task learning. We show the impact of this method and contrast the performance relative to a multi-agent multi-task approach using a centralized policy sharing algorithm. / Master of Science / Machine Learning techniques allow drones to be trained to achieve tasks which are otherwise time-consuming or difficult. The goal of this thesis is to facilitate the work of creating these complex drone machine learning systems by exploring Reinforcement Learning (RL), a field of machine learning which involves learning the correct actions to take through experience. Currently, RL methods are effective in the design of drones which are able to solve one particular task. The next step in this technology is to develop RL systems which are able to handle generalization and perform well across multiple tasks. In this thesis, simulation environments for drones to learn complex tasks are created, and algorithms which are able to train drones in multiple hard tasks are developed and tested. We explore the benefits of using a specific multi-task training technique known as Incremental Learning. Additionally, we consider one of the prohibitive factors of multi-task machine learning-based solutions, the degradation problem of agent performance on previously learned tasks, known as catastrophic forgetting. We create an algorithm that aims to prevent the impact of forgetting when training drones sequentially on new tasks. We contrast this approach with a multi-agent solution, where multiple drones learn simultaneously across the tasks.

Hoy en día los sistemas informáticos complejos se pueden ven en términos de los servicios que ofrecen y las entidades que interactúan para proporcionar o consumir dichos servicios. Los sistemas multi-agente abiertos, donde los agentes pueden entrar o salir del sistema, interactuar y formar grupos (coaliciones de agentes u organizaciones) de forma dinámica para resolver problemas, han sido propuestos como una tecnología adecuada para implementar este nuevo paradigma informático. Sin embargo, el amplio dinamismo de estos sistemas requiere que los agentes tengan una forma de armonizar los conflictos que surgen cuando tienen que colaborar y coordinar sus actividades. En estas situaciones, los agentes necesitan un mecanismo para argumentar de forma eficiente (persuadir a otros agentes para que acepten sus puntos de vista, negociar los términos de un contrato, etc.) y poder llegar a acuerdos. La argumentación es un medio natural y efectivo para abordar los conflictos y contradicciones del conocimiento. Participando en diálogos argumentativos, los agentes pueden llegar a acuerdos con otros agentes. En un sistema multi-agente abierto, los agentes pueden formar sociedades que los vinculan a través de relaciones de dependencia. Estas relaciones pueden surgir de sus interacciones o estar predefinidas por el sistema. Además, los agentes pueden tener un conjunto de valores individuales o sociales, heredados de los grupos a los que pertenecen, que quieren promocionar. Las dependencias entre los agentes y los grupos a los que pertenecen y los valores individuales y sociales definen el contexto social del agente. Este contexto tiene una influencia decisiva en la forma en que un agente puede argumentar y llegar a acuerdos con otros agentes. Por tanto, el contexto social de los agentes debería tener una influencia decisiva en la representación computacional de sus argumentos y en el proceso de gestión de argumentos. / Heras Barberá, SM. (2011). Case-Based Argumentation in Agent Societies [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/12497

Connected and Automated Vehicles (CAVs) have the potential to revolutionize transportation efficiency and safety through collaborative behavior. This dissertation explores the challenges and opportunities associated with achieving socially optimal cooperative maneuvers, using the problem of cooperative lane-changing to showcase the significance of cooperativeness. Cooperative lane-changing serves as an ideal testbed for examining decentralized optimal control, interactions with uncooperative vehicles, accommodating diverse human driving preferences, and integrating planning and execution processes. Initially, the research focuses on scenarios where all vehicles are cooperative CAVs, leveraging their communication and coordination capabilities. Decentralized optimal control problems are formulated to minimize energy consumption, travel time, and traffic disruption during sequential cooperative lane changes, balancing individual vehicle objectives with system-level goals. The dissertation then extends the analysis to mixed-traffic scenarios involving uncooperative human-driven vehicles (HDVs). A novel approach is developed to ensure safety assurance, combining optimal control with Control Barrier Functions (CBFs) and fixed-time convergence (FxT-OCBF). Robust methods for handling disturbances from uncooperative vehicles are introduced, enhancing the resilience and dependability of cooperative lane-changing maneuvers. An innovative online learning framework is presented to address the complexities of CAVs interacting with HDVs exhibiting diverse driving preferences. Safety preferences are characterized using parameterized CBFs, and an extended Kalman filter dynamically adjusts control parameters based on observed interactions, enabling real-time adaptation to evolving human behaviors. The proposed methodologies bridge the gap between high-level planning and low-level control execution, facilitating safe and near-optimal cooperative maneuvers. Comprehensive analysis demonstrates improved traffic throughput, reduced energy consumption, and enhanced safety compared to non-cooperative or reactive approaches. This research lays the foundation for deploying CAV technologies that prioritize social optimality while addressing uncertainties in mixed-traffic settings, ultimately paving the way for safer and more efficient transportation systems. / 2025-03-11T00:00:00Z

Tesis por compendio / [EN] Automated planning is a centralized process in which a single planning entity, or agent, synthesizes a course of action, or plan, that satisfies a desired set of goals from an initial situation. A Multi-Agent System (MAS) is a distributed system where a group of autonomous agents pursue their own goals in a reactive, proactive and social way. Multi-Agent Planning (MAP) is a novel research field that emerges as the integration of automated planning in MAS. Agents are endowed with planning capabilities and their mission is to find a course of action that attains the goals of the MAP task. MAP generalizes the problem of automated planning in domains where several agents plan and act together by combining their knowledge, information and capabilities. In cooperative MAP, agents are assumed to be collaborative and work together towards the joint construction of a competent plan that solves a set of common goals. There exist different methods to address this objective, which vary according to the typology and coordination needs of the MAP task to solve; that is, to which extent agents are able to make their own local plans without affecting the activities of the other agents. The present PhD thesis focuses on the design, development and experimental evaluation of a general-purpose and domain-independent resolution framework that solves cooperative MAP tasks of different typology and complexity. More precisely, our model performs a multi-agent multi-heuristic search over a plan space. Agents make use of an embedded search engine based on forward-chaining Partial Order Planning to successively build refinement plans starting from an initial empty plan while they jointly explore a multi-agent search tree. All the reasoning processes, algorithms and coordination protocols are fully distributed among the planning agents and guarantee the preservation of the agents' private information. The multi-agent search is guided through the alternation of two state-based heuristic functions. These heuristic estimators use the global information on the MAP task instead of the local projections of the task of each agent. The experimental evaluation shows the effectiveness of our multi-heuristic search scheme, obtaining significant results in a wide variety of cooperative MAP tasks adapted from the benchmarks of the International Planning Competition. / [ES] La planificación automática es un proceso centralizado en el que una única entidad de planificación, o agente, sintetiza un curso de acción, o plan, que satisface un conjunto deseado de objetivos a partir de una situación inicial. Un Sistema Multi-Agente (SMA) es un sistema distribuido en el que un grupo de agentes autónomos persiguen sus propias metas de forma reactiva, proactiva y social. La Planificación Multi-Agente (PMA) es un nuevo campo de investigación que surge de la integración de planificación automática en SMA. Los agentes disponen de capacidades de planificación y su propósito consiste en generar un curso de acción que alcance los objetivos de la tarea de PMA. La PMA generaliza el problema de planificación automática en dominios en los que diversos agentes planifican y actúan conjuntamente mediante la combinación de sus conocimientos, información y capacidades. En PMA cooperativa, se asume que los agentes son colaborativos y trabajan conjuntamente para la construcción de un plan competente que resuelva una serie de objetivos comunes. Existen distintos métodos para alcanzar este objetivo que varían de acuerdo a la tipología y las necesidades de coordinación de la tarea de PMA a resolver; esto es, hasta qué punto los agentes pueden generar sus propios planes locales sin afectar a las actividades de otros agentes. La presente tesis doctoral se centra en el diseño, desarrollo y evaluación experimental de una herramienta independiente del dominio y de propósito general para la resolución de tareas de PMA cooperativa de distinta tipología y nivel de complejidad. Particularmente, nuestro modelo realiza una búsqueda multi-agente y multi-heurística sobre el espacio de planes. Los agentes hacen uso de un motor de búsqueda embebido basado en Planificación de Orden Parcial de encadenamiento progresivo para generar planes refinamiento de forma sucesiva mientras exploran conjuntamente el árbol de búsqueda multiagente. Todos los procesos de razonamiento, algoritmos y protocolos de coordinación están totalmente distribuidos entre los agentes y garantizan la preservación de la información privada de los agentes. La búsqueda multi-agente se guía mediante la alternancia de dos funciones heurísticas basadas en estados. Estos estimadores heurísticos utilizan la información global de la tarea de PMA en lugar de las proyecciones locales de la tarea de cada agente. La evaluación experimental muestra la efectividad de nuestro esquema de búsqueda multi-heurístico, que obtiene resultados significativos en una amplia variedad de tareas de PMA cooperativa adaptadas a partir de los bancos de pruebas de las Competición Internacional de Planificación. / [CA] La planificació automàtica és un procés centralitzat en el que una única entitat de planificació, o agent, sintetitza un curs d'acció, o pla, que satisfau un conjunt desitjat d'objectius a partir d'una situació inicial. Un Sistema Multi-Agent (SMA) és un sistema distribuït en el que un grup d'agents autònoms persegueixen les seues pròpies metes de forma reactiva, proactiva i social. La Planificació Multi-Agent (PMA) és un nou camp d'investigació que sorgeix de la integració de planificació automàtica en SMA. Els agents estan dotats de capacitats de planificació i el seu propòsit consisteix en generar un curs d'acció que aconseguisca els objectius de la tasca de PMA. La PMA generalitza el problema de planificació automàtica en dominis en què diversos agents planifiquen i actúen conjuntament mitjançant la combinació dels seus coneixements, informació i capacitats. En PMA cooperativa, s'assumeix que els agents són col·laboratius i treballen conjuntament per la construcció d'un pla competent que ressolga una sèrie d'objectius comuns. Existeixen diferents mètodes per assolir aquest objectiu que varien d'acord a la tipologia i les necessitats de coordinació de la tasca de PMA a ressoldre; és a dir, fins a quin punt els agents poden generar els seus propis plans locals sense afectar a les activitats d'altres agents. La present tesi doctoral es centra en el disseny, desenvolupament i avaluació experimental d'una ferramenta independent del domini i de propòsit general per la resolució de tasques de PMA cooperativa de diferent tipologia i nivell de complexitat. Particularment, el nostre model realitza una cerca multi-agent i multi-heuristica sobre l'espai de plans. Els agents fan ús d'un motor de cerca embegut en base a Planificació d'Ordre Parcial d'encadenament progressiu per generar plans de refinament de forma successiva mentre exploren conjuntament l'arbre de cerca multiagent. Tots els processos de raonament, algoritmes i protocols de coordinació estan totalment distribuïts entre els agents i garanteixen la preservació de la informació privada dels agents. La cerca multi-agent es guia mitjançant l'aternança de dues funcions heurístiques basades en estats. Aquests estimadors heurístics utilitzen la informació global de la tasca de PMA en lloc de les projeccions locals de la tasca de cada agent. L'avaluació experimental mostra l'efectivitat del nostre esquema de cerca multi-heurístic, que obté resultats significatius en una ampla varietat de tasques de PMA cooperativa adaptades a partir dels bancs de proves de la Competició Internacional de Planificació. / Torreño Lerma, A. (2016). Cooperative planning in multi-agent systems [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/65815 / Premios Extraordinarios de tesis doctorales / Compendio

Recent events have probably lead us to wonder why people make decisions that seem to be irrational, and that go against any easily understandable logic. The fact that these decisions are emotionally driven often explains what, at first glance, does not have a plausible explanation. Evidence has been found that proves that emotions and other affective characteristics guide decisions beyond a purely rational deliberation. Understanding the way emotions take place, the way emotions change, and/or the way emotions influence behavior, has traditionally been a concern of several fields including psychology and neurology. Moreover, other sciences such as behavioral economics, artificial intelligence, and in general, all sciences that aim to understand, explain, or simulate human behavior, acknowledge the important role of affective characteristics in this task. Specifically, artificial intelligence uses psychological findings in order to create agents that simulate human behavior. Nevertheless, individual research efforts in modeling affective characteristics are often overlapped, short of integration, and they lack of a common conceptual system. This deprives individual researches of the exchange and cooperation's inherent benefits, and makes the task of computationally simulating affective characteristics more difficult. Although much individual effort has been put in classifying, formalizing and modeling emotions and emotion theories on some fields, recognized researchers of emotions' and affective processes' modeling report that a common formal language, an informal conceptual system, and a general purpose affective agent architecture will greatly improve the interdisciplinary exchange and the intradisciplinary coordination. The research literature proposes a wide amount of affective models that deal with some of: relationship between emotions and cognition, relationship between emotions and behavior, emotions and their evolutionary account, emotions for appraising situations, emotion regulation, etc. These models are useful tools for addressing particular emotion-related issues. Furthermore, computational approaches that are based on particular psychological theories have also been proposed. They often address domain specific issues starting from a specific psychological theory. In such solutions, the absence of a common conceptual system and/or platform, makes difficult the feedback between psychological theories and computational approaches. This thesis systematizes and formalizes affect-related theories, what can benefit the interdisciplinary exchange, the intradisciplinary coordination, and hence, allows the improvement of involved disciplines. Specifically this thesis makes the following contributions: (1) a theoretical framework that includes the main processes and concepts that a model of an affective agent with practical reasoning should have; (2) a general-purpose affective agent architecture that shares the concepts of the proposed theoretical framework; (3) an implementation-independent formal language for designing affective agents that have the proposed architecture; and (4) a specific agent language for implementing affective agents which is an extension of a BDI language. Some studies with human participants have helped to validate the contributions of this thesis. They include classical games of game theory, and an study with 300 participants, which have provided the necessary information to evaluate the contributions. The validation has been performed in three directions: determine whether the proposed computational approach represents better the human behavior than traditional computational approaches; determine whether this approach allows to improve psychological theories used by default; and determine whether the proposed affective agents' behavior is closer to human behavior than the behavior of a purely rational agent. / Probablemente algunos eventos recientes nos han conducido a preguntarnos por qué las personas toman decisiones aparentemente irracionales y en contra de alguna lógica fácilmente comprensible. El hecho de que estas decisiones estén bajo la influencia de las emociones a menudo explica lo que, a primera vista, parece no tener una explicación aceptable. En este sentido, se han encontrado evidencias que prueban que las emociones y otras características afectivas condicionan las decisiones más allá de una deliberación meramente racional. Entender cómo las emociones tienen lugar, cómo cambian y cómo influyen en el comportamiento, ha sido tradicionalmente de interés para muchos campos de investigación, incluyendo la psicología y la neurología. Además, otras ciencias como la economía conductual o la inteligencia artificial reconocen el importante papel de las características afectivas en esta tarea. Específicamente, la inteligencia artificial utiliza los resultados obtenidos en psicología para crear agentes que simulan el comportamiento humano. Sin embargo, a menudo los esfuerzos individuales de investigación en el modelado del afecto se solapan, carecen de la suficiente integración y de un sistema conceptual común. Esto limita a las investigaciones individuales para disponer de los beneficios que ofrecen el intercambio y la cooperación, y hace más compleja la tarea de simular los procesos afectivos. Las emociones y teorías relacionadas han sido clasificadas, formalizadas y modeladas. No obstante, reconocidos investigadores argumentan que un lenguaje formal común, un sistema conceptual informal y una arquitectura de agentes de propósito general, mejorarán significativamente el intercambio interdisciplinar y la coordinación intradisciplinar. En la literatura se propone una amplia cantidad de modelos afectivos que modelan: la relación entre las emociones y la cognición, la relación entre las emociones y el comportamiento, las emociones para evaluar las situaciones, la regulación de emociones, etc. Estos modelos son herramientas útiles para abordar aspectos particulares relacionados con las emociones. Además, se han realizado propuestas computacionales que abordan aspectos específicos sobre la base de teorías psicológicas específicas. En éstas soluciones, la ausencia de una plataforma y/o sistema conceptual dificulta la retroalimentación entre las teorías psicológicas y las propuestas computacionales. Esta tesis sistematiza y formaliza teorías relacionadas con el afecto, lo cual beneficia el intercambio interdisciplinar y la coordinación intradisciplinar, y por tanto, permite el desarrollo de las disciplinas correspondientes. Específicamente esta tesis realiza las siguientes contribuciones: (1) una plataforma teórica que incluye los conceptos y procesos principales que debería poseer un modelo de agentes afectivos con razonamiento práctico; (2) una arquitectura de agentes de propósito general que comparte los conceptos de la plataforma teórica propuesta; (3) un lenguaje formal independiente de la implementación, para diseñar agentes afectivos que poseen la arquitectura propuesta; y (4) un lenguaje de agentes específico para implementar agentes afectivos el cual es un extensión de un lenguaje BDI. Algunos estudios con participantes humanos han ayudado a validar las contribuciones de esta tesis. Estos incluyen juegos clásicos de teoría de juegos y un estudio con 300 participantes, los cuales han proporcionado la información necesaria para evaluar las contribuciones. La validación se ha realizado en tres direcciones: determinar si la propuesta computacional que se ha realizado representa mejor el comportamiento humano que propuestas computacionales tradicionales; determinar si esta propuesta permite mejorar las teorías psicológicas empleadas por defecto; y determinar si el comportamiento de los agentes afectivos propuestos se acerca más al comportamiento humano que el compor / Probablement alguns esdeveniments recents ens han conduït a preguntar-nos per què les persones prenen decisions que aparentment són irracionals i que van en contra d'algun tipus de lògica fàcilment comprensible. El fet que aquestes decisions estiguin sota la influència de les emocions sovint explica el que, a primera vista, sembla no tenir una explicació acceptable. En aquest sentit, s'han trobat evidències que proven que les emocions i altres característiques afectives condicionen les decisions més enllà d'una deliberació merament racional. Entendre com les emocions tenen lloc, com canvien i com influeixen en el comportament, ha estat tradicionalment d'interès per a molts camps d'investigació, incloent la psicologia i la neurologia. A més, altres ciències com l'economia conductual, la intel·ligència artificial i, en general, totes les ciències que intenten entendre, explicar o simular el comportament humà, reconeixen l'important paper de les característiques afectives en aquesta tasca. Específicament, la intel·ligència artificial utilitza els resultats obtinguts en psicologia per crear agents que simulen el comportament humà. No obstant això, sovint els esforços individuals d'investigació en el modelatge de l'afecte es solapen, no tenen la suficient integració ni compten amb un sistema conceptual comú. Això limita a les investigacions individuals, que no poden disposar dels beneficis que ofereixen l'intercanvi i la cooperació, i fa més complexa la tasca de simular els processos afectius. Les emocions i teories relacionades han estat classificades, formalitzades i modelades. No obstant això reconeguts investigadors argumenten que un llenguatge formal comú, un sistema conceptual informal i una arquitectura d'agents de propòsit general, milloraran significativament l'intercanvi interdisciplinar i la coordinació intradisciplinar. En la literatura es proposa una àmplia quantitat de models afectius que modelen: la relació entre les emocions i la cognició, la relació entre les emocions i el comportament, les emocions per avaluar les situacions, la regulació d'emocions, etc. Aquests models són eines útils per abordar aspectes particulars relacionats amb les emocions. A més, s'han realitzat propostes computacionals que aborden aspectes específics sobre la base de teories psicològiques específiques. En aquestes solucions, l'absència d'una plataforma i/o sistema conceptual dificulta la retroalimentació entre les teories psicològiques i les propostes computacionals. Aquesta tesi sistematitza i formalitza teories relacionades amb l'afecte, la qual cosa beneficia l'intercanvi interdisciplinar i la coordinació intradisciplinar, i per tant, permet el desenvolupament de les disciplines corresponents. Específicament aquesta tesi realitza les següents contribucions: (1) una plataforma teòrica que inclou els conceptes i processos principals que hauria de posseir un model d'agents afectius amb raonament pràctic; (2) una arquitectura d'agents de propòsit general que comparteix els conceptes de la plataforma teòrica proposta; (3) un llenguatge formal independent de la implementació, per dissenyar agents afectius que posseeixen l'arquitectura proposada; i (4) un llenguatge d'agents específic per implementar agents afectius el qual és un extensió d'un llenguatge BDI. Alguns estudis amb participants humans han ajudat a validar les contribucions d'aquesta tesi. Aquests inclouen jocs clàssics de teoria de jocs i un estudi amb 300 participants, els quals han proporcionat la informació necessària per avaluar les contribucions. La validació s'ha realitzat en tres direccions: determinar si la proposta computacional que s'ha realitzat representa millor el comportament humà que propostes computacionals tradicionals; determinar si aquesta proposta permet millorar les teories psicològiques emprades per defecte; i determinar si el comportament dels agents afectius proposats s'acosta més al / Alfonso Espinosa, B. (2017). Agents with Affective Traits for Decision-Making in Complex Environments [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/90497

Tesis por compendio / A lo largo de los últimos años, los sistemas multi-agente (SMA) han demostrado ser un paradigma potente y versátil, con un gran potencial a la hora de resolver problemas complejos en entornos dinámicos y distribuidos. Este potencial no se debe principalmente a sus características individuales (como son su autonomía, su capacidad de percepción, reacción y de razonamiento), sino que también a la capacidad de comunicación y cooperación a la hora de conseguir un objetivo. De hecho, su capacidad social es la que más llama la atención, es este comportamiento social el que dota de potencial a los sistemas multi-agente. Estas características han hecho de los SMA, la herramienta de inteligencia artificial (IA) más utilizada para el diseño de entornos virtuales inteligentes (IVE), los cuales son herramientas de simulación compleja basadas en agentes. Sin embargo, los IVE incorporan restricciones físicas (como gravedad, fuerzas, rozamientos, etc.), así como una representación 3D de lo que se quiere simular. Así mismo, estas herramientas no son sólo utilizadas para la realización de simulaciones. Con la aparición de nuevas aplicaciones como \emph{Internet of Things (IoT)}, \emph{Ambient Intelligence (AmI)}, robot asistentes, entre otras, las cuales están en contacto directo con el ser humano. Este contacto plantea nuevos retos a la hora de interactuar con estas aplicaciones. Una nueva forma de interacción que ha despertado un especial interés, es el que se relaciona con la detección y/o simulación de estados emocionales. Esto ha permitido que estas aplicaciones no sólo puedan detectar nuestros estados emocionales, sino que puedan simular y expresar sus propias emociones mejorando así la experiencia del usuario con dichas aplicaciones. Con el fin de mejorar la experiencia humano-máquina, esta tesis plantea como objetivo principal la creación de modelos emocionales sociales, los cuales podrán ser utilizados en aplicaciones MAS permitiendo a los agentes interpretar y/o emular diferentes estados emocionales y, además, emular fenómenos de contagio emocional. Estos modelos permitirán realizar simulaciones complejas basadas en emociones y aplicaciones más realistas en dominios como IoT, AIm, SH. / Over the past few years, multi-agent systems (SMA) have proven to be a powerful and versatile paradigm, with great potential for solving complex problems in dynamic and distributed environments. This potential is not primarily due to their individual characteristics (such as their autonomy, their capacity for perception, reaction and reasoning), but also the ability to communicate and cooperate in achieving a goal. In fact, its social capacity is the one that draws the most attention, it is this social behavior that gives potential to multi-agent systems. These characteristics have made the SMA, the artificial intelligence (AI) tool most used for the design of intelligent virtual environments (IVE), which are complex agent-based simulation tools. However, IVE incorporates physical constraints (such as gravity, forces, friction, etc.), as well as a 3D representation of what you want to simulate. Also, these tools are not only used for simulations. With the emergence of new applications such as \emph {Internet of Things (IoT)}, \emph {Ambient Intelligence (AmI)}, robot assistants, among others, which are in direct contact with humans. This contact poses new challenges when it comes to interacting with these applications. A new form of interaction that has aroused a special interest is that which is related to the detection and / or simulation of emotional states. This has allowed these applications not only to detect our emotional states, but also to simulate and express their own emotions, thus improving the user experience with those applications. In order to improve the human-machine experience, this thesis aims to create social emotional models, which can be used in MAS applications, allowing agents to interpret and / or emulate different emotional states, and emulate phenomena of emotional contagion. These models will allow complex simulations based on emotions and more realistic applications in domains like IoT, AIm, SH. / Al llarg dels últims anys, els sistemes multi-agent (SMA) han demostrat ser un paradigma potent i versàtil, amb un gran potencial a l'hora de resoldre problemes complexos en entorns dinàmics i distribuïts. Aquest potencial no es deu principalment a les seues característiques individuals (com són la seua autonomia, la seua capacitat de percepció, reacció i de raonament), sinó que també a la capacitat de comunicació i cooperació a l'hora d'aconseguir un objectiu. De fet, la seua capacitat social és la que més crida l'atenció, és aquest comportament social el que dota de potencial als sistemes multi-agent. Aquestes característiques han fet dels SMA, l'eina d'intel·ligència artificial (IA) més utilitzada per al disseny d'entorns virtuals intel·ligents (IVE), els quals són eines de simulació complexa basades en agents. No obstant això, els IVE incorporen restriccions físiques (com gravetat, forces, fregaments, etc.), així com una representació 3D del que es vol simular. Així mateix, aquestes eines no són només utilitzades per a la realització de simulacions. Amb l'aparició de noves aplicacions com \emph{Internet of Things (IOT)}, \emph{Ambient Intelligence (AmI)}, robot assistents, entre altres, les quals estan en contacte directe amb l'ésser humà. Aquest contacte planteja nous reptes a l'hora d'interactuar amb aquestes aplicacions. Una nova forma d'interacció que ha despertat un especial interès, és el que es relaciona amb la detecció i/o simulació d'estats emocionals. Això ha permès que aquestes aplicacions no només puguen detectar els nostres estats emocionals, sinó que puguen simular i expressar les seues pròpies emocions millorant així l'experiència de l'usuari amb aquestes aplicacions. Per tal de millorar l'experiència humà-màquina, aquesta tesi planteja com a objectiu principal la creació de models emocionals socials, els quals podran ser utilitzats en aplicacions MAS permetent als agents interpretar i/o emular diferents estats emocionals i, a més, emular fenòmens de contagi emocional. Aquests models permetran realitzar simulacions complexes basades en emocions i aplicacions més realistes en dominis com IoT, AIM, SH. / Rincón Arango, JA. (2018). Social Emotions in Multiagent Systems [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/98090 / Compendio

In nature, many social species demonstrate collective behavior ranging from coordinated motion in flocks of birds and schools of fish to collective decision making in humans. Such distinct behavioral patterns at the group level are the consequence of local interactions among the individuals. We can learn from these biological systems, which have successfully evolved to operate in noisy and fault-prone environments, and understand how these complex interactions can be applied to engineered systems where robustness remains a major challenge. This dissertation addresses a two-scale approach to study these interactions- one in larger scale, where we are interested in the information exchange in a group and how it enables the group to reach a common decision, and the other in a smaller scale, where we are focused in the presence and directionality in the information exchange in a pair of individuals. To understand the interactions at large scale, we use a graph theoretic approach to study consensus or synchronization protocols over two types of biologically-inspired interaction networks. The first network captures both collaborative and antagonistic interactions and the second considers the impact of dynamic leaders in presence of purely collaborative interactions. To study the interactions at small scale, we use an information theoretic approach to understand the directionality of information transfer in a pair of individual using a real-world data-set of animal group motion. Finally, we choose the issue of same-sex marriage in the United States to demonstrate that collective opinion formation is not only a result of negotiations among the individuals, but also reflects inherent spatial and political similarities and temporal delays. / Ph. D. / Social animals exhibit coordination often referred to as ‘collective behavior’ that results from interactions among individuals in the group. This dissertation has demonstrated how interactions can be studied using mathematical modeling, at the same time reveals that real-world interactions are even more complex. Mathematical modeling provides capabilities to introduce biologically inspired phenomena, for example, the implementation of both friendly and hostile interactions that may coexist; and the presence of leader-follower interactions, which is another determinant of collective behavior. The results may find applications in real-world networks, where hostile and leader-follower interactions are prevalent, for example international relations, online social media sites, neural networks, and biologically inspired robotic interactions. We further extend our knowledge regarding interactions by choosing real world systems, the first to understand human decision making, for example in public policies; and the second in animal group motion. Public policy adoption is generally complex and depends on a variety of factors, and no exception is same-sex marriage in the United States which has been a volatile subject for decades until nationwide legalization on June 26, 2015. We target this timely issue and explore the opinion formation of senators and state-law as they evolve over two decades to identify factors that may have affected the dynamics. We unravel geographic proximity, and state-government ideology are significant contributors to the senators opinions and the state-law adoption. Moreover, we build a state-law adoption model which captures these driving factors, and demonstrates predictive power. This study will help to understand or model other public policies that propagate via social and political change. Next we choose the system of bats to investigate navigational leadership roles as they fly in pairs from direct observation of bat swarms in flight. Pairs of bats were continuously tracked in a mountain cave in Shandong Province, China, from which three-dimensional path points are extracted and converted to one-dimensional curvature time series. The study allows us to answer the question of whether individuals fly independently of each other or interact to plan flight paths.

This thesis implements a novel distributed, deterministic algorithm for as few unmanned agents as possible to detect and cover as many static targets of unknown location as possible. This algorithm, Pruning-Perception-Decision (PPD), strikes the balance of exploration versus exploitation by maximizing the number of targets covered by each agent. Agents can cover only one grouping of targets at a time and continue exploring until they find an uncovered target. In doing so, agents' search area is discretized into a grid, where the average percent coverage of each tile is monitored with respect to each agent's field-of-view. Once all agents are covering targets and the average area-coverage value stabilizes, PPD terminates. Alternately, if all targets are found and there exist additional explorer agents, PPD terminates when a time threshold is reached. Simulations show that implementing PPD results in faster convergence than the state-of-the-art by nearly an order of magnitude as well as improved target coverage. Additionally, results of a second demonstration suggest that PPD could be applied to targets appearing and disappearing. / Master of Science / In this thesis, a new process is proposed that uses as few agents as possible to detect and cover as many target points as possible; such configurations can be applied to defense, search-and-rescue, and environmental relief missions, to name a few. This thesis focuses on a scenario where autonomous agents aim to locate and cover as many unknown targets in the world as possible using as few agents as possible. To reach this goal, a new algorithm is formulated, Pruning-Perception-Decision (PPD), which involves detecting and covering static targets whose number and location are unknown to agents in advance. Specifically, some of these agents travel to unvisited regions of a square world to find targets while remaining agents cover known targets. In most cases, agents will find and cover all targets. When there are fewer agents than targets, however, agents may cover the the same number of targets as there are agents, at least, or may cover all targets in the search space, at most. The number of targets covered in this case depends on how spread apart the targets are in the world with respect to agents' field-of-view. Otherwise, when there are equal numbers of agents and targets in the search space, agents are guaranteed to find and cover all targets. In simulations, PPD was shown to perform significantly better than a similar state-of-the-art algorithm. A second demonstration shows that PPD may also be applied when targets appear and disappear.