Дисертації: "Distributed artificial intelligence and multi-Agent systems"

1

Hu, Yuebing, and 胡跃冰. "Consensus control of multi-agent systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B4658657X.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Malheiro, Maria Benedita Campos Neves. "Methodologies for Belief Revision in Multi-agent Systems." Phd thesis, Instituições portuguesas -- UP-Universidade do Porto -- -Faculdade de Engenharia -- -Departamento de Engenharia Electrotécnica e de Computadores, 1999. http://dited.bn.pt:80/29534.

Повний текст джерела

Анотація:

The goal of this thesis is twofold: first, we want to present the distributed belief accommodation and revision model for multi-agent systems that has been developed and, second, we wish to show its applicability to an appropriate domain. The Distributed Belief Accommodation & Revision model, called DeBAteR model, was developed for co-operative heterogeneous multi-agent systems used to model inherently dynamic distributed problems. In these systems, although the agents are able to detect changes both in the environment and in the problem specifications, each agent has only a partial view of the global picture. As a result the information that represents the current state of affairs is dynamic, incomplete and sometimes uncertain. This non-monotonic kind of data is called beliefs ? a belief is a piece of data that is held as correct as long as no contradicting evidence is found or presented. Each agent is expected to include an assumption based truth maintenance module for representing properly this type of data. Our main effort was concentrated on the task of maintaining the system's information, which consists of updating, revising and accommodating the represented beliefs. Belief updating is necessary for including the changes detected by the agents both in the environment and/or in the problem specifications. Belief revision is essential for solving the inconsistencies detected among the represented beliefs. Belief accommodation and revision is crucial for integrating the multiple disparate perspectives regarding the same data items, which may occur whenever there is overlap of expertise domains between the agents. In order to solve the information conflicts that result from the detection of inconsistencies between distinct beliefs or within multi-perspective beliefs we conceived the DeBATeR model. The DeBAteR is fully distributed, provides individual belief autonomy and is made of two methodologies: the pro-active belief accommodation and revision methodology and the delayed belief revision methodology. Whilst the first methodology is used to solve domain independent conflicts, the second methodology was devised for solving domain dependent conflicts. Both methodologies use argumentation for, in the case of the domain independent conflicts, choosing the most credible perspective between the existing multiple perspectives of a belief, and, in the case of the domain dependent conflicts, finding the best alternative belief support set for the affected concepts. These methodologies are distributed and their scope may be internal or collective. The DeBAteR model main contributions are: (i) the pro-active methodology conceived for solving domain independent conflicts and (ii) the capability, not only to represent and maintain individual beliefs and joint beliefs, but also to accommodate, rationally maintain and make use of multi-perspective beliefs. Finally, we describe the developed decision support multi-agent system for choosing adequate project locations, called DIPLOMAT ? Dynamic and Interactive Project Location Test bed, which has the ability of accommodating and revising the represented beliefs according to the DeBAteR model methodologies.
O objectivo desta dissertação é duplo: por um lado, pretendemos dar a conhecer o modelo de revisão e acomodação de crenças para sistemas multi-agente por nós desenvolvido e, por outro, procuramos ilustrar a sua validade descrevendo a aplicação que realizámos. O modelo, designado DeBAteR ? Distributed Belief Accommodation & Revision, destina-se a sistemas multi-agente cooperativos e heterogéneos que modelam problemas inerentemente distribuídos e dinâmicos. Neste tipo de sistemas, a informação que representa o ambiente é dinâmica (os agentes possuem a capacidade de constatar alterações no ambiente e/ou nas condições do problema) e, muitas vezes, incompleta (os agentes possuem visões parcelares da realidade) e/ou incerta. Este tipo de informação, de carácter não definitivo, designa-se por crenças ? uma crença é uma convicção tida como correcta enquanto não for posta em causa por alguma evidência. Cada agente, a fim de representar e manipular crenças, foi enriquecido com um módulo específico de manutenção de consistência baseado em suposições. O nosso esforço concentrou-se na tarefa de manutenção (actualização, revisão e acomodação) da informação do sistema. A actualização de crenças é essencial para incorporar as alterações que os agentes detectam no ambiente e/ou nas condições do problema. A revisão de crenças é indispensável para resolver inconsistências (conflitos) entre as crenças representadas. A acomodação e revisão simultânea de crenças é imprescindível para a integração das múltiplas perspectivas díspares que surgem em relação a um mesmo item de informação (crenças pluri-perspectiva) quando existe sobreposição de domínios de especialidade entre os agentes. Para tentar solucionar estes conflitos entre crenças concebemos um modelo distribuído que assegura autonomia individual de crença. O modelo de acomodação e revisão de crenças DeBAteR é composto por duas metodologias: a metodologia pró-activa de acomodação e revisão de crenças pluri-perspectiva e a metodologia retardada de revisão de crenças. A primeira, destina-se a resolver conflitos independentes do domínio e a segunda destina-se à resolução de conflitos dependentes do domínio. Estas metodologias são suportadas quase integralmente por um sistema de argumentação que procura, no caso dos conflitos independentes do domínio, escolher a perspectiva mais credível e, no caso dos conflitos dependentes do domínio, encontrar o melhor conjunto alternativo de suporte para os conceitos afectados. Esta actividade é descentralizada e pode decorrer quer no âmbito intra-agente, quer no âmbito inter-agente. É ainda de realçar: (i) o carácter pró-activo da resolução dos conflitos independentes do domínio (crenças pluri-perspectiva) e (ii) a capacidade de, não só, representar e manter crenças de âmbito individual (crenças suportadas por apenas um agente) e crenças conjuntas (crenças suportadas por vários agentes), mas também, de sintetizar, manter racionalmente e utilizar crenças pluri-perspectiva. Por último, descrevemos o sistema multi-agente de apoio à decisão no domínio da localização de empreendimentos desenvolvido, denominado DIPLOMAT ? Dynamic and Interactive Project Location Test bed, o qual possui a capacidade de acomodar e rever crenças de acordo com as metodologias concebidas no âmbito do modelo DeBAteR.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Qi, Dehu. "Multi-agent systems : integrating reinforcement learning, bidding and genetic algorithms /." free to MU campus, to others for purchase, 2002. http://wwwlib.umi.com/cr/mo/fullcit?p3060133.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Gandon, Fabien. "Distributed artificial intelligence and knowledge management : ontologies and multi-agent systems for a corporate semantic web." Nice, 2002. http://www.theses.fr/2002NICE5773.

Повний текст джерела

Анотація:

This work concerns multi-agents systems for the management of a corporate semantic web based on an ontology. It was carried out in the context of the European project CoMMA focusing on two application scenarios: support technology monitoring activities and assist the integration of a new employee to the organisation. Three aspects were essentially developed in this work: the design of a multi-agents architecture supporting both scenarios, and the organisational top-down approach followed to identify the societies, the roles and the interactions of agents. The construction of the ontology O'CoMMA and the structuring of a corporate memory exploiting semantic Web technologies. The design and implementation of the sub-societies of agents dedicated to the management of the annotations and the ontology and of the protocols underlying these groups of agents, in particular techniques for distributing annotations and queries between the agents
Ce travail concerne les systèmes multi-agents pour la gestion d'un web sémantique d'entreprise basé sur une ontologie. Il a été effectué dans le cadre du projet Européen CoMMA se focalisant sur deux scénarios d'application: l'assistance aux activités de veille technologique et l'aide à l'insertion d'un nouvel employé dans une organisation. Trois aspects ont essentiellement été développés dans ce travail: la conception d'une architecture multi-agents assistant les deux scénarios, et l'approche organisationnelle descendante adoptée pour identifier les sociétés, les rôles et les interactions des agents. La construction de l'ontologie O'CoMMA et la structuration de la mémoire organisationnelle en exploitant les technologies du Web sémantique. La conception et l'implantation (a) des sous-sociétés d'agents chargées de la maintenance des annotations et de l'ontologie et (b) des protocoles supportant ces deux groupes d'agents, en particulier des techniques pour la distribution des annotations et des requêtes entre les agents

Стилі APA, Harvard, Vancouver, ISO та ін.

5

FASANOTTI, Luca. "A Distributed Intelligent Maintenance System based on Artificial Immune Approach and Multi-Agent Systems." Doctoral thesis, Università degli studi di Bergamo, 2016. http://hdl.handle.net/10446/63690.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Wei, Jin. "Modeling and Coordination of interconnected microgrids using distributed artificial intelligence approaches." Thesis, Bourgogne Franche-Comté, 2019. http://www.theses.fr/2019UBFCA021.

Повний текст джерела

Анотація:

À mesure que les sources renouvelables pénètrent dans le système électrique actuel pour atténuer le réchauffement planétaire et la pénurie d’énergie, le concept de microréseau (MG) permet de réduire l’impact de la production intermittente sur le réseau de services publics. Il permet d'améliorer l’automatisation et l’intelligence du réseau électrique avec des caractéristiques plug-and-play. L’intégration d’un plus grand nombre de MG dans un réseau de distribution favorise le développement du réseau intelligent. Leur coordination pourrait conduire à une grande fiabilité du système avec un faible coût, et une forte résistance aux pannes électriques. La réalisation de ces profits repose sur des technologies développées de communication et de stratégies de contrôle.La répartition de la puissance dans les MG répartis tout en coordonnant les éléments au sein de chaque MG exige un contrôle décentralisé. L'approche multiagent permet de modéliser un réseau de MG comme un système physiquement distribué. Cette thèse étudie principalement le contrôle de coordination dans le réseau MG et sa modélisation à base d'agent.. L' objectif est de promouvoir la performance des contrôles en termes d’efficacité et de fiabilité. Deux méthodes sont envisagées pour permettre l’évolutivité du système, y compris la coordination avec les MG voisins et dans la zone de coordination étendue. Une plateforme de simulation est établie pour valider les approches proposées.Les stratégies de contrôle pour la coordination entre les MG et leurs voisins sont proposées afin de maintenir la charge complète et la sécurité tout en minimisant le coût de production. Le contrôle centralisé dans le groupe de coordination est appliqué à la gestion économique de l’énergie. Il utilise une méthode de Newton-Raphson pour répartir la puissance entre les MG voisins en simplifiant la relation entre le coût de production de MG et sa puissance de sortie. Une approche fondée sur le consensus est adoptée pour calculer le flux de puissance du réseau, et les résultats sont comparés avec la capacité maximale sur la ligne pour assurer un fonctionnement sûr. Pour améliorer encore les avantages économiques, l’approximation de la relation entre la puissance de production de MG et le coût de production est améliorée par une autre stratégie fondée sur la notion de marché. Il construit un marché pour le commerce d’électricité avec les voisins. Cette méthode préserve la vie privée de chaque MG. Le calcul du débit de puissance est simplifié pour être proportionnel à la différence d’angle entre les deux extrémités de la ligne de raccordement. Les deux stratégies sont testées sur plusieurs réseaux MG. Leur performance montre que les deux approches sont évolutives et pourraient économiquement compenser le manque d’approvisionnement en charge dans les MG défectueux.Pour la stratégie de contrôle avec une fiabilité et un profit plus élevés, une stratégie de coordination au sein d’une vaste zone sélectionnée de MG est proposée. L’élargissement de la zone de coordination en fonction des MG voisins fournit plus de sources d’énergie au MG. Il assure suffisamment de puissance pour compenser le déséquilibre et offre plus de choix pour la distribution de puissance. La sélection de la zone de coordination est réalisée par un algorithme évolutionnaire distribué. La programmation quadratique dans Gurobi est utilisée pour résoudre le problème de répartition de puissance. Un autre algorithme génétique est également adopté pour résoudre le problème de la répartition optimale de la puissance avec un coût de production quadratique pour la microturbine. La performance de cette stratégie est testée, et les résultats montrent qu’elle a des avantages en termes de fiabilité, d'évolutivité et de profit par rapport aux méthodes centralisées
As renewable sources penetrate the current electrical system to relief global warming and energy shortage, microgrid (MG) emerges to reduce the impact of intermittent generation on the utility grid. Additionally, it improves the automation and intelligence of the power grid with plug-and-play characteristics. Inserting more MGs into a distribution network promotes the development of the smart grid. Thus MG networks existing in the power system are in prospect. Coordinating them could gain a system with high reliability, low cost, and strong resistance to electrical faults. Achieving these profits relies on developed technologies of communication, control strategy, and corresponding algorithms.Dispatching power in distributed MGs while coordinating elements within the individual MG demands a decentralized control system, in which the multi-agent system possesses advantages. It is applied to the MG network for establishing a physically distributed system. Based on the multi-agent system, this thesis mainly studies the coordination control in the MG network and its modeling. It aims at promoting control performance in terms of efficiency, reliability, economic benefit, and scalability. Two methods are considered to enable the system scalability, including the coordination with neighboring MGs and within the extensive coordinating area. A simulation platform is established to validate the proposed approaches.The control strategies for coordination between MGs and their neighbors are proposed to maintain the complete load supply and global security operation while minimizing the generation cost. Centralized control in the coordination group is applied for economic energy management. It uses a Newton-Raphson method to dispatch power among neighboring MGs by simplifying the relationship between MG generation cost and its output power. An average consensus approach is adopted to calculate the caused network power flow, and the results are compared with the maximal capacity on the line to keep safe operation. To further improve the economic benefits, the approximation of the relationship between MG output power and the caused generation cost is improved by an another strategy based on the market concept. It builds a market for neighboring power trade. This method maintains the operation privacy of individual MG. Power flow calculation is simplified to be proportional to the angle difference between the two terminates of the connecting line. Both strategies are tested on several MG network. Their performance shows that both approaches possess scalability and could economically compensate for the lack of load supply in faulted MG.For the control strategy with higher reliability and profit, a coordination strategy within a selected extensive area of MGs is proposed. Expanding the coordination area based on neighboring MGs provides more energy sources to the demanded MG. It ensures enough power to compensate imbalance and offers more choices for power dispatching. The selection of the coordination area is based on a distributed evolutionary algorithm. Quadratic programming in Gurobi is used to solve the power dispatching problem. Another genetic algorithm is also adopted to solve the problem of optimal power dispatching with a quadratic generation cost for microturbine. The performance of this strategy is tested, and the results show that it has comprehensive advantages on reliability, scalability, and profit compared with centralized methods

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Mihal, Bađonski. "Adaptable Java Agents (AJA) — a Tool for Programming o f Multi-Agent Systems." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2004. https://www.cris.uns.ac.rs/record.jsf?recordId=73368&source=NDLTD&language=en.

