• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 117
  • 48
  • 35
  • 8
  • 6
  • 3
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 261
  • 261
  • 248
  • 59
  • 55
  • 36
  • 36
  • 31
  • 31
  • 30
  • 30
  • 27
  • 26
  • 25
  • 25
  • 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.
241

Une approche multi-agents pour la composition de services Web fondée sur la confiance et les réseaux sociaux / A Multi-Agents Approach for Web service Composition based on Trust and Social Networks

Louati, Amine 13 October 2015 (has links)
Dans cette thèse, nous nous intéressons aux problèmes de découverte, de sélection et de composition de services. L'objectif est de satisfaire une requête complexe d'un demandeur de services. Pour ce faire, nous proposons une approche multi-agents fondée sur la confiance et les réseaux sociaux. Nous définissions un modèle de confiance en tant que concept compositionnel formé de quatre composantes: une composante sociale, une composante d'expertise, une composante de recommandation et une composante de coopération. La composante sociale juge s'il est intéressant de suivre un fournisseur avant d'utiliser ses services. La composante d'expertise estime si un service se comporte bien et comme prévu. La composante de recommandation vérifie si un agent est pertinent ou pas et si l'on peut compter sur ses recommandations. La composante de coopération permet aux agents de décider avec qui interagir dans une composition de services. Nous proposons un algorithme distribué pour la découverte de services utilisant la confiance entre les agents ainsi que les systèmes de références dans les réseaux sociaux. Nous développons également une nouvelle méthode s'appuyant sur un modèle probabiliste pour inférer la confiance entre les agents non adjacents tout en tenant compte des rôles des agents intermédiaires. Finalement, nous présentons un processus original de formation de coalitions qui est incrémental, dynamique et recouvrant pour une composition de services dans les réseaux sociaux. Les résultats expérimentaux montrent que nos approches multi-agents sont efficaces, plus performants que les approches similaires existantes et peuvent offrir des résultats plus dignes de confiance à faible coût de communications. / This thesis deals with service discovery, selection and composition problems. The aim is to fulfill a complex requester query. To do that, we propose a multi-agent approach based on trust and social networks. We define a trust model as a compositional concept that includes social, expert, recommender and cooperation-based component. The social-based component judges whether or not the provider is worthwhile pursuing before using his services. The expert-based component estimates whether or not the service behaves well and as expected. The recommender-based component checks whether or not an agent is reliable and if we can rely on its recommendations. The cooperation-based component allows agents to decide with whom to interact in a service composition. We propose a distributed algorithm for service discovery using trust between agents and referral systems in social networks. We also develop a new method based on a probabilistic model to infer trust between non adjacent agents while taking into account roles of intermediate agents. Finally, we present an original coalition formation process which is incremental, dynamic and overlapping for service composition in social networks. %In particular, our coalition formation process engaging self-interested agents is incremental, dynamic and overlapping. Experimental results show that our multi-agents approaches are efficient, outperforms existing similar ones and can deliver more trustworthy results at low cost of communications.
242

Modelování rozhodovacích sítí / Modelling of decision-making networks

Šilar, Pavel January 2011 (has links)
Delegative democracy is a new concept of democratic governance. It is meant as a new system of trust among people. It is derived from principles of direct democracy and presents only minimal form of representation. The voter is not forced to cast his vote directly, but it can be transferred to a delegate. Delegative democracy is based on openness, awareness and trust. It is still only a concept and for real application it has to face rising critics. Main issues are high costs, threat of populism and corruption and overall complexity. Agent-based modelling is chosen to test the validity of delelagative democracy principles. It is suitable for studying social phenomena such as democratic governance. Agent-based models apply a "new kind" of artificial intelligence -- a dynamic system composed of individual and autonomous units -- agents -- which interact within the environment. Universal methodology called Agentology is used to propose a new agent-based model. This methodology is composed of subsequent steps. These steps cover initial analysis, conceptual and technological proposal and development of the model itself. Assessment of delegative democracy principles is achieved with data acquired from the agent-based model. Delegative democracy is less effective for small and cooperative system than direct democracy. If more voters are delegating, this effectiveness decreases even more. This conclusion is based on initial parameters of the model. Delegating voters count is indeed a relevant parameter whereas total voters count is not. The model has its basic predicative value and is open to further elaboration.
243

