subject:(Multiagent Coordination)

Oregon State University

1. Nasroullahi, Ehsan. Combining coordination mechanisms to improve performance in multi-robot teams.

Degree: MS, Mechanical Engineering, 2012, Oregon State University

URL: http://hdl.handle.net/1957/28352

► Coordination is essential to achieving good performance in cooperative multiagent systems. To date, most work has focused on either implicit or explicit coordination mechanisms, while… (more)

Subjects/Keywords: Multiagent Coordination; Multiagent systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nasroullahi, E. (2012). Combining coordination mechanisms to improve performance in multi-robot teams. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/28352

Chicago Manual of Style (16^th Edition):

Nasroullahi, Ehsan. “Combining coordination mechanisms to improve performance in multi-robot teams.” 2012. Masters Thesis, Oregon State University. Accessed March 04, 2021. http://hdl.handle.net/1957/28352.

MLA Handbook (7^th Edition):

Nasroullahi, Ehsan. “Combining coordination mechanisms to improve performance in multi-robot teams.” 2012. Web. 04 Mar 2021.

Vancouver:

Nasroullahi E. Combining coordination mechanisms to improve performance in multi-robot teams. [Internet] [Masters thesis]. Oregon State University; 2012. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1957/28352.

Council of Science Editors:

Nasroullahi E. Combining coordination mechanisms to improve performance in multi-robot teams. [Masters Thesis]. Oregon State University; 2012. Available from: http://hdl.handle.net/1957/28352

Oregon State University

2. Soria Zurita, Nicolas Francisco. Design of Complex Engineered Systems Using Multiagent Coordination.

Degree: MS, Mechanical Engineering, 2016, Oregon State University

URL: http://hdl.handle.net/1957/59480

► This thesis is the combination of two research publications working toward a unified strategy in which the design of complex engineered systems can be completed… (more)

▼ This thesis is the combination of two research publications working toward a unified strategy in which the design of complex engineered systems can be completed using a multiagent coordination approach. Current engineered system modeling techniques segment large complex models into multiple groups to be simulated independently. These methods restrict the evaluations of such complex systems, as their failure properties are typically unknown until they are experienced in operation. In an effort to help engineers to design complex engineered systems, this research proposes that a distributed yet non-legislated approach can be used in the design processes by splitting up the overall system into specific teams. The approach specifically hypothesizes that multiagent credit assignment can be used to effectively determine how to properly incentivize subsystem designers so that the global set of system-level objectives can be achieved. The first publication presents a multiagent systems based approach for designing a selfreplicating robotic manufacturing factory in space. The simulation in this work is able to present the coordination of the agents during the construction of the factory as the parameters of the learning algorithm are changed. The results show the advantage of using a learning algorithm to design a large system. The second publication presents a hybrid approach to design complex engineered systems, providing a method in which design decisions can be reconciled without the need for either detailed interaction models or external legislating mechanisms. The results of this paper demonstrate that a team of autonomous agents using a cooperative coevolutionary algorithm can effectively design a complex engineered system. Each publication utilized a system model to illustrate and simulate the methods and potential results. By designing complex systems with a multiagent coordination approach, a design methodology can be developed in an effort to reduce design uncertainty and provide mechanisms through which the system level impact of decisions can be estimated without explicitly modeling such interactions. Advisors/Committee Members: Tumer, Irem Y. (advisor), Tumer, Kagan (committee member).

Subjects/Keywords: Multiagent coordination; Multiagent systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Soria Zurita, N. F. (2016). Design of Complex Engineered Systems Using Multiagent Coordination. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/59480

Chicago Manual of Style (16^th Edition):

Soria Zurita, Nicolas Francisco. “Design of Complex Engineered Systems Using Multiagent Coordination.” 2016. Masters Thesis, Oregon State University. Accessed March 04, 2021. http://hdl.handle.net/1957/59480.

MLA Handbook (7^th Edition):

Soria Zurita, Nicolas Francisco. “Design of Complex Engineered Systems Using Multiagent Coordination.” 2016. Web. 04 Mar 2021.

Vancouver:

Soria Zurita NF. Design of Complex Engineered Systems Using Multiagent Coordination. [Internet] [Masters thesis]. Oregon State University; 2016. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1957/59480.

Council of Science Editors:

Soria Zurita NF. Design of Complex Engineered Systems Using Multiagent Coordination. [Masters Thesis]. Oregon State University; 2016. Available from: http://hdl.handle.net/1957/59480

Universidade do Rio Grande do Sul

3. Oliveira, Denise de. Aprendizado em sistemas multiagente através de coordenação oportunista.

Degree: 2009, Universidade do Rio Grande do Sul

URL: http://hdl.handle.net/10183/26857

►

O tamanho da representação de ações e estados conjuntos é um fator chave que limita o uso de algoritmos de apendizado por reforço multiagente em… (more)

Subjects/Keywords: Inteligência artificial; Multiagent systems; Sistemas multiagentes; Reinforcement learning; Coordination; Cadeias : Markov

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Oliveira, D. d. (2009). Aprendizado em sistemas multiagente através de coordenação oportunista. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/26857

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Oliveira, Denise de. “Aprendizado em sistemas multiagente através de coordenação oportunista.” 2009. Thesis, Universidade do Rio Grande do Sul. Accessed March 04, 2021. http://hdl.handle.net/10183/26857.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Oliveira, Denise de. “Aprendizado em sistemas multiagente através de coordenação oportunista.” 2009. Web. 04 Mar 2021.

Vancouver:

Oliveira Dd. Aprendizado em sistemas multiagente através de coordenação oportunista. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2009. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/10183/26857.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oliveira Dd. Aprendizado em sistemas multiagente através de coordenação oportunista. [Thesis]. Universidade do Rio Grande do Sul; 2009. Available from: http://hdl.handle.net/10183/26857

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Michigan

4. Sleight, Jason Lee. Agent-Driven Representations, Algorithms, and Metrics for Automated Organizational Design.

Degree: PhD, Computer Science and Engineering, 2015, University of Michigan

URL: http://hdl.handle.net/2027.42/113616

► As cooperative multiagent systems (MASs) increase in interconnectivity, complexity, size, and longevity, coordinating the agents' reasoning and behaviors becomes increasingly difficult. One approach to address… (more)

▼ As cooperative multiagent systems (MASs) increase in interconnectivity, complexity, size, and longevity, coordinating the agents' reasoning and behaviors becomes increasingly difficult. One approach to address these issues is to use insights from human organizations to design structures within which the agents can more efficiently reason and interact. Generally speaking, an organization influences each agent such that, by following its respective influences, an agent can make globally-useful local decisions without having to explicitly reason about the complete joint coordination problem. For example, an organizational influence might constrain and/or inform which actions an agent performs. If these influences are well-constructed to be cohesive and correlated across the agents, then each agent is influenced into reasoning about and performing only the actions that are appropriate for its (organizationally-designated) portion of the joint coordination problem. In this dissertation, I develop an agent-driven approach to organizations, wherein the foundation for representing and reasoning about an organization stems from the needs of the agents in the MAS. I create an organizational specification language to express the possible ways in which an organization could influence the agents' decision making processes, and leverage details from those decision processes to establish quantitative, principled metrics for organizational performance based on the expected impact that an organization will have on the agents' reasoning and behaviors. Building upon my agent-driven organizational representations, I identify a strategy for automating the organizational design process~(ODP), wherein my ODP computes a quantitative description of organizational patterns and then searches through those possible patterns to identify an (approximately) optimal set of organizational influences for the MAS. Evaluating my ODP reveals that it can create organizations that both influence the MAS into effective patterns of joint policies and also streamline the agents' decision making in a coordinate manner. Finally, I use my agent-driven approach to identify characteristics of effective abstractions over organizational influences and a heuristic strategy for converging on a good abstraction. Advisors/Committee Members: Durfee, Edmund H. (committee member), Cohn, Amy Ellen (committee member), Lesser, Victor R. (committee member), Baveja, Satinder Singh (committee member).

Subjects/Keywords: Artificial Intelligence; Multiagent Coordination; Organizational Design; Computer Science; Engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sleight, J. L. (2015). Agent-Driven Representations, Algorithms, and Metrics for Automated Organizational Design. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/113616

Chicago Manual of Style (16^th Edition):

Sleight, Jason Lee. “Agent-Driven Representations, Algorithms, and Metrics for Automated Organizational Design.” 2015. Doctoral Dissertation, University of Michigan. Accessed March 04, 2021. http://hdl.handle.net/2027.42/113616.

MLA Handbook (7^th Edition):

Sleight, Jason Lee. “Agent-Driven Representations, Algorithms, and Metrics for Automated Organizational Design.” 2015. Web. 04 Mar 2021.

Vancouver:

Sleight JL. Agent-Driven Representations, Algorithms, and Metrics for Automated Organizational Design. [Internet] [Doctoral dissertation]. University of Michigan; 2015. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2027.42/113616.

Council of Science Editors:

Sleight JL. Agent-Driven Representations, Algorithms, and Metrics for Automated Organizational Design. [Doctoral Dissertation]. University of Michigan; 2015. Available from: http://hdl.handle.net/2027.42/113616

Penn State University

5. Wray, Kyle Hollins. A Game Theoretic Approach to Multi-agent Systems in Highly Dynamic, Information-sparse, Role Assignment Scenarios.

Degree: 2012, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/16056

► The wide array of problems found in the field of Multi-Agent Systems (MAS) require rapid coordination toward a desired system state amidst the often limited… (more)