Повний текст джерела

Анотація:

The main goal of this thesis is the creation o f the tool agent-oriented programming tool AJA. AJA is the acronym for Adaptable Java Agents. AJA consists o f two programming languages:- A higher-level language used for the description of the main agent parts. This language is called HADL, which is the acronym for Higher Agent Definition Language.- A lower-level language used for the programming o f the agent parts defined in HADL. This language is called Java+. It is actually Java enriched with the constructs for accessing higher-level agent parts defined in HADL.A translator from AJA to Java is implemented in the practical part o f the thesis. AJA agents have the following features: - Agent communicates with other agents using a construct called negotiation. The messages sent can be encrypted or digitally signed in order to ensure the security of the system. - Agent possesses adaptable parameters and neural nets that adapt themselves when the environment changes.- Agent has reflexes, which are the reactive component o f the agent architecture.- Agent can perform its actions parallel. Actions execution is synchronized.- Agent is accessible via Internet, because it acts as a simple HTTP server. People can use this way to communicate with an agent.- Agent has Java Swing based graphical user interface. Its owner uses this interface to communicate with the agent.- Because o f the fact that Java-i- language extends Java, it is possible to use all useful Java features in the implementation o f AJA agents (e.g. JDBC for the database access). The thesis also presents an original approach of integrating artificial intelligence techniques, such as neural nets, with a programming language. Having the artificial intelligence components as a part of the programming language runtime environment makes their use straightforward. A programmer uses the language constructs that are implemented using the artificial intelligencewithout the need for understanding their background and theory.The thesis contains eight chapters and three appendixes. In the first chapter, an overview of agents and multi-agent systems is given. The second chapter surveys existing agent-oriented programming languages and tools. The third chapter introduces AJA and describes the architecture of AJA agents. The syntax and semantics o f AJA languages HADL and Java+ is described in the fourth chapter. The fifth chapter presents adaptable AJA constructs in more details. To demonstrate and test the created tool, a case-study multi-agent system has been implemented in AJA. There are four personal digital assistant agents in the system. The sixth chapter describes the example agents and positively evaluates the tool. In the seventh chapter the related work and tools are analyzed and compared to AJA. The last chapter concludes the thesis. The first appendix describes the implementation details of the AJA to Java translator. The second appendix is a guide for the installation and usage of the implemented AJA to Java translator. Finally, the thirdappendix describes step by step how to translate, compile, run, and use the example agents. The thesis contains many references, which include almost all the most important and the most actual papers in the field. The reference list can be found at the end o f the thesis.
Glavni doprinos doktorske teze je napravljeni alat za programiranje agenata AJA . AJA - Adaptabilni Java Agenti je jezički alat za programsku implementaciju agenata Sastoji se od dva programska jezika:- Jezik višeg nivoa kojim se opisuju glavne kom ponente agenta. Ovaj jezik se naziva HADL - Higher Agent Definition Language.- Jezik nižeg nivoa koji služi za implementaciju pojedinih komponenti agenta specificiranih HADL jezikom . Ovaj jezik se najava Java+, jer je on zapravo programski jezik Java obogaćen konstrukcijama pomoću kojih je moguće pristupati komponentama agenta, definisanim u jezik u HADL.AJA agent poseduje sledeće osobine:- Sigurna kom unikacija sa drugim A JA agentim a koristeći mehanizam pregovaranja, šifrovanje i digitalno potpisivanje poruka.- Mogućnost adaptiranja na promene u okruženju u kom se nalazi, koristeći neuralne mreže i adaptabilne parametre.- Reaktivnost zasnovana n a kom ponenti zvanoj refleks.- Paralelno izvršavanje akcija agenta u z njihovu internu sinhronizaciju.- D ostupnost agenta preko Interneta. Agent se ponaša kao jednostavan HTTP server. Na ovaj način se drugim osobama omogućuje da komuniciraju sa agentom .- G rafički korisnički interfejs zasnovan n a Java Swing tehnologiji- Pošto se u program iranju agenta koristi Java+, moguće je uposliti sve pogodnosti Jave, kao što su na primer pristup bazama podataka koristeći JDBC , rad sa multimedijalnim sadržajem , itd.U tezi je predstavljen i originalni pristup integrisanja tehnika veštačke inteligencije sa program skim jezikom . U građujući kom ponente veštačke inteligencije u izvršnu okolinu je z ik a čini n jihovo korišćenje veom a jednostavnim . Programer ne mora da bude ekspert iz veštačke inteligencije a da pri tome koristi konstrukcije jezika koje su implementirane pomoću veštačke inteligencije. AJA specifikacija agenta se sastoji od HADL i Java+ delova. U tezi je implementiran prevodioc kojim se A JA specifikacija prevodi u skup klasa programskog jezika Java. Implementiran je i jedan multi-agentski sistem kojim se praktično pokazuje korišćenje i mogućnosti napravljenog alata D oktorska teza sadrži i detaljan pregled oblasti o agentskpj m etodologiji. O n a kruniše višegodišnji rad kandidata i njegovog mentora u ovoj sve značajnijoj oblasti računarstva.Teza sadrži o sam glava i tri dodatka. U prvoj glavi se opisuje oblast agenata i m ulti-agentskih sistem a. Pregled postojećih agentskih program skih jezik a i alata se daje u drugoj glavi. O pis A JA agenata i njihove arhitekture je dat u trećoj glavi teze. Četvrta glava se bavi sintaksom i sem antikom oba A JA jezika: H A D L -a i Jave+. Adaptabilni elem enti A JA agenata se opisuju u petoj glavi. U šestoj glavi je opisan m ulti-agentski sistem koji j e ujed n o i prim er prim ene A JA alata. A JA se sa drugim postojećim agentskim alatim a upoređuje u sedm oj glavi. Osma glava sadrži zaključak. N a kraju se u tri dodatka detaljno opisuju im plem entacija prevodioca A JA -e u Javu, instalacija prevodioca i korišćenje napravljenog m ulti-agentskog sistema respektivno. U doktorskom radu su korišćene i navedene brojne reference kojim a su obuhvaćeni gotovo svi najznačajniji i najaktuelniji radovi iz oblasti multi-agentskih sistema. Lista referenci je navedena na kraju teze.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Xu, Duo. "An agent-based tool for China's express delivery SMEs." Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B40987784.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Charrier, Rodolphe. "L'intelligence en essaim sous l'angle des systèmes complexes : étude d'un système multi-agent réactif à base d'itérations logistiques couplées." Phd thesis, Université Nancy II, 2009. http://tel.archives-ouvertes.fr/tel-00442841.

Повний текст джерела

Анотація:

L'intelligence en essaim constitue désormais un domaine à part entière de l'intelligence artificielle distribuée. Les problématiques qu'elle soulève touchent cependant à de nombreux autres domaines ou questions scientifiques. En particulier le concept d'essaim trouve pleinement sa place au sein de la science dites des ``systèmes complexes''. Cette thèse présente ainsi la conception, les caractéristiques et les applications d'un modèle original, le SMA logistique, pour le domaine de l'intelligence en essaim. Le SMA logistique trouve son origine en modélisation des systèmes complexes : il est en effet issu des réseaux d'itérations couplées dont nous avons adapté le modèle de calcul à l'architecture multi-agent. Ce modèle se fonde sur des principes communs à d'autres disciplines, comme la synchronisation et le contrôle paramétrique que nous plaçons au coeur des mécanismes d'auto-organisation et d'adaptation. Du point de vue mathématique, les applications logistiques sont à la base de la formalisation du comportement interne des agents constituant le SMA logistique, tout en prenant place dans un schéma ``influence-réaction''. L'environnement à base de champs est l'autre aspect fondamental du SMA logistique, en permettant la réalisation des interactions indirectes des agents et en jouant le rôle d'une structure de données pour le système. Les travaux décrits dans cette thèse donnent lieu à des applications principalement en simulation et en optimisation, comme c'est le cas pour la plupart des algorithmes du domaine de l'intelligence en essaim. L'intérêt et l'originalité du SMA logistique pour l'intelligence en essaim résident dans l'aspect générique de son schéma théorique qui permet de traiter avec un même modèle des phénomènes considérés a priori comme distincts dans la littérature : phénomènes de ``flocking'' et phénomènes stigmergiques ``fourmis'' à base de phéromones. Ce modèle répond ainsi à un besoin d'explication des mécanismes mis en jeu autant qu'au besoin d'en synthétiser les algorithmes générateurs.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Massawe, Libe Valentine. "The design and development of multi-agent based RFID middleware system for data and devices management." Thesis, Bloemfontein : Central University of Technology, Free State, 2012. http://hdl.handle.net/11462/167.

Повний текст джерела

Анотація:

Thesis (D. Tech. (Electrical Engineering)) - Central University of technology, Free State, 2012
Radio frequency identification technology (RFID) has emerged as a key technology for automatic identification and promises to revolutionize business processes. While RFID technology adoption is improving rapidly, reliable and widespread deployment of this technology still faces many significant challenges. The key deployment challenges include how to use the simple, unreliable raw data generated by RFID deployments to make business decisions; and how to manage a large number of deployed RFID devices. In this thesis, a multi-agent based RFID middleware which addresses some of the RFID data and device management challenges was developed. The middleware developed abstracts the auto-identification applications from physical RFID device specific details and provides necessary services such as device management, data cleaning, event generation, query capabilities and event persistence. The use of software agent technology offers a more scalable and distributed system architecture for the proposed middleware. As part of a multi-agent system, application-independent domain ontology for RFID devices was developed. This ontology can be used or extended in any application interested with RFID domain ontology. In order to address the event processing tasks within the proposed middleware system, a temporal-based RFID data model which considers both applications’ temporal and spatial granules in the data model itself for efficient event processing was developed. The developed data model extends the conventional Entity-Relationship constructs by adding a time attribute to the model. By maintaining the history of events and state changes, the data model captures the fundamental RFID application logic within the data model. Hence, this new data model supports efficient generation of application level events, updating, querying and analysis of both recent and historical events. As part of the RFID middleware, an adaptive sliding-window based data cleaning scheme for reducing missed readings from RFID data streams (called WSTD) was also developed. The WSTD scheme models the unreliability of the RFID readings by viewing RFID streams as a statistical sample of tags in the physical world, and exploits techniques grounded in sampling theory to drive its cleaning processes. The WSTD scheme is capable of efficiently coping with both environmental variations and tag dynamics by automatically and continuously adapting its cleaning window size, based on observed readings.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Xu, Duo, and 徐鐸. "An agent-based tool for China's express delivery SMEs." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2008. http://hub.hku.hk/bib/B40987784.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Charrier, Rodolphe. "L'intelligence en essaim sous l'angle des systèmes complexes : étude d'un système multi-agent réactif à base d'itérations logistiques couplées." Electronic Thesis or Diss., Nancy 2, 2009. http://www.theses.fr/2009NAN23001.

Повний текст джерела

Анотація:

L'intelligence en essaim constitue désormais un domaine à part entière de l'intelligence artificielle distribuée. Les problématiques qu'elle soulève touchent cependant à de nombreux autres domaines ou questions scientifiques. En particulier le concept d'essaim trouve pleinement sa place au sein de la science dites des ``systèmes complexes''. Cette thèse présente ainsi la conception, les caractéristiques et les applications d'un modèle original, le système multi-agent logistique (SMAL), pour le domaine de l'intelligence en essaim. Le SMAL trouve son origine en modélisation des systèmes complexes : il est en effet issu des réseaux d'itérations logistiques couplées dont nous avons adapté le modèle de calcul au schéma ``influence-réaction'' des systèmes multi-agents. Ce modèle est fondé sur des principes communs à d'autres disciplines, comme la synchronisation et le contrôle paramétrique, que nous plaçons au coeur des mécanismes d'auto-organisation et d'adaptation du système. L'environnement à base de champs est l'autre aspect fondamental du SMAL, en permettant la réalisation des interactions indirectes des agents et en jouant le rôle d'une structure de données pour le système. Les travaux décrits dans cette thèse donnent lieu à des applications principalement en simulation et en optimisation combinatoire.L'intérêt et l'originalité du SMAL pour l'intelligence en essaim résident dans l'aspect générique de son schéma théorique qui permet de traiter avec un même modèle des phénomènes considérés a priori comme distincts dans la littérature : phénomènes de ``flocking'' et phénomènes stigmergiques ``fourmis'' à base de phéromones. Ce modèle répond ainsi à un besoin d'explication des mécanismes mis en jeu autant qu'au besoin d'en synthétiser les algorithmes générateurs
Swarm Intelligence is from now on a full part of Distributed Artificial Intelligence. Its associated problematics meet many other fields and scientific questions. The concept of swarm in particular belongs to the science called the science of complex systems. This phd thesis shows the design and the characteristics and the applications of a novel type of model called the logistic multi-agent system (LMAS) dedicated to the Swarm Intelligence field. The LMAS has its foundations in complex system modeling: it is inspired from the coupled logistic map lattice model which has been adapted to the ``Influence-Reaction'' modeling of multi-agent systems. This model is based on universal principles such as synchronization and parametric control which are considered as the main mechanisms of self-organization and adaptation in the heart of the system. The field-layered based environment is the other important feature of the LMAS, since it enables indirect interactions and plays the part of a data structure for the whole system. The work of this thesis is put into practice for simulation and optimization.The novelty of the LMAS lies in its generic theoretical framework, which enables to tackle problems considered as distinct in the literature, in particular flocking and ant-like stigmergic behavior. This model meets the need of explaining basic mechanisms and the need of synthesizing generative algorithms for the Swarm Intelligence

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Case, Denise Marie. "Engineering complex systems with multigroup agents." Diss., Kansas State University, 2015. http://hdl.handle.net/2097/19045.