Architecture distribuée interopérable pour la gestion des projets multi-sites : application à la planification des activités de production / A distributed and interoperable architecture to manage multi-site projects : application to the planning of production activities

Ishak, Karim 04 November 2010 (has links)
Aujourd’hui, la production est souvent multi-site car les entreprises se recentrent sur leurs cœurs de métiers. Dans ce contexte, la gestion des projets est une tâche difficile car il faut prendre en compte la distribution de la décision et l’hétérogénéité qui peut exister entre les différentes applications de production des partenaires. Les Systèmes Multi-Agents, et notamment le modèle SCEP (Superviseur, Client, Environnement, Producteur), apportent une solution satisfaisante au problème de la distribution de la décision, en instaurant une coopération entre des agents responsables de la gestion des projets client et des agents représentant les sites de production distants. Néanmoins, ce modèle présente des limites à cause de sa faible capacité à communiquer et à coopérer avec des modèles et des systèmes de gestion hétérogènes ainsi qu’à sa difficulté à localiser les nouveaux partenaires. Dans ce mémoire, nous proposons une architecture distribuée et interopérable SCEP-SOA intégrant les concepts du modèle SCEP et ceux du modèle SOA (Service Oriented Architecture) qui offre des mécanismes de mise en relation des partenaires et permet des communications entre des systèmes et des applications hétérogènes. Pour garantir la bonne compréhension des informations échangées entre les partenaires, l’architecture SCEP-SOA met en œuvre une stratégie d’interopérabilité sémantique basée sur l’intégration des ontologies. Cette stratégie s’articule autour d’une ontologie globale et commune utilisée pour l’échange des informations, et des mécanismes de correspondances entre cette ontologie globale et les ontologies locales des partenaires. Cette architecture est illustrée sur un cas d’étude où l’on se focalise sur l’interopérabilité entre des applications dédiées à la planification des projets de fabrication multi-sites. / Today, the production is often multi-site because companies focus on their core competencies. In this context, projects’ management is a difficult task because it must take into account the distribution of the decision and the heterogeneity which can exist between the various production applications of the partners. The Multi-agents systems, in particular the SCEP model (Supervisor, Customer, Environment, Producer), offer a satisfactory solution for the decision distribution problem, by establishing a cooperation between agents responsible of the management of the customer projects and agents representing the remote production sites. Nevertheless, this model presents limits because of its weak ability to communicate and to cooperate with heterogeneous models and management systems, as well as in its difficulty to localize new partners. In this dissertation, we propose a distributed and interoperable architecture, SCEP-SOA, which integrates concepts of the SCEP model and SOA (Service Oriented Architecture) which offers mechanisms for putting in relation various partners and allows communication between heterogeneous systems and applications. To insure the good understanding of the information exchanged between the partners, the SCEP-SOA architecture implements a strategy of semantic interoperability based on the integration of ontologies. This strategy is based on the use of a shared global ontology for information exchange, and on mechanisms of mappings between the global ontology and the partners’ local ontologies. This architecture is illustrated by a study case in which we focus on the interoperability between applications dedicated to the planning of manufacturing multi-sites projects
244

Dynamique et contrôle d'un marché financier avec une approche système multi-agents / Dynamics and control of financial market with a multi-agent system approach

Lucas, Iris 18 July 2018 (has links)
Cette thèse propose une réflexion autour de l'étude des marchés financiers sous le prisme des systèmes complexes.Tout d'abord une description mathématique est proposée pour représenter le processus de prises de décision des agents dès lors où celui-ci bien que représentant les intérêts individuels d'un agent, est également influencé par l'émergence d'un comportement collectif. La méthode est particulièrement applicable lorsque le système étudié est caractérisé par une dynamique non-linéaire. Une application du modèle est proposée au travers de l'implémentation d'un marché artificiel boursier avec une approche système multi-agents. Dans cette application la dynamique du marché est décrite à la fois aux niveaux microscopiques (comportement des agents) et macroscopique (formation du prix). Le processus de décision des agents est défini à partir d'un ensemble de règles comportementales reposant sur des principes de logique floue. La dynamique de la formation du prix repose sur une description déterministe à partir des règles d'appariement d'un carnet d'ordres central tel que sur NYSE-Euronext-Paris. Il est montré que le marché artificiel boursier tel qu'implémenté est capable de répliquer plusieurs faits stylisés des marchés financiers : queue de distribution des rendements plus épaisse que celle d'une loi normale et existence de grappes de volatilité (ou volatility clustering).Par la suite, à partir de simulations numériques il est proposé d'étudier trois grandes propriétés du système : sa capacité d'auto-organisation, de résilience et sa robustesse. Dans un premier temps une méthode est introduite pour qualifier le niveau d'auto-organisation du marché. Nous verrons que la capacité d'auto-organisation du système est maximisée quand les comportements des agents sont diversifiés. Ensuite, il est proposé d'étudier la réponse du système quand celui-ci est stressé via la simulation de chocs de marché. Dans les deux analyses, afin de mettre en évidence comment la dynamique globale du système émerge à partir des interactions et des comportements des agents des résultats numériques sont systématiquement apportés puis discutés.Nos résultats montrent notamment qu'un comportement collectif grégaire apparait à la suite d'un choc, et, entraîne une incapacité temporaire du système à s'auto-organiser. Finalement, au travers des simulations numériques il peut être également remarqué que le marché artificiel boursier implémenté est plus sensible à de faibles répétitions répétées qu'à un choc plus important mais unique. / This thesis suggests reflection in studying financial markets through complex systems prism.First, an original mathematic description for describing agents' decision-making process in case of problems affecting by both individual and collective behavior is introduced. The proposed method is particularly applicable when studied system is characterized by non-linear, path dependent and self-organizing interactions. An application to financial markets is proposed by designing a multi¬agent system based on the proposed formalization.In this application, we propose to implement a computational agent-based financial market in which the system is described in both a microscopie and macroscopic levels are proposed. The agents' decision-making process is based on fuzzy logic rules and the price dynamic is purely deten-ninistic according to the basis matching rules of a central order book as in NYSE-Euronext-Paris. We show that, while putting most parameters under evolutionary control, the computational agent- based system is able to replicate several stylized facts of financial time series (distributions of stocks returns showing a heavy tau l with positive excess kurtosis and volatility clustering phenomenon).Thereafter, with numerical simulations we propose to study three system's properties: self-organization, resilience and robustness. First a method is introduced to quantify the degree of selforganization which ernerges in the system and shows that the capacity of self-organization is maximized when the agents' behaviors are heterogeneous. Secondly, we propose to study the system's response when market shock is simulated. in both cases, numerical results are presentedI and analyzed, showing how the global market behavior emerges from specific individual behavior interactions.Our results notably show that the emergence of collective herding behavior when market shock occurs leads to a temporary disruption on the system self-organization. Finaily, numerical simulations highlight that our artificial financial market can be able to absorb strong mono-shock but be lead to the rupture by low but repeated perturbations.
245

Consensus décentralisé de type meneur/suiveur pour une flotte de robots coopératifs soumis à des contraintes temporelles / Decentralized leader-follower consensus for multiple cooperative robots under temporal constraints

Anggraeni, Pipit 11 June 2019 (has links)
Un groupe de robots collaboratifs peut gérer des tâches qui sont difficiles, voire impossibles, à accomplir par un seul. On appelle un ensemble de robots coopérant un système multi-agents (SMA). L'interaction entre agents est un facteur clé dans la commande coopérative qui pose d'importants défis théoriques et pratiques. L'une des tâches du contrôle coopératif est le consensus dont l'objectif est de concevoir des protocoles de commande afin de parvenir à un accord entre leurs états respectifs. Cette thèse améliore la navigation pour les SMA, tout en tenant compte de certaines contraintes pratiques (modèle du robot et contraintes temporelles) dans la conception de contrôleurs coopératifs pour chaque agent, de manière décentralisée. Dans cette thèse, deux directions sont étudiées. D'une part, le taux de convergence est une spécification de performance importante pour la conception du contrôleur pour un système dynamique. La convergence rapide est toujours recherchée pour améliorer les performances et la robustesse. La plupart des algorithmes de consensus existants se concentrent sur la convergence asymptotique, où le temps d'établissement est infini. Cependant, de nombreuses applications nécessitent une convergence rapide généralement caractérisée par une stratégie de commande à temps fini. De plus, la commande à temps fini autorise certaines propriétés intéressantes, mais le temps de stabilisation dépend des conditions initiales des agents. L'objectif ici est de concevoir un protocole de consensus leader-follower à temps fixe pour les SMA décrits en temps continu. Ce problème est étudié en utilisant la théorie de la stabilisation à temps fixe, qui garantit que le temps de stabilisation est borné quelles que soient les conditions initiales. Les contrôleurs et les observateurs à modes glissants sont conçus pour que chaque agent résolve le problème du consensus à temps fixe lorsque le leader est dynamique. D'autre part, par rapport aux systèmes à temps continu, le problème du consensus dans un cadre à temps discret convient mieux aux applications pratiques en raison de la limitation des ressources de calcul pour chaque agent. Le modèle de commande prédictive (MPC) permet de gérer les contraintes de commande et d'état des systèmes. Dans cette thèse, cette méthode est appliquée pour traiter le problème du consensus en temps discret en laissant chaque agent résoudre, à chaque étape, un problème de commande optimale contraint impliquant uniquement l'état des agents voisins. Les performances de suivi sont également améliorées dans cette thèse en ajoutant de nouveaux termes à partir du MPC classique. Les contrôleurs proposés sont simulés et implémentés sur un groupe composé de plusieurs robots réels en utilisant ROS (Robotic Operating System). Dans cette thèse, quelques solutions correspondant au problème de la connexion entre plusieurs robots mobiles de manière décentralisée, du réglage des périodes d'échantillonnage et des paramètres de contrôle sont également abordées. / Nowadays, robots have become increasingly important to investigate hazardous and dangerous environments. A group of collaborating robots can often deal with tasks that are difficult, or even impossible, to be accomplished by a single robot. Multiple robots working in a cooperative manner is called as a Multi-Agent System (MAS). The interaction between agents to achieve a global task is a key in cooperative control. Cooperative control of MASs poses significant theoretical and practical challenges. One of the fundamental topics in cooperative control is the consensus where the objective is to design control protocols between agents to achieve a state agreement. This thesis improves the navigation scheme for MASs, while taking into account some practical constraints (robot model and temporal constraints) in the design of cooperative controllers for each agent, in a fully decentralized way. In this thesis, two directions are investigated. On one hand, the convergence rate is an important performance specification to design the controller for a dynamical system. As an important performance measure for the coordination control of MASs, fast convergence is always pursued to achieve better performance and robustness. Most of the existing consensus algorithms focus on asymptotic convergence, where the settling time is infinite. However, many applications require a high speed convergence generally characterized by a finite-time control strategy. Moreover, finite-time control allows some advantageous properties but the settling time depend on the initial states of agents. The objective here is to design a fixed-time leader-follower consensus protocol for MASs described in continuous-time. This problem is studied using the powerful theory of fixed-time stabilization, which guarantee that the settling time is upper bounded regardless to the initial conditions. Sliding mode controllers and sliding mode observers are designed for each agent to solve the fixed-time consensus tracking problem when the leader is dynamic. On the other hand, compared with continuous-time systems, consensus problem in a discrete-time framework is more suitable for practical applications due to the limitation of computational resources for each agent. Model Predictive Control (MPC) has the ability to handle control and state constraints for discrete-time systems. In this thesis, this method is applied to deal with the consensus problem in discrete-time by letting each agent to solve, at each step, a constrained optimal control problem involving only the state of neighboring agents. The tracking performances are also improved in this thesis by adding new terms in the classical MPC technique. The proposed controllers will be simulated and implemented on a team of multiple Mini-Lab Enova Robots using ROS (Robotic Operating System) which is an operating system for mobile robots. ROS provides not only standard operating system services but also high-level functionalities. In this thesis, some solutions corresponding to problem of connection between multiple mobile robots in a decentralized way for a wireless robotic network, of tuning of the sampling periods and control parameters are also discussed.
246

Übertragung von Prinzipien der Ameisenkolonieoptimierung auf eine sich selbst organisierende Produktion

Bielefeld, Malte 12 July 2019 (has links)
Die Bachelorarbeit behandelt die Themen der Selbstorganisation in Produktionssystemen im Kontext von Industrie 4.0. Dabei wird gezeigt, wie man mithilfe von einer Ameisenkolonieoptimierung die Reihenfolgeplanung organisieren kann.:Abbildungsverzeichnis Tabellenverzeichnis Formelverzeichnis 1. Einleitung 1.1. Motivation 1.2. Ziele 1.3. Vorgehensweise 2. Sich selbst organisierende Produktionen 2.1. Begriffserklärung 2.2. Stand der Technik 2.3. Reihenfolgeplanung als ein Problem der Selbstorganisation 2.3.1. Begriffserklärung 2.3.2. Stand der Technik 2.3.3. Umsetzung in einer Selbstorganisation 3. Ameisenkolonieoptimierung 3.1. Begriffserklärung 3.2. Allgemeine Umsetzung 3.3. Konkrete Umsetzungen 3.4. Vor- und Nachteile 3.5. Anwendungsbeispiele 4. Entwicklung einer Ameisenkolonieoptimierung für ein sich selbst organisierendes Produktionssystem 4.1. Analyse des gegebenen sich selbst organisierenden Produktionssystems 4.1.1. Grobanalyse des Systems 4.1.2. Feinanalyse der bisherigen Reihenfolgeplanung 4.2. Entwurf der Reihenfolgeplanung durch Prinzipien der Ameisenkolonieoptimierung 4.3. Implementierung der Prinzipien der Ameisenkolonieoptimierung 5. Empirische Untersuchung der implementierten Ameisenkolonieoptimierung 5.1. Beschreibung der gegebenen Produktionsdaten 5.2. Szenarienuntersuchung zur Funktionsfähigkeit 5.2.1. Schichtwechselszenario 5.2.2. Abnutzungs- und Wartungsszenario 5.2.3. Vergleichsszenario 5.3. Untersuchung hinsichtlich der Laufzeit und des Speicherbedarfs 5.3.1. Laufzeit 5.3.2. Speicherbedarf 6. Zusammenfassung und Ausblick 6.1. Zusammenfassung 6.2. Ausblick Quellenverzeichnis / The bachelor thesis is about self organization in production systems in the context of Industry 4.0. Its about ant colony optimization for scheduling in the production planning.:Abbildungsverzeichnis Tabellenverzeichnis Formelverzeichnis 1. Einleitung 1.1. Motivation 1.2. Ziele 1.3. Vorgehensweise 2. Sich selbst organisierende Produktionen 2.1. Begriffserklärung 2.2. Stand der Technik 2.3. Reihenfolgeplanung als ein Problem der Selbstorganisation 2.3.1. Begriffserklärung 2.3.2. Stand der Technik 2.3.3. Umsetzung in einer Selbstorganisation 3. Ameisenkolonieoptimierung 3.1. Begriffserklärung 3.2. Allgemeine Umsetzung 3.3. Konkrete Umsetzungen 3.4. Vor- und Nachteile 3.5. Anwendungsbeispiele 4. Entwicklung einer Ameisenkolonieoptimierung für ein sich selbst organisierendes Produktionssystem 4.1. Analyse des gegebenen sich selbst organisierenden Produktionssystems 4.1.1. Grobanalyse des Systems 4.1.2. Feinanalyse der bisherigen Reihenfolgeplanung 4.2. Entwurf der Reihenfolgeplanung durch Prinzipien der Ameisenkolonieoptimierung 4.3. Implementierung der Prinzipien der Ameisenkolonieoptimierung 5. Empirische Untersuchung der implementierten Ameisenkolonieoptimierung 5.1. Beschreibung der gegebenen Produktionsdaten 5.2. Szenarienuntersuchung zur Funktionsfähigkeit 5.2.1. Schichtwechselszenario 5.2.2. Abnutzungs- und Wartungsszenario 5.2.3. Vergleichsszenario 5.3. Untersuchung hinsichtlich der Laufzeit und des Speicherbedarfs 5.3.1. Laufzeit 5.3.2. Speicherbedarf 6. Zusammenfassung und Ausblick 6.1. Zusammenfassung 6.2. Ausblick Quellenverzeichnis
247

Analyses and Scalable Algorithms for Byzantine-Resilient Distributed Optimization

Kananart Kuwaranancharoen (16480956) 03 July 2023 (has links)
<p>The advent of advanced communication technologies has given rise to large-scale networks comprised of numerous interconnected agents, which need to cooperate to accomplish various tasks, such as distributed message routing, formation control, robust statistical inference, and spectrum access coordination. These tasks can be formulated as distributed optimization problems, which require agents to agree on a parameter minimizing the average of their local cost functions by communicating only with their neighbors. However, distributed optimization algorithms are typically susceptible to malicious (or "Byzantine") agents that do not follow the algorithm. This thesis offers analysis and algorithms for such scenarios. As the malicious agent's function can be modeled as an unknown function with some fundamental properties, we begin in the first two parts by analyzing the region containing the potential minimizers of a sum of functions. Specifically, we explicitly characterize the boundary of this region for the sum of two unknown functions with certain properties. In the third part, we develop resilient algorithms that allow correctly functioning agents to converge to a region containing the true minimizer under the assumption of convex functions of each regular agent. Finally, we present a general algorithmic framework that includes most state-of-the-art resilient algorithms. Under the strongly convex assumption, we derive a geometric rate of convergence of all regular agents to a ball around the optimal solution (whose size we characterize) for some algorithms within the framework.</p>
248

[en] AUTONOMOUS SYSTEMS EXPLAINABLE THROUGH DATA PROVENANCE / [pt] SISTEMAS AUTÔNOMOS EXPLICÁVEIS POR MEIO DE PROVENIÊNCIA DE DADOS

TASSIO FERENZINI MARTINS SIRQUEIRA 25 June 2020 (has links)
[pt] Determinar a proveniência dos dados, isto é, o processo que levou a esses dados, é vital em muitas áreas, especialmente quando é essencial que os resultados ou ações sejam confiáveis. Com o crescente número de aplicações baseadas em inteligência artificial, criou-se a necessidade de torná-las capazes de explicar seu comportamento e responder às suas decisões. Isso é um desafio, especialmente se as aplicações forem distribuídas e compostas de vários agentes autônomos, formando um Sistema Multiagente (SMA). Uma maneira fundamental de tornar tais sistemas explicáveis é rastrear o comportamento do agente, isto é, registrar a origem de suas ações e raciocínios, como em uma depuração onisciente. Embora a ideia de proveniência já tenha sido explorada em alguns contextos, ela não foi extensivamente explorada no contexto de SMA, deixando muitas questões para serem compreendidas e abordadas. Nosso objetivo neste trabalho é justificar a importância da proveniência dos dados para SMA, discutindo quais perguntas podem ser respondidas em relação ao comportamento do SMA, utilizando a proveniência e ilustrando, através de cenários de aplicação, os benefícios que a proveniência proporciona para responder a essas questões. Este estudo envolve a criação de um framework de software, chamado FProvW3C, que suporta a coleta e armazenamento da proveniência dos dados produzidos pelo SMA, que foi integrado a plataforma BDI4JADE (41), formando o que denominamos de Prov-BDI4JADE. Por meio desta plataforma, utilizando exemplos de sistemas autônomos, demostramos com rigor que, o uso da proveniência de dados em SMA é uma solução sólida, para tornar transparente o processo de raciocínio e ação do agente. / [en] Determining the data provenance, that is, the process that led to those data, is vital in many areas, especially when it is essential that the results or actions be reliable. With the increasing number of applications based on artificial intelligence, the need has been created to make them capable of explaining their behavior and be responsive to their decisions. This is a challenge especially if the applications are distributed, and composed of multiple autonomous agents, forming a Multiagent System (MAS). A key way of making such systems explicable is to track the agent s behavior, that is, to record the source of their actions and reasoning, as in an omniscient debugging. Although the idea of provenance has already been explored in some contexts, it has not been extensively explored in the context of MAS, leaving many questions to be understood and addressed. Our objective in this work is to justify the importance of the data provenance to MAS, discussing which questions can be answered regarding the behavior of MAS using the provenance and illustrating, through application scenarios, to demonstrate the benefits that provenance provides to reply to these questions. This study involves the creation of a software framework, called FProvW3C, which supports the collects and stores the provenance of the data produced by the MAS, which was integrated with the platform BDI4JADE (41), forming what we call Prov-BDI4JADE. Through this platform, using examples of autonomous systems, we have rigorously demonstrated that the use of data provenance in MAS is a solid solution to make the agent’s reasoning and action process transparent.
249

Multi-robot coordination and planning with human-in-the-loop under STL specifications : Centralized and distributed frameworks / Multi-robotkoordination och planering med mänsklig interaktion under STL-specifikationer : Centraliserade och distribuerade ramverk

Zhang, Yixiao January 2023 (has links)
Recent urbanization and industrialization have brought tremendous pressure and challenges to modern autonomous systems. When considering multiple complex tasks, cooperation and coordination between multiple agents can improve efficiency in a system. In real-world applications, multi-agent systems (MAS) are widely used in various fields, such as robotics, unmanned aerial systems, autonomous vehicles, distributed sensor networks, etc. Unlike traditional MAS systems based on pre-defined algorithms and rules, a special human-in-loop (HIL) based MAS involves human interactions to enhance the system’s adaptability for special scenarios, as well as apply human preferences for robot control. However, existing HIL strategies are primarily based on human involvement at a low level, such as mixed-initiative control and mixed-agent scenarios with both human-driven and intelligent robots. There are fewer investigations on applying HIL in high-level coordination. In particular, designing a coordination strategy for multi-task multi-agent scenarios, which can also deal with real-time human commands, will be one of the key topics of this Master’s thesis project. In this thesis work, different kinds of tasks described by signal temporal logic (STL) are created for agents, which can be enforced by control barrier function (CBF) constraints. Both centralized and distributed frameworks are designed for agent coordination. In detail, the centralized strategy is developed for machine-to-infrastructure (M2I) communication, by using the nonlinear model predictive control (NMPC) method to obtain collision-free trajectories. The distributed strategy utilizing graph theory is proposed for machine-to-machine (M2M), in order to reduce computation time by offloading. Most importantly, a HIL model is generated for both frameworks to apply online human commands to the coordination, with a novel task allocation protocol. Simulations and experiments are carried out on both Matlab and Python-based ROS simulators, to show that proposed frameworks can achieve obvious performance advantages in safety, smoothness, and stability for task completion. Numerical results are provided to validate the feasibility and applicability of our algorithms. / Den senaste urbaniseringen och industrialiseringen har medfört enormt tryck och utmaningar för moderna autonoma system. Vid beaktande av flera komplexa uppgifter kan samarbete och samordning mellan flera agenter förbättra effektiviteten i ett system. I verkliga tillämpningar används multiagent-system (MAS) i stor utsträckning inom olika områden, såsom robotik, obemannade luftfarkoster, autonoma fordon, distribuerade sensorsystem etc. Till skillnad från traditionella MAS-system baserade på fördefinierade algoritmer och regler, innebär ett särskilt människa-i-loop (HIL)-baserat MAS mänsklig interaktion för att förbättra systemets anpassningsförmåga till speciella scenarier samt anpassa mänskliga preferenser för robotstyrning. Emellertid är befintliga HIL-strategier främst baserade på mänsklig inblandning på en låg nivå, såsom mixad-initiativkontroll och mixade agentscenarier med både människa-drivna och intelligenta robotar. Det finns färre undersökningar om att tillämpa HIL på högnivåkoordination. Särskilt att utforma en koordineringsstrategi för fleruppgiftsfleragent-scenarier, som också kan hantera mänskliga kommandon i realtid, kommer att vara ett av huvudämnena för detta masterprojekt. I detta examensarbete skapas olika typer av uppgifter beskrivna av signaltemporallogik (STL) för agenter, som kan upprätthållas genom styrbarriärfunktions (CBF) -begränsningar. Både centraliserade och distribuerade ramverk utformas för agentkoordination. Mer specifikt utvecklas den centraliserade strategin för maskin-till-infrastruktur (M2I)-kommunikation genom att använda icke-linjär modellprediktiv reglering (NMPC) för att erhålla kollisionsfria trajektorier. Den distribuerade strategin med användning av grafteori föreslås för maskin-till-maskin (M2M) för att minska beräkningstiden genom avlastning. Viktigast av allt genereras en HIL-modell för båda ramverken för att tillämpa online-mänskliga kommandon på koordinationen med en ny protokoll för uppgiftstilldelning. Simuleringar och experiment utförs på både Matlab och Python-baserade ROS-simulatorer för att visa att de föreslagna ramverken kan uppnå tydliga prestandafördelar när det gäller säkerhet, smidighet och stabilitet för uppgiftsslutförande. Numeriska resultat presenteras för att validera genomförbarheten och tillämpligheten hos våra algoritmer.
250

Collaborative applications used in a wireless environment at sea for use in Coast Guard Law Enforcement and Homeland Security missions

Klopson, Jadon E., Burdian, Stephen V. 03 1900 (has links)
Approved for public release, distribution is unlimited / This thesis analyzes the potential impact of incorporating wireless technologies, specifically an 802.11 mesh layer architecture and 802.16 Orthogonal Frequency Division Multiplexing, in order to effectively and more efficiently transmit data and create a symbiotic operational picture between Coast Guard Cutters, their boarding teams, Coast Guard Operation Centers, and various external agencies. Two distinct collaborative software programs, Groove Virtual Office and the Naval Postgraduate School's Situational Awareness Agent, are utilized over the Tactical Mesh and OFDM network configurations to improve the Common Operating Picture of involved units within a marine environment to evaluate their potential impact for the Coast Guard. This is being done to increase the effectiveness and efficiency of Coast Guard units while they carry out their Law Enforcement and Homeland Security Missions. Through multiple field experiments, including Tactical Network Topology and nuclear component sensing with Lawrence Livermore National Laboratory, we utilize commercial off the shelf (COTS) equipment and software to evaluate their impact on these missions. / Lieutenant Commander, United States Coast Guard / Lieutenant, United States Coast Guard

Page generated in 0.3432 seconds