▼ The wide array of problems found in the field of Multi-Agent Systems (MAS) require rapid coordination toward a desired system state amidst the often limited and inaccurate information observed by the agents within. This thesis investigates the conditions surrounding this kind of emergent coordination. We focus primarily on a problem entitled Defender and provide a solution that leverages game theory in its agents' construction. Defender is a multi-predator multi-prey problem in which the predators seek to capture as many prey as possible before any of the prey reach their haven. The problem itself is a continuous noisy version of scenarios found throughout the MAS literature, particularly in the RoboCup, an annual robotic soccer competition. As such, it defines two sides as goal regions with its agents restricted to observational noise and a limited field of view. It specifically examines dynamically changing versions of learning algorithms like fictitious play, rational learning, and regret matching, in addition to baseline algorithms following minimax regret and greedy strategies. These algorithms operate in an anti-coordination game, which only rewards agents that select different actions from one another. Furthermore, this thesis presents optimizations to these algorithms and tests their robustness in ad hoc team scenarios. Results show that fictitious play outperforms all other algorithms and tends toward strong cooperative behavior. In order to improve the algorithms in these kinds of problems, we also developed an adaptive communication architecture. The Distributed Communication Architecture (DCA) algorithm addresses the common issue found in real-world systems, specifically the message passing structure between agents. It is able to dynamically assign time slots to agents in a completely distributed manner. We apply this algorithm to Defender and show that while communication is not required to achieve emergent cooperation, it can improve the quality of agent's observations and subsequent decisions. Overall, this thesis investigates these primary topics to address the problem of constructing a team of agents seeking to cooperatively behave in a highly dynamic environment. Advisors/Committee Members: Vijaykrishnan Narayanan, Thesis Advisor/Co-Advisor, Benjamin Berry Thompson, Thesis Advisor/Co-Advisor.

Subjects/Keywords: Multiagent Systems; Game Theory; Fictitious Play; Anti-Coordination Games; Predator Prey; Uncertainty; Robotics; Cooperation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wray, K. H. (2012). A Game Theoretic Approach to Multi-agent Systems in Highly Dynamic, Information-sparse, Role Assignment Scenarios. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/16056

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wray, Kyle Hollins. “A Game Theoretic Approach to Multi-agent Systems in Highly Dynamic, Information-sparse, Role Assignment Scenarios.” 2012. Thesis, Penn State University. Accessed March 04, 2021. https://submit-etda.libraries.psu.edu/catalog/16056.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wray, Kyle Hollins. “A Game Theoretic Approach to Multi-agent Systems in Highly Dynamic, Information-sparse, Role Assignment Scenarios.” 2012. Web. 04 Mar 2021.

Vancouver:

Wray KH. A Game Theoretic Approach to Multi-agent Systems in Highly Dynamic, Information-sparse, Role Assignment Scenarios. [Internet] [Thesis]. Penn State University; 2012. [cited 2021 Mar 04]. Available from: https://submit-etda.libraries.psu.edu/catalog/16056.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wray KH. A Game Theoretic Approach to Multi-agent Systems in Highly Dynamic, Information-sparse, Role Assignment Scenarios. [Thesis]. Penn State University; 2012. Available from: https://submit-etda.libraries.psu.edu/catalog/16056

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

6. Kvaternik, Karla. Decentralized Coordination Control for Dynamic Multiagent Systems.

Degree: PhD, 2015, University of Toronto

URL: http://hdl.handle.net/1807/69348

► Engineered networks such as power grids, communication networks and logistics operations are becoming increasingly interdependent and comprised of intelligent components that are capable of autonomously… (more)

▼ Engineered networks such as power grids, communication networks and logistics operations are becoming increasingly interdependent and comprised of intelligent components that are capable of autonomously processing and influencing their local environment, as well as interacting with other such components. These emerging capabilities are poised to enable unprecedented efficiency gains across previously disparate application domains. Fully harnessing this potential is contingent in part on our ability to effect coordinated local interactions among such components, ensuring their optimal collective behavior. In this thesis we formulate several Decentralized Coordination Control Problems (DCCPs) for networked multiagent systems involving either static or dynamic agents. We propose that Consensus Optimization (CO) methods constitute a viable foundation for the synthesis of coordination control strategies that address large classes of DCCPs. In order to understand both the potential and the limitations of such strategies, we develop a new framework for the convergence analysis of general CO schemes. In contrast with existing analytic approaches, our framework is based on powerful system-theoretic techniques enabling the study of DCCP scenarios in which the agent dynamics interact with those of the CO algorithm itself, thereby affecting its performance. Aside from fulfilling its intended purpose, our analytic viewpoint also leads to the relaxation of several standard assumptions imposed on numerical CO algorithms, and suggests a methodical approach to deriving conditions under which existing centralized optimization methods can be decentralized. In addition, we propose the Reduced Consensus Optimization (RCO) algorithm – a streamlined variant of CO which is more innately suited to the DCCP context. Agents implementing RCO generally need not be aware of the network size and topology, and the overall processing and communication overhead associated with agent coordination may be substantially reduced relative to CO. On the basis of RCO, we propose a methodology for the design of decentralized content caching strategies in information-centric networks. Advisors/Committee Members: Pavel, Lacra, Electrical and Computer Engineering.

Subjects/Keywords: Consensus Optimization; Control Theory; Cooperative Systems; Coordination Control; Decentralized Optimization; Multiagent Systems; 0537

12 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kvaternik, K. (2015). Decentralized Coordination Control for Dynamic Multiagent Systems. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/69348

Chicago Manual of Style (16^th Edition):

Kvaternik, Karla. “Decentralized Coordination Control for Dynamic Multiagent Systems.” 2015. Doctoral Dissertation, University of Toronto. Accessed March 04, 2021. http://hdl.handle.net/1807/69348.

MLA Handbook (7^th Edition):

Kvaternik, Karla. “Decentralized Coordination Control for Dynamic Multiagent Systems.” 2015. Web. 04 Mar 2021.

Vancouver:

Kvaternik K. Decentralized Coordination Control for Dynamic Multiagent Systems. [Internet] [Doctoral dissertation]. University of Toronto; 2015. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1807/69348.

Council of Science Editors:

Kvaternik K. Decentralized Coordination Control for Dynamic Multiagent Systems. [Doctoral Dissertation]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/69348

University of Michigan

7. Zhang, Qi. Making and Keeping Probabilistic Commitments for Trustworthy Multiagent Coordination.

Degree: PhD, Computer Science & Engineering, 2020, University of Michigan

URL: http://hdl.handle.net/2027.42/162948

► In a large number of real world domains, such as the control of autonomous vehicles, team sports, medical diagnosis and treatment, and many others, multiple… (more)

▼ In a large number of real world domains, such as the control of autonomous vehicles, team sports, medical diagnosis and treatment, and many others, multiple autonomous agents need to take actions based on local observations, and are interdependent in the sense that they rely on each other to accomplish tasks. Thus, achieving desired outcomes in these domains requires interagent coordination. The form of coordination this thesis focuses on is commitments, where an agent, referred to as the commitment provider, specifies guarantees about its behavior to another, referred to as the commitment recipient, so that the recipient can plan and execute accordingly without taking into account the details of the provider's behavior. This thesis grounds the concept of commitments into decision-theoretic settings where the provider's guarantees might have to be probabilistic when its actions have stochastic outcomes and it expects to reduce its uncertainty about the environment during execution. More concretely, this thesis presents a set of contributions that address three core issues for commitment-based coordination: probabilistic commitment adherence, interpretation, and formulation. The first contribution is a principled semantics for the provider to exercise maximal autonomy that responds to evolving knowledge about the environment without violating its probabilistic commitment, along with a family of algorithms for the provider to construct policies that provably respect the semantics and make explicit tradeoffs between computation cost and plan quality. The second contribution consists of theoretical analyses and empirical studies that improve our understanding of the recipient's interpretation of the partial information specified in a probabilistic commitment; the thesis shows that it is inherently easier for the recipient to robustly model a probabilistic commitment where the provider promises to enable preconditions that the recipient requires than where the provider instead promises to avoid changing already-enabled preconditions. The third contribution focuses on the problem of formulating probabilistic commitments for the fully cooperative provider and recipient; the thesis proves structural properties of the agents' values as functions of the parameters of the commitment specification that can be exploited to achieve orders of magnitude less computation for 1) formulating optimal commitments in a centralized manner, and 2) formulating (approximately) optimal queries that induce (approximately) optimal commitments for the decentralized setting in which information relevant to optimization is distributed among the agents. Advisors/Committee Members: Baveja, Satinder Singh (committee member), Durfee, Edmund H (committee member), Lewis, Richard L (committee member), Sinha, Arunesh (committee member).

Subjects/Keywords: Multiagent Coordination; Sequential Decision Making; Commitment; Markov Decision Process; Computer Science; Engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, Q. (2020). Making and Keeping Probabilistic Commitments for Trustworthy Multiagent Coordination. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/162948

Chicago Manual of Style (16^th Edition):

Zhang, Qi. “Making and Keeping Probabilistic Commitments for Trustworthy Multiagent Coordination.” 2020. Doctoral Dissertation, University of Michigan. Accessed March 04, 2021. http://hdl.handle.net/2027.42/162948.

MLA Handbook (7^th Edition):

Zhang, Qi. “Making and Keeping Probabilistic Commitments for Trustworthy Multiagent Coordination.” 2020. Web. 04 Mar 2021.

Vancouver:

Zhang Q. Making and Keeping Probabilistic Commitments for Trustworthy Multiagent Coordination. [Internet] [Doctoral dissertation]. University of Michigan; 2020. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2027.42/162948.

Council of Science Editors:

Zhang Q. Making and Keeping Probabilistic Commitments for Trustworthy Multiagent Coordination. [Doctoral Dissertation]. University of Michigan; 2020. Available from: http://hdl.handle.net/2027.42/162948

Universidade do Rio Grande do Norte

8. Azevedo, Samuel Oliveira de. Sistema de agentes poligínicos para esteganálise de imagens digitais .

Degree: 2007, Universidade do Rio Grande do Norte

URL: http://repositorio.ufrn.br/handle/123456789/17965

► In this work, we propose a multi agent system for digital image steganalysis, based on the poliginic bees model. Such approach aims to solve the… (more)

Subjects/Keywords: Esteganografia; Esteganálise; Segmentação de imagens; Criptologia; Poliginia; Sistemas multi-agentes; Coordenação; Steganography; Steganalysis; Image segmentation; Cryptology; Poliginy; Multiagent systems; Coordination

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Azevedo, S. O. d. (2007). Sistema de agentes poligínicos para esteganálise de imagens digitais . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/17965

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Azevedo, Samuel Oliveira de. “Sistema de agentes poligínicos para esteganálise de imagens digitais .” 2007. Thesis, Universidade do Rio Grande do Norte. Accessed March 04, 2021. http://repositorio.ufrn.br/handle/123456789/17965.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Azevedo, Samuel Oliveira de. “Sistema de agentes poligínicos para esteganálise de imagens digitais .” 2007. Web. 04 Mar 2021.

Vancouver:

Azevedo SOd. Sistema de agentes poligínicos para esteganálise de imagens digitais . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2007. [cited 2021 Mar 04]. Available from: http://repositorio.ufrn.br/handle/123456789/17965.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Azevedo SOd. Sistema de agentes poligínicos para esteganálise de imagens digitais . [Thesis]. Universidade do Rio Grande do Norte; 2007. Available from: http://repositorio.ufrn.br/handle/123456789/17965

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Cara, Frank Araujo de Abreu. Uma heurística ganha-ganha para formação de coalizões em sistemas multiagentes.

Degree: Mestrado, Sistemas Eletrônicos, 2013, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/3/3142/tde-26122013-145159/ ;

►

Sistemas multiagentes muitas vezes apresentam características que os aproximam de sociedades de agentes e, como as humanas, possuem normas e organizações com o objetivo de… (more)

▼

Sistemas multiagentes muitas vezes apresentam características que os aproximam de sociedades de agentes e, como as humanas, possuem normas e organizações com o objetivo de coordenar as interações entre os seus membros. Coalizão é um tipo de estrutura organizacional temporária, montada com objetivos específicos. A teoria dos jogos estuda formalmente o fenômeno coalizional, se detendo em demonstrações de propriedades e características dessa estrutura. A área de sistemas multiagentes, por outro lado, tem mostrado significativo interesse nas estruturas coalizionais como forma de organizar a cooperação entre os agentes, dedicando-se ao desenvolvimento de algoritmos para formação de coalizões. Esse trabalho apresenta um algoritmo de formação de coalizões para compartilhamento de recursos, denominado heurística ganha-ganha. Definimos um modelo que utiliza a abstração de recursos para representar tanto a posse de habilidades e objetos, quanto para representar os objetivos dos agentes. Um jogo de votação k-ponderado é utilizado para implementar o processo decisório de quais coalizões são válidas e o algoritmo testa iterativamente cada vizinhança de um agente na busca de associações vantajosas. Demonstramos que o algoritmo incrementa monotonicamente o bem-estar da sociedade e converge para uma estrutura coalizional. Também mostramos empiricamente que a heurística é eficiente para compartilhamento de recursos em situações de abundância de recursos, montando coalizões em poucas iterações e com uma quantidade grande de agentes.

Multiagent systems frequently show characteristics that come closer to agent societies and, like the humans ones, have norms and organizations in order to coordinate the interactions of its members. Coalition is a type of temporary organizational structure, assembled with specific goals. Game theory formally studies the coalitional phenomenon focusing in the demonstrations of properties and characteristics of this structure. The area of multiagent systems, on the other hand, has devoted significant interest in coalition structures as a way to organize cooperation between its members, and has been dedicated to the development of algorithms for coalition formation. This dissertation presents an algorithm to coalition formation named win-win heuristic. We define a model which uses the abstraction of resources to represent either, the possession of abilities and objects, or to represent the agents target. A k-weight voting game is used to implement the decision process of what coalitions are worth and an iteratively algorithm tests each agent neighborhood in the pursue of better associations. We demonstrate that the algorithm monotonically increases the society welfare and converges to a coalitional structure. We also show empirically that the heuristic is efficient for resource sharing in situations of availability of resources, building coalitions with few iterations and a large amount of agents.

Advisors/Committee Members: Netto, Marcio Lobo.

Subjects/Keywords: Coalition formation; Cooperação e coordenação; Cooperation and coordination; Formação de coalizões; Multiagent systems; Negociação; Negotiation; Sistemas multiagentes

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cara, F. A. d. A. (2013). Uma heurística ganha-ganha para formação de coalizões em sistemas multiagentes. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3142/tde-26122013-145159/ ;

Chicago Manual of Style (16^th Edition):

Cara, Frank Araujo de Abreu. “Uma heurística ganha-ganha para formação de coalizões em sistemas multiagentes.” 2013. Masters Thesis, University of São Paulo. Accessed March 04, 2021. http://www.teses.usp.br/teses/disponiveis/3/3142/tde-26122013-145159/ ;.

MLA Handbook (7^th Edition):

Cara, Frank Araujo de Abreu. “Uma heurística ganha-ganha para formação de coalizões em sistemas multiagentes.” 2013. Web. 04 Mar 2021.

Vancouver:

Cara FAdA. Uma heurística ganha-ganha para formação de coalizões em sistemas multiagentes. [Internet] [Masters thesis]. University of São Paulo; 2013. [cited 2021 Mar 04]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3142/tde-26122013-145159/ ;.

Council of Science Editors:

Cara FAdA. Uma heurística ganha-ganha para formação de coalizões em sistemas multiagentes. [Masters Thesis]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/3/3142/tde-26122013-145159/ ;

University of Michigan

10. Pappachan, Pradeep M. Coordinating plan execution in dynamic multiagent environments.

Degree: PhD, Computer science, 2002, University of Michigan

URL: http://hdl.handle.net/2027.42/130344

► Autonomous agents operating in shared, dynamic environments need to coordinate their plans to preclude negative interactions. In this dissertation, we describe an online algorithm that… (more)

Subjects/Keywords: Autonomous Agents; Coordinating; Coordination; Dynamic; Environments; Multiagent; Plan Execution

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pappachan, P. M. (2002). Coordinating plan execution in dynamic multiagent environments. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/130344

Chicago Manual of Style (16^th Edition):

Pappachan, Pradeep M. “Coordinating plan execution in dynamic multiagent environments.” 2002. Doctoral Dissertation, University of Michigan. Accessed March 04, 2021. http://hdl.handle.net/2027.42/130344.

MLA Handbook (7^th Edition):

Pappachan, Pradeep M. “Coordinating plan execution in dynamic multiagent environments.” 2002. Web. 04 Mar 2021.

Vancouver:

Pappachan PM. Coordinating plan execution in dynamic multiagent environments. [Internet] [Doctoral dissertation]. University of Michigan; 2002. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2027.42/130344.

Council of Science Editors:

Pappachan PM. Coordinating plan execution in dynamic multiagent environments. [Doctoral Dissertation]. University of Michigan; 2002. Available from: http://hdl.handle.net/2027.42/130344

Pontifical Catholic University of Rio de Janeiro

11. LEONARDO ALFREDO FORERO MENDOZA. [en] INTELLIGENT COORDINATION FOR MULTIAGENT BASED MODELS HIERARCHICAL NEURO-FUZZY WITH REINFORCEMENT LEARNING.

Degree: 2018, Pontifical Catholic University of Rio de Janeiro

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35557

►

[pt] Esta tese consiste na investigação e no desenvolvimento de estratégias de coordenação inteligente que possam ser integradas a modelos neuro-fuzzy hierárquicos para sistemas de… (more)

▼

[pt] Esta tese consiste na investigação e no desenvolvimento de estratégias de coordenação inteligente que possam ser integradas a modelos neuro-fuzzy hierárquicos para sistemas de múltiplos agentes em ambientes complexos. Em ambientes dinâmicos ou complexos a organização dos agentes deve se adaptar a mudanças nos objetivos do sistema, na disponibilidade de recursos, nos relacionamentos entre os agentes, e assim por diante. Esta flexibilidade é um problema chave nos sistemas multiagente. O objetivo principal dos modelos propostos é fazer com que múltiplos agentes interajam de forma inteligente entre si em sistemas complexos. Neste trabalho foram desenvolvidos dois novos modelos inteligentes neuro-fuzzy hierárquicos com mecanismo de coordenação para sistemas multiagentes, a saber: modelo Neuro-Fuzzy Hierárquico com Aprendizado por Reforço com mecanismo de coordenação Market-Driven (RL-NFHP-MA-MD); e o Modelo Neuro-Fuzzy Hierárquico com Aprendizado por Reforço com modelo de coordenação por grafos (RL-NFHP-MA-CG). A inclusão de modelos de coordenação ao modelo Neuro-Fuzzy Hierárquicos com Aprendizado por Reforço (RL-NHFP-MA) foi motivada principalmente pela importância de otimizar o desempenho do trabalho em conjunto dos agentes, melhorando os resultados do modelo e visando aplicações mais complexas. Os modelos foram concebidos a partir do estudo das limitações existentes nos modelos atuais e das características desejáveis para sistemas de aprendizado baseados em RL, em particular quando aplicados a ambientes contínuos e/ou ambientes considerados de grande dimensão. Os modelos desenvolvidos foram testados através de basicamente dois estudos de caso: a aplicação benchmark do jogo da presa-predador (Pursuit- Game) e Futebol de robôs (simulado e com agentes robóticos). Os resultados obtidos tanto no jogo da presa-predador quanto no futebol de robô através dos novos modelos RL-NFHP-MA-MD e RL-NFHP-MA-CG para múltiplos agentes se mostraram bastante promissores. Os testes demonstraram que o novo sistema mostrou capacidade de coordenar as ações entre agentes com uma velocidade de convergência quase 30 por cento maior que a versão original. Os resultados de futebol de robô foram obtidos com o modelo RL-NFHP-MA-MD e o modelo RL-NFHP-MA-CG, os resultados são bons em jogos completos como em jogadas específicas, ganhando de times desenvolvidos com outros modelos similares.

[en] This thesis is the research and development of intelligent coordination strategies that can be integrated into models for hierarchical neuro-fuzzy systems of multiple agents in complex environments. In dynamic environments or complex organization of agents must adapt to changes in the objectives of the system, availability of resources, relationships between agents, and so on. This flexibility is a key problem in multiagent systems. The main objective of the proposed models is to make multiple agents interact intelligently with each other in complex systems. In this work we developed two new intelligent neuro-fuzzy models with hierarchical coordination…

Advisors/Committee Members: MARLEY MARIA BERNARDES REBUZZI VELLASCO.

Subjects/Keywords: [pt] APRENDIZADO POR REFORCO; [en] REINFORCEMENT LEARNING; [pt] NEURO-FUZZY; [en] NEURO-FUZZY; [pt] COORDENACAO MULTIAGENTE; [en] MULTIAGENT COORDINATION

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

MENDOZA, L. A. F. (2018). [en] INTELLIGENT COORDINATION FOR MULTIAGENT BASED MODELS HIERARCHICAL NEURO-FUZZY WITH REINFORCEMENT LEARNING. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35557

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

MENDOZA, LEONARDO ALFREDO FORERO. “[en] INTELLIGENT COORDINATION FOR MULTIAGENT BASED MODELS HIERARCHICAL NEURO-FUZZY WITH REINFORCEMENT LEARNING.” 2018. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed March 04, 2021. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35557.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

MENDOZA, LEONARDO ALFREDO FORERO. “[en] INTELLIGENT COORDINATION FOR MULTIAGENT BASED MODELS HIERARCHICAL NEURO-FUZZY WITH REINFORCEMENT LEARNING.” 2018. Web. 04 Mar 2021.

Vancouver:

MENDOZA LAF. [en] INTELLIGENT COORDINATION FOR MULTIAGENT BASED MODELS HIERARCHICAL NEURO-FUZZY WITH REINFORCEMENT LEARNING. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. [cited 2021 Mar 04]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35557.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

MENDOZA LAF. [en] INTELLIGENT COORDINATION FOR MULTIAGENT BASED MODELS HIERARCHICAL NEURO-FUZZY WITH REINFORCEMENT LEARNING. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35557

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of North Texas

12. Hurt, David. An Empirical Evaluation of Communication and Coordination Effectiveness in Autonomous Reactive Multiagent Systems.

Degree: 2005, University of North Texas

URL: https://digital.library.unt.edu/ark:/67531/metadc4770/

► This thesis describes experiments designed to measure the effect of collaborative communication on task performance of a multiagent system. A discrete event simulation was developed… (more)

Subjects/Keywords: Intelligent agents (Computer software); multiagent systems; coordination; simulation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hurt, D. (2005). An Empirical Evaluation of Communication and Coordination Effectiveness in Autonomous Reactive Multiagent Systems. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc4770/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Hurt, David. “An Empirical Evaluation of Communication and Coordination Effectiveness in Autonomous Reactive Multiagent Systems.” 2005. Thesis, University of North Texas. Accessed March 04, 2021. https://digital.library.unt.edu/ark:/67531/metadc4770/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Hurt, David. “An Empirical Evaluation of Communication and Coordination Effectiveness in Autonomous Reactive Multiagent Systems.” 2005. Web. 04 Mar 2021.

Vancouver:

Hurt D. An Empirical Evaluation of Communication and Coordination Effectiveness in Autonomous Reactive Multiagent Systems. [Internet] [Thesis]. University of North Texas; 2005. [cited 2021 Mar 04]. Available from: https://digital.library.unt.edu/ark:/67531/metadc4770/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hurt D. An Empirical Evaluation of Communication and Coordination Effectiveness in Autonomous Reactive Multiagent Systems. [Thesis]. University of North Texas; 2005. Available from: https://digital.library.unt.edu/ark:/67531/metadc4770/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Desquesnes, Guillaume, Louis, Florent. Distribution de Processus Décisionnels Markoviens pour une gestion prédictive d’une ressource partagée : application aux voies navigables des Hauts-de-France dans le contexte incertain du changement climatique : Distributing Markov Decision Processes for a predictive management of a shared resource : application to the Hauts-de-France waterways in the uncertain context of climate change.

Degree: Docteur es, Informatique, automatique, 2018, Ecole nationale supérieure Mines-Télécom Lille Douai

URL: http://www.theses.fr/2018MTLD0001

►

Les travaux de cette thèse visent à mettre en place une gestion prédictive sous incertitudes de la ressource en eau pour les réseaux de voies… (more)

▼

Les travaux de cette thèse visent à mettre en place une gestion prédictive sous incertitudes de la ressource en eau pour les réseaux de voies navigables. L'objectif est de proposer un plan de gestion de l'eau pour optimiser les conditions de navigation de l'ensemble du réseau supervisé sur un horizon spécifié. La solution attendue doit rendre le réseau résilient aux effets probables du changement climatique et aux évolutions du trafic fluvial. Dans un premier temps, une modélisation générique d'une ressource distribuée sur un réseau est proposée. Celle-ci, basée sur les processus décisionnels markoviens, prend en compte les nombreuses incertitudes affectant les réseaux considérés. L'objectif de cette modélisation est de couvrir l'ensemble des cas possibles, prévus ou non, afin d'avoir une gestion résiliente de ces réseaux. La seconde contribution consiste en une distribution du modèle sur plusieurs agents afin de permettre son passage à l'échelle. Ceci consiste en une répartition des capacités de contrôle du réseau entre les agents. Chaque agent ne possède ainsi qu'une connaissance locale du réseau supervisé. De ce fait, les agents ont besoin de se cordonner pour proposer une gestion efficace du réseau. Une résolution itérative avec échanges de plans temporaires de chaque agent est utilisée pour l'obtention de politiques de gestion locales à chaque agent. Finalement, des expérimentations ont été réalisées sur des réseaux réels de voies navigables françaises pour observer la qualité des solutions produites. Plusieurs scénarios climatiques différents ont été simulés pour tester la résilience des politiques produites.

The work of this thesis aims to introduce and implement a predictive management under uncertainties of the water resource for inland waterway networks. The objective is to provide a water management plan to optimize the navigation conditions of the entire supervised network over a specified horizon. The expected solution must render the network resilient to probable effects of the climate change and changes in waterway traffic. Firstly, a generic modeling of a resource distributed on a network is proposed. This modeling, based on Markovian Decision Processes, takes into account the numerous uncertainties affecting considered networks. The objective of this modeling is to cover all possible cases, foreseen or not, in order to have a resilient management of those networks. The second contribution consists in a distribution of the model over several agents to facilitate the scaling. This consists of a repartition of the network's control capacities among the agents. Thus, each agent has only local knowledge of the supervised network. As a result, agents require coordination to provide an efficient management of the network. An iterative resolution, with exchanges of temporary plans from each agent, is used to obtain local management policies for each agent. Finally, experiments were carried out on realistic and real networks of the French waterways to observe the quality of the solutions produced. Several…

Advisors/Committee Members: Duviella, Eric (thesis director).

Subjects/Keywords: Intelligence artificielle; Système multiagent; Processus décisionnel de Markov; Planification distribuée; Coordination et coopération; Réseaux de voies navigables; Changement climatique; Artificial Intelligence; Multiagent system; Markov Decision Process; Distributed planning; Coordination and cooperation; Inland waterways networks; Climate change; 004

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Desquesnes, Guillaume, Louis, F. (2018). Distribution de Processus Décisionnels Markoviens pour une gestion prédictive d’une ressource partagée : application aux voies navigables des Hauts-de-France dans le contexte incertain du changement climatique : Distributing Markov Decision Processes for a predictive management of a shared resource : application to the Hauts-de-France waterways in the uncertain context of climate change. (Doctoral Dissertation). Ecole nationale supérieure Mines-Télécom Lille Douai. Retrieved from http://www.theses.fr/2018MTLD0001

Chicago Manual of Style (16^th Edition):

Desquesnes, Guillaume, Louis, Florent. “Distribution de Processus Décisionnels Markoviens pour une gestion prédictive d’une ressource partagée : application aux voies navigables des Hauts-de-France dans le contexte incertain du changement climatique : Distributing Markov Decision Processes for a predictive management of a shared resource : application to the Hauts-de-France waterways in the uncertain context of climate change.” 2018. Doctoral Dissertation, Ecole nationale supérieure Mines-Télécom Lille Douai. Accessed March 04, 2021. http://www.theses.fr/2018MTLD0001.

MLA Handbook (7^th Edition):

Desquesnes, Guillaume, Louis, Florent. “Distribution de Processus Décisionnels Markoviens pour une gestion prédictive d’une ressource partagée : application aux voies navigables des Hauts-de-France dans le contexte incertain du changement climatique : Distributing Markov Decision Processes for a predictive management of a shared resource : application to the Hauts-de-France waterways in the uncertain context of climate change.” 2018. Web. 04 Mar 2021.

Vancouver:

Desquesnes, Guillaume, Louis F. Distribution de Processus Décisionnels Markoviens pour une gestion prédictive d’une ressource partagée : application aux voies navigables des Hauts-de-France dans le contexte incertain du changement climatique : Distributing Markov Decision Processes for a predictive management of a shared resource : application to the Hauts-de-France waterways in the uncertain context of climate change. [Internet] [Doctoral dissertation]. Ecole nationale supérieure Mines-Télécom Lille Douai; 2018. [cited 2021 Mar 04]. Available from: http://www.theses.fr/2018MTLD0001.

Council of Science Editors:

Desquesnes, Guillaume, Louis F. Distribution de Processus Décisionnels Markoviens pour une gestion prédictive d’une ressource partagée : application aux voies navigables des Hauts-de-France dans le contexte incertain du changement climatique : Distributing Markov Decision Processes for a predictive management of a shared resource : application to the Hauts-de-France waterways in the uncertain context of climate change. [Doctoral Dissertation]. Ecole nationale supérieure Mines-Télécom Lille Douai; 2018. Available from: http://www.theses.fr/2018MTLD0001

14. Samuel Oliveira de Azevedo. Sistema de agentes poligínicos para esteganálise de imagens digitais.

Degree: 2007, Universidade Federal do Rio Grande do Norte

URL: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=1493

►

Neste trabalho, propomos um sistema multi-agentes para esteganálise em imagens digitais, baseado na metáfora das abelhas poligínicas. Tal abordagem visa resolver o problema da esteganálise… (more)

▼

Neste trabalho, propomos um sistema multi-agentes para esteganálise em imagens digitais, baseado na metáfora das abelhas poligínicas. Tal abordagem visa resolver o problema da esteganálise automática de mídias digitais, com estudo de caso para imagens digitais. A arquitetura do sistema foi projetada não só para detectar se um arquivo é ou não suspeito de possuir uma mensagem oculta em si, como também para extrair essa mensagem ou informações acerca dela. Foram realizados vários experimentos cujos resultados confirmam uma melhoria substancial (de 67% para 82% de acertos) com o uso da abordagem multi-agente, fato não observado em outros sistemas tradicionais. Uma aplicação atualmente em andamento com o uso da técnica é a detecção de anomalias em dados digitais produzidos por sensores que captam emissões cerebrais em pequenos animais. A detecção de tais anomalias pode ser usada para comprovar teorias e evidencias de complementação do imageamento durante o sono, provida pelo cérebro nas áreas visuais do córtex cerebral

In this work, we propose a multi agent system for digital image steganalysis, based on the poliginic bees model. Such approach aims to solve the problem of automatic steganalysis for digital media, with a case study on digital images. The system architecture was designed not only to detect if a file is suspicious of covering a hidden message, as well to extract the hidden message or information regarding it. Several experiments were performed whose results confirm a substantial enhancement (from 67% to 82% success rate) by using the multi-agent approach, fact not observed in traditional systems. An ongoing application using the technique is the detection of anomalies in digital data produced by sensors that capture brain emissions in little animals. The detection of such anomalies can be used to prove theories and evidences of imagery completion during sleep provided by the brain in visual cortex areas

Advisors/Committee Members: Luiz Marcos Garcia Gonçalves, Ricardo Cordeiro de Farias, Benjamin René Callejas Bedegral.

Subjects/Keywords: Multiagent systems; Esteganografia; Esteganálise; Segmentação de imagens; Steganalysis; Cryptology; Poliginy; Coordination; Criptologia; Poliginia; Sistemas multi-agentes; Coordenação; SISTEMAS DE COMPUTACAO; Steganography; Image segmentation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Azevedo, S. O. d. (2007). Sistema de agentes poligínicos para esteganálise de imagens digitais. (Thesis). Universidade Federal do Rio Grande do Norte. Retrieved from http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=1493

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Azevedo, Samuel Oliveira de. “Sistema de agentes poligínicos para esteganálise de imagens digitais.” 2007. Thesis, Universidade Federal do Rio Grande do Norte. Accessed March 04, 2021. http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=1493.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Azevedo, Samuel Oliveira de. “Sistema de agentes poligínicos para esteganálise de imagens digitais.” 2007. Web. 04 Mar 2021.

Vancouver:

Azevedo SOd. Sistema de agentes poligínicos para esteganálise de imagens digitais. [Internet] [Thesis]. Universidade Federal do Rio Grande do Norte; 2007. [cited 2021 Mar 04]. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=1493.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Azevedo SOd. Sistema de agentes poligínicos para esteganálise de imagens digitais. [Thesis]. Universidade Federal do Rio Grande do Norte; 2007. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=1493

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Michigan

15. Cox, Jeffrey S. Efficient methods for solving the multiagent plan coordination problem.

Degree: PhD, Computer science, 2005, University of Michigan

URL: http://hdl.handle.net/2027.42/125333

► The Multiagent Plan Coordination Problem arises whenever multiple agents plan to achieve their individual goals independently, but might mutually benefit by coordinating their plans to… (more)

▼ The Multiagent Plan Coordination Problem arises whenever multiple agents plan to achieve their individual goals independently, but might mutually benefit by coordinating their plans to avoid working at cross purposes or duplicating effort. Although variations of this problem have been studied in the literature, there is as yet no agreement over a general characterization of the problem. In this dissertation, I describe a general framework that extends the partial-order, causal-link plan representation to the multiagent case, and that treats coordination as a form of iterative repair of plan flaws between agents. I show, analytically and empirically, that this algorithmic formulation can scale to the multiagent case better than can a straightforward application of the most advanced existing coordination techniques, highlighting fundamental differences between my algorithmic framework and these earlier approaches. I then examine whether and how the Multiagent Plan Coordination Problem can be cast as a Distributed Constraint Optimization Problem (DCOP). I use ADOPT, a state-of-the-art system that can solve DCOPs in an asynchronous, parallel manner using local communication between individual computational agents. I extend the ADOPT framework to take advantage of problem structure, in an effort to improve its performance on representative Multiagent Plan Coordination Problems. Although the performance gains from using ADOPT were negligible, I show how the same problem structure can be used to enable my algorithm to operate more efficiently. In the interest of scaling my approaches to larger problems, I build on previous work in the area of multiagent coordination [8] to make use of abstraction techniques that create hierarchical planning structures that are decomposed into primitive actions. By exploiting past work on developing summary information at abstract levels of agent plan hierarchies, I then extend my coordination algorithm to reason about agent interactions at abstract levels of the agents' plan hierarchies, and empirically establish that this technique greatly reduces the amount of computation required to derive coordinated planning solutions for the agents. I conclude with a discussion of possible ways of extending my work to handle richer and alternative plan coordination problems. Advisors/Committee Members: Durfee, Edmund H. (advisor).

Subjects/Keywords: Artificial Intelligence; Coordination; Efficient; Methods; Multiagent; Plan; Planning; Problem; Solving

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cox, J. S. (2005). Efficient methods for solving the multiagent plan coordination problem. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/125333

Chicago Manual of Style (16^th Edition):

Cox, Jeffrey S. “Efficient methods for solving the multiagent plan coordination problem.” 2005. Doctoral Dissertation, University of Michigan. Accessed March 04, 2021. http://hdl.handle.net/2027.42/125333.

MLA Handbook (7^th Edition):

Cox, Jeffrey S. “Efficient methods for solving the multiagent plan coordination problem.” 2005. Web. 04 Mar 2021.

Vancouver:

Cox JS. Efficient methods for solving the multiagent plan coordination problem. [Internet] [Doctoral dissertation]. University of Michigan; 2005. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2027.42/125333.

Council of Science Editors:

Cox JS. Efficient methods for solving the multiagent plan coordination problem. [Doctoral Dissertation]. University of Michigan; 2005. Available from: http://hdl.handle.net/2027.42/125333

University of Michigan

16. Clement, Bradley Jefferson. Abstract reasoning for multiagent coordination and planning.

Degree: PhD, Computer science, 2002, University of Michigan

URL: http://hdl.handle.net/2027.42/129322

► As autonomous software and robotic systems (or agents) grow in complexity, they will increasingly need to communicate and coordinate with each other. These agents will… (more)

▼ As autonomous software and robotic systems (or agents) grow in complexity, they will increasingly need to communicate and coordinate with each other. These agents will need planned courses of action to achieve their goals while sharing limited resources. This dissertation addresses the problem of efficiently interleaving planning and coordination for multiple agents. As part of my approach, I represent agents as having hierarchies of tasks that can be decomposed into executable primitive actions. Using task hierarchies, an agent can reason efficiently about its own goals and tasks (and those of others) at multiple levels of abstraction. By exploiting hierarchy, these agents can make planning and coordination decisions while avoiding complex computation involving unnecessary details of their tasks. To reason at abstract levels, agents must be aware of the constraints an abstract task embodies in its potential decompositions. Thus, I provide algorithms that summarize these constraints (represented as propositional state conditions and metric resource us ages) for each abstract task in an agent's library of hierarchical plans. This summary information can be derived offline for a domain of problems and used for any instance of tasks (or plans) assigned to the agents during coordination and planning. I also provide algorithms for reasoning about the concurrent interactions of abstract tasks, for identifying conflicts, and for resolving them. I use these algorithms to build sound and complete refinement-based coordination and planning algorithms. I also integrate summary information with a local search planner/scheduler, showing how the benefits can be extended to different classes of planning algorithms. Complexity analyses and experiments show where abstract reasoning using summary information can reduce computation and communication exponentially along a number of dimensions for coordination, planning, and scheduling in finding a single agent's plan or in optimally coordinating the plans of multiple agents. In addition, I provide pruning techniques and heuristics for decomposition that can further dramatically reduce computation. Overall, the techniques developed in this thesis enable researchers and system designers to scale the capabilities of interleaved coordination, planning, and execution by providing agents with tools to reason efficiently about their plans at multiple levels of abstraction. Advisors/Committee Members: Durfee, Edmund H. (advisor).

Subjects/Keywords: Abstract Reasoning; Artificial Intelligence; Autonomous Software; Coordination; Multiagent; Planning; Robotics; Scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Clement, B. J. (2002). Abstract reasoning for multiagent coordination and planning. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/129322

Chicago Manual of Style (16^th Edition):

Clement, Bradley Jefferson. “Abstract reasoning for multiagent coordination and planning.” 2002. Doctoral Dissertation, University of Michigan. Accessed March 04, 2021. http://hdl.handle.net/2027.42/129322.

MLA Handbook (7^th Edition):

Clement, Bradley Jefferson. “Abstract reasoning for multiagent coordination and planning.” 2002. Web. 04 Mar 2021.

Vancouver:

Clement BJ. Abstract reasoning for multiagent coordination and planning. [Internet] [Doctoral dissertation]. University of Michigan; 2002. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2027.42/129322.

Council of Science Editors:

Clement BJ. Abstract reasoning for multiagent coordination and planning. [Doctoral Dissertation]. University of Michigan; 2002. Available from: http://hdl.handle.net/2027.42/129322

17. Othmani-Guibourg, Mehdi. Supervised learning for distribution of centralised multiagent patrolling strategies : Apprentissage supervisé pour la distribution de stratégies de patrouille multi-agents centralisées.

Degree: Docteur es, Informatique, 2019, Sorbonne université

URL: http://www.theses.fr/2019SORUS534

► Depuis presque deux décennies, la tâche de la patrouille a fait l'objet d'une attention toute particulière de la part de la communauté multi-agent. La patrouille… (more)

▼ Depuis presque deux décennies, la tâche de la patrouille a fait l'objet d'une attention toute particulière de la part de la communauté multi-agent. La patrouille multi-agent consiste à modéliser comme un système multi-agent une tâche de patrouille à optimiser. Cette optimisation revient à répartir dans l'espace et le temps les agents patrouilleurs sur la zone à surveiller, cela le plus efficacement possible; un tel problème constitue par là même un problème de décision. Un large éventail d'algorithmes basés sur des stratégies d’agent réactives, cognitives, d’apprentissage par renforcement, centralisées et décentralisées, entre autres, ont été développés pour rendre les stratégies de patrouille toujours plus performantes. Cependant, les approches existantes basées sur de l'apprentissage supervisé avaient peu été étudiées jusqu’à présent, bien que quelques travaux aient abordé cette question. L’idée principale et sous-jacente à l'apprentissage supervisé, qui n’est rien de plus qu’un ensemble de méthodes et d'outils permettant d’inférer de nouvelles connaissances, est d’apprendre une fonction associant à tout élément en entrée un élément en sortie, à partir d'un ensemble de données composé de paires d'éléments entrées-sorties; l'apprentissage, dans ce cas, permet au système de faire de la généralisation à de nouvelles données jamais observées auparavant. Jusqu'à présent, la meilleure stratégie de patrouille multi-agent en ligne, à savoir sans calcul préalable, s'est avérée être une stratégie centralisée à coordinateur. Cependant, comme pour tout processus de décision centralisé généralement, une telle stratégie est difficilement échelonnable. L'objectif de ce travail est alors de développer et de mettre en œuvre une nouvelle méthodologie visant à transformer toute stratégie centralisée performante en stratégie distribuée, c'est-à-dire par nature résiliente, plus adaptative aux changements de l'environnement et échelonnable. Ce faisant, le processus de décision centralisé, généralement représenté par un coordinateur dans la patrouille multi-agent, est distribué sur les agents patrouilleurs au moyen de méthodes d’apprentissage supervisé, de sorte que les agents de la stratégie distribuée résultante tendent chacun à capturer ou cristalliser une partie de l’algorithme exécuté par le processus de décision centralisé. Le résultat est alors un nouveau algorithme de prise de décision distribué, qui repose sur de l’apprentissage automatique. Dans cette thèse, une telle procédure de distribution de stratégie centralisée est établie, puis concrètement mise en œuvre en utilisant certaines architectures de réseaux de neurones. Ainsi, après avoir exposé le contexte et les motivations, nous posons la problématique étudiée. Les principales stratégies multi-agent élaborées jusqu'à présent dans le cadre de la patrouille multi-agent sont ensuite décrites, en particulier une stratégie centralisée à haute performance qui est la stratégie centralisée à distribuer ici étudiée, ainsi qu’une stratégie décentralisée assez simple qui est utilisée… Advisors/Committee Members: El Fallah Seghrouchni, Amal (thesis director), Farges, Jean-Loup (thesis director).

Subjects/Keywords: Patrouille multi-agents; Apprentissage automatique; Réseaux de neurones artificiels; Systèmes multi-agents; Apprentissage supervisé; Coordination multi-agents; Multiagent patrolling; Supervised learning; Artificial neural networks; 006.3

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Othmani-Guibourg, M. (2019). Supervised learning for distribution of centralised multiagent patrolling strategies : Apprentissage supervisé pour la distribution de stratégies de patrouille multi-agents centralisées. (Doctoral Dissertation). Sorbonne université. Retrieved from http://www.theses.fr/2019SORUS534

Chicago Manual of Style (16^th Edition):

Othmani-Guibourg, Mehdi. “Supervised learning for distribution of centralised multiagent patrolling strategies : Apprentissage supervisé pour la distribution de stratégies de patrouille multi-agents centralisées.” 2019. Doctoral Dissertation, Sorbonne université. Accessed March 04, 2021. http://www.theses.fr/2019SORUS534.

MLA Handbook (7^th Edition):

Othmani-Guibourg, Mehdi. “Supervised learning for distribution of centralised multiagent patrolling strategies : Apprentissage supervisé pour la distribution de stratégies de patrouille multi-agents centralisées.” 2019. Web. 04 Mar 2021.

Vancouver:

Othmani-Guibourg M. Supervised learning for distribution of centralised multiagent patrolling strategies : Apprentissage supervisé pour la distribution de stratégies de patrouille multi-agents centralisées. [Internet] [Doctoral dissertation]. Sorbonne université; 2019. [cited 2021 Mar 04]. Available from: http://www.theses.fr/2019SORUS534.

Council of Science Editors:

Othmani-Guibourg M. Supervised learning for distribution of centralised multiagent patrolling strategies : Apprentissage supervisé pour la distribution de stratégies de patrouille multi-agents centralisées. [Doctoral Dissertation]. Sorbonne université; 2019. Available from: http://www.theses.fr/2019SORUS534

18. Boerkoel Jr, James C. Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems.

Degree: PhD, Computer Science & Engineering, 2012, University of Michigan

URL: http://hdl.handle.net/2027.42/96046

► This research focuses on building foundational algorithms for scheduling agents that assist people in managing their activities in environments in which tempo and complexity outstrip… (more)

▼ This research focuses on building foundational algorithms for scheduling agents that assist people in managing their activities in environments in which tempo and complexity outstrip people's cognitive capacity. The critical challenge is that, as individuals decide how to act on their scheduling goals, scheduling agents should answer queries regarding the events in their interacting schedules while respecting individual privacy and autonomy to the extent possible. I formally define both the Multiagent Simple Temporal Problem (MaSTP) and Multiagent Disjunctive Temporal Problem (MaDTP) for naturally capturing and reasoning over the distributed but interconnected scheduling problems of multiple individuals. My hypothesis is that combining a bottom-up approach – where an agent externalizes constraints that compactly summarize how its local subproblem affects other agents' subproblems, with a top-down approach – where an agent proactively constructs and internalizes new local constraints that decouple its subproblem from others', will lead to effective solution techniques. I confirm that my hypothesized approach leads to distributed algorithms that calculate summaries of the joint solution space for multiagent scheduling problems, without centralizing or otherwise redistributing the problems. In both the MaSTP and MaDTP domains, the distributed algorithms permit concurrent execution for significant speedup over current art, and also increase the level of privacy and independence in individual agent reasoning. These algorithms are most advantageous for problems where interactions between the agents are sparse compared to the complexity of agents' individual scheduling problems. Moreover, despite the combinatorially-large and unwieldy nature of the MaDTP solution space, I show that agents can use influence spaces, which compactly capture the impact of agents' interacting schedules, to tractably converge on distributed summaries of the joint solution space. Finally, I apply the same basic principle to the Hybrid Scheduling Problem, which combines constraint-based scheduling with a rudimentary level of planning, and show that my Hybrid Constraint Tightening precompilation algorithm can improve the propagation of information between planning and scheduling subproblems, leading to significant search space pruning and execution time reduction. Advisors/Committee Members: Durfee, Edmund H. (committee member), Cohn, Amy Ellen (committee member), Pollack, Martha E. (committee member), Wellman, Michael P. (committee member).

Subjects/Keywords: Multiagent Scheduling; Constraint-based Scheduling; Simple Temporal Problem; Disjunctive Temporal Problem; Temporal Decoupling; Multiagent Coordination; Computer Science; Engineering

…could conceptually be applied in many multiagent coordination domains. My algorithms, which… …computation. In addition to providing another distributed technique for multiagent coordination, the… …Coordination of Mobile Agent Teams; Bucket-Elimination Algorithms Section 2.3 Fast Dist. Multiagent… …91 3.5.2 Influence Space . . . . . . . . . . . . . . . . . . . . 92 3.5.3 The Multiagent… …Construction . . . . . . . . . . . . . 103 3.6.3 The Multiagent Disjunctive Temporal Decoupling…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Boerkoel Jr, J. C. (2012). Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/96046

Chicago Manual of Style (16^th Edition):

Boerkoel Jr, James C. “Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems.” 2012. Doctoral Dissertation, University of Michigan. Accessed March 04, 2021. http://hdl.handle.net/2027.42/96046.

MLA Handbook (7^th Edition):

Boerkoel Jr, James C. “Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems.” 2012. Web. 04 Mar 2021.

Vancouver:

Boerkoel Jr JC. Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems. [Internet] [Doctoral dissertation]. University of Michigan; 2012. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2027.42/96046.

Council of Science Editors:

Boerkoel Jr JC. Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems. [Doctoral Dissertation]. University of Michigan; 2012. Available from: http://hdl.handle.net/2027.42/96046

Universidade do Rio Grande do Norte

19. Azevedo, Samuel Oliveira de. Sistema de agentes poligínicos para esteganálise de imagens digitais .

Degree: 2007, Universidade do Rio Grande do Norte

URL: http://repositorio.ufrn.br/handle/123456789/17965

► In this work, we propose a multi agent system for digital image steganalysis, based on the poliginic bees model. Such approach aims to solve the… (more)

Subjects/Keywords: Esteganografia; Esteganálise; Segmentação de imagens; Criptologia; Poliginia; Sistemas multi-agentes; Coordenação; Steganography; Steganalysis; Image segmentation; Cryptology; Poliginy; Multiagent systems; Coordination

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Azevedo, S. O. d. (2007). Sistema de agentes poligínicos para esteganálise de imagens digitais . (Masters Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/17965

Chicago Manual of Style (16^th Edition):

Azevedo, Samuel Oliveira de. “Sistema de agentes poligínicos para esteganálise de imagens digitais .” 2007. Masters Thesis, Universidade do Rio Grande do Norte. Accessed March 04, 2021. http://repositorio.ufrn.br/handle/123456789/17965.

MLA Handbook (7^th Edition):

Azevedo, Samuel Oliveira de. “Sistema de agentes poligínicos para esteganálise de imagens digitais .” 2007. Web. 04 Mar 2021.

Vancouver:

Azevedo SOd. Sistema de agentes poligínicos para esteganálise de imagens digitais . [Internet] [Masters thesis]. Universidade do Rio Grande do Norte; 2007. [cited 2021 Mar 04]. Available from: http://repositorio.ufrn.br/handle/123456789/17965.

Council of Science Editors:

Azevedo SOd. Sistema de agentes poligínicos para esteganálise de imagens digitais . [Masters Thesis]. Universidade do Rio Grande do Norte; 2007. Available from: http://repositorio.ufrn.br/handle/123456789/17965

20. Haque, Musad Al. Biologically inspired heterogeneous multi-agent systems.

Degree: PhD, Electrical and Computer Engineering, 2010, Georgia Tech

URL: http://hdl.handle.net/1853/37138

► Many biological systems are known to accomplish complex tasks in a decentralized, robust, and scalable manner - characteristics that are desirable to the coordination of… (more)

Subjects/Keywords: Multi-agent systems; Biologically-inspired; Coordination strategies; Multiagent systems; Systems engineering

…The consensus problem is a canonical problem in decentralized coordination of multiagent… …FIGURES 1 The approach to bioinspiration is shown. This work produces coordination strategies… …characteristics that are desirable to the coordination of engineered systems as well. Inspired by nature… …we produce coordination strategies for a network of heterogenous agents and in particular… …these algorithms are developed in the context of specific coordination tasks, e.g., the multi…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Haque, M. A. (2010). Biologically inspired heterogeneous multi-agent systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/37138

Chicago Manual of Style (16^th Edition):

Haque, Musad Al. “Biologically inspired heterogeneous multi-agent systems.” 2010. Doctoral Dissertation, Georgia Tech. Accessed March 04, 2021. http://hdl.handle.net/1853/37138.

MLA Handbook (7^th Edition):

Haque, Musad Al. “Biologically inspired heterogeneous multi-agent systems.” 2010. Web. 04 Mar 2021.

Vancouver:

Haque MA. Biologically inspired heterogeneous multi-agent systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1853/37138.

Council of Science Editors:

Haque MA. Biologically inspired heterogeneous multi-agent systems. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/37138

21. Christelis, George Dimitri. Automated norm synthesis in planning environments.

Degree: PhD, 2011, University of Edinburgh

URL: http://hdl.handle.net/1842/5730

► Multiagent systems offer a design paradigm used to conceptualise and implement systems composed of autonomous agents. Autonomy facilitates proactive independent behaviour yet in practice agents… (more)

▼ Multiagent systems offer a design paradigm used to conceptualise and implement systems composed of autonomous agents. Autonomy facilitates proactive independent behaviour yet in practice agents are constrained in order to ensure the system satisfies a desired social objective. Explicit constraints on agent behaviour, in the form of social norms, encourage this desirable system behaviour, yet research has largely focused on norm representation languages and protocols for norm proposal and adoption. The fundamental problem of how to automate the process of norm synthesis has largely been overlooked with norms assumed provided by the designer. Previous work has shown that automating the design of social norms is intractable in the worst case. Existing approaches, relying on state space enumerations, are effective for small systems but impractical for larger ones. Furthermore, they do not produce a set of succinct, general norms but rather a large number of state-specific restrictions. This work presents conflict-rooted synthesis, an automated norm synthesis approach that utilises a planning-based action schemata to overcome these limitations. These action schemata facilitate localised searches around specifications of undesirable states, using representations of sets of system states to avoid a full state enumeration. The proposed technique produces concise, generalised social norms that are applicable in multiple system states while also providing guarantees that agents are still able to achieve their original goals in the constrained system. To improve efficiency a set of theoretically sound, domain-independent optimisations are presented that reduce the state space searched without compromising the quality of the norms synthesised. A comparison with an alternative model checking based technique illustrates the advantages and disadvantages of our approach, while an empirical evaluation highlights the improved efficiency and quality of norms it produces at the cost of a less expressive specification of undesirable states. We empirically investigate the effectiveness of each of the proposed optimisations using a set of benchmark domains, quantifying how successful each of them is at reducing search complexity in practice. The results show that, with all optimisations enabled, conflict-rooted synthesis produces more generally applicable and succinct norms and consumes fewer system resources. Additionally, we show that this approach synthesises norms in systems where the competing approach is intractable. We provide a discussion of our approach, highlighting the impact our abstract search approach has on the fields of multiagent systems and automated planning, and discuss the limitations and assumptions we have made. We conclude with a presentation of future work.

Subjects/Keywords: 006.3; artificial intelligence; multiagent systems; social norms; social laws; coordination; automated planning

…Coordination using Social Norms 11 2.1 Coordination Approaches in Multiagent Systems… …Background: Coordination using Social Norms A multiagent system is comprised of a set of agents… …coordination approaches in multiagent systems are decentralised and implemented at runtime (… …using Social Norms 2.1 Coordination Approaches in Multiagent Systems We begin by discussing… …central to achieving pre-planning coordination in multiagent systems and now present a few key…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Christelis, G. D. (2011). Automated norm synthesis in planning environments. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/5730

Chicago Manual of Style (16^th Edition):

Christelis, George Dimitri. “Automated norm synthesis in planning environments.” 2011. Doctoral Dissertation, University of Edinburgh. Accessed March 04, 2021. http://hdl.handle.net/1842/5730.

MLA Handbook (7^th Edition):

Christelis, George Dimitri. “Automated norm synthesis in planning environments.” 2011. Web. 04 Mar 2021.

Vancouver:

Christelis GD. Automated norm synthesis in planning environments. [Internet] [Doctoral dissertation]. University of Edinburgh; 2011. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1842/5730.

Council of Science Editors:

Christelis GD. Automated norm synthesis in planning environments. [Doctoral Dissertation]. University of Edinburgh; 2011. Available from: http://hdl.handle.net/1842/5730

22. Kingston, Peter. Multi-agent coordination: fluid-inspired and optimal control approaches.

Degree: PhD, Electrical and Computer Engineering, 2012, Georgia Tech

URL: http://hdl.handle.net/1853/43714

► Multiagent coordination problems arise in a variety of applications, from satellite constellations and formation flight, to air traffic control and unmanned vehicle teams. We investigate… (more)

Subjects/Keywords: Multiagent coordination; Formation control; Networked control; Optimal control; Preference learning; Time warping; Output warping; Space warping; Machine learning; Multiagent systems; Automatic control

…xk+1 − x¯|| < ||˜ xk − x¯||. . . . . . . . . . 131 x SUMMARY Multiagent coordination… …INTRODUCTION Multiagent coordination problems arise in a variety of applications, including… …complementary, physically-inspired approaches to multiagent coordination. To describe them, we will… …algebraic topology provide a natural mathematical language for discussing multiagent coordination… …to air traffic control and unmanned vehicle teams. We investigate the coordination of…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kingston, P. (2012). Multi-agent coordination: fluid-inspired and optimal control approaches. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/43714

Chicago Manual of Style (16^th Edition):

Kingston, Peter. “Multi-agent coordination: fluid-inspired and optimal control approaches.” 2012. Doctoral Dissertation, Georgia Tech. Accessed March 04, 2021. http://hdl.handle.net/1853/43714.

MLA Handbook (7^th Edition):

Kingston, Peter. “Multi-agent coordination: fluid-inspired and optimal control approaches.” 2012. Web. 04 Mar 2021.

Vancouver:

Kingston P. Multi-agent coordination: fluid-inspired and optimal control approaches. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/1853/43714.

Council of Science Editors:

Kingston P. Multi-agent coordination: fluid-inspired and optimal control approaches. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/43714

23. Sosnowski, Scott T. Approximate Action Selection For Large, Coordinating, Multiagent Systems.

Degree: MSs, EECS - Computer and Information Sciences, 2016, Case Western Reserve University School of Graduate Studies

URL: http://rave.ohiolink.edu/etdc/view?acc_num=case1459468867

► Many practical decision-making problems involve coordinating teams of agents. In our work, we focus on the problem of coordinated action selection in reinforcement learning with… (more)

Subjects/Keywords: Artificial Intelligence; Computer Science; multiagent system; approximate action selection; cooperative multiagent decision making; coordination graph; cooperative agent; max-plus algorithm; mean field method; variable elimination algorithm; graph traversal algorithm

…107 4.43 Results of predator-and-prey with eight agents at various coordination levels… …showing how, at each level, more coordination is beneficial. . . . . . . . . . . . . . . . 107… …is an example of an advantage for coordination beyond pairs. Two of the agents should… …Approximate Action Selection For Large, Coordinating, Multiagent Systems SCOTT T. SOSNOWSKI… …how to formulate coordination as exact inference in a Markov network, but this becomes…

5 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sosnowski, S. T. (2016). Approximate Action Selection For Large, Coordinating, Multiagent Systems. (Masters Thesis). Case Western Reserve University School of Graduate Studies. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1459468867

Chicago Manual of Style (16^th Edition):

Sosnowski, Scott T. “Approximate Action Selection For Large, Coordinating, Multiagent Systems.” 2016. Masters Thesis, Case Western Reserve University School of Graduate Studies. Accessed March 04, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=case1459468867.

MLA Handbook (7^th Edition):

Sosnowski, Scott T. “Approximate Action Selection For Large, Coordinating, Multiagent Systems.” 2016. Web. 04 Mar 2021.

Vancouver:

Sosnowski ST. Approximate Action Selection For Large, Coordinating, Multiagent Systems. [Internet] [Masters thesis]. Case Western Reserve University School of Graduate Studies; 2016. [cited 2021 Mar 04]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1459468867.

Council of Science Editors:

Sosnowski ST. Approximate Action Selection For Large, Coordinating, Multiagent Systems. [Masters Thesis]. Case Western Reserve University School of Graduate Studies; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1459468867

Universidade Estadual de Campinas

24. Walter, Igor Alexandre. Sistemas multiagentes em mercados de energia elétrica/: Multiagent systems bidding approach for competitive electricity markets.

Degree: 2010, Universidade Estadual de Campinas

URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/260769

► Abstract: We suggest an evolutionary approach to design interaction strategies for multiagent systems, focusing on strategies modeled as fuzzy rule-based systems. The aim is to… (more)

▼ Abstract: We suggest an evolutionary approach to design interaction strategies for multiagent systems, focusing on strategies modeled as fuzzy rule-based systems. The aim is to learn models represented by evolving knowledge bases to achieve agents' performance improvement when playing in a competitive environment. In competitive situations data for learning and tuning are rare and rule bases must jointly evolve with the databases. We introduce an evolutionary algorithm whose operators use variable length chromosome, a hierarchical relationship among individuals through fitness, and a scheme that successively explores and exploits the search space along generations. Evolution of interaction strategies uncovers unknown and unexpected agent behaviors and allows a richer analysis of negotiation mechanisms and their role as a coordination protocol. An application concerning an electricity market illustrates the effectiveness of the approach and allows to simulate the market through evolutionary bidding strategies. The restructuring process of power markets raises new challenges and opportunities, since there is no consensual market architecture. The evolution of the power industry organization shows a lack of insight about the issues to be addressed and taken into account. Several authors have considered the available tools based on the neoclassical economics theory a limited approach to analyze the effects of the industry restructuring and to study economical agents behavior participating in a restructured electricity market. We present Artificial Economy Multiagent System (AEMAS), a computational architecture inspired on Agent-based Computational Economics (ACE) that allows to model, study and simulate a power market. We apply Computational Intelligence tools to conceive the market agents that we expect could be extended to other negotiation environments. A power market is a complex system populated by self interested economical agents that interact. We conclude that it is feasible to model and simulate these markets on a multiagent system based approach. The evolution of bidding strategies allows to uncover new and unexpected behaviors that help to address the negotiation mechanism analysis by its designers and to support a market player decision process Advisors/Committee Members: UNIVERSIDADE ESTADUAL DE CAMPINAS (CRUESP), Gomide, Fernando Antonio Campos, 1951- (advisor), Universidade Estadual de Campinas. Faculdade de Engenharia Elétrica e de Computação (institution), Programa de Pós-Graduação em Engenharia Elétrica (nameofprogram), Vellasco, Marley Maria Bernardes Rebuzzi (committee member), Correia, Paulo de Barros (committee member), Filho, Secundino Soares (committee member), Gudwin, Ricardo Ribeiro (committee member), Ricarte, Ivan Luiz Marques (committee member).

Subjects/Keywords: Agentes inteligentes (Software); Inteligencia artificial distribuida; Algoritmos genéticos; Sistemas fuzzy; Energia elétrica - Mercado; Leilões; Negociação; Multiagent systems; Genetic fuzzy systems; Electricy market; Agent-based computational economics; Auctions; Coordination strategies; Competitive markets

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Walter, I. A. (2010). Sistemas multiagentes em mercados de energia elétrica/: Multiagent systems bidding approach for competitive electricity markets. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/260769

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Walter, Igor Alexandre. “Sistemas multiagentes em mercados de energia elétrica/: Multiagent systems bidding approach for competitive electricity markets.” 2010. Thesis, Universidade Estadual de Campinas. Accessed March 04, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260769.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Walter, Igor Alexandre. “Sistemas multiagentes em mercados de energia elétrica/: Multiagent systems bidding approach for competitive electricity markets.” 2010. Web. 04 Mar 2021.

Vancouver:

Walter IA. Sistemas multiagentes em mercados de energia elétrica/: Multiagent systems bidding approach for competitive electricity markets. [Internet] [Thesis]. Universidade Estadual de Campinas; 2010. [cited 2021 Mar 04]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/260769.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Walter IA. Sistemas multiagentes em mercados de energia elétrica/: Multiagent systems bidding approach for competitive electricity markets. [Thesis]. Universidade Estadual de Campinas; 2010. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/260769

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Witwicki, Stefan J. Abstracting Influences for Efficient Multiagent Coordination Under Uncertainty.

Degree: PhD, Computer Science & Engineering, 2011, University of Michigan

URL: http://hdl.handle.net/2027.42/84614

► When planning optimal decisions for teams of agents acting in uncertain domains, conventional methods explicitly coordinate all joint policy decisions and, in doing so, are… (more)

▼ When planning optimal decisions for teams of agents acting in uncertain domains, conventional methods explicitly coordinate all joint policy decisions and, in doing so, are inherently susceptible to the curse of dimensionality, as state, action, and observation spaces grow exponentially with the number of agents. With the goal of extending the scalability of optimal team coordination, the research presented in this dissertation examines how agents can reduce the amount of information they need to coordinate. Intuitively, to the extent that agents are weakly coupled, they can avoid the complexity of coordinating all decisions; they need instead only coordinate abstractions of their policies that convey their essential influences on each other. In formalizing this intuition, I consider several complementary aspects of weakly-coupled problem structure, including agent scope size, corresponding to the number of an agent's peers whose decisions influence the agent's decisions, and degree of influence, corresponding to the proportion of unique influences that peers can feasibly exert. To exploit this structure, I introduce a (transition-dependent decentralized POMDP) model that efficiently decomposes into local decision models with shared state features. This context yields a novel characterization of influences as transition probabilities (compactly encoded using a dynamic Bayesian network). Not only is this influence representation provably sufficient for optimal coordination, but it also allows me to frame the subproblems of (1) proposing influences, (2) evaluating influences, and (3) computing optimal policies around influences as mixed-integer linear programs. The primary advantage of working in the influence space is that there are potentially significantly fewer feasible influences than there are policies. Blending prior work on decoupled joint policy search and constraint optimization, I develop influence-space search algorithms that, for problems with a low degree of influence, compute optimal solutions orders of magnitude faster than policy-space search. When agents' influences are constrained, influence-space search also outperforms other state-of-the-art optimal solution algorithms. Moreover, by exploiting both degree of influence and agent scope size, I demonstrate scalability, substantially beyond the reach of prior optimal methods, to teams of 50 weakly-coupled transition-dependent agents. Advisors/Committee Members: Durfee, Edmund H. (committee member), Baveja, Satinder Singh (committee member), Cohn, Amy Ellen (committee member), Wellman, Michael P. (committee member).

Subjects/Keywords: Multiagent Coordination; Optimal Planning; Sequential Decision Making; Agent Interaction Structure; Decentralized Partially Observable Markov Decision Process; Influence Based Policy Abstraction; Computer Science; Engineering

…Multiagent Coordination Under Uncertainty The label multiagent coordination under uncertainty… …of a principled methodology for multiagent coordination under uncertainty, with a focus on… …Abstraction . . . . . . . . . . . . . . 7.2.1 Service Coordination . . . . . . . . . . . . . . 7.2.2… …233 Service Coordination example . . . . . . . . . . . . . . . . . . . . . 235 A… …optimal team coordination, the research presented in this dissertation examines how agents can…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Witwicki, S. J. (2011). Abstracting Influences for Efficient Multiagent Coordination Under Uncertainty. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/84614

Chicago Manual of Style (16^th Edition):

Witwicki, Stefan J. “Abstracting Influences for Efficient Multiagent Coordination Under Uncertainty.” 2011. Doctoral Dissertation, University of Michigan. Accessed March 04, 2021. http://hdl.handle.net/2027.42/84614.

MLA Handbook (7^th Edition):

Witwicki, Stefan J. “Abstracting Influences for Efficient Multiagent Coordination Under Uncertainty.” 2011. Web. 04 Mar 2021.

Vancouver:

Witwicki SJ. Abstracting Influences for Efficient Multiagent Coordination Under Uncertainty. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2021 Mar 04]. Available from: http://hdl.handle.net/2027.42/84614.

Council of Science Editors:

Witwicki SJ. Abstracting Influences for Efficient Multiagent Coordination Under Uncertainty. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/84614

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations