Spelling suggestions: "subject:"agent lemsystems"" "subject:"agent atemsystems""
51 |
A Targeting Approach To Disturbance Rejection In Multi-Agent SystemsLiu, Yining January 2012 (has links)
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.
|
52 |
Cybernetic automata: An approach for the realization of economical cognition for multi-robot systemsMathai, Nebu John 2008 May 1900 (has links)
The multi-agent robotics paradigm has attracted much attention due to the
variety of pertinent applications that are well-served by the use of a multiplicity of
agents (including space robotics, search and rescue, and mobile sensor networks). The
use of this paradigm for most applications, however, demands economical, lightweight
agent designs for reasons of longer operational life, lower economic cost, faster and
easily-verified designs, etc.
An important contributing factor to an agent’s cost is its control architecture.
Due to the emergence of novel implementation technologies carrying the promise of
economical implementation, we consider the development of a technology-independent
specification for computational machinery. To that end, the use of cybernetics toolsets
(control and dynamical systems theory) is appropriate, enabling a principled specifi-
cation of robotic control architectures in mathematical terms that could be mapped
directly to diverse implementation substrates.
This dissertation, hence, addresses the problem of developing a technologyindependent
specification for lightweight control architectures to enable robotic agents
to serve in a multi-agent scheme. We present the principled design of static and dynamical
regulators that elicit useful behaviors, and integrate these within an overall
architecture for both single and multi-agent control. Since the use of control theory
can be limited in unstructured environments, a major focus of the work is on the engineering of emergent behavior.
The proposed scheme is highly decentralized, requiring only local sensing and
no inter-agent communication. Beyond several simulation-based studies, we provide
experimental results for a two-agent system, based on a custom implementation employing
field-programmable gate arrays.
|
53 |
Multi-Agent Potential Field based Architectures for Real-Time Strategy Game BotsHagelbäck, Johan January 2012 (has links)
Real-Time Strategy (RTS) is a sub-genre of strategy games which is running in real-time, typically in a war setting. The player uses workers to gather resources, which in turn are used for creating new buildings, training combat units, build upgrades and do research. The game is won when all buildings of the opponent(s) have been destroyed. The numerous tasks that need to be handled in real-time can be very demanding for a player. Computer players (bots) for RTS games face the same challenges, and also have to navigate units in highly dynamic game worlds and deal with other low-level tasks such as attacking enemy units within fire range. This thesis is a compilation grouped into three parts. The first part deals with navigation in dynamic game worlds which can be a complex and resource demanding task. Typically it is solved by using pathfinding algorithms. We investigate an alternative approach based on Artificial Potential Fields and show how an APF based navigation system can be used without any need of pathfinding algorithms. In RTS games players usually have a limited visibility of the game world, known as Fog of War. Bots on the other hand often have complete visibility to aid the AI in making better decisions. We show that a Multi-Agent PF based bot with limited visibility can match and even surpass bots with complete visibility in some RTS scenarios. We also show how the bot can be extended and used in a full RTS scenario with base building and unit construction. In the next section we propose a flexible and expandable RTS game architecture that can be modified at several levels of abstraction to test different techniques and ideas. The proposed architecture is implemented in the famous RTS game StarCraft, and we show how the high-level architecture goals of flexibility and expandability can be achieved. In the last section we present two studies related to gameplay experience in RTS games. In games players usually have to select a static difficulty level when playing against computer oppo- nents. In the first study we use a bot that during runtime can adapt the difficulty level depending on the skills of the opponent, and study how it affects the perceived enjoyment and variation in playing against the bot. To create bots that are interesting and challenging for human players a goal is often to create bots that play more human-like. In the second study we asked participants to watch replays of recorded RTS games between bots and human players. The participants were asked to guess and motivate if a player was controlled by a human or a bot. This information was then used to identify human-like and bot-like characteristics for RTS game players.
|
54 |
The Fern algorithm for intelligent discretizationHall, John Wendell 06 November 2012 (has links)
This thesis proposes and tests a recursive, adpative, and computationally inexpensive method for partitioning real-number spaces. When tested for proof-of-concept on both one- and two- dimensional classification and control problems, the Fern algorithm was found to work well in one dimension, moderately well for two-dimensional classification, and not at all for two-dimensional control. Testing ferns as pure discretizers - which would involve a secondary discrete learner - has been left to future work. / text
|
55 |
Dynamic Credibility Threshold Assignment in Trust and Reputation Mechanisms Using PID Controller2015 July 1900 (has links)
In online shopping buyers do not have enough information about sellers and cannot inspect the products before purchasing them. To help buyers find reliable sellers, online marketplaces deploy Trust and Reputation Management (TRM) systems. These systems aggregate buyers’ feedback about the sellers they have interacted with and about the products they have purchased, to inform users within the marketplace about the sellers and products before making purchases. Thus positive customer feedback has become a valuable asset for each seller in order to attract more business. This naturally creates incentives for cheating, in terms of introducing fake positive feedback. Therefore, an important responsibility of TRM systems is to aid buyers find genuine feedback (reviews) about different sellers.
Recent TRM systems achieve this goal by selecting and assigning credible advisers to any new customer/buyer. These advisers are selected among the buyers who have had experience with a number of sellers and have provided feedback for their services and goods. As people differ in their tastes, the buyer feedback that would be most useful should come from advisers with similar tastes and values. In addition, the advisers should be honest, i.e. provide truthful reviews and ratings, and not malicious, i.e. not collude with sellers to favour them or with other buyers to badmouth some sellers.
Defining the boundary between dishonest and honest advisers is very important. However, currently, there is no systematic approach for setting the honesty threshold which divides benevolent advisers from the malicious ones. The thesis addresses this problem and proposes a market-adaptive honesty threshold management mechanism. In this mechanism the TRM system forms a feedback system which monitors the current status of the e-marketplace. According to the status of the e-marketplace the feedback system improves the performance utilizing PID controller from the field of control systems. The responsibility of this controller is to set the the suitable value of honesty threshold. The results of experiments, using simulation and real-world dataset show that the market-adaptive honesty threshold allows to optimize the performance of the marketplace with respect to throughput and buyer satisfaction.
|
56 |
Consensus analysis of networked multi-agent systems with second-order dynamics and Euler-Lagrange dynamicsMu, Bingxian 30 May 2013 (has links)
Consensus is a central issue in designing multi-agent systems (MASs). How to design
control protocols under certain communication topologies is the key for solving
consensus problems. This thesis is focusing on investigating the consensus protocols
under different scenarios: (1) The second-order system dynamics with Markov time
delays; (2) The Euler-Lagrange dynamics with uniform and nonuniform sampling
strategies and the event-based control strategy.
Chapter 2 is focused on the consensus problem of the multi-agent systems with
random delays governed by a Markov chain. For second-order dynamics under the
sampled-data setting, we first convert the consensus problem to the stability analysis
of the equivalent error system dynamics. By designing a suitable Lyapunov function
and deriving a set of linear matrix inequalities (LMIs), we analyze the mean square
stability of the error system dynamics with fixed communication topology. Since
the transition probabilities in a Markov chain are sometimes partially unknown, we
propose a method of estimating the delay for the next sampling time instant. We explicitly give a lower bound of the probability for the delay estimation which can ensure
the stability of the error system dynamics. Finally, by applying an augmentation
technique, we convert the error system dynamics to a delay-free stochastic system. A
sufficient condition is established to guarantee the consensus of the networked multi-agent
systems with switching topologies. Simulation studies for a fleet of unmanned
vehicles verify the theoretical results.
In Chapter 3, we propose the consensus control protocols involving both position
and velocity information of the MASs with the linearized Euler-Lagrange dynamics,
under uniform sampling and nonuniform sampling schemes, respectively. Then we
extend the results to the case of applying the centralized event-triggered strategy, and
accordingly analyze the consensus property. Simulation examples and comparisons
verify the effectiveness of the proposed methods. / Graduate / 0548
|
57 |
Trust Logics and Their Horn Fragments : Formalizing Socio-Cognitive Aspects of TrustNygren, Karl January 2015 (has links)
This thesis investigates logical formalizations of Castelfranchi and Falcone's (C&F) theory of trust [9, 10, 11, 12]. The C&F theory of trust defines trust as an essentially mental notion, making the theory particularly well suited for formalizations in multi-modal logics of beliefs, goals, intentions, actions, and time. Three different multi-modal logical formalisms intended for multi-agent systems are compared and evaluated along two lines of inquiry. First, I propose formal definitions of key concepts of the C&F theory of trust and prove some important properties of these definitions. The proven properties are then compared to the informal characterisation of the C&F theory. Second, the logics are used to formalize a case study involving an Internet forum, and their performances in the case study constitute grounds for a comparison. The comparison indicates that an accurate modelling of time, and the interaction of time and goals in particular, is integral for formal reasoning about trust. Finally, I propose a Horn fragment of the logic of Herzig, Lorini, Hubner, and Vercouter [25]. The Horn fragment is shown to be too restrictive to accurately express the considered case study.
|
58 |
A Targeting Approach To Disturbance Rejection In Multi-Agent SystemsLiu, Yining January 2012 (has links)
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.
|
59 |
Interest-based negotiation in multi-agent systemsRahwan, Iyad January 2004 (has links) (PDF)
Software systems involving autonomous interacting software entities (or agents) present new challenges in computer science and software engineering. A particularly challenging problem is the engineering of various forms of interaction among agents. Interaction may be aimed at enabling agents to coordinate their activities, cooperate to reach common objectives, or exchange resources to better achieve their individual objectives. This thesis is concerned with negotiation: a process through which multiple self-interested agents can reach agreement over the exchange of scarce resources. In particular, I focus on settings where agents have limited or uncertain information, precluding them from making optimal individual decisions. I demonstrate that this form of bounded-rationality may lead agents to sub-optimal negotiation agreements. I argue that rational dialogue based on the exchange of arguments can enable agents to overcome this problem. Since agents make decisions based on particular underlying reasons, namely their interests, beliefs and planning knowledge, then rational dialogue over these reasons can enable agents to refine their individual decisions and consequently reach better agreements. I refer to this form of interaction as “interested-based negotiation.” (For complete abstract open document)
|
60 |
Efficient Representation and Effective Reasoning for Multi-Agent SystemsDuy Hoang Pham Unknown Date (has links)
A multi-agent system consists of a collection of agents that interact with each other to fulfil their tasks. Individual agents can have different motivations for engaging in interactions. Also, agents can possibly recognise the goals of the other participants in the interaction. To successfully interact, an agent should exhibit the ability to balance reactivity, pro-activeness (autonomy) and sociability. That is, individual agents should deliberate not only on what they themselves know about the working environment and their desires, but also on what they know about the beliefs and desires of the other agents in their group. Multi-agent systems have proven to be a useful tool for modelling and solving problems that exhibit complex and distributed structures. Examples include real-time traffic control and monitoring, work-flow management and information retrieval in computer networks. There are two broad challenges that the agent community is currently investigating. One is the development of the formalisms for representing the knowledge the agents have about their actions, goals, plans for achieving their goals and other agents. The second challenge is the development of the reasoning mechanisms agents use to achieve autonomy during the course of their interactions. Our research interests lie in a model for the interactions among the agents, whereby the behaviour of the individual agents can be specified in a declarative manner and these specifications can be made executable. Therefore, we investigate the methods that effectively represent the agents' knowledge about their working environment (which includes other agents), to derive unrealised information from the agents' knowledge by considering that the agents can obtain only a partial image of their working environment. The research also deals with the logical reasoning about the knowledge of the other agents to achieve a better interaction. Our approach is to apply the notions of modality and non-monotonic reasoning to formalise and to confront the problem of incomplete and conflicting information when modelling multi-agent systems. The approach maintains the richness in the description of the logical method while providing an efficient and easy-to-implement reasoning mechanism. In addition to the theoretical analysis, we investigate n-person argumentation as an application that benefits from the efficiency of our approach.
|
Page generated in 0.0618 seconds