You searched for subject:(Multi agent Systems)
.
Showing records 1 – 30 of
771 total matches.
◁ [1] [2] [3] [4] [5] … [26] ▶

Anna University
1.
Ponnusamy, R.
On the retrieval effectiveness study of an adaptive multi
agent system in a Web digital library; -.
Degree: Information and Communication
Engineering, 2014, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/27368
► An agent is a computational entity similar to a software program newlinethat can be viewed as perceiving and acting upon its environment and newlineautonomous in…
(more)
▼ An agent is a computational entity similar to a
software program newlinethat can be viewed as perceiving and acting
upon its environment and newlineautonomous in its behaviors
partially depending on its own experience newlineAs an intelligent
entity an agent operates flexibly and rationally in a
newlinevariety of environmental circumstances An agent on the basis
of any newlinekey process such as problem solving, planning
decision making and newlinelearning achieves behavior flexibility
and rationality newlineMulti agent systems are those in which
several agents employ newlinetheir knowledge and coordinate their
activities and reason about the newlineprocesses of coordination
Distributed problem solving systems are newlinethose in which the
work of solving a particular problem is divided newlineamong a
number of nodes that divide and share knowledge about the
newlineproblem in developing a solution A key pattern of
interaction in Multi newlineAgent Systems MAS is a goal and task
oriented coordination both in newlinecooperative and competitive
situations newline newline
reference p.151-161
Advisors/Committee Members: Gopal, T V.
Subjects/Keywords: Multi agent; Multi Agent Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ponnusamy, R. (2014). On the retrieval effectiveness study of an adaptive multi
agent system in a Web digital library; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27368
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Ponnusamy, R. “On the retrieval effectiveness study of an adaptive multi
agent system in a Web digital library; -.” 2014. Thesis, Anna University. Accessed January 23, 2021.
http://shodhganga.inflibnet.ac.in/handle/10603/27368.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Ponnusamy, R. “On the retrieval effectiveness study of an adaptive multi
agent system in a Web digital library; -.” 2014. Web. 23 Jan 2021.
Vancouver:
Ponnusamy R. On the retrieval effectiveness study of an adaptive multi
agent system in a Web digital library; -. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Jan 23].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27368.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Ponnusamy R. On the retrieval effectiveness study of an adaptive multi
agent system in a Web digital library; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27368
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Università della Svizzera italiana
2.
Lukovic, Slobodan.
A comprehensive approach to MPSoC security: achieving
network-on-chip security : a hierarchical, multi-agent
approach.
Degree: 2012, Università della Svizzera italiana
URL: http://doc.rero.ch/record/278116
► Multiprocessor Systems-on-Chip (MPSoCs) are pervading our lives, acquiring ever increasing relevance in a large number of applications, including even safety-critical ones. MPSoCs, are becoming increasingly…
(more)
▼ Multiprocessor
Systems-on-Chip (MPSoCs) are pervading
our lives, acquiring ever increasing relevance in a large number of
applications, including even safety-critical ones. MPSoCs, are
becoming increasingly complex and heterogeneous; the Networks on
Chip (NoC paradigm has been introduced to support scalable on-chip
communication, and (in some cases) even with reconfigurability
support. The increased complexity as well as the networking
approach in turn make security aspects more critical. In this work
we propose and implement a hierarchical
multi-
agent approach
providing solutions to secure NoC based MPSoCs at different levels
of design. We develop a flexible, scalable and modular structure
that integrates protection of different elements in the MPSoC (e.g.
memory, processors) from different attack scenarios. Rather than
focusing on protection strategies specifically devised for an
individual attack or a particular core, this work aims at providing
a comprehensive, system-level protection strategy: this constitutes
its main methodological contribution. We prove feasibility of the
concepts via prototype realization in FPGA
technology.
Advisors/Committee Members: Mariagiovanna (Dir.).
Subjects/Keywords: Multi-agent systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lukovic, S. (2012). A comprehensive approach to MPSoC security: achieving
network-on-chip security : a hierarchical, multi-agent
approach. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/278116
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Lukovic, Slobodan. “A comprehensive approach to MPSoC security: achieving
network-on-chip security : a hierarchical, multi-agent
approach.” 2012. Thesis, Università della Svizzera italiana. Accessed January 23, 2021.
http://doc.rero.ch/record/278116.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Lukovic, Slobodan. “A comprehensive approach to MPSoC security: achieving
network-on-chip security : a hierarchical, multi-agent
approach.” 2012. Web. 23 Jan 2021.
Vancouver:
Lukovic S. A comprehensive approach to MPSoC security: achieving
network-on-chip security : a hierarchical, multi-agent
approach. [Internet] [Thesis]. Università della Svizzera italiana; 2012. [cited 2021 Jan 23].
Available from: http://doc.rero.ch/record/278116.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Lukovic S. A comprehensive approach to MPSoC security: achieving
network-on-chip security : a hierarchical, multi-agent
approach. [Thesis]. Università della Svizzera italiana; 2012. Available from: http://doc.rero.ch/record/278116
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Otago
3.
Savarimuthu, Amala Arul Sharmila.
Socially-Inspired Mechanisms for Restricting Exploitation in Artificial Agent Societies
.
Degree: 2011, University of Otago
URL: http://hdl.handle.net/10523/1961
► Human societies have long cultivated the ability to organise themselves into groups and have also established formal or informal rules of behaviour that are expected…
(more)
▼ Human societies have long cultivated the ability to organise themselves into groups and have also established formal or informal rules of behaviour that are expected within these groups. In the field of
multi-
agent systems, researchers are inspired by this ability of human societies to form groups and establish social control, and they have applied them to solve some of the problems in artificial
agent societies.
One of the problems in artificial
agent societies is the problem of non-cooperation, where individuals have motivations for not cooperating with other agents. An example of non-cooperation is the issue of freeriding, where some agents do not contribute to the welfare of the society but do consume valuable resources. This can be likened to the “commons” problem. The way to address this problem is by imposing strict rules by centralised institutions. However, centralised solutions suffer from performance bottlenecks, and their scalability is poor. Towards this end, our first objective of this thesis is to investigate decentralised mechanisms for facilitating social control in
agent societies. Our second objective is associated with an important attribute of modern artificial societies, which is the openness of such societies. Agents may join and/or leave these societies at any time. Towards this end, our second objective of this thesis is to investigate mechanisms which can handle the dynamism of open
agent societies.
Another key aspect in facilitating social control lies in employing appropriate mechanisms that can facilitate such control. In this thesis we are inspired by decentralised social practices found in human societies. This thesis investigates mechanisms that contribute towards the formation (via self-organisation) of different groups in an
agent society based on their cooperativeness. It demonstrates that these mechanisms help in achieving the separation of good agents (cooperators) from bad agents (noncooperators) without expelling them from the society. It demonstrates how the concepts of tags can be used for group formation and how the information about the cooperativeness of agents in the society can be spread based on using socially-inspired mechanisms. It also investigates how monitoring and control mechanisms such as referrals, voting, gossip, resource restriction, and ostracism can be used in artificial
agent societies. Thus our focus of this thesis is to develop socially-inspired mechanisms to facilitate self-organisation of groups in
agent societies to restrict exploitation. We demonstrate that the formation of groups shield “bad” agents from taking advantage of “good” agents. We also demonstrate that the society is better off if the groups are organised based on their cooperativeness.
Overall, the goal of this thesis is to investigate and demonstrate the new socially-inspired mechanisms for the self-organisation of groups in open, decentralized
agent societies. This thesis initially systematically explores closed, centralized societies and gradually moves on to open,…
Advisors/Committee Members: Purvis, Maryam (advisor).
Subjects/Keywords: Multi-agent systems;
Social simulation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Savarimuthu, A. A. S. (2011). Socially-Inspired Mechanisms for Restricting Exploitation in Artificial Agent Societies
. (Doctoral Dissertation). University of Otago. Retrieved from http://hdl.handle.net/10523/1961
Chicago Manual of Style (16th Edition):
Savarimuthu, Amala Arul Sharmila. “Socially-Inspired Mechanisms for Restricting Exploitation in Artificial Agent Societies
.” 2011. Doctoral Dissertation, University of Otago. Accessed January 23, 2021.
http://hdl.handle.net/10523/1961.
MLA Handbook (7th Edition):
Savarimuthu, Amala Arul Sharmila. “Socially-Inspired Mechanisms for Restricting Exploitation in Artificial Agent Societies
.” 2011. Web. 23 Jan 2021.
Vancouver:
Savarimuthu AAS. Socially-Inspired Mechanisms for Restricting Exploitation in Artificial Agent Societies
. [Internet] [Doctoral dissertation]. University of Otago; 2011. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10523/1961.
Council of Science Editors:
Savarimuthu AAS. Socially-Inspired Mechanisms for Restricting Exploitation in Artificial Agent Societies
. [Doctoral Dissertation]. University of Otago; 2011. Available from: http://hdl.handle.net/10523/1961

University of Waterloo
4.
Liu, Yining.
A Targeting Approach To Disturbance Rejection In Multi-Agent Systems.
Degree: 2012, University of Waterloo
URL: http://hdl.handle.net/10012/6841
► This thesis focuses on deadbeat disturbance rejection for discrete-time linear multi-agent systems. The multi-agent systems, on which Spieser and Shams’ decentralized deadbeat output regulation problem…
(more)
▼ This thesis focuses on deadbeat disturbance rejection for discrete-time linear multi-agent systems. The multi-agent systems, on which Spieser and Shams’ decentralized deadbeat output regulation problem is based, are extended by including disturbance agents. Specifically, we assume that there are one or more disturbance agents interacting with the plant agents in some known manner. The disturbance signals are assumed to be unmeasured and, for simplicity, constant. Control agents are introduced to interact with the plant agents, and each control agent is assigned a target plant agent. The goal is to drive the outputs of all plant agents to zero in finite time, despite the presence of the disturbances. In the decentralized deadbeat output regulation problem, two analysis schemes were introduced: targeting analysis, which is used to determine
whether or not control laws can be found to regulate, not all the agents, but only the target agents; and growing analysis, which is used to determine the behaviour of all the non-target agents when the control laws are applied. In this thesis these two analyses are adopted to the deadbeat disturbance rejection problem. A new necessary condition for successful disturbance rejection is derived, namely that a control agent must be connected to the same plant agent to which a disturbance agent is connected. This result puts a bound on the minimum number of control agents and constraints the locations of control agents. Then, given the premise that both targeting and growing
analyses succeed in the special case where the disturbances are all ignored, a new control approach is proposed for the linear case based on the idea of integral control and the regulation methods of Spieser and Shams. Preliminary studies show that this approach is also suitable for some nonlinear systems.
Subjects/Keywords: Disturbance rejection; Multi-agent systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liu, Y. (2012). A Targeting Approach To Disturbance Rejection In Multi-Agent Systems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6841
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Liu, Yining. “A Targeting Approach To Disturbance Rejection In Multi-Agent Systems.” 2012. Thesis, University of Waterloo. Accessed January 23, 2021.
http://hdl.handle.net/10012/6841.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liu, Yining. “A Targeting Approach To Disturbance Rejection In Multi-Agent Systems.” 2012. Web. 23 Jan 2021.
Vancouver:
Liu Y. A Targeting Approach To Disturbance Rejection In Multi-Agent Systems. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10012/6841.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liu Y. A Targeting Approach To Disturbance Rejection In Multi-Agent Systems. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6841
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
5.
Apete, Geoffroy Kokou.
Optimisation médico-économique et organisation des services d'urgences hospitalières : apport des systèmes multi-agents : Medico-economic optmimizing and organisation of hospital emergency departments : contributions of Multi-Agent Systems.
Degree: Docteur es, Economie de la santé, 2011, Université Lille II – Droit et Santé
URL: http://www.theses.fr/2011LIL2S029
► La Tarification à l’Activité (T2A) contraint les services d’urgences hospitalières à développer différentes stratégies d’'allocation efficiente des ressources. L'optimisation de la prise en charge est…
(more)
▼ La Tarification à l’Activité (T2A) contraint les services d’urgences hospitalières à développer différentes stratégies d’'allocation efficiente des ressources. L'optimisation de la prise en charge est centrale à cette problématique et vise des coûts de production couverts par les revenus induits par la T2A. Aussi, l'objectif de la thèse est d’identifier l’apport d’un Système d’Aide à la Décision (SAD) basé sur les Systèmes Multi-Agents (SMA) utilisant une modélisation basée sur un algorithme d'ordonnancement des moyens de production des soins en trois phases (OR-3P). Cette modélisation formalise l'organisation de ces services autour de cinq types d'agents. L’Agent Ordonnanceur y chargé d’affecter les personnels de l’équipe médicale et de gérer les flux de patients. Il joue un rôle prépondérant dans la recherche d’optimisation. Les résultats obtenus de l’application simulée de l’OR-3P, montrent l’optimisation des délais d’attente et de passage global, une augmentation de la productivité et une indication qualitative du bon fonctionnement de la prise en charge. Ces résultats incitent à réaliser des expérimentations dans des établissements français.
The activity-based payment, which is known in France as T2A requires hospital emergency departments, faced with a very strong growth in their activities since 1990, to develop strategies of an efficient allocation of resources. The optimization of medical treatment is central to this issue and should allow obtaining production costs covered by funding induced T2A. The main objective of the thesis was to identify the contribution of a System Decision Support (DSS) based on Multi-Agent Systems (MAS), using multi-agent modelling of care means production, using a three-phase scheduling algorithm, so called OR-3P. This modelling formalizes the organization of emergency departments around five types of agent. The scheduler Officer is responsible for assigning personnel to the medical team in an efficient framework for managing patient flow, plays the leading role in the search of optimized management. Results from the application of OR-3P, show an optimizing of the delays and the overall passage, an increase in productivity, a qualitative indication of proper functioning. These results lead to tests in French institutions.
Advisors/Committee Members: Durocher, Alain (thesis director), Hubert, Hervé (thesis director).
Subjects/Keywords: Systèmes Multi-Agents; Multi-Agent Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Apete, G. K. (2011). Optimisation médico-économique et organisation des services d'urgences hospitalières : apport des systèmes multi-agents : Medico-economic optmimizing and organisation of hospital emergency departments : contributions of Multi-Agent Systems. (Doctoral Dissertation). Université Lille II – Droit et Santé. Retrieved from http://www.theses.fr/2011LIL2S029
Chicago Manual of Style (16th Edition):
Apete, Geoffroy Kokou. “Optimisation médico-économique et organisation des services d'urgences hospitalières : apport des systèmes multi-agents : Medico-economic optmimizing and organisation of hospital emergency departments : contributions of Multi-Agent Systems.” 2011. Doctoral Dissertation, Université Lille II – Droit et Santé. Accessed January 23, 2021.
http://www.theses.fr/2011LIL2S029.
MLA Handbook (7th Edition):
Apete, Geoffroy Kokou. “Optimisation médico-économique et organisation des services d'urgences hospitalières : apport des systèmes multi-agents : Medico-economic optmimizing and organisation of hospital emergency departments : contributions of Multi-Agent Systems.” 2011. Web. 23 Jan 2021.
Vancouver:
Apete GK. Optimisation médico-économique et organisation des services d'urgences hospitalières : apport des systèmes multi-agents : Medico-economic optmimizing and organisation of hospital emergency departments : contributions of Multi-Agent Systems. [Internet] [Doctoral dissertation]. Université Lille II – Droit et Santé 2011. [cited 2021 Jan 23].
Available from: http://www.theses.fr/2011LIL2S029.
Council of Science Editors:
Apete GK. Optimisation médico-économique et organisation des services d'urgences hospitalières : apport des systèmes multi-agents : Medico-economic optmimizing and organisation of hospital emergency departments : contributions of Multi-Agent Systems. [Doctoral Dissertation]. Université Lille II – Droit et Santé 2011. Available from: http://www.theses.fr/2011LIL2S029

University of Minnesota
6.
Hildreth, Dalton James.
Learning To Communicate for Coordinated Multi-Agent Navigation.
Degree: MS, Computer Science, 2019, University of Minnesota
URL: http://hdl.handle.net/11299/206172
► This work presents a decentralized multi-agent navigation approach that allows agents to coordinate their motion through local communication. Our approach allows agents to develop their…
(more)
▼ This work presents a decentralized multi-agent navigation approach that allows agents to coordinate their motion through local communication. Our approach allows agents to develop their own emergent language of communication through an optimization process that simultaneously determines what agents say in response to their spatial observations and how agents interpret communication from others to update their motion. We apply our communication approach together with the TTC-Forces crowd simulation algorithm and show a significant decrease in congestion and bottle-necking of agents, especially in scenarios where agents benefit from close coordination. In addition to reaching their goals faster, agents using our approach show coordinated behaviors including greeting, flocking, following, and grouping.Furthermore, we observe that communication strategies optimized for one scenario often continue to provide time-efficient, coordinated motion between agents when applied to different scenarios.This suggests that the agents are learning to generalize strategies for coordination through their communication “language".
Subjects/Keywords: Animation; Learning; Motion Planning; Multi-Agent Coordination; Multi-Agent Navigation; Multi-Agent Systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hildreth, D. J. (2019). Learning To Communicate for Coordinated Multi-Agent Navigation. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/206172
Chicago Manual of Style (16th Edition):
Hildreth, Dalton James. “Learning To Communicate for Coordinated Multi-Agent Navigation.” 2019. Masters Thesis, University of Minnesota. Accessed January 23, 2021.
http://hdl.handle.net/11299/206172.
MLA Handbook (7th Edition):
Hildreth, Dalton James. “Learning To Communicate for Coordinated Multi-Agent Navigation.” 2019. Web. 23 Jan 2021.
Vancouver:
Hildreth DJ. Learning To Communicate for Coordinated Multi-Agent Navigation. [Internet] [Masters thesis]. University of Minnesota; 2019. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/11299/206172.
Council of Science Editors:
Hildreth DJ. Learning To Communicate for Coordinated Multi-Agent Navigation. [Masters Thesis]. University of Minnesota; 2019. Available from: http://hdl.handle.net/11299/206172

Universiteit Utrecht
7.
Testerink, B.J.G.
Norms for distributed organizations: Syntax, Semantics and Interpreter.
Degree: 2012, Universiteit Utrecht
URL: http://dspace.library.uu.nl:8080/handle/1874/253423
► Agents are autonomous processes which together form multi-agent systems. Often we want to make sure that these agents behave according to certain guidelines. To make…
(more)
▼ Agents are autonomous processes which together form
multi-
agent systems. Often we want to make sure that these agents behave according to certain guidelines. To make sure they do, we need control mechanisms. A possible control mechanism is an exogenous normative organization. Such an organization contains norms that represent the kind of behavior that we want from agents. Norms are regulations which can be violated. Therefore, when we program an organization we need to specify what happens when agents violate norms. Existing programming languages for exogenous normative organizations are used to make centralized control structures for
multi-
agent systems. However, some
multi-
agent system applications require a distributed control mechanism due to the structure and/or nature of the application. In this thesis we address this problem by proposing a programming language for distributed exogenous normative organizations. Norms are handled by a set of suborganizations which observe and influence a partition of the environment. We will cover the syntax, operational semantics and a prototype interpreter of the proposed programming language.
Advisors/Committee Members: Dastani, M.M..
Subjects/Keywords: Multi-Agent systems; Multi-agent organizations; Normative programming
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Testerink, B. J. G. (2012). Norms for distributed organizations: Syntax, Semantics and Interpreter. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253423
Chicago Manual of Style (16th Edition):
Testerink, B J G. “Norms for distributed organizations: Syntax, Semantics and Interpreter.” 2012. Masters Thesis, Universiteit Utrecht. Accessed January 23, 2021.
http://dspace.library.uu.nl:8080/handle/1874/253423.
MLA Handbook (7th Edition):
Testerink, B J G. “Norms for distributed organizations: Syntax, Semantics and Interpreter.” 2012. Web. 23 Jan 2021.
Vancouver:
Testerink BJG. Norms for distributed organizations: Syntax, Semantics and Interpreter. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2021 Jan 23].
Available from: http://dspace.library.uu.nl:8080/handle/1874/253423.
Council of Science Editors:
Testerink BJG. Norms for distributed organizations: Syntax, Semantics and Interpreter. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253423

Vanderbilt University
8.
Dukeman, Anton Leo.
Hybrid Mission Planning with Coalition Formation.
Degree: PhD, Computer Science, 2017, Vanderbilt University
URL: http://hdl.handle.net/1803/11548
► Robotic systems have proven effective in many domains. Some robotic domains, such as mass casualty response, require close coupling between the humans and robots that…
(more)
▼ Robotic
systems have proven effective in many domains. Some robotic domains, such as mass casualty response, require close coupling between the humans and robots that are able to adapt to the environment and tasks. The coalition formation problem allocates coalitions to each task, but does not produce executable plans. The planning problem creates executable plans, but problem difficulty scales with the number of agents and tasks in the problem. A hybrid solution to solve both problems will produce executable plans for the assigned tasks, while satisfying computational resource constraints. Four solution tools are presented and evaluated using four test domains, including a novel domain simulating the immediate response to a tornado by local government agencies. Each domain and problem was implemented in a new problem description language combining planning and coalition formation.
Planning alone is an existing tool to produce high quality plans by considering all possible interactions between tasks and agents simultaneously. However, planning alone requires large amounts of time and memory, both of which are constrained in real world applications. The coalition formation then planning tool factors the problem to reduce the required computational resources, but coalition formation cannot be relied upon to produce executable coalitions in all cases. The relaxed plan coalition augmentation tool addresses nonexecutable coalitions by selecting the
agent(s) required to produce an executable coalition. The final tool, task fusion, addresses reduced solution quality by selecting tasks and coalitions for which planning together will increase solution quality. The relaxed plan coalition augmentation tool solved at least as many problems as planning alone and averaged much less computational resource usage. The task fusion tool solved more problems than planning alone, but plan quality and computational resource usage was mixed when compared to relaxed plan coalition augmentation.
Advisors/Committee Members: Mark Ellingham (committee member), Maithilee Kunda (committee member), Eugene Vorobeychik (committee member), Julie A. Adams (Committee Chair), Gautam Biswas (Committee Chair).
Subjects/Keywords: coalition formation; multi-agent planning; robotics; planning; multi-agent systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dukeman, A. L. (2017). Hybrid Mission Planning with Coalition Formation. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/11548
Chicago Manual of Style (16th Edition):
Dukeman, Anton Leo. “Hybrid Mission Planning with Coalition Formation.” 2017. Doctoral Dissertation, Vanderbilt University. Accessed January 23, 2021.
http://hdl.handle.net/1803/11548.
MLA Handbook (7th Edition):
Dukeman, Anton Leo. “Hybrid Mission Planning with Coalition Formation.” 2017. Web. 23 Jan 2021.
Vancouver:
Dukeman AL. Hybrid Mission Planning with Coalition Formation. [Internet] [Doctoral dissertation]. Vanderbilt University; 2017. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/1803/11548.
Council of Science Editors:
Dukeman AL. Hybrid Mission Planning with Coalition Formation. [Doctoral Dissertation]. Vanderbilt University; 2017. Available from: http://hdl.handle.net/1803/11548

Kansas State University
9.
Janovsky, Pavel.
Large-scale
coalition formation: application in power distribution
systems.
Degree: PhD, Department of Computing and
Information Sciences, 2017, Kansas State University
URL: http://hdl.handle.net/2097/35328
► Coalition formation is a key cooperative behavior of a system of multiple autonomous agents. When the capabilities of individual agents are not su fficient for…
(more)
▼ Coalition formation is a key cooperative behavior of a
system of multiple autonomous agents. When the capabilities of
individual agents are not su fficient for the improvement of
well-being of the individual agents or of the entire system, the
agents can bene t by joining forces together in coalitions.
Coalition formation is a technique for finding coalitions that are
best fi tted to achieve individual or group goals. This is a
computationally expensive task because often all combinations of
agents have to be considered in order to find the best assignments
of agents to coalitions. Previous research has therefore focused
mainly on small-scale or otherwise restricted
systems. In this
thesis we study coalition formation in large-scale
multi-
agent
systems. We propose an approach for coalition formation based on
multi-
agent simulation. This approach allows us to find coalitions
in
systems with thousands of agents. It also lets us modify
behaviors of individual agents in order to better match a specific
coalition formation application. Finally, our approach can consider
both social welfare of the
multi-
agent system and well-being of
individual self-interested agents.
Power distribution
systems are
used to deliver electric energy from the transmission system to
households. Because of the increased availability of distributed
generation using renewable resources, push towards higher use of
renewable energy, and increasing use of electric vehicles, the
power distribution
systems are undergoing significant changes
towards active consumers who participate in both supply and demand
sides of the electricity market and the underlying power grid. In
this thesis we address the ongoing change in power distribution
systems by studying how the use of renewable energy can be
increased with the help of coalition formation. We propose an
approach that lets renewable generators, which face uncertainty in
generation prediction, to form coalitions with energy stores, which
on the other hand are always able to deliver the committed power.
These coalitions help decrease the uncertainty of the power
generation of renewable generators, consequently allowing the
generators to increase their use of renewable energy while at the
same time increasing their pro fits. Energy stores also bene t from
participating in coalitions with renewable generators, because they
receive payments from the generators for the availability of their
power at specific time slots. We first study this problem assuming
no physical constraints of the underlying power grid. Then we
analyze how coalition formation of renewable generators and energy
stores in a power grid with physical constraints impacts the state
of the grid, and we propose
agent behavior that leads to increase
in use of renewable energy as well as maintains stability of the
grid.
Advisors/Committee Members: Scott A. DeLoach.
Subjects/Keywords: Coalition
formation; Power
distribution systems; Multi-agent
system; Multi-agent
simulation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Janovsky, P. (2017). Large-scale
coalition formation: application in power distribution
systems. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/35328
Chicago Manual of Style (16th Edition):
Janovsky, Pavel. “Large-scale
coalition formation: application in power distribution
systems.” 2017. Doctoral Dissertation, Kansas State University. Accessed January 23, 2021.
http://hdl.handle.net/2097/35328.
MLA Handbook (7th Edition):
Janovsky, Pavel. “Large-scale
coalition formation: application in power distribution
systems.” 2017. Web. 23 Jan 2021.
Vancouver:
Janovsky P. Large-scale
coalition formation: application in power distribution
systems. [Internet] [Doctoral dissertation]. Kansas State University; 2017. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/2097/35328.
Council of Science Editors:
Janovsky P. Large-scale
coalition formation: application in power distribution
systems. [Doctoral Dissertation]. Kansas State University; 2017. Available from: http://hdl.handle.net/2097/35328

Virginia Tech
10.
Cunningham, Bryan.
Non-Reciprocating Sharing Methods in Cooperative Q-Learning Environments.
Degree: MS, Computer Science and Applications, 2012, Virginia Tech
URL: http://hdl.handle.net/10919/34610
► Past research on multi-agent simulation with cooperative reinforcement learning (RL) for homogeneous agents focuses on developing sharing strategies that are adopted and used by all…
(more)
▼ Past research on
multi-
agent simulation with cooperative reinforcement learning (RL) for homogeneous agents focuses on developing sharing strategies that are adopted and used by all agents in the environment. These sharing strategies are considered to be reciprocating because all participating agents have a predefined agreement regarding what type of information is shared, when it is shared, and how the participating
agent's policies are subsequently updated. The sharing strategies are specifically designed around manipulating this shared information to improve learning performance. This thesis targets situations where the assumption of a single sharing strategy that is employed by all agents is not valid. This work seeks to address how agents with no predetermined sharing partners can exploit groups of cooperatively learning agents to improve learning performance when compared to Independent learning. Specifically, several intra-
agent methods are proposed that do not assume a reciprocating sharing relationship and leverage the pre-existing
agent interface associated with Q-Learning to expedite learning. The other agents' functions and their sharing strategies are unknown and inaccessible from the point of view of the
agent(s) using the proposed methods. The proposed methods are evaluated on physically embodied agents in the
multi-
agent cooperative robotics field learning a navigation task via simulation. The experiments conducted focus on the effects of the following factors on the performance of the proposed non-reciprocating methods: scaling the number of agents in the environment, limiting the communication range of the agents, and scaling the size of the environment.
Advisors/Committee Members: Cao, Yong (committeechair), Kavanaugh, Andrea L. (committee member), Cao, Yang (committee member).
Subjects/Keywords: Information Exchanges in Multi-Agent Systems; Multi-Agent Reinforcement Learning; Agent Interaction Protocols; Cooperative Learning
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cunningham, B. (2012). Non-Reciprocating Sharing Methods in Cooperative Q-Learning Environments. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/34610
Chicago Manual of Style (16th Edition):
Cunningham, Bryan. “Non-Reciprocating Sharing Methods in Cooperative Q-Learning Environments.” 2012. Masters Thesis, Virginia Tech. Accessed January 23, 2021.
http://hdl.handle.net/10919/34610.
MLA Handbook (7th Edition):
Cunningham, Bryan. “Non-Reciprocating Sharing Methods in Cooperative Q-Learning Environments.” 2012. Web. 23 Jan 2021.
Vancouver:
Cunningham B. Non-Reciprocating Sharing Methods in Cooperative Q-Learning Environments. [Internet] [Masters thesis]. Virginia Tech; 2012. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10919/34610.
Council of Science Editors:
Cunningham B. Non-Reciprocating Sharing Methods in Cooperative Q-Learning Environments. [Masters Thesis]. Virginia Tech; 2012. Available from: http://hdl.handle.net/10919/34610

Universiteit Utrecht
11.
Steenbergen, J. van.
Emergence in Multi-Agent Systems.
Degree: 2012, Universiteit Utrecht
URL: http://dspace.library.uu.nl:8080/handle/1874/253745
► This thesis is meant to clarify the concept of emergence once and for all by creating order from the chaos of emergence definitions. Instead of…
(more)
▼ This thesis is meant to clarify the concept of emergence once and for all by creating order from the chaos of emergence definitions. Instead of focussing on the disagreement among scientists on the
subject, it will reveal the commonalities between the different ideas on emergence. The resulting unification will create a solid basis for further research on emergence.
Advisors/Committee Members: Vreeswijk, G.A.W..
Subjects/Keywords: emergence; multi-agent systems; definitions; unified theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Steenbergen, J. v. (2012). Emergence in Multi-Agent Systems. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253745
Chicago Manual of Style (16th Edition):
Steenbergen, J van. “Emergence in Multi-Agent Systems.” 2012. Masters Thesis, Universiteit Utrecht. Accessed January 23, 2021.
http://dspace.library.uu.nl:8080/handle/1874/253745.
MLA Handbook (7th Edition):
Steenbergen, J van. “Emergence in Multi-Agent Systems.” 2012. Web. 23 Jan 2021.
Vancouver:
Steenbergen Jv. Emergence in Multi-Agent Systems. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2021 Jan 23].
Available from: http://dspace.library.uu.nl:8080/handle/1874/253745.
Council of Science Editors:
Steenbergen Jv. Emergence in Multi-Agent Systems. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253745

Dalhousie University
12.
Gong, Xiang.
CONSENSUS ANALYSIS ON NETWORKED MULTI-AGENT SYSTEMS WITH
STOCHASTIC COMMUNICATION LINK FAILURE.
Degree: Master of Applied Science, Department of Mechanical Engineering, 2013, Dalhousie University
URL: http://hdl.handle.net/10222/21379
► This thesis is to develop a novel consensus algorithm or protocol for multi-agent systems in the event of communication link failure over the network. The…
(more)
▼ This thesis is to develop a novel consensus algorithm
or protocol for
multi-
agent systems in the event of communication
link failure over the network. The structure or topology of the
system is modeled by an algebraic graph theory, and defined as a
discrete time-invariant system with a second-order dynamics. The
communication link failure is governed by a Bernoulli process.
Lyapunov-based methodologies and Linear Matrix Inequality (LMI)
techniques are then applied to find an appropriate controller gain
by satisfying the sufficient conditions of the error dynamics.
Therefore, the controller with the calculated gain is guaranteed to
drive the system to reach a consensus. Finally, simulation and
experiment studies are carried out by using two Mobile Robot
Pioneer 3-DXs and one Pioneer 3-AT as a team to verify the proposed
work.
Advisors/Committee Members: Jason Gu (external-examiner), Ya-Jun Pan (graduate-coordinator), Mae Seto (thesis-reader), Ya-Jun Pan (thesis-supervisor), Not Applicable (ethics-approval), Not Applicable (manuscripts), Not Applicable (copyright-release).
Subjects/Keywords: Multi-agent Systems; Bernoulli Process; Data
Losses
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Gong, X. (2013). CONSENSUS ANALYSIS ON NETWORKED MULTI-AGENT SYSTEMS WITH
STOCHASTIC COMMUNICATION LINK FAILURE. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/21379
Chicago Manual of Style (16th Edition):
Gong, Xiang. “CONSENSUS ANALYSIS ON NETWORKED MULTI-AGENT SYSTEMS WITH
STOCHASTIC COMMUNICATION LINK FAILURE.” 2013. Masters Thesis, Dalhousie University. Accessed January 23, 2021.
http://hdl.handle.net/10222/21379.
MLA Handbook (7th Edition):
Gong, Xiang. “CONSENSUS ANALYSIS ON NETWORKED MULTI-AGENT SYSTEMS WITH
STOCHASTIC COMMUNICATION LINK FAILURE.” 2013. Web. 23 Jan 2021.
Vancouver:
Gong X. CONSENSUS ANALYSIS ON NETWORKED MULTI-AGENT SYSTEMS WITH
STOCHASTIC COMMUNICATION LINK FAILURE. [Internet] [Masters thesis]. Dalhousie University; 2013. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10222/21379.
Council of Science Editors:
Gong X. CONSENSUS ANALYSIS ON NETWORKED MULTI-AGENT SYSTEMS WITH
STOCHASTIC COMMUNICATION LINK FAILURE. [Masters Thesis]. Dalhousie University; 2013. Available from: http://hdl.handle.net/10222/21379

Universiteit Utrecht
13.
Poot, B.W.A.
Norm-based distributed controllers in a Multi-Agent System.
Degree: 2015, Universiteit Utrecht
URL: http://dspace.library.uu.nl:8080/handle/1874/320413
► Autonomous vehicles will most likely participate in traffic in the near future. These autonomous vehicles have private goals they want to achieve, which might conflict…
(more)
▼ Autonomous vehicles will most likely participate in traffic in the near future. These autonomous vehicles have private goals they want to achieve, which might conflict with the goals of the traffic system designers. To ensure that the goals of the system are met, the vehicle behavior needs to be influenced. Since the vehicles are autonomous, their behavior cannot be controlled di- rectly. One way of influencing behavior indirectly is through norms. A norm is a violable rule that describes correct behavior. Vehicles who do not com- ply with the norm may receive a sanction, such as a monetary fine. The norms are issued to the vehicles by traffic control
systems, which monitor the vehicles and sanction them when norm violations are detected. In this thesis, we present a formal model and a corresponding imple- mentation for a norm-based
multi-
agent system for traffic. We created a formal model of vehicles, traffic regulations and traffic controllers and im- plemented this in an extension of a state-of-the-art traffic simulator named SUMO. The features of this extension are presented in several demonstrative experiments.
Advisors/Committee Members: Dastani, M.M., Meyer, J-J.Ch..
Subjects/Keywords: Multi-Agent Systems; Norms; Traffic; SUMO
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Poot, B. W. A. (2015). Norm-based distributed controllers in a Multi-Agent System. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/320413
Chicago Manual of Style (16th Edition):
Poot, B W A. “Norm-based distributed controllers in a Multi-Agent System.” 2015. Masters Thesis, Universiteit Utrecht. Accessed January 23, 2021.
http://dspace.library.uu.nl:8080/handle/1874/320413.
MLA Handbook (7th Edition):
Poot, B W A. “Norm-based distributed controllers in a Multi-Agent System.” 2015. Web. 23 Jan 2021.
Vancouver:
Poot BWA. Norm-based distributed controllers in a Multi-Agent System. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2021 Jan 23].
Available from: http://dspace.library.uu.nl:8080/handle/1874/320413.
Council of Science Editors:
Poot BWA. Norm-based distributed controllers in a Multi-Agent System. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/320413

University of Saskatchewan
14.
Sedighi Gilani, Mohammad Hossein.
MACRM: A Multi-agent Cluster Resource Management System.
Degree: 2016, University of Saskatchewan
URL: http://hdl.handle.net/10388/ETD-2016-04-2560
► The falling cost of cluster computing has significantly increased its use in the last decade. As a result, the number of users, the size of…
(more)
▼ The falling cost of cluster computing has significantly increased its use in the last decade. As a result, the number of users, the size of clusters, and the diversity of jobs that are submitted to clusters have grown. These changes lead to a quest for redesigning of clusters' resource management
systems. The growth in the number of users and increase in the size of clusters require a more scalable approach to resource management. Moreover, ever-increasing use of clusters for carrying out a diverse range of computations demands fault-tolerant and highly available cluster management
systems. Last, but not the least, serving highly parallel and interactive jobs in a cluster with hundreds of nodes, requires high throughput scheduling with a very short service time.
This research presents MACRM, a
multi-
agent cluster resource management system. MACRM is an adaptive distributed/centralized resource management system which addresses the requirements of scalability, fault-tolerance, high availability, and high throughput scheduling. It breaks up resource management responsibilities and delegates it to different agents to be scalable in various aspects. Also, modularity in MACRM's design increases fault-tolerance because components are replicable and recoverable. Furthermore, MACRM has a very short service time in different loads. It can maintain an average service time of less than 15ms by adaptively switching between centralized and distributed decision making based on a cluster's load.
Comparing MACRM with representative centralized and distributed
systems (YARN [67] and Sparrow [52]) shows several advantages. We show that MACRM scales better when the number of resources, users, or jobs increase in a cluster. As well, MACRM has faster and less expensive failure recovery mechanisms compared with the two other
systems. And finally, our experiments show that MACRM's average service time beats the other
systems, particularly in high loads.
Advisors/Committee Members: Jamali, Nadeem, Roy, Chanchal, Stanely, Kevin, Gokaraju, Ramakrishna.
Subjects/Keywords: Cluster computing; Resource management; Multi-agent systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sedighi Gilani, M. H. (2016). MACRM: A Multi-agent Cluster Resource Management System. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/ETD-2016-04-2560
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Sedighi Gilani, Mohammad Hossein. “MACRM: A Multi-agent Cluster Resource Management System.” 2016. Thesis, University of Saskatchewan. Accessed January 23, 2021.
http://hdl.handle.net/10388/ETD-2016-04-2560.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Sedighi Gilani, Mohammad Hossein. “MACRM: A Multi-agent Cluster Resource Management System.” 2016. Web. 23 Jan 2021.
Vancouver:
Sedighi Gilani MH. MACRM: A Multi-agent Cluster Resource Management System. [Internet] [Thesis]. University of Saskatchewan; 2016. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10388/ETD-2016-04-2560.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Sedighi Gilani MH. MACRM: A Multi-agent Cluster Resource Management System. [Thesis]. University of Saskatchewan; 2016. Available from: http://hdl.handle.net/10388/ETD-2016-04-2560
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Newcastle
15.
Chen, Xi.
Sampled-data synchronization control of multi-agent systems.
Degree: PhD, 2015, University of Newcastle
URL: http://hdl.handle.net/1959.13/1294248
► Research Doctorate - Doctor of Philosophy (PhD)
The collective control of multi-agent systems has attracted more and more researcher's attention in past decades due to…
(more)
▼ Research Doctorate - Doctor of Philosophy (PhD)
The collective control of multi-agent systems has attracted more and more researcher's attention in past decades due to its wide applications in different areas. This thesis mainly studies two aspects of the collective control problems of multi-agent systems, specifically, consensus of linear multi-agent systems and synchronizarion of nonlinear and heterogenous multi-agent systems. Moreover, the controllers designed throughout the whole thesis are in sampled-data versions. For consensus of linear multi-agent systems, I firstly establish a general linear dynamic for each individual, and assume that the communication topology among the agents is fixed. After proposing the sampled-data controller, it is shown that the consensus problem is equivalent to a stability problem of a continuous-time system with a time-varying time delay. Lyapunov-Razumikbin approach is used to deal with the stability problem. I then further consider a more general case where only the union of the communication topologies has a smapping tree and only the measurement output infomration of the agents are available for the controller in sampled-data setup. This problem is proved to be equivalent to a stability problem of a discrete-time system. Lyapunov-based approach is applied to solve it. For synchronization of nonlinear and heterogeneous multi-agents, I solve the problem by two steps. The first step is to design a linear reference model for each individual and to make the reference models reach consensus under the designed controllers. The second step is to design a sampled-data controller for each individual to make the output traching its own reference model. The analysis for consensus of linear MASs can be used directly for step one, thus, I am only concerned with the step two for synchronization of nonlinear and heterogenous multi-agents, and I call this problem in a two-step mannar, that is, I firstly design a continuous dynamic controller and discretize it to the sampled-data version. Throughout the thesis, the aforementioned two main problems will be stated in five chapters. Moreover, the Introduction and Conclusion are at the beginning and the end of the thesis, respectively. The effectiveness of control design framework is supported tepretically by rigorous proof and practically validated by numerical simulation.
Advisors/Committee Members: University of Newcastle. Faculty of Engineering & Built Enviroment, School of Electrical Engineering and Computer Science.
Subjects/Keywords: sampled-data; synchronization; multi-agent systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, X. (2015). Sampled-data synchronization control of multi-agent systems. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1294248
Chicago Manual of Style (16th Edition):
Chen, Xi. “Sampled-data synchronization control of multi-agent systems.” 2015. Doctoral Dissertation, University of Newcastle. Accessed January 23, 2021.
http://hdl.handle.net/1959.13/1294248.
MLA Handbook (7th Edition):
Chen, Xi. “Sampled-data synchronization control of multi-agent systems.” 2015. Web. 23 Jan 2021.
Vancouver:
Chen X. Sampled-data synchronization control of multi-agent systems. [Internet] [Doctoral dissertation]. University of Newcastle; 2015. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/1959.13/1294248.
Council of Science Editors:
Chen X. Sampled-data synchronization control of multi-agent systems. [Doctoral Dissertation]. University of Newcastle; 2015. Available from: http://hdl.handle.net/1959.13/1294248

University of Nairobi
16.
Mutoru, Tirus.
Continuous auditing support using multi-agent systems
.
Degree: 2010, University of Nairobi
URL: http://erepository.uonbi.ac.ke:8080/xmlui/handle/123456789/13699
► The frequency of the review III a continuous auditing environment differentiates it from periodic traditional auditing. In continuous auditing the controls, transactions and financial reports…
(more)
▼ The frequency of the review III a continuous auditing environment differentiates it from periodic
traditional auditing. In continuous auditing the controls, transactions and financial reports are reviewed
as soon as the data/evidence becomes available. The "continuous" aspect of continuous auditing and
reporting refers to the near real-time capability for financial information to be checked and shared.
There lacks support tools to aid in decision making for continuous auditing. The objective of this
research was to develop a tool to assist in continuous auditing support. During a period of one year, a
new continuous auditing support tool has been developed for use by Auditors. A distributed problem
solving Multi Agent System was designed for this problem domain. The system is characterized by
group of individual agents cooperating to identify audit exceptions and report in a timely manner.
Several agents have been developed covering different systems review areas. The application is aimed
at reducing the time lapse between an audit incident and the realization of the existence of the incident
in continuous auditing. The application can be used to add value to auditors' reports since the findings
are 'fresh' and relevant to senior management. The research also draws upon the lack of tools to
support continuous auditing in transaction processing systems. The research paper explains the
rationale behind the use of Multi Agent System technology to support Continuous Auditing. The tool
was tested amongst auditors from various banks and their responses have been discussed in this report.
The tool is currently being used at a local bank in Kenya.
Subjects/Keywords: Continuous auditing support;
Multi-agent systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Mutoru, T. (2010). Continuous auditing support using multi-agent systems
. (Thesis). University of Nairobi. Retrieved from http://erepository.uonbi.ac.ke:8080/xmlui/handle/123456789/13699
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Mutoru, Tirus. “Continuous auditing support using multi-agent systems
.” 2010. Thesis, University of Nairobi. Accessed January 23, 2021.
http://erepository.uonbi.ac.ke:8080/xmlui/handle/123456789/13699.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Mutoru, Tirus. “Continuous auditing support using multi-agent systems
.” 2010. Web. 23 Jan 2021.
Vancouver:
Mutoru T. Continuous auditing support using multi-agent systems
. [Internet] [Thesis]. University of Nairobi; 2010. [cited 2021 Jan 23].
Available from: http://erepository.uonbi.ac.ke:8080/xmlui/handle/123456789/13699.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Mutoru T. Continuous auditing support using multi-agent systems
. [Thesis]. University of Nairobi; 2010. Available from: http://erepository.uonbi.ac.ke:8080/xmlui/handle/123456789/13699
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Nairobi
17.
Opiyo, Elisha TO.
Multi-Agent systems scheduler in a dynamic environment using a load optimizing strategy
.
Degree: 2012, University of Nairobi
URL: http://hdl.handle.net/11295/95991
► The problem of finding an optimal schedule of n jobs to be processed on m machines is classic. In its general form the jobs have…
(more)
▼ The problem of finding an optimal schedule of n jobs to be processed on m machines is classic. In its general form the jobs have several components called operations that can be processed in different ways on the available machines. In this thesis, the jobs are assumed to have only one operation and any job can be processed on any of the available machines. The task is to find an optimal or near optimal assignment of jobs to machines so that the makespan is minimal. The makespan is the total time it takes all the jobs to be processed. The smaller the makespan of a schedule, the better the schedule. This problem has had no satisfactory solution due Lo the huge sizes of the schedule spaces that arise in practical situations and it is also NP-hard. Its solution, however, has relevance in many areas including: job shop scheduling, resource allocation, manufacturing and distributed systems. The problem that is addressed in this thesis is to find a way of guaranteeing generating a good schedule using minimal effort. The effort, here, refers to the number of steps or schedules that must be generated and examined before a good schedule is obtained from a given schedule space.
Mathematics, operations research, economics, distributed computing and artificial intelligence are disciplines that have had interests in the solution to the classic scheduling problem. They have approached the problem using gradient-based and search-based techniques. The gradient-based approaches arc rigid and do not scale well for large, real-world scenarios. The sc arch- based methods are not able to cope with the large schedule spaces that arise out of the many real-world situations. This thesis presents an approach that used artificial intelligence. Ideas from game theory and multi-agent systems were used to formulate models in which the behavior of agents generated the schedules [78, 140, 130J. The proposition that guided the inquiry in this work was that some strategic behavior of agents exists that leads to the generation of optimal or near optimal schedules using reasonable effort in
XXI u
cuncivtc schedule spares. '1 he various existing agent behaviors wereexplored. The random, potential and dispersion strategic behaviors were explored in influencing the actions of agents in selecting the machines. The resulting schedules were evaluated based on the makespan. It was found that none of these strategic behavior of agents could individually guarantee getting a good schedule. Apart from the dispersion strategic behavior, the random and potential strategic behaviors were vulnerable to the size of the schedule space. The dispersion strategic behavior was, however, generating poorer schedules compared to the other strategies. It however, pre-empted the load optimization strategy.
It was shown that when the agents act by selecting the machines so that the overall load is minimized, then better schedules were obtained using minimal search effort. This was the load optimization strategy, which was the main contribution in this work. It wras also…
Subjects/Keywords: Multi-Agent systems; dynamic environment; optimizing strategy
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Opiyo, E. T. (2012). Multi-Agent systems scheduler in a dynamic environment using a load optimizing strategy
. (Thesis). University of Nairobi. Retrieved from http://hdl.handle.net/11295/95991
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Opiyo, Elisha TO. “Multi-Agent systems scheduler in a dynamic environment using a load optimizing strategy
.” 2012. Thesis, University of Nairobi. Accessed January 23, 2021.
http://hdl.handle.net/11295/95991.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Opiyo, Elisha TO. “Multi-Agent systems scheduler in a dynamic environment using a load optimizing strategy
.” 2012. Web. 23 Jan 2021.
Vancouver:
Opiyo ET. Multi-Agent systems scheduler in a dynamic environment using a load optimizing strategy
. [Internet] [Thesis]. University of Nairobi; 2012. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/11295/95991.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Opiyo ET. Multi-Agent systems scheduler in a dynamic environment using a load optimizing strategy
. [Thesis]. University of Nairobi; 2012. Available from: http://hdl.handle.net/11295/95991
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Otago
18.
Ebadi, Toktam.
Facilitating Cooperation in Multi-agent Robotic Systems
.
Degree: 2012, University of Otago
URL: http://hdl.handle.net/10523/2163
► This thesis presents a new framework for developing, coordinating, and managing a system of situated agents for operation in distributed spatial environments. The framework was…
(more)
▼ This thesis presents a new framework for developing, coordinating, and managing a system of situated agents for operation in distributed spatial environments. The framework was developed using
agent-oriented software engineering techniques that consider concurrent features of real
systems. It provides a realistic development environment that ensures reliable deployment of coordination schemes and mechanisms in real contexts.
The framework uses
multi-threaded agents so all the agents are executed concurrently, and each has control over its own behaviour. Such a model allows us to capture the behaviour of agents under realistic conditions where all the agents act concurrently. In addition, the framework employs Coloured Petri Net technique to model multiple, concurrent conversations in which a given
agent may be engaged.
In this framework agents must resolve complex and interdependent tasks. A Coloured Petri Net modelling technique was used to specify task plans and for the support of mechanisms both for the agents to identify task requirements and for managing the order in which various subtasks are performed. Our framework also enables the developed agents to identify subtasks that must be executed concurrently.
The framework takes into account the unreliability of
agent communication in real, physical environments by employing a timeout mechanism to test situations when communication responses are lost or delayed. It uses an environmental system time to accommodate the time delay associated with agents' responses in a distributed
multi-
agent system.
Any
agent framework must support the ability of agents to adapt according to the new circumstances. Our framework enables the agents to adapt in various ways. Agents can interact for solving various problems by changing their roles. Agents can change their roles at run-time. In addition, certain strategies were designed for agents to show how they can change their cooperation strategy in different situations to maximise their reward. A reinforcement learning mechanism was used to enable the agents to adopt the best strategies under changing circumstances.
The framework that we have developed uses the Opal
agent platform which complies with standards provided by Foundation for Intelligent Physical
Agent (FIPA). Agents in the framework use asynchronous communication, and agents' messages are sent over a network. In addition, all the messages in the system use FIPA
agent communication languages.
By providing a design environment that enables the direct deployment of developed methods on real, instantiated
agent robot
systems, this work enhances the robustness of the
agent-oriented software engineering process for mobile robots. A cooperative task execution scenario was tested using commercially available mobile robots (Garcia). The experiment demonstrated the efficiency and effectiveness of our framework in developing and deploying robots organisational models in physically distributed scenarios.
Advisors/Committee Members: Purvis, Maryam (advisor).
Subjects/Keywords: multi-agent systems;
Coloured Petri Nets;
robotics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ebadi, T. (2012). Facilitating Cooperation in Multi-agent Robotic Systems
. (Doctoral Dissertation). University of Otago. Retrieved from http://hdl.handle.net/10523/2163
Chicago Manual of Style (16th Edition):
Ebadi, Toktam. “Facilitating Cooperation in Multi-agent Robotic Systems
.” 2012. Doctoral Dissertation, University of Otago. Accessed January 23, 2021.
http://hdl.handle.net/10523/2163.
MLA Handbook (7th Edition):
Ebadi, Toktam. “Facilitating Cooperation in Multi-agent Robotic Systems
.” 2012. Web. 23 Jan 2021.
Vancouver:
Ebadi T. Facilitating Cooperation in Multi-agent Robotic Systems
. [Internet] [Doctoral dissertation]. University of Otago; 2012. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10523/2163.
Council of Science Editors:
Ebadi T. Facilitating Cooperation in Multi-agent Robotic Systems
. [Doctoral Dissertation]. University of Otago; 2012. Available from: http://hdl.handle.net/10523/2163
19.
HASANOV, TOFIG.
Application of Crowdsourcing and Multi-Agent Systems to Logistics and Finances : 物流や金融へのクラウドソーシングとマルチエージェントシステムの応用.
Degree: 博士(工学), 2016, Kyoto Institute of Technology / 京都工芸繊維大学
URL: http://hdl.handle.net/10212/2313
► As the real world problems become more complex and dynamic, industry looks for ways to shift from rigid centralized control models to more flexible and…
(more)
▼ As the real world problems become more complex and dynamic, industry looks for ways to shift from rigid centralized control models to more flexible and dynamic ones. Distributed problem-solving has become a common approach for solving many types of tasks, including logistics, data mining, finances and management. Both crowdsourcing and multi-agent systems are relatively recently emerged models for distributed problem-solving. Multi-agent systems based models are usually characterized by high fault-tolerance, good adaptability to changes and efficient resource management. Such models are particularly useful for control of large number of relatively independent but interconnected entities as is in the case of logistics, for example. The model of logic based multi-agent systems is described in the thesis. This model has demonstrated good results in a simulated experiment of cleaning robot in a smart house. This model acts as a basis of the real world applications of multi-agent systems in the other experiments describes in the thesis. Crowdsourcing on the other hand allows us to utilize human evaluation for tasks in which machine judgement is inefficient or there is not enough data for efficient machine learning. Such tasks include evaluation of people opinions, text mining, and image processing. This thesis describes several applications of multi-agent systems and crowdsourcing to real industry tasks in the areas of logistics and finances. Particularly, application of multi-agent system and crowdsourcing to map update in context of taxi navigation is described. In the experiment conducted in Azerbaijan 80 taxi drivers were using proposed system for several months. Experiment has shown that the distance per client and time per client parameters were improved by 7.42% and 15.3% respectively compared to the standard navigation system. This thesis also describes application of crowdsourcing to risk assessment of microcredits, a financial service that is rapidly gaining popularity in many developing countries. Crowdsourcing in this context is used to evaluate clients’ data using social networks. Experiment was conducted in Azerbaijan using 400 people’s social accounts data. The results demonstrate that such system is capable of giving correct predictions in 90.1% of cases, with 20% false positives and 5.9% false negatives.
Subjects/Keywords: Multi-Agent Systems; Crowdsourcing; Microcredits; Car Navigation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
HASANOV, T. (2016). Application of Crowdsourcing and Multi-Agent Systems to Logistics and Finances : 物流や金融へのクラウドソーシングとマルチエージェントシステムの応用. (Thesis). Kyoto Institute of Technology / 京都工芸繊維大学. Retrieved from http://hdl.handle.net/10212/2313
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
HASANOV, TOFIG. “Application of Crowdsourcing and Multi-Agent Systems to Logistics and Finances : 物流や金融へのクラウドソーシングとマルチエージェントシステムの応用.” 2016. Thesis, Kyoto Institute of Technology / 京都工芸繊維大学. Accessed January 23, 2021.
http://hdl.handle.net/10212/2313.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
HASANOV, TOFIG. “Application of Crowdsourcing and Multi-Agent Systems to Logistics and Finances : 物流や金融へのクラウドソーシングとマルチエージェントシステムの応用.” 2016. Web. 23 Jan 2021.
Vancouver:
HASANOV T. Application of Crowdsourcing and Multi-Agent Systems to Logistics and Finances : 物流や金融へのクラウドソーシングとマルチエージェントシステムの応用. [Internet] [Thesis]. Kyoto Institute of Technology / 京都工芸繊維大学; 2016. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10212/2313.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
HASANOV T. Application of Crowdsourcing and Multi-Agent Systems to Logistics and Finances : 物流や金融へのクラウドソーシングとマルチエージェントシステムの応用. [Thesis]. Kyoto Institute of Technology / 京都工芸繊維大学; 2016. Available from: http://hdl.handle.net/10212/2313
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Baylor University
20.
Yu, Albert Reynold, 1984-.
Optimizing multi-agent dynamics for underwater tactical applications.
Degree: M.S.E.C.E., Engineering., 2011, Baylor University
URL: http://hdl.handle.net/2104/8181
► Large groups of autonomous agents, or swarms, can exhibit complex emergent behaviors that are difficult to predict and characterize from their low-level interactions. These emergent…
(more)
▼ Large groups of autonomous agents, or swarms, can exhibit complex emergent behaviors that are difficult to predict and characterize from their low-level interactions. These emergent behaviors can have hidden implications for the performance of the swarm should the operational theater be perturbed. Thus, designing the optimal rules of operation for coordinating these
multi-
agent systems in order to accomplish a given task often requires simulations or expensive implementations. This thesis project examines swarm dynamics and the use of inversion to optimize the rules of operation of a large group of autonomous agents in order to accomplish missions of tactical relevance: specifically missions concerning underwater frequency-based standing patrols and point-defense between two competing swarms. Modified genetic algorithms and particle swarm optimization are utilized in the inversion process, producing various competing tactical responses and patrol behaviors. Swarm inversion is shown to yield effective and often creative solutions for guiding swarms of autonomous agents.
Advisors/Committee Members: Marks, Robert J. (advisor).
Subjects/Keywords: Swarm intelligence.; Multi-agent systems.; Swarm inversion.
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yu, Albert Reynold, 1. (2011). Optimizing multi-agent dynamics for underwater tactical applications. (Masters Thesis). Baylor University. Retrieved from http://hdl.handle.net/2104/8181
Chicago Manual of Style (16th Edition):
Yu, Albert Reynold, 1984-. “Optimizing multi-agent dynamics for underwater tactical applications.” 2011. Masters Thesis, Baylor University. Accessed January 23, 2021.
http://hdl.handle.net/2104/8181.
MLA Handbook (7th Edition):
Yu, Albert Reynold, 1984-. “Optimizing multi-agent dynamics for underwater tactical applications.” 2011. Web. 23 Jan 2021.
Vancouver:
Yu, Albert Reynold 1. Optimizing multi-agent dynamics for underwater tactical applications. [Internet] [Masters thesis]. Baylor University; 2011. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/2104/8181.
Council of Science Editors:
Yu, Albert Reynold 1. Optimizing multi-agent dynamics for underwater tactical applications. [Masters Thesis]. Baylor University; 2011. Available from: http://hdl.handle.net/2104/8181

Boston University
21.
Pierson, Alyssa.
Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition.
Degree: PhD, Mechanical Engineering, 2017, Boston University
URL: http://hdl.handle.net/2144/20848
► Multi-agent systems rely heavily on coordination and cooperation to achieve a variety of tasks. It is often assumed that these agents will be fully cooperative,…
(more)
▼ Multi-agent systems rely heavily on coordination and cooperation to achieve a variety of tasks. It is often assumed that these agents will be fully cooperative, or have reliable and equal performance among group members. Instead, we consider cooperation as a spectrum of possible interactions, ranging from performance variations within the group to adversarial agents. This thesis examines several scenarios where cooperation and performance are not guaranteed. Potential applications include sensor coverage, emergency response, wildlife management, tracking, and surveillance. We use geometric methods, such as Voronoi tessellations, for design insight and Lyapunov-based stability theory to analyze our proposed controllers. Performance is verified through simulations and experiments on a variety of ground and aerial robotic platforms. First, we consider the problem of Voronoi-based coverage control, where a group of robots must spread out over an environment to provide coverage. Our approach adapts online to sensing and actuation performance variations with the group. The robots have no prior knowledge of their relative performance, and in a distributed fashion, compensate by assigning weaker robots a smaller portion of the environment. Next, we consider the problem of multi-agent herding, akin to shepherding. Here, a group of dog-like robots must drive a herd of non-cooperative sheep-like agents around the environment. Our key insight in designing the control laws for the herders is to enforce geometrical relationships that allow for the combined system dynamics to reduce to a single nonholonomic vehicle. We also investigate the cooperative pursuit of an evader by a group of quadrotors in an environment with no-fly zones. While the pursuers cannot enter the no-fly zones, the evader moves freely through the zones to avoid capture. Using tools for Voronoi-based coverage control, we provide an algorithm to distribute the pursuers around the zone's boundary and minimize capture time once the evader emerges. Finally, we present an algorithm for the guaranteed capture of multiple evaders by one or more pursuers in a bounded, convex environment. The pursuers utilize properties of the evader's Voronoi cell to choose a control strategy that minimizes the safe-reachable area of the evader, which in turn leads to the evader's capture.
Subjects/Keywords: Robotics; Distributed networks; Multi-agent systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pierson, A. (2017). Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/20848
Chicago Manual of Style (16th Edition):
Pierson, Alyssa. “Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition.” 2017. Doctoral Dissertation, Boston University. Accessed January 23, 2021.
http://hdl.handle.net/2144/20848.
MLA Handbook (7th Edition):
Pierson, Alyssa. “Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition.” 2017. Web. 23 Jan 2021.
Vancouver:
Pierson A. Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition. [Internet] [Doctoral dissertation]. Boston University; 2017. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/2144/20848.
Council of Science Editors:
Pierson A. Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition. [Doctoral Dissertation]. Boston University; 2017. Available from: http://hdl.handle.net/2144/20848

Universitat Politècnica de València
22.
Criado Pacheco, Natalia.
Using Norms To Control Open Multi-Agent Systems
.
Degree: 2012, Universitat Politècnica de València
URL: 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…
(more)
▼ 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
Advisors/Committee Members: Argente Villaplana, Estefanía (advisor), Botti Navarro, Vicente Juan (advisor), Noriega, Pablo (advisor).
Subjects/Keywords: Norms;
Multi-agent systems;
Artificial intelligence
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Criado Pacheco, N. (2012). Using Norms To Control Open Multi-Agent Systems
. (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/17800
Chicago Manual of Style (16th Edition):
Criado Pacheco, Natalia. “Using Norms To Control Open Multi-Agent Systems
.” 2012. Doctoral Dissertation, Universitat Politècnica de València. Accessed January 23, 2021.
http://hdl.handle.net/10251/17800.
MLA Handbook (7th Edition):
Criado Pacheco, Natalia. “Using Norms To Control Open Multi-Agent Systems
.” 2012. Web. 23 Jan 2021.
Vancouver:
Criado Pacheco N. Using Norms To Control Open Multi-Agent Systems
. [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2012. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10251/17800.
Council of Science Editors:
Criado Pacheco N. Using Norms To Control Open Multi-Agent Systems
. [Doctoral Dissertation]. Universitat Politècnica de València; 2012. Available from: http://hdl.handle.net/10251/17800

University of Waterloo
23.
Fadakar, Iman.
Spatial Formation Control.
Degree: 2015, University of Waterloo
URL: http://hdl.handle.net/10012/10068
► In this thesis, we study robust spatial formation control from several aspects. First, we study robust adaptive attitude synchronization for a network of rigid body…
(more)
▼ In this thesis, we study robust spatial formation control from several aspects. First, we study robust adaptive attitude synchronization for a network of rigid body agents using various attitude error functions defined on SO(3). Our results are particularly useful for networks with large initial attitude difference. We devise an adaptive geometric approach to cope with situations where the inertia matrices are not available for measurement. We use the Frobenius norm as a measure for the difference between the actual values of inertia matrices and their estimated values, to construct the individual adaptive laws of the agents. Compared to the previous methods for synchronization on SO(3) such as those which are based on quaternions, our proposed approach does not contain any attitude representation ambiguity. As the final part of our studies from the attitude synchronization aspect, we analyze robustness to external disturbances and unmodeled dynamics, and propose a method to attenuate such effects. Simulation results illustrate the effectiveness of the proposed approach. In the next part of the thesis, we study the distributed localization of the extremum point of unknown quadratic functions representing various physical or artificial signal potential fields. It is assumed that the value of such functions can be measured at each instant. Using high pass filtering of the measured signals, a linear parametric model is obtained for system identification. For design purposes, we add a consensus term to modify the identification subsystem. Next, we analyze the exponential convergence of the proposed estimation scheme using algebraic graph theory. In addition, we derive a distributed identifiability condition and use it for the construction of distributed extremum seeking control laws. In particular, we show that for a network of connected agents, if each agent contains a portion of the dithering signals, it is still possible to drive the system states to the extremum point provided that the distributed identifiability condition is satisfied. In the final part of this research, several robust control problems for general linear time invariant multi-agent systems are studied. We consider the robust consensus problem in the presence of unknown Lipschitz nonlinearities and polytopic uncertainties in the model of each agent. Next, this problem is solved in the presence of external disturbances. A set of control laws is proposed for the network to attain the consensus task and under the zero initial condition, achieves the desired H-infinity performance. We show that by implementing the modified versions of these control laws, it is possible to perform two-time scales formation control.
Subjects/Keywords: Distributed control; Multi-agent systems; Adaptive control
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Fadakar, I. (2015). Spatial Formation Control. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10068
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Fadakar, Iman. “Spatial Formation Control.” 2015. Thesis, University of Waterloo. Accessed January 23, 2021.
http://hdl.handle.net/10012/10068.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Fadakar, Iman. “Spatial Formation Control.” 2015. Web. 23 Jan 2021.
Vancouver:
Fadakar I. Spatial Formation Control. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10012/10068.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Fadakar I. Spatial Formation Control. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/10068
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
24.
Guler, Samet.
Adaptive Formation Control of Cooperative Multi-Vehicle Systems.
Degree: 2015, University of Waterloo
URL: http://hdl.handle.net/10012/10082
► The literature comprises many approaches and results for the formation control of multi-vehicle systems; however, the results established for the cases where the vehicles contain…
(more)
▼ The literature comprises many approaches and results for the formation control of multi-vehicle systems; however, the results established for the cases where the vehicles contain parametric uncertainties are limited. Motivated by the need for explicit characterization of the effects of uncertainties on multi-vehicle formation motions, we study distributed adaptive formation control of multi-vehicle systems in this thesis, focusing on different interrelated sub-objectives. We first examine the cohesive motion control problem of minimally persistent formations of autonomous vehicles. Later, we consider parametric uncertainties in vehicle dynamics in such autonomous vehicle formations. Following an indirect adaptive control approach and exploiting the features of the certainty equivalence principle, we propose control laws to solve maneuvering problem of the formations, robust to parametric modeling uncertainties. Next, as a formation acquisition/closing ranks problem, we study the adaptive station keeping problem, which is defined as positioning an autonomous mobile vehicle A inside a multi-vehicle network, having specified distances from the existing vehicles of the network. In this setting, a single-integrator model is assumed for the kinematics for the vehicle A, and A is assumed to have access to only its own position and its continuous distance measurements to the vehicles of the network. We partition the problem into two sub-problems; localization of the existing vehicles of the network using range-only measurements and motion control of A to its desired location within the network with respect to other vehicles. We design an indirect adaptive control scheme, provide formal stability and convergence analysis and numerical simulation results, demonstrating the characteristics and performance of the design. Finally, we study re-design of the proposed station keeping scheme for the more challenging case where the vehicle A has non-holonomic motion dynamics and does not have access to its self-location information. Overall, the thesis comprises methods and solutions to four correlated formation control problems in the direction of achieving a unified distributed adaptive formation control framework for multi-vehicle systems.
Subjects/Keywords: Multi-agent systems; Formation control; Adaptive Control
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Guler, S. (2015). Adaptive Formation Control of Cooperative Multi-Vehicle Systems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10082
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Guler, Samet. “Adaptive Formation Control of Cooperative Multi-Vehicle Systems.” 2015. Thesis, University of Waterloo. Accessed January 23, 2021.
http://hdl.handle.net/10012/10082.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Guler, Samet. “Adaptive Formation Control of Cooperative Multi-Vehicle Systems.” 2015. Web. 23 Jan 2021.
Vancouver:
Guler S. Adaptive Formation Control of Cooperative Multi-Vehicle Systems. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2021 Jan 23].
Available from: http://hdl.handle.net/10012/10082.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Guler S. Adaptive Formation Control of Cooperative Multi-Vehicle Systems. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/10082
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of North Texas
25.
Patil, Riya Raghuvir.
A Lego Mindstorms Nxt Based Test Bench for Multiagent Exploratory Systems and Distributed Network Partitioning.
Degree: 2014, University of North Texas
URL: https://digital.library.unt.edu/ark:/67531/metadc500196/
► Networks of communicating agents require distributed algorithms for a variety of tasks in the field of network analysis and control. For applications such as swarms…
(more)
▼ Networks of communicating agents require distributed algorithms for a variety of tasks in the field of network analysis and control. For applications such as swarms of autonomous vehicles, ad hoc and wireless sensor networks, and such military and civilian applications as exploring and patrolling a robust autonomous system that uses a distributed algorithm for self-partitioning can be significantly helpful. A single team of autonomous vehicles in a field may need to self-dissemble into multiple teams, conducive to completing multiple control tasks. Moreover, because communicating agents are
subject to changes, namely, addition or failure of an
agent or link, a distributed or decentralized algorithm is favorable over having a central
agent. A framework to help with the study of self-partitioning of such
multi agent systems that have most basic mobility model not only saves our time in conception but also gives us a cost effective prototype without negotiating the physical realization of the proposed idea. In this thesis I present my work on the implementation of a flexible and distributed stochastic partitioning algorithm on the Lego® Mindstorms’ NXT on a graphical programming platform using National Instruments’ LabVIEW™ forming a team of communicating agents via NXT-Bee radio module. We single out mobility, communication and self-partition as the core elements of the work. The goal is to randomly explore a precinct for reference sites. Agents who have discovered the reference sites announce their target acquisition to form a network formed based upon the distance of each
agent with the other wherein the self-partitioning begins to find an optimal partition. Further, to illustrate the work, an experimental test-bench of five Lego NXT robots is presented.
Advisors/Committee Members: Wan, Yan, Namaduri, Kamesh, Fu, Shengli.
Subjects/Keywords: Distributed; partitioning; multi-agent; exploratory systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share






Louisiana State University
26.
Cai, Xiaoyu.
Graph rigidity-based formation control of planar multi-agent systems.
Degree: PhD, Mechanical Engineering, 2013, Louisiana State University
URL: etd-07052013-123849
;
https://digitalcommons.lsu.edu/gradschool_dissertations/1666
► A multi-agent system is a network of interacting "agents" that collectively perform a complex task. This dissertation is concerned with the decentralized formation control of…
(more)
▼ A multi-agent system is a network of interacting "agents" that collectively perform a complex task. This dissertation is concerned with the decentralized formation control of multi-agent systems moving in the plane. The formation problem is defined as designing control inputs for the agents so that they form and maintain a pre-defined, planar geometric shape. The focus is on three related problems with increasing level of complexity: formation acquisition, formation maneuvering, and target interception. Three different "dynamic" models, also with increasing level of complexity, are considered for the motion of the agents: the single-integrator model, the double-integrator model, and the full mechanical dynamic model. Rigid graph theory and Lyapunov theory are the primary tools utilized in this work for solving the aforementioned formation problems for the three models. The backstepping control technique also plays a key role in the cases of the double-integrator and full dynamic models. Starting with the single-integrator model, a basic formation acquisition controller is proposed that is only a function of the relative position of agents in an infinitesimally and minimally rigid graph. A Lyapunov analysis shows that the origin of the inter-agent distance error system is exponentially stable. It is then shown how an extra term can be added to the controller to enable formation maneuvering or target interception. The three controllers for the single-integrator model are used as a stepping stone and extended to the double-integrator model with the aid of backstepping. Finally, an actuator-level, formation acquisition control law is developed for multiple robotic vehicles that accounts for the vehicle dynamics. Specifically, a class of underactuated vehicles modeled by Euler-Lagrange-like equations is considered. The backstepping technique is again employed while exploiting the structural properties of the system dynamics. Computer simulations are provided throughout the dissertation to show the proposed control laws in action.
Subjects/Keywords: formation control; multi-agent systems; Lyapunov stability
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cai, X. (2013). Graph rigidity-based formation control of planar multi-agent systems. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07052013-123849 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1666
Chicago Manual of Style (16th Edition):
Cai, Xiaoyu. “Graph rigidity-based formation control of planar multi-agent systems.” 2013. Doctoral Dissertation, Louisiana State University. Accessed January 23, 2021.
etd-07052013-123849 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1666.
MLA Handbook (7th Edition):
Cai, Xiaoyu. “Graph rigidity-based formation control of planar multi-agent systems.” 2013. Web. 23 Jan 2021.
Vancouver:
Cai X. Graph rigidity-based formation control of planar multi-agent systems. [Internet] [Doctoral dissertation]. Louisiana State University; 2013. [cited 2021 Jan 23].
Available from: etd-07052013-123849 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1666.
Council of Science Editors:
Cai X. Graph rigidity-based formation control of planar multi-agent systems. [Doctoral Dissertation]. Louisiana State University; 2013. Available from: etd-07052013-123849 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1666

Louisiana State University
27.
Pandey, Abhishek.
Consensusability of discrete-time multi-agent systems.
Degree: MSEE, Electrical and Computer Engineering, 2012, Louisiana State University
URL: etd-05252012-133308
;
https://digitalcommons.lsu.edu/gradschool_theses/2083
► The study of multi-agent systems (MAS) focuses on systems in which many intelligent agents interact within an environment. The agents are considered to be autonomous…
(more)
▼ The study of multi-agent systems (MAS) focuses on systems in which many intelligent agents interact within an environment. The agents are considered to be autonomous entities. MAS can be used to solve problems that are difficult or impossible for an individual agent to solve. The main feature which is achieved when developing MAS, if they work, is flexibility, since MAS can be added to, modified and reconstructed, without the need for detailed rewriting of the application. MAS can manifest self-organization as well as self-steering related complex behaviors even when the individual strategies of all their agents are simple. The goal of MAS research is to find methods that allow us to build complex systems composed of autonomous agents who, while operating on local knowledge and possessing only limited abilities, are nonetheless capable of enacting the desired global behaviors. We want to know how to take a description of what a system of agents should do and break it down into individual agent behaviors. This thesis investigates the problem when discrete-time MAS are consensusable under undirected graph. A discussion is provided to show how the problem differs from continuous time system. Then a consensusability condition is derived in terms of the Mahler measure of the agent system for single input single out systems (SISO) and result shows that there is an improved consensusability by a power of two. An algorithm is proposed for distributed consensus feedback control law when the consensusability holds. Also the case of output feedback is considered in which the consensusability problem becomes more complicated. To solve this we decompose the problem into two parts i.e. state feedback and state estimation. Simulation results demonstrate the effectiveness of the established results.
Subjects/Keywords: Output Feedback; Multi-agent Systems; Consensusability
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pandey, A. (2012). Consensusability of discrete-time multi-agent systems. (Masters Thesis). Louisiana State University. Retrieved from etd-05252012-133308 ; https://digitalcommons.lsu.edu/gradschool_theses/2083
Chicago Manual of Style (16th Edition):
Pandey, Abhishek. “Consensusability of discrete-time multi-agent systems.” 2012. Masters Thesis, Louisiana State University. Accessed January 23, 2021.
etd-05252012-133308 ; https://digitalcommons.lsu.edu/gradschool_theses/2083.
MLA Handbook (7th Edition):
Pandey, Abhishek. “Consensusability of discrete-time multi-agent systems.” 2012. Web. 23 Jan 2021.
Vancouver:
Pandey A. Consensusability of discrete-time multi-agent systems. [Internet] [Masters thesis]. Louisiana State University; 2012. [cited 2021 Jan 23].
Available from: etd-05252012-133308 ; https://digitalcommons.lsu.edu/gradschool_theses/2083.
Council of Science Editors:
Pandey A. Consensusability of discrete-time multi-agent systems. [Masters Thesis]. Louisiana State University; 2012. Available from: etd-05252012-133308 ; https://digitalcommons.lsu.edu/gradschool_theses/2083

University of Canterbury
28.
Zhou, Di.
A model driven architecture based approach for developing multi-agent systems.
Degree: MS, Computer Science, 2008, University of Canterbury
URL: http://dx.doi.org/10.26021/2727
► The research described in this thesis is an attempt to utilize the Model Driven Architecture for semi-automatically developing a prototype Multi-Agent System to support the…
(more)
▼ The research described in this thesis is an attempt to utilize the Model Driven Architecture for semi-automatically developing a prototype Multi-Agent System to support the management of a real container terminal. Agent technology has been increasingly applied in Transport Logistics and seems to be a viable solution to support the container terminal management. Thus, from the user point of view, the focus of this research is to investigate the applicability of Multi-Agent Systems to assist the container terminal's decision makers in improving the container terminal productivity, which is often measured in terms of the productivity of cranes. A prototype Multi-Agent System has been developed to evaluate and compare a set of proposed vehicle dispatching strategies, which are a collection of rules that a vehicle (e.g. straddle carrier) uses to decide the priority of serving the working cranes. Employing an appropriate dispatching strategy may greatly improve the efficiency of vehicle allocation to the working cranes, so as to increase the utilization of cranes which directly enhance the container terminal productivity. In order to investigate the applicability of the Multi-Agent System for supporting the container terminal management, experiments have been conducted in a variety of real-world scenarios. The experiment results have revealed that Multi-Agent Systems are applicable to assist container terminal decision makers in evaluating operating strategies. On the other hand, from the developer point of view, the author investigates how to apply the Model Driven Architecture to agent technologies, providing a partially automated support for the derivation of Multi-Agent System implementation from the agent-oriented design, independently from the target implementation platforms. The Model Driven Architecture approach studied in this research is a model-driven software development process that explicitly separates models at three different levels of abstraction: platform independent models, platform specific models, and implementation models. In contrast to the conventional code-centric software development, the Model Driven Architecture based software development uses models as the primary engineering artifacts. The adopted development approach is to take a high-level abstraction model of a system and transform it into a set of platform specific models, each of which is in turn transformed into the corresponding implementation. Transformations between models are automatically carried out by a set of transformation tools. The experience of using the Model Driven Architecture for the development of the prototype Multi-Agent System has revealed the following benefits: (a) automated transformations between models increase software productivity; (b) separating the high-level specification of the system from the underlying implementation technology improves the portability of the system's high-level abstraction model; (c) strong separation of concerns, guaranteed consistency between models, and automatic generation of source…
Subjects/Keywords: multi-agent systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zhou, D. (2008). A model driven architecture based approach for developing multi-agent systems. (Masters Thesis). University of Canterbury. Retrieved from http://dx.doi.org/10.26021/2727
Chicago Manual of Style (16th Edition):
Zhou, Di. “A model driven architecture based approach for developing multi-agent systems.” 2008. Masters Thesis, University of Canterbury. Accessed January 23, 2021.
http://dx.doi.org/10.26021/2727.
MLA Handbook (7th Edition):
Zhou, Di. “A model driven architecture based approach for developing multi-agent systems.” 2008. Web. 23 Jan 2021.
Vancouver:
Zhou D. A model driven architecture based approach for developing multi-agent systems. [Internet] [Masters thesis]. University of Canterbury; 2008. [cited 2021 Jan 23].
Available from: http://dx.doi.org/10.26021/2727.
Council of Science Editors:
Zhou D. A model driven architecture based approach for developing multi-agent systems. [Masters Thesis]. University of Canterbury; 2008. Available from: http://dx.doi.org/10.26021/2727

University of Manchester
29.
Wang, Chunyan.
Consensus Control for Multi-Agent Sytems with Input
Delay.
Degree: 2016, University of Manchester
URL: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:304858
► This thesis applies predictor-based methods for the distributed consensus control of multi-agent systems with input delay. "Multi-agent systems" is a term used to describe a…
(more)
▼ This thesis applies predictor-based methods for the
distributed consensus control of multi-agent systems with input
delay. "Multi-agent systems" is a term used to describe a group of
agents which are connected together to achieve specified control
tasks over a communication network. In many applications, the
subsystems or agents are required to reach an agreement upon
certain quantities of interest, which is referred to as "consensus
control". This input delay may represent delays in the network
communication. The main contribution of this thesis is to provide
feasible methods to deal with the consensus control for general
multi-agent systems with input delay.The consensus control for
general linear multi-agent systems with parameter uncertainties and
input delay is first investigated under directed network
connection. Artstein reduction method is applied to deal with the
input delay. By transforming the Laplacian matrix into the real
Jordan form, delay-dependent conditions are derived to guarantee
the robust consensus control for uncertain multi-agent systems with
input delay. Then, the results are extended to a class of Lipschitz
nonlinear multi-agent systems and the impacts of Lipschitz
nonlinearity and input delay in consensus control are investigated.
By using tools from control theory and graph theory, sufficient
conditions based on the Lipschitz constant are identified for
proposed protocols to tackle the nonlinear terms in the system
dynamics.Other than the time delay, external disturbances are
inevitable in various practical systems including the multi-agent
systems. The consensus disturbance rejection problems are
investigated. For linear multi-agent systems with bounded external
disturbances, Truncated Predictor Feedback (TPF) approach is
applied to deal with the input delay and the H_infinity consensus
analysis is put in the framework of Lyapunov analysis. Sufficient
conditions are derived to guarantee the H_infinity consensus in
time domain. Some disturbances in real engineering problems have
inherent characteristics such as harmonics and unknown constant
load. For those kinds of disturbances in Lipschitz nonlinear
multi-agent systems with input delay, Disturbance Observer-Based
Control (DOBC) technique is applied to design the disturbance
observers. A new predictor-based control scheme is constructed for
each agent by utilizing the estimate of the disturbance and the
prediction of the relative state information. Sufficient
delay-dependent conditions are derived to guarantee consensus with
disturbance rejection.
None
None
Advisors/Committee Members: LENNOX, BARRY B, Lennox, Barry, Ding, Zhengtao.
Subjects/Keywords: Consensus Control; Multi-Agent Systems; Input Delay
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wang, C. (2016). Consensus Control for Multi-Agent Sytems with Input
Delay. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:304858
Chicago Manual of Style (16th Edition):
Wang, Chunyan. “Consensus Control for Multi-Agent Sytems with Input
Delay.” 2016. Doctoral Dissertation, University of Manchester. Accessed January 23, 2021.
http://www.manchester.ac.uk/escholar/uk-ac-man-scw:304858.
MLA Handbook (7th Edition):
Wang, Chunyan. “Consensus Control for Multi-Agent Sytems with Input
Delay.” 2016. Web. 23 Jan 2021.
Vancouver:
Wang C. Consensus Control for Multi-Agent Sytems with Input
Delay. [Internet] [Doctoral dissertation]. University of Manchester; 2016. [cited 2021 Jan 23].
Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:304858.
Council of Science Editors:
Wang C. Consensus Control for Multi-Agent Sytems with Input
Delay. [Doctoral Dissertation]. University of Manchester; 2016. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:304858

Université Montpellier II
30.
Dinu, Razvan.
Web Agents : towards online hybrid multi-agent systems : Agents Web : vers des systèmes multi-agents hybrides en ligne.
Degree: Docteur es, Informatique, 2012, Université Montpellier II
URL: http://www.theses.fr/2012MON20126
► 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…
(more)
▼ 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…
Advisors/Committee Members: Ferber, Jacques (thesis director), Stratulat, Tiberiu (thesis director).
Subjects/Keywords: Agents Web; Humain; Interaction; En Ligne; Agent Artificiel; Systems Multi-Agent; Web Agents; Human; Interaction; Online; Artificial agent; Multi-Agent System
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dinu, R. (2012). Web Agents : towards online hybrid multi-agent systems : Agents Web : vers des systèmes multi-agents hybrides en ligne. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2012MON20126
Chicago Manual of Style (16th Edition):
Dinu, Razvan. “Web Agents : towards online hybrid multi-agent systems : Agents Web : vers des systèmes multi-agents hybrides en ligne.” 2012. Doctoral Dissertation, Université Montpellier II. Accessed January 23, 2021.
http://www.theses.fr/2012MON20126.
MLA Handbook (7th Edition):
Dinu, Razvan. “Web Agents : towards online hybrid multi-agent systems : Agents Web : vers des systèmes multi-agents hybrides en ligne.” 2012. Web. 23 Jan 2021.
Vancouver:
Dinu R. Web Agents : towards online hybrid multi-agent systems : Agents Web : vers des systèmes multi-agents hybrides en ligne. [Internet] [Doctoral dissertation]. Université Montpellier II; 2012. [cited 2021 Jan 23].
Available from: http://www.theses.fr/2012MON20126.
Council of Science Editors:
Dinu R. Web Agents : towards online hybrid multi-agent systems : Agents Web : vers des systèmes multi-agents hybrides en ligne. [Doctoral Dissertation]. Université Montpellier II; 2012. Available from: http://www.theses.fr/2012MON20126
◁ [1] [2] [3] [4] [5] … [26] ▶
.