Повний текст джерела

Анотація:

Doctor of Philosophy
Computing and Information Sciences
Scott A. DeLoach
As sensor prices drop and computing devices continue to become more compact and powerful, computing capabilities are being embedded throughout our physical environment. Connecting these devices in cyber-physical systems (CPS) enables applications with significant societal impact and economic benefit. However, engineering CPS poses modeling, architecture, and engineering challenges and, to fully realize the desired benefits, many outstanding challenges must be addressed. For the cyber parts of CPS, two decades of work in the design of autonomous agents and multiagent systems (MAS) offers design principles for distributed intelligent systems and formalizations for agent-oriented software engineering (AOSE). MAS foundations offer a natural fit for enabling distributed interacting devices. In some cases, complex control structures such as holarchies can be advantageous. These can motivate complex organizational strategies when implementing such systems with a MAS, and some designs may require agents to act in multiple groups simultaneously. Such agents must be able to manage their multiple associations and assignments in a consistent and unambiguous way. This thesis shows how designing agents as systems of intelligent subagents offers a reusable and practical approach to designing complex systems. It presents a set of flexible, reusable components developed for OBAA++, an organization-based architecture for single-group MAS, and shows how these components were used to develop the Adaptive Architecture for Systems of Intelligent Systems (AASIS) to enable multigroup agents suitable for complex, multigroup MAS. This work illustrates the reusability and flexibility of the approach by using AASIS to simulate a CPS for an intelligent power distribution system (IPDS) operating two multigroup MAS concurrently: one providing continuous voltage control and a second conducting discrete power auctions near sources of distributed generation.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Kuyler, Wilhelmina Johanna. "A multi-agent system for administering the prescription of anti-retroviral and anti-TB drugs." Thesis, Bloemfontein : Central University of Technology, Free State, 2007. http://hdl.handle.net/11462/103.

Повний текст джерела

Анотація:

Thesis (M. Tech.) -- Central University of Technology, Free State, 2007
Multi-agent systems (MAS) consist of a number of autonomous agents that communicate among themselves to coordinate their activities in order to solve collectively a complex problem that cannot be tackled by any agent individually. These kinds of systems are appropriate in many domains where problems that are complex, distributed and heterogeneous require communication and coordination between separate autonomous agents, which may be running on different machines distributed over the Internet and are located in many different places. In the health care domain, MAS have been used for distributed patient scheduling, organ and tissue transplant management, community care, decision support, training and so on. One other promising area of application is in the prescription of antiretroviral and antiTB drugs. The drugs used to treat the two diseases have many and similar side effects that complicate the prescription process. These factors have to be considered when prescribing medication to a person coinfected with HIV and tuberculosis. This is usually done manually using drug recommendation tables, which are complicated to use and require a great deal of decisionmaking. The design and implementation of a multiagent system that assists health care staff in carrying out the complex task of combining antiretroviral and antiTB drugs in an efficient way is described. The system consists of a number of collaborating agents requiring the communication of complex and diverse forms of information between a variety of clinical and other settings, as well as the coordination between groups of health care professionals (doctors, nurses, counsellors, etcetera.) with very different skills and roles. The agents in the system include: patient agents, nurse agents, lab agents, medication agents and physician agents. The agents may be hosted on different machines, located in many different places distributed over the Internet. The system saves time, minimises decision errors and increases the standard of health care provided to patients.

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Druckenmiller, Douglas Allen. "Exploring Agent-Based Simulation of Causal Maps: Toward a Strategic Decision Support Tool." [Kent, Ohio] : Kent State University, 2005. http://www.ohiolink.edu/etd/view.cgi?acc_num=kent1112125730.

Повний текст джерела

Анотація:

Thesis (Ph.D.)--Kent State University, 2005.
Title from PDF t.p. (viewed Feb. 23, 2005). Advisor: Acar, William. Available online via OhioLINK's ETD Center. Keywords: strategy making; causal mapping; multi-agent systems; knowledge management; dialectical inquiry Includes bibliographical references (p. 111-116).

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Adolfsson, Victor. "The State of the Art in Distributed Mobile Robotics." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-6195.

Повний текст джерела

Анотація:

Distributed Mobile Robotics (DMR) is a multidisciplinary research area with many open research questions. This is a survey of the state of the art in Distributed Mobile Robotics research. DMR is sometimes referred to as cooperative robotics or multi-robotic systems. DMR is about how multiple robots can cooperate to achieve goals and complete tasks better than single robot systems. It covers architectures, communication, learning, exploration and many other areas presented in this master thesis.
Uppsatsen är en brett spektrum på vilken forskning som pågår rörande distribuerad mobil robotik, dvs hur många robotar kan samverka för att lösa uppgifter.
Adress: Victor Adolfsson Folkparksvägen 12:24 372 38 Ronneby Telefon: 0457-171 42 Mobil: 0709-441389

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Epstein, Daniel. "Um algoritmo distribuído para resolução do problema de geração de estruturas de coalizão com presença de externalidades." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2013. http://hdl.handle.net/10183/103391.

Повний текст джерела

Анотація:

Uma importante parte de um sistema multiagente é o seu mecanismo de coordenação que permite que os agentes possam agir de maneira coesa em direção aos seus objetivos, sejam eles individuais ou coletivos. Um agente pode optar por cooperar para atingir um determinado objetivo que seria inalcançável através de ações individuais, para realizar uma tarefa de maneira mais eficiente ou simplesmente porque ele foi projetado para tal. Em todos os casos, a formação de coalizões (grupos de agentes que concordam em coordenar suas ações em torno de um objetivo comum) é uma questão fundamental. O problema de geração de estruturas de coalizão entre agentes (conjunto de todas as combinações de coalizões) é um tópico de pesquisa que recebeu muita atenção principalmente na resolução do problema quando considerado como um jogo de função característica, onde o valor das coalizões independe dos agentes que não estão presentes nela. Essa abordagem, apesar de ser indicada para muitos tipos de problema, não cobre toda a área de pesquisa do assunto, visto que em muitos casos a criação de uma coalizão irá afetar os demais agentes do sistema. Quando o sistema possui agentes com objetivos sobrepostos ou contrários, uma coalizão cujos recursos são destinados a completar tais objetivos irá influenciar as demais coalizões desse sistema. Essa influência se chama externalidade e, nesses casos, o problema de formação de estruturas de coalizão deve ser tratado como um jogo de partição. Apesar das pesquisas na área de jogos de partição serem recentes, elas trazem resultados promissores e há alguns poucos algoritmos já desenvolvidos para buscar soluções a esse problema. A busca pela melhor estrutura de coalizão geralmente demanda que seja calculado o valor de todas possíveis coalizões, a fim de se encontrar aquele conjunto cuja soma dos valores das coalizões forneça o melhor resultado. Esse processo requer um alto número de computações e de memória, devido à natureza exponencial do problema. Assim, ao invés de apenas um agente central realizar todas as operações, é mais eficiente do ponto de vista do uso de recursos computacionais distribuir essas operações entres os diversos agentes presentes no sistema. Além dos benefícios computacionais, distribuir o processo de busca pela melhor estrutura de coalizão permitiria trabalhar com questões como privacidade e tolerância a falhas, tendo em vista que as informações não estão concentradas em um único agente. Apesar disso, não há na literatura qualquer algoritmo capaz de solucionar o problema de geração de estrutura de coalizão em ambientes distribuídos e que sejam modelados como jogos de partição. A proposta desse trabalho é utilizar a fundamentação teórica existente acerca do problema de formação de estruturas de coalizão (modelados tanto como jogos de função característica quanto como jogos de partição) para criar um algoritmo distribuído capaz de encontrar a estrutura de coalizão ótima em ambientes que possuam externalidade. Esse algoritmo utiliza como base a ordenação das coalizões e dos agentes para permitir a distribuição do cálculo dos limites superiores e inferiores de cada coalizão. Após, esses valores são utilizados para se encontrar o subespaço mais provável de conter a estrutura de coalizão ótima. Com base nos experimentos, percebe-se que o algoritmo encontrou a estrutura de coalizão ótima buscando em apenas uma pequena parte do espaço de busca. Para os experimentos com 16 agentes, o algoritmo foi capaz de encontrar a solução ótima procurando em apenas 0,01% do espaço de busca. Também, é demonstrado que em cenários com externalidade negativa os agentes necessitaram investigar um espaço de busca menor para encontrar a estrutura de coalizão ótima que em cenários com externalidade positiva. Experimentos também demonstram que o algoritmo não consegue encontrar a estrutura de coalizão ótima quando há falhas na comunicação entre os agentes.
An important part of a multi-agent system is its coordination mechanism that allows the agents to act cohesively towards their goals, whether individual or collective. An agent can choose to cooperate to achieve a certain goal that would be unattainable through individual actions, to perform a task more efficiently or simply because it was designed to do so. In all cases, the formation of coalitions (group of agents that agree to coordinate their actions around a common goal) is a key issue. The problem of generating coalition structures between agents (set of all combinations of coalitions) is a research topic that has received much attention mostly on solving the problem when considered as a characteristic function game, where the value of coalitions is independent of agents that are not part of it. This approach, although suitable for many types of problem, does not cover the whole area of research on the subject, since in many cases the creation of a coalition will affect the other agents of the system. When the system has agents with overlapping goals or opposing goals, a coalition whose resources are devoted to completing these objectives will influence the other coalitions of that system. This influence is called externality, and in these cases, the problem of formation of coalition structures should be treated as a partition function game. Although research in the area of partition games is recent, it brings promising results and there are few algorithms already developed to find solutions to this problem. The search for the best coalition structure generally requires computation of the value of all possible coalitions in order to find the set that the sum of the values of the coalitions provides the best result. This process requires a large number of computations and memory due to the exponential nature of the problem. Hence, instead of just one central agent performing all operations, it is more efficient to distribute those operations among several agents. Besides the computational benefits, distributing the search process for the best coalition structure would address issues such as privacy and fault tolerance, given that the information is not concentrated in a single agent. Nevertheless, in the literature there is not algorithm capable of solving the problem of coalition structure generation in decentralized environments and modeled as partition function game. The purpose of this work is to use the existing theoretical foundations for solving the coalition structure generation problem (modeled both as a characteristic function game and as a partition function game) to create a distributed algorithm capable of finding the optimal coalition structure in environments that have externality. This algorithm uses as a base the ordering of coalitions and agents to distribute the calculation of the upper and lower limits for each coalition. Afterwards, these values are used to find the subspace more likely to contain the optimal coalition structure. Based on experiments, the algorithm found the optimal coalition structure searching only a small part of the search space. For the experiments with 16 agents, the algorithm was able to find the solution looking at just 0.0001%of the search space. Also, it is shown that in scenarios with negative externality agents need to investigate a smaller search space to find the optimal coalition structure than in scenarios with positive externality. Experiments also show that the algorithm can not find the optimal coalition structure when there are failures in the communication among the agents.

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Saraiva, Filipe de Oliveira. "Aplicações híbridas entre sistemas multiagentes e técnicas de inteligência artificial para redes inteligentes de distribuição de energia elétrica." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/18/18154/tde-06062016-094659/.

Повний текст джерела

Анотація:

Os smart grids representam a nova geração dos sistemas elétricos de potência, combinando avanços em computação, sistemas de comunicação, processos distribuídos e inteligência artificial para prover novas funcionalidades quanto ao acompanhamento em tempo real da demanda e do consumo de energia elétrica, gerenciamento em larga escala de geradores distribuídos, entre outras, a partir de um sistema de controle distribuído sobre a rede elétrica. Esta estrutura modifica profundamente a maneira como se realiza o planejamento e a operação de sistemas elétricos nos dias de hoje, em especial os de distribuição, e há interessantes possibilidades de pesquisa e desenvolvimento possibilitada pela busca da implementação destas funcionalidades. Com esse cenário em vista, o presente trabalho utiliza uma abordagem baseada no uso de sistemas multiagentes para simular esse tipo de sistema de distribuição de energia elétrica, considerando opções de controle distintas. A utilização da tecnologia de sistemas multiagentes para a simulação é baseada na conceituação de smart grids como um sistema distribuído, algo também realizado nesse trabalho. Para validar a proposta, foram simuladas três funcionalidades esperadas dessas redes elétricas: classificação de cargas não-lineares; gerenciamento de perfil de tensão; e reconfiguração topológica com a finalidade de reduzir as perdas elétricas. Todas as modelagens e desenvolvimentos destes estudos estão aqui relatados. Por fim, o trabalho se propõe a identificar os sistemas multiagentes como uma tecnologia a ser empregada tanto para a pesquisa, quanto para implementação dessas redes elétricas.
The smart grids represent a new generation of electric power systems, combining advances in computing, communication, distributed systems, and artificial intelligence, to provide new features to the power systems as the real-time demand monitoring and real-time energy consumption monitoring, large-scale managing of distributed generators, among others. It is possible by the existence of a distributed control system on the grid. This structure modifies the way it conducts the planning and operation of electrical systems currently, especially in the distribution level, and there are interesting possibilities for research and development made possible by the need for implementation of these features. With this scenario in mind, this thesis uses an approach based on multi-agent systems to simulate this new power distribution system, considering different control options. The use of multi-agent systems technology for smart grid simulation is based on the concept of smart grid as a distributed system - this conceptualization is realized in this work too. In order to validate this proposal, three features expected of these grids were simulated: the classification of non-linear loads; the voltage profile management; and the topological reconfiguration in order to reduce electrical losses. All modeling and developments of these studies are reported here. Finally, the study aims to identify the multi-agent systems as a technology to be utilized both for research and for implementing these grids.

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Nongaillard, Antoine. "An agent-based approach for distributed resource allocations." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2009. http://tel.archives-ouvertes.fr/tel-00831365.

Повний текст джерела

Анотація:

Resource allocation problems have been widely studied according to various scenarios in literature. In such problems, a set of resources must be allocated to a set of agents, according to their own preferences. Self-organization issues in telecommunication, scheduling problems or supply chain management problems can be modeled using resource allocation problems. Such problems are usually solved by means of centralized techniques, where an omniscient entity determines how to optimally allocate resources. However, these solving methods are not well-adapted for applications where privacy is required. Moreover, several assumptions made are not always plausible, which may prevent their use in practice, especially in the context of agent societies. For instance, dynamic applications require adaptive solving processes, which can handle the evolution of initial data. Such techniques never consider restricted communication possibilities whereas many applications are based on them. For instance, in peer-to-peer networks, a peer can only communicate with a small subset of the systems. In this thesis, we focus on distributed methods to solve resource allocation problems. Initial allocation evolves step by step thanks to local agent negotiations. We seek to provide agent behaviors leading negotiation processes to socially optimal allocations. In this work, resulting resource allocations can be viewed as emergent phenomena. We also identify parameters favoring the negotiation efficiency. We provide the negotiation settings to use when four different social welfare notions are considered. The original method proposed in this thesis is adaptive, anytime and can handle any restriction on agent communication possibilities.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Tlig, Mohamed. "Coordination locale et optimisation distribuée du trafic de véhicules autonomes dans un réseau routier." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0049/document.

Повний текст джерела

Анотація:

Dans le cadre de cette thèse, nous nous intéressons à la coordination et l'optimisation du trafic aux intersections des réseaux routiers, avec la particularité de considérer des véhicules autonomes intelligents. Cette thèse est organisée en deux grandes parties. La première se concentre sur le problème du partage d'un espace de voie par deux files de véhicules évoluant en sens opposés. L'état de l'art montre le peu de travaux abordant cette question. Nous explorons deux approches par coordination réactive, en relation avec un critère de minimisation des retards. Les performances de ces approches ont été mesurées statistiquement en simulation. La deuxième partie de la thèse s'attaque au problème générique de la gestion du trafic au sein d'un réseau routier. Nous développons une approche originale à deux égards: d'une part elle explore un principe de passage en alternance des flux permettant de ne pas arrêter les véhicules aux intersections, et d'autre part, elle propose des algorithmes d'optimisationdistribuée de ce passage alterné au niveau de chaque intersection et au niveau du réseau global. La thèse présente successivement les choix de modélisation, les algorithmes et l'étude en simulation de leurs performances comparées à desapproches existantes
In this thesis, we focus on traffic coordination and optimization in road intersections, while accounting for intelligent autonomous vehicles. This thesis is organized in two parts. The first part focuses on the problem of sharing a one-lane road between two opposite flows of vehicles. The state of the art shows few studies addressing this issue. We propose two reactive coordination approaches that minimize vehicle delays and measure their performances statistically through simulations. The second part of the thesis addresses the problem of generic traffic management in a traffic network. We develop a stop-free approach that explores a principle alternating vehicles between flows at intersections, and it provides distributed algorithms optimizing this alternation at each intersection and in the overall network. We present the modeling choices, the algorithms and the simulation study of our approach and we compare its performances with existing approaches

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Hubner, Jomi Fred. "Migração de agentes em sistemas multi-agentes abertos." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1995. http://hdl.handle.net/10183/25032.

Повний текст джерела

Анотація:

A Inteligência Artificial Distribuída traz uma série de novas perspectivas para a computação quando considera sistemas heterogêneos, adaptativos, evolutivos, continuamente em funcionamento e abertos. Estes sistemas, chamados de sociedades, apresentam tais características por permitirem que seus componentes, chamados de agentes, migrem entre sociedades, isto é, agentes podem sair e entrar em sociedades. Sociedades abertas permitem a migração dos agentes e coloca dois tipos de problemas para o agente que está migrando: problemas de linguagem e interação, que concernem ao uso de expressões usadas e à maneira como as interações são organizadas na nova sociedade; e, problemas de conhecimento e atuação, que se referem à como um agente irá se comportar a fim de realizar justamente aquilo que a sociedade espera dele. Este trabalho se atem aos problemas de conhecimento e atuação. Para que os agentes da sociedade possam cooperar e coordenar suas ações, é necessário que tenham conhecimento das capacidades, habilidades, desejos e planos dos outros agentes. Grande parte do conhecimento a respeito dos outros pode ser extraído dos papéis que estes podem assumir na sociedade. Assim sendo, o problema colocado para este trabalho é como os agentes da sociedade que receberam o agente imigrante e o próprio agente imigrante conhecerão/aprenderão os papéis uns dos outros. São desenvolvidos três mecanismos de identificação de papéis, bem como a comparação entre eles e sua adequação a tipos de migração. Os três mecanismos são os seguintes: i) Identificação de papéis por protocolo de apresentação: é proposta uma linguagem de descrição de protocolos (LDP) e uma especificação de protocolo de apresentação nesta LDP. Os agentes que utilizam este mecanismo conseguem se identificar com rapidez, porém necessitam conhecer várias informações “locais” da sociedade, o que pode ser muito restritivo para um agente migrante. ii) Identificação de papéis por observação e classificação: esta solução procura classificar o agente observado em um papel de um conjunto prédefinido de papéis. Neste conjunto, os papéis são descritos por meio de processos de interação (PI). Para isto, desenvolveu-se a noção de PI. Para isto, desenvolveu-se a noção de PI. Foram desenvolvidas duas formas de proceder a classificação: construir uma especificação do agente a partir da observação das suas ações e verificar se esta pertence ao conjunto pré-definido de papéis; e, verificar se o comportamento do agente confere com as execuções possíveis para algum dos papéis pré-definidos. Este mecanismo é mais adequado para sociedades abertas e tem boa precisão no resultado apresentado, porém, a identificação do papel de um agente pode ser demorada. iii) Identificação de papéis por reconhecimento de intenções em planos: este mecanismo baseia-se na existência de uma relação entre intenções e papéis. A partir das ações observadas para o agente, procura-se saber qual seu plano, sua intenção e, conseqüentemente, seu papel. Para isto foi implementado um procedimento de indução de planos. Este mecanismo também é adequado para sociedades abertas, no entanto, a identificação, embora satisfatória, nem sempre é completamente correta. Estes três mecanismos foram testados em simulações numa implementação da sociedade Produtor - Consumidor, onde puderam ser comprovadas as características de cada um.
Distributed Artificial Intelligence brings a number of new perspectives to Computing Science when heterogeneous, adaptative and evolutive systems, those under functioning and open, are taken into consideration. These systems, named societies, present these characteristics because they allow their components, named agents, to migrate within societies, that is, agents are allowed to enter and to leave societies. Agents' migration brings two kinds of problems to the migrating agent: language and interaction problems both related to the use of used expressions and to the way the interactions are organized in the new society; and, knowledge and performance problems refering to the way the agent will behave in order to accomplish exactly what society expects him to do. This work is limited to knowledge and performance problems. In order to cooperate and coordinate their actions, the society's agents need to learn about the capabilities, abilities wishes and plans of other agents. A great part of knowledge of others can be extracted from the social roles these agents can play. Therefore, the problem posed in this work is how social agents who has received an immigrating agent and the immigrating agent himself will know and learn one another's roles. Three role identification mechanisms, and the comparison between them and their adaptation to migration types as well are developed. The three mechanisms are the following: i) Role Identification by means of presentation protocol:a language of protocol description (LPD) and a specification of presentation protocol in this LPD are proposed. The agents who use this mechanism can rapidly identify each other, however they need know a number of 'local' social information, which can be very restrictive to the migrating agent. ii) Role identification by means of observation and classification: this solution tries to classify the observed agent as a role out of set of definite roles. In this set, the roles are described by means of interactional processes (IP). Therefore, the notion of IP was developed. Two ways to proceed the role classification were developed: to build the agent's especification departing from the observation of their actions and to check whether this especification belongs to a set of pre-defined roles; and to check whether the agent's behavior fits the possible executions to some predefined roles. This mechanism is more adequate to open societies and has good precision in the result presented, but, the agent's role identification can last longer. iii) Role Identification by means of intention and plans recognition: this mechanism is based on the existence of a relationship between intentions and roles. By departing from the agent's observed actions, his plan, intention, consequently, his role is recognized. Therefore an induced plan procedure was implemented. This mechanism is also adequate to open societies, however, the identification, though satisfactory, is not always totally correct. These three mechanisms were tested in simulated situations in a kind of Producer- Consumer Society implementation in which each one's characteristics could be verified.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Klaimi, Joelle. "Gestion multi-agents des smart grids intégrant un système de stockage : cas résidentiel." Thesis, Troyes, 2017. http://www.theses.fr/2017TROY0006/document.

Повний текст джерела

Анотація:

Cette thèse s’intéresse à la gestion décentralisée à l’aide des systèmes multi-agents de l’énergie, notamment de sources renouvelables, dans le contexte des réseaux électriques intelligents (smart grids). Nos travaux de recherche visent à minimiser la facture énergétique des consommateurs en se focalisant sur deux verrous essentiels que nous nous proposons de lever : (1) résoudre le problème de l’intermittence des énergies renouvelables; (2) minimiser les pertes d’énergie. Pour pallier le problème d’intermittence des énergies renouvelables et dans le but de maintenir un coût énergétique peu onéreux même lors des pics d’utilisation, nous avons intégré un système de stockage intelligent. Nous avons, en effet, proposé des algorithmes permettant d’utiliser les systèmes de stockage intelligents et la négociation multi-agents pour réduire la facture énergétique tout en conservant un taux de décharge minimal de la batterie et une perte énergétique minimale. La validation par simulation de nos contributions a montré que celles-ci répondent aux enjeux identifiés, notamment en réduisant le coût de l’énergie pour les consommateurs en comparaison aux travaux de l’état de l’art
This thesis focuses on the decentralized management using multi-agent systems of energy, including renewable energy sources, in the smart grid context. Our research aims to minimize consumers’ energy bills by answering two key challenges: (1) handle the problem of intermittency of renewable energy sources; (2) reduce energy losses. To overcome the problem of renewable resources intermittency and in order to minimize energy costs even during peak hours, we integrated an intelligent storage system. To this end, we propose many algorithms in order to use intelligent storage systems and multi-agent negotiation algorithm to reduce energy cost while maintaining a minimal discharge rate of the battery and minimal energy loss. The validation of our contributions has shown that our proposals respond to the identified challenges, including reducing the cost of energy for consumers, in comparison to the state of the art

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Tlig, Mohamed. "Coordination locale et optimisation distribuée du trafic de véhicules autonomes dans un réseau routier." Electronic Thesis or Diss., Université de Lorraine, 2015. http://www.theses.fr/2015LORR0049.

Повний текст джерела

Анотація:

Dans le cadre de cette thèse, nous nous intéressons à la coordination et l'optimisation du trafic aux intersections des réseaux routiers, avec la particularité de considérer des véhicules autonomes intelligents. Cette thèse est organisée en deux grandes parties. La première se concentre sur le problème du partage d'un espace de voie par deux files de véhicules évoluant en sens opposés. L'état de l'art montre le peu de travaux abordant cette question. Nous explorons deux approches par coordination réactive, en relation avec un critère de minimisation des retards. Les performances de ces approches ont été mesurées statistiquement en simulation. La deuxième partie de la thèse s'attaque au problème générique de la gestion du trafic au sein d'un réseau routier. Nous développons une approche originale à deux égards: d'une part elle explore un principe de passage en alternance des flux permettant de ne pas arrêter les véhicules aux intersections, et d'autre part, elle propose des algorithmes d'optimisationdistribuée de ce passage alterné au niveau de chaque intersection et au niveau du réseau global. La thèse présente successivement les choix de modélisation, les algorithmes et l'étude en simulation de leurs performances comparées à desapproches existantes
In this thesis, we focus on traffic coordination and optimization in road intersections, while accounting for intelligent autonomous vehicles. This thesis is organized in two parts. The first part focuses on the problem of sharing a one-lane road between two opposite flows of vehicles. The state of the art shows few studies addressing this issue. We propose two reactive coordination approaches that minimize vehicle delays and measure their performances statistically through simulations. The second part of the thesis addresses the problem of generic traffic management in a traffic network. We develop a stop-free approach that explores a principle alternating vehicles between flows at intersections, and it provides distributed algorithms optimizing this alternation at each intersection and in the overall network. We present the modeling choices, the algorithms and the simulation study of our approach and we compare its performances with existing approaches

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Davis, Cledo L. "The systems integration of autonomous behavior analysis to create a "Maritime Smart Environment" for the enhancement of maritime domain awareness." Thesis, Monterey, California : Naval Postgraduate School, 2010. http://edocs.nps.edu/npspubs/scholarly/theses/2010/Jun/10Jun%5FDavis.pdf.

Повний текст джерела

Анотація:

Thesis (M.S. in Systems Engineering)--Naval Postgraduate School, June 2010.
Thesis Advisor(s): Goshorn, Rachel ; Goshorn, Deborah. "June 2010." Description based on title screen as viewed on June 24, 2010. Author(s) subject terms: Anomaly Detection, Artificial Intelligence, Automation, Behavior Analysis, Distributed Artificial Intelligence, Intelligence-Surveillance-Reconnaissance, Maritime Domain Awareness, Maritime Force Protection, Multi-agent Systems, Network-centric Operations, Network-centric Systems Engineering, Network-centric Warfare, Smart Sensor Networks, Systems Engineering, Systems Integration, System of Systems. Includes bibliographical references (p. 209-212). Also available in print.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Mahmoud, Thair. "Optimal power generation in microgrids using agent-based technology." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2013. https://ro.ecu.edu.au/theses/599.

Повний текст джерела

Анотація:

The existing power grids that form the basis of the respective electrical power infrastructures for various states and nations around the world, are expected to undergo a period of rapid change in the near future. The key element driving this change is the emergence of the Smartgrid. The Smartgrid paradigm represents a transition towards an intelligent, digitally enhanced, two-way power delivery grid. The aim of the Smartgrid is to promote and enhance the e_cient management and operation of the power generation and delivery facilities, by incorporating advanced communications, information technology, automation, and control methodologies into the power grid proper. Smartgrid's are currently an active topic for research, where the research is strongly focused on developing new technologies such as: demand response, power generation management, pricing modelling and energy markets participation, power quality, and self-healing scenarios. In recent times, in both the United States of America and Europe, many new projects have begun which are specifically directed towards developing “Smartgrid” technologies. In Australia, the Federal Government has recently initiated funding plans to promote the commercialisation of renewable energy. In order to exploit these developments, Edith Cowan University (ECU); which is a High Voltage (HV) customer for the major utility network of Western Australia, and which owns its own transformers and Low Voltage (LV) network; is planning to integrate renewable energy suppliers within its LV network. The aim of this research is to introduce a smart decision making system, which can manage the operation of disparate power generation sources installed on a LV network (microgrid); such as that owned by ECU on its campuses. The proposed energy management system is to gather data in real-time, and it must be capable of anticipating and optimising energy needs for each operational scenario that the microgrid might be expected to experience. The system must take into account risk levels, while systematically favouring low economic and environmental costs. A management system application, based on autonomous and distributed controllers, is investigated in a virtual environment. The virtual environment being a full-scale simulation of ECU's microgrid; with solar panels, wind turbines, storage devices, gas gen-sets, and utility supply. Hence the simulation studies were conducted on the basis of realistic demand trends and weather conditions data. The major factors for reducing the cost of generation in the case study, were identified as being: 1) demand forecasting; 2) generation scheduling; 3) markets participation; and 4) autonomous strategies configuration, which is required to cope with the unpredictable operation scenarios in LV networks. Due to the high uncertainty inherent within the operational scenarios; an Artificial Intelligence (AI) deployment for managing the distributed sub-systems was identified as being an ideal mechanism for achieving the above mentioned objectives. Consequently it is proposed that Multi-Agent System (MAS) technology be deployed, to enable the system to respond dynamically to the unpredictable operational conditions by updating the method of analysis. The proposed system is to behave in a strategic manner when dealing with the expected operational scenarios, by aiming to achieve the lowest possible cost of power generation for the microgrid. The simulated system is based on realistic operational scenarios, which have been scaled to suit the size and type of load in the case study. The distributed intelligent modules have proven to be successful in achieving the potential benefits of the dynamic operational conditions, by minimising the cost of power generation. The distributed intelligent modules, which form the basis of the proposed management systems, have been designed to perform the following functions: 1. Provide accurate demand forecasts through the utilisation of an AI-based adaptive demand forecasting model. The novel demand-forecast modelling technique, which was introduced to model demand in the case study, has been utilised to supply reasonably accurate demand forecasts to other stages of processing in the management system. The forecasts are generated from this model, by monitoring and controlling the forecasting error to ensure consistent and satisfactory forecasts. 2. Make optimum decisions concerning the operation of the power generators by considering the economic and the environmental costs. In order to deal with the complexity of the operational conditions, a smart and adaptive generation scheduling method was implemented for the case study. The method was primarily applied to control the charging/ discharging process of the Storage Devices (SDs) among the other generators. The proposed method aims at controlling the resources, and extracting the benefit of having an hourly based variable generation cost. 3. Integrate the microgrid into the electricity market, in order to enable the microgrid to offer its spinning and non-spinning power generation reserve as Ancillary Services (AS) to the grid. To this end, studying the operational mechanisms of the Australian market was essential prior to building the proposed market participation rules which form an integral part of the proposed management system. As a result we used the market data, by approaching the market operators to create a semi-realistic competitive market environment for our simulations. Consequently, a smart and adaptive pricing mechanism, that adapts the AS prices to the amount of electricity on offer, and the level of demand in the market has been presented. The motivation for introducing the proposed management system, is to achieve a transition plan for current microgrids, so that they can have a commercial connection to the future Smartgrid. The results obtained in this work show that there is a signi_cant economic and environmental advantage to be gained from utilising intelligence when managing electricity generation within a power grid. As a consequence, selecting the appropriate management strategy is fundamental to the success of the proposed management system. In conclusion, modelling of the proposed strategies using MAS technology has proven to be a successful approach, and one that is able to reflect the human attitude; in making critical decisions and in reducing the cost of generation.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Gibilini, Daniel. "Aplicação de técnicas de inteligência artificial na alocação dinâmica de canais em redes sem fio." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-04092006-154457/.

Повний текст джерела

Анотація:

Nos últimos anos, as redes de comunicação móveis se tornaram de fundamental importância para a infraestrutura dos sistemas de comunicação. Uma das áreas de maior crescimento é a computação móvel. Realizada através de sinais de rádio, a quantidade de canais disponíveis raramente é suficiente para atender a crescente demanda. Este trabalho apresenta uma solução para a questão da alocação de canais, um tópico desafiador dentro da área de redes móveis. A implementação de alocação dinâmica com uso de técnicas computacionais clássicas melhora a utilização dos recursos disponíveis,mas necessita de ajustes periódicos para se adequar a novos cenários. Para a construção de um sistema mais flexível e adaptável, a abordagem escolhida utiliza técnicas de Inteligência Artificial. O modelo proposto combina Teoria Nebulosa, Redes Neurais Artificiais e Sistemas Multi-Agentes. As características de cada técnica foram analisadas e identificamos as partes do sistema que poderiam ser beneficiadas por cada uma. O sistema é resultado da combinação coordenada das três técnicas, e constitui um método eficiente e flexível para gerenciamento de recursos de rádio. Após o detalhamento do modelo, realizamos uma simulação de uma rede celular com o sistema proposto e seu comportamento é comparado com uma rede de referência, para verificação das diferenças e melhorias alcançadas. Por fim, apresentamos a situação atual da pesquisa e os possíveis caminhos para aprimoramento do sistema.
In the last years, mobile networks became more important for communication systems infrastructure. One area of great growth is mobile computation, which is performed through radio signals. The amount of available channels rarely is enough to attend the increasing demand. This work presents a solution for the channel allocation topic, a challenging topic inside mobile networks area. The implementation of dynamic allocation using classic computational techniques improves the use of available resources, but it needs periodic and frequent adjustments for new scenarios. The construction of a more flexible and adaptable system was achieved using Artificial Intelligence techniques. Proposed model combines Fuzzy Logic, Artificial Neural Networks and Multi-Agents Systems. Features of each technique had been analyzed and we identified the system modules which could be benefited by them. The system is the result of coordinated combination of these three techniques, and constitutes an efficient and flexible method for radio resources management. After model detailing, we executed a cellular network simulation using proposed system, and its behavior is compared with a reference network, presenting reached differences and improvements. Finally, we present current situation of this research and possible ways for system improvement.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Wahbi, Mohamed. "Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2012. http://tel.archives-ouvertes.fr/tel-00718537.

Повний текст джерела

Анотація:

Les problèmes de satisfaction de contraintes distribués (DisCSP) permettent de formaliser divers problèmes qui se situent dans l'intelligence artificielle distribuée. Ces problèmes consistent à trouver une combinaison cohérente des actions de plusieurs agents. Durant cette thèse nous avons apporté plusieurs contributions dans le cadre des DisCSPs. Premièrement, nous avons proposé le Nogood-Based Asynchronous Forward-Checking (AFC-ng). Dans AFC-ng, les agents utilisent les nogoods pour justifier chaque suppression d'une valeur du domaine de chaque variable. Outre l'utilisation des nogoods, plusieurs backtracks simultanés venant de différents agents vers différentes destinations sont autorisés. En deuxième lieu, nous exploitons les caractéristiques intrinsèques du réseau de contraintes pour exécuter plusieurs processus de recherche AFC-ng d'une manière asynchrone à travers chaque branche du pseudo-arborescence obtenu à partir du graphe de contraintes dans l'algorithme Asynchronous Forward-Checking Tree (AFC-tree). Puis, nous proposons deux nouveaux algorithmes de recherche synchrones basés sur le même mécanisme que notre AFC-ng. Cependant, au lieu de maintenir le forward checking sur les agents non encore instanciés, nous proposons de maintenir la consistance d'arc. Ensuite, nous proposons Agile Asynchronous Backtracking (Agile-ABT), un algorithme de changement d'ordre asynchrone qui s'affranchit des restrictions habituelles des algorithmes de backtracking asynchrone. Puis, nous avons proposé une nouvelle méthode correcte pour comparer les ordres dans ABT_DO-Retro. Cette méthode détermine l'ordre le plus pertinent en comparant les indices des agents dès que les compteurs d'une position donnée dans le timestamp sont égaux. Finalement, nous présentons une nouvelle version entièrement restructurée de la plateforme DisChoco pour résoudre les problèmes de satisfaction et d'optimisation de contraintes distribués.

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Sabbani, Imad. "Optimisation du trafic routier par des modèles distribués à base d'agents embarqués utilisant les technologies des objets connectés." Thesis, Bourgogne Franche-Comté, 2019. http://www.theses.fr/2019UBFCD023.

Повний текст джерела

Анотація:

Dans cette thèse nous nous intéressons à l’étude et la résolution de problèmes d’optimisation dans le domaine du transport. Le problème fondamental est de déterminer le plus court chemin à effectuer à travers un ou plusieurs modes de transport d’un point A vers un point B. Au cours des deux dernières décennies, les chaines logistiques soulèvent un grand nombre de problèmes combinatoires avec des enjeux économiques et environnementaux importants à résoudre: problèmes d’ordonnancement, problèmes de tournées de véhicules, problème de routage de véhicules... Ce travail de recherche a pour objectif d’identifier et de lever certains verrous scientifiques sur la modélisation et l’optimisation de ces problèmes. Deux méthodes originales sont présentées dans ce manuscrit. Dans un premier temps, nous proposons un algorithme d’optimisation par méta-heuristiques, pour orienter les véhicules à prendre la bonne décision de choisir le parcours optimal et de favoriser la fluidité du trafic. La modélisation de notre système est basée sur une nouvelle architecture distribuée des systèmes multi-agents et un nouveau protocole de communication. Notre système se base sur une fonction multi-objective avec plusieurs paramètres (i.e. densité, vitesse, nombre de voiture, ...).Le recueil de ces données joue un rôle important afin de s’assurer de l’applicabilité et de l’efficacité de notre solution. Nous proposons un algorithme de réseaux de neurones convolutionels profonds afin d’obtenir l’état du trafic en temps réel. La deuxième partie de notre thèse s’intéresse à une nouvelle politique de mobilité exigée par la croissance de la taille des réseaux et les évolutions technologiques en transport: la plannification des chaînes d’activité quotidiennes dans un contexte multimodal. Le choix modal du transport consiste à utiliser successivement un ou plusieurs modes de transport. Nous proposons un algorithme de colonies de fourmis avec les fenêtres temporelles tout en adoptant un nouveau concept de flexibilité. L’introduction de cet aspect induit de nouveaux défis et de nouvelles contraintes auxquelles il faut répondre.Pour chaque problématique, des expériences sont réalisées afin d’évaluer la performance de nos approches de résolution sur des instances de littérature
In this thesis we present some models of optimization problems in transportation field; The fundamental problem is to define the shortest path bewteen two points through one or many modes of transport. Over the past two decades, logistics chains have raised a large number of combinatorial problems with important economic and environmental issues to be solved: scheduling problems, rooting vehicles, monitoring trafic ... Two original methods are presented in this thesis. First, we propose a meta-heuristic optimization algorithm, to guide the vehicles to make the right decision to choose the optimal route and to promote traffic fluidity. The modeling of our system is based on a new distributed architecture of multi-agent systems and a new communication protocol. Our system is based on a multi-objective function with several parameters (i.e. density, speed, number of cars, ...). The collection of this data plays an important role in ensuring the applicability and effectiveness of our solution.We propose a deep convolutional neural network algorithm to obtain real-time traffic status. The second part of our thesis focuses on a new policy of mobility required by the growth of network size and new high technological developments in transport : the planning of daily activity chains in a multimodal context. The modal choice of transport consists in successively using one or more modes of transport. We propose the ant colony algorithm with time windows involving a new concept of flexibility. The introduction of this aspect introduces new challenges and new constraints that must be resolved.For each problem, experiments are carried out in order to evaluate the performance of our approaches on literature instances. In particular, our algorithms have improved the results obtained by the best existing approaches

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Moukir, Sara. "High performance analysis for road traffic control." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG039.

Повний текст джерела

Анотація:

La réduction des temps de trajet et de la consommation d'énergie dans les réseaux routiers urbains est cruciale pour le bien-être collectif et la durabilité environnementale. Depuis les années 1950, la modélisation du trafic a été un axe central de la recherche. Avec l'évolution des capacités informatiques, des simulations sophistiquées représentant fidèlement les complexités du trafic routier ont émergé, essentielles pour évaluer les technologies sans perturber le trafic réel.Les systèmes de transport deviennent plus complexes avec des informations en temps réel, nécessitant des modèles de simulation adaptés. Les simulations multi-agents, analysant les comportements individuels dans un environnement dynamique, sont particulièrement efficaces pour cette tâche, permettant de comprendre et de gérer le trafic urbain en représentant les interactions entre les voyageurs et leur environnement.Simuler de grandes populations de voyageurs dans les villes a longtemps été une tâche exigeante en termes de ressources informatiques. Les technologies avancées permettant la distribution des calculs sur plusieurs ordinateurs ont ouvert de nouvelles possibilités. Cependant, de nombreux simulateurs de mobilité urbaine n'exploitent pas pleinement ces architectures distribuées, limitant leur capacité à modéliser des scénarios complexes.L'objectif principal de cette recherche est d'améliorer la performance algorithmique et computationnelle des simulateurs de mobilité. Nous développons et validons des modèles de distribution génériques et reproductibles pouvant être adoptés par divers simulateurs de mobilité multi-agents, surmontant ainsi les barrières techniques pour analyser les systèmes de transport complexes dans des environnements urbains dynamiques.Nous utilisons le simulateur de trafic MATSim, reconnu pour la simulation de trafic multi-agents, pour tester nos méthodes génériques. Notre première contribution applique l'approche "Unite and Conquer" (UC) à MATSim. Cette méthode accélère les simulations en exploitant les architectures informatiques modernes. L'approche multiMATSim réplique plusieurs instances de MATSim sur plusieurs nœuds de calcul avec des communications périodiques, chaque instance fonctionnant sur un nœud séparé, utilisant les capacités de multithreading de MATSim pour améliorer le parallélisme. La synchronisation périodique assure la cohérence des données, tandis que les mécanismes de tolérance aux pannes permettent à la simulation de se poursuivre même en cas d'échec de certaines instances. Cette approche optimise l'utilisation des ressources informatiques selon les capacités spécifiques de chaque nœud.La deuxième contribution explore les techniques d'intelligence artificielle pour accélérer la simulation. Nous utilisons des réseaux de neurones profonds pour prédire les résultats des simulations MATSim. Initialement mise en œuvre sur un seul nœud, cette approche de preuve de concept utilise efficacement les ressources CPU disponibles. Les réseaux de neurones sont entraînés sur des données de simulations précédentes pour prédire des indicateurs tels que les temps de trajet et les niveaux de congestion. Les résultats sont comparés à ceux de MATSim pour évaluer leur précision. Cette approche est conçue pour évoluer avec des plans futurs pour une formation distribuée sur plusieurs nœuds.En résumé, nos contributions fournissent de nouvelles variantes algorithmiques et explorent l'intégration du calcul haute performance et de l'IA dans les simulateurs de trafic multi-agents. Nous démontrons l'impact de ces modèles et technologies sur la simulation de trafic, en abordant les défis et les limites de leur mise en œuvre. Notre travail met en évidence les avantages des architectures émergentes et des nouveaux concepts algorithmiques pour améliorer la robustesse et la performance des simulateurs de trafic, avec des résultats prometteurs
The need to reduce travel times and energy consumption in urban road networks is critical for improving collective well-being and environmental sustainability. Since the 1950s, traffic modeling has been a central research focus. With the rapid evolution of computing capabilities in the 21st century, sophisticated digital simulations have emerged, accurately depicting road traffic complexities. Mobility simulations are essential for assessing emerging technologies like cooperative systems and dynamic GPS navigation without disrupting real traffic.As transport systems become more complex with real-time information, simulation models must adapt. Multi-agent simulations, which analyze individual behaviors within a dynamic environment, are particularly suited for this task. These simulations help understand and manage urban traffic by representing interactions between travelers and their environment.Simulating large populations of travelers in cities, potentially millions of individuals, has historically been computationally demanding. Advanced computer technologies allowing distributed calculations across multiple computers have opened new possibilities. However, many urban mobility simulators do not fully exploit these distributed architectures, limiting their ability to model complex scenarios involving many travelers and extensive networks.The main objective of this research is to improve the algorithmic and computational performance of mobility simulators. We aim to develop and validate generic and reproducible distribution models that can be adopted by various multi-agent mobility simulators. This approach seeks to overcome technical barriers and provide a solid foundation for analyzing complex transport systems in dynamic urban environments.Our research leverages the MATSim traffic simulator due to its flexibility and open structure. MATSim is widely recognized in the literature for multi-agent traffic simulation, making it an ideal candidate to test our generic methods.Our first contribution applies the "Unite and Conquer" (UC) approach to MATSim. This method accelerates simulation speed by leveraging modern computing architectures. The multiMATSim approach involves replicating several MATSim instances across multiple computing nodes with periodic communications. Each instance runs on a separate node, utilizing MATSim's native multithreading capabilities to enhance parallelism. Periodic synchronization ensures data consistency, while fault tolerance mechanisms allow the simulation to continue smoothly even if some instances fail. This approach efficiently uses diverse computational resources based on each node's specific capabilities.The second contribution explores artificial intelligence techniques to expedite the simulation process. Specifically, we use deep neural networks to predict MATSim simulation outcomes. Initially implemented on a single node, this proof-of-concept approach efficiently uses available CPU resources. Neural networks are trained on data from previous simulations to predict key metrics like travel times and congestion levels. The outputs are compared to MATSim results to assess accuracy. This approach is designed to scale, with future plans for distributed neural network training across multiple nodes.In summary, our contributions provide new algorithmic variants and explore integrating high-performance computing and AI into multi-agent traffic simulators. We aim to demonstrate the impact of these models and technologies on traffic simulation, addressing the challenges and limitations of their implementation. Our work highlights the benefits of emerging architectures and new algorithmic concepts for enhancing the robustness and performance of traffic simulators, presenting promising results

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Macedo, Diego de Queiroz. "Experimentos em simulações paralelas do Dilema do Prisioneiro com n jogadores." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-12122011-133530/.

Повний текст джерела

Анотація:

O Dilema do Prisioneiro com n jogadores é um problema que ilustra a dificuldade na formação da cooperação em sociedades de indivíduos racionais. Diversos trabalhos foram feitos no sentido de compreender melhor os fatores que influenciam o surgimento e a evolução da cooperação nessas sociedades, sendo que muitos desses mostraram que a simulação deste tipo de problema carece de escalabilidade, o que impede a realização de experimentos que envolvam uma grande quantidade de agentes ou de parâmetros de teste. Este trabalho tem o intuito de aplicar conceitos de computação paralela para tratar este problema. Para tal, foi desenvolvido um sistema denominado PS2 E2 , evolução de um trabalho anterior, cuja utilização em alguns cenários possibilitou a verificação da influência de alguns parâmetros tais como o tamanho da população e a expressividade do modelo de representação de estratégias na utilidade global de um conjunto de agentes que jogam o Dilema do Prisioneiro com n jogadores.
The n-Player Prisoners Dilemma is a problem that illustrates the difficulty of cooperation formation in societies composed of rational individuals. Several studies were made to better understand the factors that influence the emergence and evolution of cooperation in these societies. Many of these showed that the simulation of this type of problem lacks scalability, which hinders the achievement of experiments involving a large number of agents or test parameters. This work intends to apply parallel computing concepts to treat this problem. To this end, it was developed a system called PS2 E2 , an evolution of a previous work, whose utilization in some scenarios allowed the verification of the influence of some parameters such as the population size and the expressiveness of the strategy representation model in the global utility of a society of agents that play the n-Player Prisoner Dilemma.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Patnayak, Chinmaya. "Distributed Intelligence for Multi-Agent Systems in Search and Rescue." Thesis, Virginia Tech, 2020. http://hdl.handle.net/10919/100796.

Повний текст джерела

Анотація:

Unfavorable environmental and (or) human displacement may engender the need for Search and Rescue (SAR). Challenges such as inaccessibility, large search areas, and heavy reliance on available responder count, limited equipment and training makes SAR a challenging problem. Additionally, SAR operations also pose significant risk to involved responders. This opens a remarkable opportunity for robotic systems to assist and augment human understanding of the harsh environments. A large body of work exists on the introduction of ground and aerial robots in visual and temporal inspection of search areas with varying levels of autonomy. Unfortunately, limited autonomy is the norm in such systems, due to the limitations presented by on-board UAV resources and networking capabilities. In this work we propose a new multi-agent approach to SAR and introduce a wearable compute cluster in the form factor of a backpack. The backpack allows offloading compute intensive tasks such as Lost Person Behavior Modelling, Path Planning and Deep Neural Network based computer vision applications away from the UAVs and offers significantly high performance computers to execute them. The backpack also provides for a strong networking backbone and task orchestrators which allow for enhanced coordination and resource sharing among all the agents in the system. On the basis of our benchmarking experiments, we observe that the backpack can significantly boost capabilities and success in modern SAR responses.
Master of Science
Unfavorable environmental and (or) human displacement may engender the need for Search and Rescue (SAR). Challenges such as inaccessibility, large search areas, and heavy reliance on available responder count, limited equipment and training makes SAR a challenging problem. Additionally, SAR operations also pose significant risk to involved responders. This opens a remarkable opportunity for robotic systems to assist and augment human understanding of the harsh environments. A large body of work exists on the introduction of ground and aerial robots in visual and temporal inspection of search areas with varying levels of autonomy. Unfortunately, limited autonomy is the norm in such systems, due to the limitations presented by on-board UAV resources and networking capabilities. In this work we propose a new multi-agent approach to SAR and introduce a wearable compute cluster in the form factor of a backpack. The backpack allows offloading compute intensive tasks such as Lost Person Behavior Modelling, Path Planning and Deep Neural Network based computer vision applications away from the UAVs and offers significantly high performance computers to execute them. The backpack also provides for a strong networking backbone and task orchestrators which allow for enhanced coordination and resource sharing among all the agents in the system. On the basis of our benchmarking experiments, we observe that the backpack can significantly boost capabilities and success in modern SAR responses.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Boucher, Alain. "Une approche décentralisée et adaptative de la gestion d'informations en vision ; application à l'interprétation d'images de cellules en mouvement." Phd thesis, Université Joseph Fourier (Grenoble), 1999. http://tel.archives-ouvertes.fr/tel-00004805.

Повний текст джерела

Анотація:

Cette thèse propose une nouvelle approche de la vision par ordinateur, insistant sur le rôle joué par les différentes informations et connaissances présentes dans un système intégré de vision. Ces connaissances peuvent être vues comme un but à atteindre dans la chaine de traitement ou comme un instrument pour guider ces différents traitement. Ce double rôle est mis en évidence en insistant sur la gestion des informations disponibles à tout moment pour effectuer la tâche de reconnaissance. Une approche distribuée est proposée, sous la forme d'un système multi-agents, où chaque agent est spécialisé pour la reconnaissance d'un concept de l'image. Le modèle générique d'agent est composé de quatre comportements de base : perception (croissance de région, suivi de contour), interaction (fusion de primitives), différenciation (interprétation de primitive) et reproduction (stratégie de focalisation des agents). Ces comportements prennent des décisions à l'aide d'évaluations multi-critères, faisant référence à plusieurs critères spécialisés. Des capacités d'adaptation et de coopération sont nécessaires aux agents pour mener à bien leurs tâches, et ce tant au niveau local qu'au niveau des groupes d'agents (travaillant sur un même groupement perceptuel). Ce système est appliqué pour la reconnaissance des cellules en mouvement. Chaque cellule est divisée en plusieurs composantes (noyau, pseudopode, cytoplasme, ...) qui servent de concepts de base pour la spécialisation des agents.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Johansson, Stefan J. "On Coordination in Multi-agent Systems." Doctoral thesis, Karlskrona : Department of Software Engineering & Computer Science, Blekinge Institute of Technology, 2002. http://www.bth.se/fou/Forskinfo.nsf/Sok/c7187f25921663c9c1256bb5005fc376!OpenDocument.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Sánchez, Anguix Víctor. "Complex negotiations in multi-agent systems." Doctoral thesis, Universitat Politècnica de València, 2013. http://hdl.handle.net/10251/21570.

Повний текст джерела

Анотація:

Los sistemas multi-agente (SMA) son sistemas distribuidos donde entidades autónomas llamadas agentes, ya sean humanos o software, persiguen sus propios objetivos. El paradigma de SMA ha sido propuesto como la aproximación de modelo apropiada para aplicaciones como el comercio electrónico, los sistemas multi-robot, aplicaciones de seguridad, etc. En la comunidad de SMA, la visión de sistemas multi-agente abiertos, donde agentes heterogéneos pueden entrar y salir del sistema dinámicamente, ha cobrado fuerza como paradigma de modelado debido a su relación conceptual con tecnologías como la Web, la computación grid, y las organizaciones virtuales. Debido a la heterogeneidad de los agentes, y al hecho de dirigirse por sus propios objetivos, el conflicto es un fenómeno candidato a aparecer en los sistemas multi-agente. En los últimos años, el término tecnologías del acuerdo ha sido usado para referirse a todos aquellos mecanismos que, directa o indirectamente, promueven la resolución de conflictos en sistemas computacionales como los sistemas multi-agente. Entre las tecnologías del acuerdo, la negociación automática ha sido propuesta como uno de los mecanismos clave en la resolución de conflictos debido a su uso análogo en la resolución de conflictos entre humanos. La negociación automática consiste en el intercambio automático de propuestas llevado a cabo por agentes software en nombre de sus usuarios. El objetivo final es conseguir un acuerdo con todas las partes involucradas. Pese a haber sido estudiada por la Inteligencia Artificial durante años, distintos problemas todavía no han sido resueltos por la comunidad científica todavía. El principal objetivo de esta tesis es proponer modelos de negociación para escenarios complejos donde la complejidad deriva de (1) las limitaciones computacionales o (ii) la necesidad de representar las preferencias de múltiples individuos. En la primera parte de esta tesis proponemos un modelo de negociación bilateral para el problema de
Sánchez Anguix, V. (2013). Complex negotiations in multi-agent systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/21570
Palancia

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Bonacina, Claudio. "Evolutionary computation in multi agent systems : lessons on diversity and coevolutionary control." Thesis, University of the West of England, Bristol, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275884.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Wen, Guoguang. "Distributed cooperative control for multi-agent systems." Phd thesis, Ecole Centrale de Lille, 2012. http://tel.archives-ouvertes.fr/tel-00818774.

Повний текст джерела

Анотація:

Cette thèse considère principalement trois problèmes dans le domaine du contrôle distribué coopératif des systèmes multi-agents(SMA): le consensus, la navigation en formation et le maintien en formation d'un groupe d'agents lorsqu'un agent disparait. Nous proposons 3 algorithmes pour résoudre le problème du calcul distribué d'un consensus à partir de l'approche leadeur-suiveur dans le contexte SMA à dynamique non-linéaire. La référence est définie comme un leader virtuel dont on n'obtient, localement, que les données de position et de vitesse. Pour résoudre le problème du suivi par consensus pour les SMA à dynamique non-linéaire, nous considérons le suivi par consensus pour SMA de premier ordre. On propose des résultats permettant aux suiveurs de suivre le leadeur virtuel en temps fini en ne considérant que les positions des agents. Ensuite, nous considérons le suivi par consensus de SMA de second. Dans le cas de la planification de trajectoire et la commande du mouvement de la formation multi-agents. L'idée est d'amener la formation, dont la dynamique est supposée être en 3D, d'une configuration initiale vers une configuration finale (trouver un chemin faisable en position et orientation) en maintenant sa forme tout le long du chemin en évitant les obstacles. La stratégie proposée se décompose en 3 étapes. Le problème du Closing-Rank se traduit par la réparation d'une formation rigide multi-agents "endommagée" par la perte de l'un de ses agents. Nous proposons 2 algorithmes d'autoréparation systématique pour récupérer la rigidité en cas de perte d'un agent. Ces réparations s'effectuent de manière décentralisée et distribuée n'utilisant que des informations de voisinage.

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Criado, Pacheco Natalia. "Using Norms To Control Open Multi-Agent Systems." Doctoral thesis, Universitat Politècnica de València, 2012. http://hdl.handle.net/10251/17800.

Повний текст джерела

Анотація:

Internet es, tal vez, el avance científico más relevante de nuestros días. Entre otras cosas, Internet ha permitido la evolución de los paradigmas de computación tradicionales hacia el paradigma de computaciónn distribuida, que se caracteriza por utilizar una red abierta de ordenadores. Los sistemas multiagente (SMA) son una tecnolog a adecuada para abordar los retos motivados por estos sistemas abiertos distribuidos. Los SMA son aplicaciones formadas por agentes heterog eneos y aut onomos que pueden haber sido dise~nados de forma independiente de acuerdo con objetivos y motivaciones diferentes. Por lo tanto, no es posible realizar ninguna hip otesis a priori sobre el comportamiento de los agentes. Por este motivo, los SMA necesitan de mecanismos de coordinaci on y cooperaci on, como las normas, para garantizar el orden social y evitar la aparici on de conictos. El t ermino norma cubre dos dimensiones diferentes: i) las normas como un instrumento que gu a a los ciudadanos a la hora de realizar acciones y actividades, por lo que las normas de nen los procedimientos y/o los protocolos que se deben seguir en una situaci on concreta, y ii) las normas como ordenes o prohibiciones respaldadas por un sistema de sanciones, por lo que las normas son medios para prevenir o castigar ciertas acciones. En el area de los SMA, las normas se vienen utilizando como una especi caci on formal de lo que est a permitido, obligado y prohibido dentro de una sociedad. De este modo, las normas permiten regular la vida de los agentes software y las interacciones entre ellos. La motivaci on principal de esta tesis es permitir a los dise~nadores de los SMA utilizar normas como un mecanismo para controlar y coordinar SMA abiertos. Nuestro objetivo es elaborar mecanismos normativos a dos niveles: a nivel de agente y a nivel de infraestructura. Por lo tanto, en esta tesis se aborda primero el problema de la de nici on de agentes normativos aut onomos que sean capaces de deliberar acerca
Criado Pacheco, N. (2012). Using Norms To Control Open Multi-Agent Systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/17800
Palancia

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Huhtinen, J. (Jouni). "Utilization of neural network and agent technology combination for distributed intelligent applications and services." Doctoral thesis, University of Oulu, 2005. http://urn.fi/urn:isbn:9514278550.

Повний текст джерела

Анотація:

Abstract The use of agent systems has increased enormously, especially in the field of mobile services. Intelligent services have also increased rapidly in the web. In this thesis, the utilization of software agent technology in mobile services and decentralized intelligent services in the multimedia business is introduced and described. Both Genie Agent Architecture (GAA) and Decentralized International and Intelligent Software Architecture (DIISA) are described. The common problems in decentralized software systems are lack of intelligence, communication of software modules and system learning. Another problem is the personalization of users and services. A third problem is the matching of users and service characteristics in web application level in a non-linear way. In this case it means that web services follow human steps and are capable of learning from human inputs and their characteristics in an intelligent way. This third problem is addressed in this thesis and solutions are presented with two intelligent software architectures and services. The solutions of the thesis are based on a combination of neural network and agent technology. To be more specific, solutions are based on an intelligent agent which uses certain black box information like Self-Organized Map (SOM). This process is as follows; information agents collect information from different sources like the web, databases, users, other software agents and the environment. Information is filtered and adapted for input vectors. Maps are created from a data entry of an SOM. Using maps is very simple, input forms are completed by users (automatically or manually) or user agents. Input vectors are formed again and sent to a certain map. The map gives several outputs which are passed through specific algorithms. This information is passed to an intelligent agent. The needs for web intelligence and knowledge representation serving users is a current issue in many business solutions. The main goal is to enable this by means of autonomous agents which communicate with each other using an agent communication language and with users using their native languages via several communication channels.

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Rahwan, Iyad. "Interest-based negotiation in multi-agent systems." Connect to thesis, 2004. http://repository.unimelb.edu.au/10187/2885.

Повний текст джерела

Анотація:

Software systems involving autonomous interacting software entities (or agents) present new challenges in computer science and software engineering. A particularly challenging problem is the engineering of various forms of interaction among agents. Interaction may be aimed at enabling agents to coordinate their activities, cooperate to reach common objectives, or exchange resources to better achieve their individual objectives. This thesis is concerned with negotiation: a process through which multiple self-interested agents can reach agreement over the exchange of scarce resources. In particular, I focus on settings where agents have limited or uncertain information, precluding them from making optimal individual decisions. I demonstrate that this form of bounded-rationality may lead agents to sub-optimal negotiation agreements. I argue that rational dialogue based on the exchange of arguments can enable agents to overcome this problem. Since agents make decisions based on particular underlying reasons, namely their interests, beliefs and planning knowledge, then rational dialogue over these reasons can enable agents to refine their individual decisions and consequently reach better agreements. I refer to this form of interaction as “interested-based negotiation.” (For complete abstract open document)

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Eriksson, Andreas, and Jonas Hansson. "Distributed Optimisation in Multi-Agent Systems Through Deep Reinforcement Learning." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254227.

Повний текст джерела

Анотація:

The increased availability of computing power have made reinforcement learning a popular field of science in the most recent years. Recently, reinforcement learning has been used in applications like decreasing energy consumption in data centers, diagnosing patients in medical care and in text-tospeech software. This project investigates how well two different reinforcement learning algorithms, Q-learning and deep Qlearning, can be used as a high-level planner for controlling robots inside a warehouse. A virtual warehouse was created, and the two different algorithms were tested. The reliability of both algorithms where found to be insufficient for real world applications but the deep Q-learning algorithm showed great potential and further research is encouraged.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Orwig, Richard E., Hsinchun Chen, D. Vogel, and Jay F. Nunamaker. "A Multi-Agent View of Strategic Planning Using Group Support Systems and Artificial Intelligence." Kluwer, 1996. http://hdl.handle.net/10150/105690.

Повний текст джерела

Анотація:

Artificial Intelligence Lab, Department of MIS, University of Arizona
The strategic planning process is dynamic and complex. Including a Group Support System (GSS) in the problem-solving process can improve the content quality of the strategic plan by allowing increased participation by more members of the organization. However, it can also add to the complexity of the problem by increasing the quantity of textual information that can result from group activity. Added complexity increases cognitive overload and frustrations of those participants negotiating the contents of the strategic plan. This article takes a multi-agent view of the strategic planning process. It considers group participants as multiple agents concerned with the content quality of the strategic plan. The facilitator agent is responsible for guiding groups in the strategic plan construction process as well as for solving process problems such as cognitive overload. We introduce an AI Concept Categorizer agent, a software tool that supports the facilitator in addressing the process problem of cognitive overload associated with convergent group activities by synthesizing group textual output into conceptual clusters. The implementation of this tool reduces frustrations which groups encounter in the process of classifying textual output and provides more time for discussion of the concepts themselves. Because of the large amount of convergent activity necessary for strategic planning, the addition of the AI Concept Categorizer to the strategic planning process should increase the quality of the strategic plan and the buy-in of the participants in the strategic planning process.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Rihawi, Omar. "Modelling and simulation of distributed large scale situated multi-agent systems." Thesis, Lille 1, 2014. http://www.theses.fr/2014LIL10148/document.

Повний текст джерела

Анотація:

Les systèmes multi-agents sont constitués d'entités autonomes qui interagissent avec leur environnement pour résoudre un objectif collectif. Si l'on souhaite modéliser des systèmes contenant des millions d'agents, une puissance de calcul et de stockage importante devient nécessaire. Pour atteindre de telles simulations large échelle, distribuer le simulateur sur un réseau de machines est nécessaire, mais il faut prendre en compte quelques aspects. Le premier aspect se concentre sur deux types de répartition de la charge de calcul : la première basée sur l'environnement, la deuxième basée sur les agents. Nous évaluons les performances de ces répartitions en les confrontant à des applications dont les dynamiques de déplacement sont très différentes, ce qui nous permet d'identifier plusieurs critères devant être pris en compte pour garantir des gains de performance lors de la distribution de simulations d'agents situés. Le second aspect de notre travail étudie la synchronisation. En effet, à notre connaissance, tous les simulateurs existants fonctionnent sur la base d'une synchronisation forte entre les machines, ce qui garantit la causalité temporelle et la cohérence des calculs. Dans cette thèse, nous remettons en cause cette hypothèse en étudiant la relaxation de la contrainte de synchronisation. Nous proposons deux politiques de synchronisation : la synchronisation forte classique et une forme de synchronisation reposant sur une fenêtre de temps bornée entre la machine la plus lente et la machine la plus rapide. Des applications de natures différentes sont exécutées avec ces différents mécanismes de synchronisation
This thesis aims to design a distributed large scale MAS simulation. When the number of agents reaches several millions, it is necessary to distribute MAS simulation. However, this can raise some issues: agents allocation, interactions from different machines, time management, etc. When we distribute MAS simulation on different machines, agents must be separated between these machines and should still be able to produce their normal behaviours. Our distribution is able to cover all agents' perceptions during the simulation and allow all agents to interact normally. Moreover, with large-scale simulations the main observations are done on the macroscopic level. In this thesis, we study two main aspects to distribute large-scale simulations. The first aspect is the efficient strategy that can be used to distribute MAS concepts (agents and environment). We propose two efficient distribution approaches: agents distribution and environment distribution. The second aspect is the relaxation of synchronization constraints in order to speed up the execution of large-scale simulations. Relaxing this constraint can induce incoherent interactions, which do not exist in a synchronized context. But, in some applications that can not affect the macroscopic level. Our experiments on different categories of MAS applications show that some applications can be distributed efficiently in one distribution approach more than the other. In addition, we have studied the impact of incoherent iterations on the emerging behaviour of different applications, and we have evidenced situations in which unsynchronized simulations still produced the expected macroscopic behaviour

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Wang, Tingting. "Multi-agent team competitions and the implementation of a team-strategy." HKBU Institutional Repository, 2006. http://repository.hkbu.edu.hk/etd_ra/772.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Sichman, Jaime Simao. "Du raisonnement social chez les agents : une approche fondée sur la théorie de la dépendance." Phd thesis, Grenoble INPG, 1995. https://theses.hal.science/tel-00005063.

Повний текст джерела

Анотація:

Cette thèse présente le modèle d'un mécanisme de raisonnement social fondé sur la théorie de la dépendance. Ce modèle permet à un agent de raisonner sur autrui et plus particulièrement de calculer ses relations et situations de dépendance. Un agent est dépendant d'un autre si celui-ci peut l'aider/l'empêcher d'atteindre un de ses buts. Nous considérons notre mécanisme de raisonnement social comme un composant essentiel pour la conception d'agents artificiels réellement autonomes, évoluant dans un univers multi-agents ouvert. La notion d'ouverture désigne la capacité d'ajouter ou de retirer dynamiquement dans le système des agents. Comme dans ces systèmes l'organisation des agents ne peut pas être spécifiée pendant la phase de conception, la résolution coopérative de problèmes est fondée sur la formation dynamique de coalitions. Dans ce contexte, des agents doivent être capables de s'adapter aux changements dynamiques du système, en particulier en évaluant pendant la phase de résolution si leurs buts sont réalisables et si leurs plans sont exécutables. Comme nous ne supposons pas que les agents soient bienveillants, notre modèle fournit un critère pour évaluer les partenaires le plus susceptibles d'accepter une proposition de coalition. Enfin, comme dans ces systèmes des agents n'ont pas généralement une représentation complète et correcte les uns des autres, notre modèle leur permet de détecter une inconsistance au niveau de la société et de choisir un contexte à être maintenue. Nous avons implémenté ce mécanisme de raisonnement social en utilisant une programmation orientée objet. Nous l'avons utilisé pour développer deux applications, le simulateur DEPNET et le système DEPINT, qui illustrent son utilisation selon deux perspectives scientifiques différentes. D'une part, selon une perspective de simulation sociale, notre modèle fournit un outil informatique permettant l'analyse et la prédiction des divers schémas intéressants d'interaction sociale, et l'évaluation du pouvoir social des agents. D'autre part, selon une perspective de résolution de problèmes, notre modèle peut être utilisé pour concevoir dynamiquement l'organisation des agents dans un contexte de systèmes multi-agents ouverts
This thesis presents the model of a social reasoning mechanism based on dependence theory. This model enables an agent to reason about the others, in particular to calculate his dependence relations and dependence situations. An agent is said to be dependent on another if the latter can help/prevent him to achieve one of his goals. We consider our social reasoning mechanism as an essential building block for the design of really autonomous artificial agents, which are immersed in an open multi-agent world. By open, we mean that agents may enter or leave the agency at any moment. In such systems, as the organisation of the agents can not be conceived at design time, the cooperative problem solving paradigm is based on dynamic coalition formation. In this context, agents must be able to adapt themselves to dynamically changing conditions, by evaluating at execution time if their goals are achievable and if their plans are feasible. As we do not suppose that agents are benevolent, our model proposes a criterion to evaluate which partners are more susceptible to accept a proposition of coalition. Finally, as in these kind of systems agents usually do not have a complete and correct representation of each other, our model helps them to detect an agency level inconsistency and to choose a context to be maintained. We have implemented our social reasoning mechanism using an object-oriented approach, and we have used it to develop two applications, the DEPNET simulator and the DEPINT system, which illustrate respectively its usage in two different scientific perspectives. On one hand, concerning social simulation, our model provides a computational tool for the analysis and prediction of the occurrence of several interesting patterns of social interactions, and for the evaluation of the agents' social power. On the other hand, with respect to problem solving, our model can be used to design dynamic agents' organizations in a context of open multi-agent systems

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Dal, col Laura. "On distributed control analysis and design for Multi-Agent systems subject to limited information." Thesis, Toulouse, INSA, 2016. http://www.theses.fr/2016ISAT0034/document.

Повний текст джерела

Анотація:

Les systèmes multi-agents sont des systèmes dynamiques composés par plusieurs éléments qui interagissent entre eux. Ces éléments sont appelés agents. Un agent est un système dynamique caractérisé par deux propriétés. La première est que les agents sont autonomes— c’est-à-dire qu’ils ne sont pas dirigés par l’environnement extérieur et ils peuvent évoluer selon un comportement auto-organisé. La seconde est que les agents sont capables de communiquer entre eux pour accomplir des tâches complexes, telles que la coopération, la coordination et la résolution de conflits. L’un des problèmes courants concernant les systèmes multi-agents est la synchronisation. Les agents sont synchronisés lorsque leur évolution dans le temps converge vers une trajectoire commune. Plusieurs applications du monde réel peuvent être conceptualisés comme des problèmes de synchronisation des systèmes multi-agents : par exemple, l’alignement en vitesse ( flocking en anglais), et le contrôle de la formation du mouvement de groupes cohérents. La synchronisation des systèmes multi-agents peut être obtenue grâce à différentes techniques de contrôle. Dans cette thèse nous proposons des méthodes de contrôle centralisées et distribuées pour la synchronisation des systèmes multi-agents. Nous développons des conditions nécessaires et suffisantes pour la synchronisation des systèmes multi-agents, composés par des agents identiques et linéaires qui ne changent pas dans le temps, en utilisant une approche Lyapunov. Ces conditions sont utilisées pour la conception de lois de contrôles distribuées. ensuite, nous étendons les résultats aux systèmes multi-agents soumis à des perturbations externes, assurant un niveau de performance désiré grâce à une technique de contrôle de type 퐻 ∞ . enfin, nous étendons l’analyse aux systèmes multi-agents avec contraintes sur les actionneurs, en utilisant des techniques de contrôle anti-windup. Nous évaluons l’efficacité et les performances des stratégies de contrôle proposées dans plusieurs simulations, dont deux d’entre elles sont inspirées par des applications issues du monde réel. La première est le contrôle du vol en formation d’avions, et la seconde est l’analyse de la transmission de contenus vidéo comme un problème de synchronisation. Nous comparons aussi les résultats obtenus avec des techniques de contrôle alternatives
Multi-agent systems are dynamical systems composed of multiple interacting elements known as agents . Each agent is a dynamical system with two characteristics. First, it is capable of autonomous action—that is, it is able to evolve according to a self-organised behavior, which is not influenced by the external environment. Second, it is able to exchange information with other agents in order to accomplish complex tasks, such as coordination, cooperation, and conflict resolution. One commonly studied problem in multi-agent systems is synchronization. The agents are synchronized when their time evolutions converge to a common trajectory. Many real-world applications, such as flocking and formation control, can be cast as synchronization problems. Agent synchronization can be achieved using different approaches. In this thesis, we propose distributed and centralized control paradigms for the synchronization of multi-agent systems. We develop necessary and sufficient conditions for the synchronization of multi-agent systems, composed by identical linear time-invariant agents, us- ing a Lyapunov-based approach. Then we use these conditions to design distributed synchronization controllers. Then, we extend this result to multi-agent systems subject to external disturbances enforcing disturbance rejection with 퐻 ∞ control techniques. Furthermore, we extend the analysis to multi-agent systems with actuator constraints using LMI-based anti-windup techniques. We test the proposed control design strategies in simulated examples among which two are inspired by real-world applications. In the first, we study airplane formation control as a synchronization problem. In the second, we analyze the delivery of video streams as a synchronization problem and we compare the results to existing controllers

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Dinu, Razvan. "Web Agents : towards online hybrid multi-agent systems." Thesis, Montpellier 2, 2012. http://www.theses.fr/2012MON20126/document.

Повний текст джерела

Анотація:

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

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Ajwad, Syed Ali. "Distributed control of multi-agent systems under communication constraints : application to robotics." Thesis, Poitiers, 2020. http://www.theses.fr/2020POIT2264.

Повний текст джерела

Анотація:

Les Systèmes Multi-Agents (SMA) ont gagné en popularité en raison de leur vaste gamme d'applications. Les SMA sont utilisés pour atteindre des objectifs complexes qui ne pourraient être atteints par un seul agent. La communication et l'échange d'informations entre les agents d'un SMA sont essentiels pour contrôler son comportement coopératif. Les agents partagent leurs informations avec leurs voisins pour atteindre un objectif commun, ils n'ont donc pas besoin d'unité centrale de surveillance. Cependant, la communication entre les agents est soumise à diverses contraintes pratiques. Ces contraintes incluent des périodes d'échantillonnage irrégulières et asynchrones et la disponibilité d'états partiels uniquement. Ces contraintes posent des défis théoriques et pratiques importants. Dans cette thèse, nous étudions deux problèmes fondamentaux liés au contrôle coopératif distribué, à savoir le consensus et le contrôle de formation pour un SMA à double intégrateur sous ces contraintes. On considère que chaque agent du réseau ne peut mesurer et transmettre son état de position qu'à des instants d'échantillonnage non uniformes et asynchrones. De plus, la vitesse et l'accélération ne sont pas disponibles. Dans un premier temps, nous étudions le problème du contrôle distribué du suivi de consensus. Un algorithme de suivi de leader basé sur l'observateur à temps discret continu est proposé. L'observateur estime la position et la vitesse de l'agent et de son voisin en temps continu à partir des données de position échantillonnées disponibles. Ces états estimés sont ensuite utilisés pour le calcul de l'entrée de commande. Les scénarios de topologie fixe et de topologie commutée sont discutés. Deuxièmement, un protocole de suivi de formation distribué basé sur le consensus est conçu pour réaliser des modèles de formation fixes et variant dans le temps. Le problème d'évitement de collision est également étudié dans cette thèse. Un mécanisme d'évitement de collision basé sur la fonction de potentiel artificiel (APF) est incorporé à l'algorithme de suivi de formation pour empêcher les collisions entre les agents tout en convergeant vers la position souhaitée. Enfin, les algorithmes proposés sont appliqués sur un réseau multi-robots, composé de robots à entraînement différentiel utilisant Robot Operating System (ROS). Un nouveau schéma est proposé pour faire face aux contraintes non holonomiques du robot. L'efficacité des algorithmes sont démontrées à la fois par des résultats de simulation et des expérimentations
Multi-agent systems (MAS) have gained much popularity due to their vast range of applications. MAS is deployed to achieve more complex goals which could not be realized by a single agent alone. Communication and information exchange among the agents in a MAS is crucial to control its cooperative behavior. Agents share their information with their neighbors to reach a common objective, thus do not require any central monitoring unit. However, the communication among the agents is subject to various practical constraints. These constraints include irregular and asynchronous sampling periods and the availability of partial states only. Such constraints pose significant theoretical and practical challenges. In this thesis, we investigate two fundamental problems related to distributed cooperative control, namely consensus and formation control, of double-integrator MAS under these constraints. It is considered that each agent in the network can measure and transmit its position state only at nonuniform and asynchronous sampling instants. Moreover, the velocity and acceleration are not available. First, we study the problem of distributed control of leader-following consensus. A continuous-discrete time observer based leader-following algorithm is proposed. The observer estimates the position and velocity of the agent and its neighbor in continuous time from the available sampled position data. Then these estimated states are used for the computation of the control input. Both fixed and switching topology scenarios are discussed. Secondly, a consensus based distributed formation tracking protocol is designed to achieve both fixed and time-varying formation patterns. Collision avoidance problem is also studied in this thesis. An Artificial Potential Function (APF) based collision avoidance mechanism is incorporated with the formation tracking algorithm to prevent collisions between the agents while converging to a desired position. Finally, the proposed algorithms are applied on a multi-robot network, consisting of differential drive robots using Robot Operating System (ROS). A new scheme is proposed to deal with nonholonomic constraints of the robot. Efficiency of the designed algorithms and their effectiveness in real world applications are shown through both simulation and hardware results

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Göhring, Daniel. "Constraint based world modeling for multi agent systems in dynamic environments." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2009. http://dx.doi.org/10.18452/16040.

Повний текст джерела

Анотація:

Die mobile Robotik stellt ein sehr junges und komplexes Forschungsfelder unserer Zeit dar. Innerhalb der letzten Jahrzehnte wurde es Robotern möglich, sich innerhalb ihrer Umgebung zu bewegen, zu navigieren und mit ihrer Umwelt zu interagieren. Aufgrund der Tatsache, dass die Welt von Unsicherheit geprägt ist und ein Roboter immer nur partielle Information über sie erhalten kann, wurden probabilistische Navigationsverfahren entwickelt, mit denen sich Roboter lokalisieren und Objekte ihrer Umgebung modellieren können. Weiterhin wurden in letzter Zeit Verfahren untersucht, die die kooperative Exploration der Umgebung durch eine Gruppe von Robotern zum Ziel haben. In der vorliegenden Arbeit wird ein neuartiges Konzept, welches sich Perzeptrelationen für die kooperative Umweltmodellierung zu Nutze macht, vorgestellt und evaluiert. Einen zweiten Beitrag der Arbeit stellen constraintbasierte Lokalisierungstechniken dar, die es einem oder mehreren Robotern auf effiziente Art und Weise ermöglichen, sich zu lokalisieren und ihre Umwelt zu modellieren.
Mobile autonomous robotics is a very young and complex field of research. Only in recent decades have robots become able to explore, to move, navigate and to interact with their environment. Since the world is uncertain and since robots can only gain partial information about it, probabilistic navigation algorithms have become very popular whenever a robot has to localize itself or surrounding objects. Furthermore, cooperative exploration and localization approaches have become very relevant lately, as robots begin to act not just alone but in groups. Within this thesis a new approach using the concept of spatial percept-relations for cooperative environment modeling is presented and evaluated. As a second contribution, constraint based localization techniques will be introduced for having a robot or a group of robots efficiently localized and to model their environment.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Vázquez-Salceda, Javier. "The role of norms and electronic institutions in multi-agent systems : the HARMONIA framework /." Basel [u.a.]: Birkhäuser, 2004. http://www.loc.gov/catdir/enhancements/fy0812/2004042072-d.html.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Micacchi, Christopher. "An Architecture For Multi-Agent Systems Operating In Soft Real-Time Environments With Unexpected Events." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1047.

Повний текст джерела

Анотація:

In this thesis, we explore the topic of designing an architecture and processing algorithms for a multi-agent system, where agents need to address potential unexpected events in the environment, operating under soft real-time constraints. We first develop a classification of unexpected events into Opportunities, Barriers and Potential Causes of Failure, and outline the interaction required to support the allocation of tasks for these events. We then propose a hybrid architecture to provide for agent autonomy in the system, employing a central coordinating agent. Certain agents in the community operate autonomously, while others remain under the control of the coordinating agent. The coordinator is able to determine which agents should form teams to address unexpected events in a timely manner, and to oversee those agents as they perform their tasks. The proposed architecture avoids the overhead of negotiation amongst agent teams for the assignment of tasks, a benefit when operating under limited time and resource constraints. It also avoids the bottleneck of having one coordinating agent making all decisions before work can proceed in the community, by allowing some agents to work independently. We illustrate the potential usefulness of the framework by describing an implementation of a simulator loosely based on that used for the RoboCup Rescue Simulation League contest. The implementation provides a set of simulated computers, each running a simple soft real-time operating system. On top of this basic simulation we implement the model described above and test it against two different search-and-rescue scenarios. From our experiments, we observe that our architecture is able to operate in dynamic and real-time environments, and can handle, in an appropriate and timely manner, any unexpected events that occur. We also comment on the value of our proposed approach for designing adjustable autonomy multi-agent systems and for specific environments such as robotics, where reducing the overall level of communication within the system is crucial.

Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "Distributed artificial intelligence and multi-Agent systems"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями