Hasil untuk "cs.MA"

Ido Farjoun, Reshef Meir

We consider the strategyproof facility location problem on a circle. We focus on the case of 5 agents, and find a tight bound for the PCD strategyproof mechanism, which selects the reported location of an agent in proportion to the length of the arc in front of it. We methodically "reduce" the size of the instance space and then use standard optimization techniques to find and prove the bound is tight. Moreover we hypothesize the approximation ratio of PCD for general odd $n$.

Damian Kurpiewski, Wojciech Jamroga, Teofil Sidoruk

Social Explainable AI (SAI) is a new direction in artificial intelligence that emphasises decentralisation, transparency, social context, and focus on the human users. SAI research is still at an early stage. Consequently, it concentrates on delivering the intended functionalities, but largely ignores the possibility of unwelcome behaviours due to malicious or erroneous activity. We propose that, in order to capture the breadth of relevant aspects, one can use models and logics of strategic ability, that have been developed in multi-agent systems. Using the STV model checker, we take the first step towards the formal modelling and verification of SAI environments, in particular of their resistance to various types of attacks by compromised AI modules.

Anna Fujioka, Masaki Ogura, Naoki Wakamiya

The problem of guiding a flock of several autonomous agents using repulsion force exerted by a smaller number of agents is called the shepherding problem and has been attracting attention due to its potential engineering applications. Although several works propose methodologies for achieving the shepherding task in this context, most assume that sheep agents have the same dynamics, which only sometimes holds in reality. The objective of this discussion paper is to overview a recent research trend addressing the gap mentioned above between the commonly placed uniformity assumption and the reality. Specifically, we first introduce recent guidance methods for heterogeneous flocks and then describe the prospects of the shepherding problem for heterogeneous flocks.

Sina Saadati, Mohammadreza Razzazi

In this article, a new solution for the convex hull problem has been presented. The convex hull is a widely known problem in computational geometry. As nature is a rich source of ideas in the field of algorithms, the solution has been inspired by nature. A tight elastic band is modeled using agents and also nails as points of the problem. By simulating an elastic band with nails in an environment, solving the convex hull problem will be possible. The algorithm runs in O(t) in which t is the time that an elastic band will get fixed.

Ted Fujimoto, Samrat Chatterjee, Auroop Ganguly

Advances in ad hoc teamwork have the potential to create agents that collaborate robustly in real-world applications. Agents deployed in the real world, however, are vulnerable to adversaries with the intent to subvert them. There has been little research in ad hoc teamwork that assumes the presence of adversaries. We explain the importance of extending ad hoc teamwork to include the presence of adversaries and clarify why this problem is difficult. We then propose some directions for new research opportunities in ad hoc teamwork that leads to more robust multi-agent cyber-physical infrastructure systems.

S. Bai

We propose an agent-based model, MNegoti, for simulating multilateral negotiation process, which can be naturally employed in group decision support system. This model can also be applied to any use case in which negotiation is involved, in order to simulate the negotiation process. In this report, we discuss the implementation of the MNegoti model on the basis of the agent-based simulation platform, Repast Simphony. It is worth pointing out that this model can be used to create a java module for any use of agent-based negotiation simulation.

Carlos Gershenson

Self-organization offers a promising approach for designing adaptive systems. Given the inherent complexity of most cyber-physical systems, adaptivity is desired, as predictability is limited. Here I summarize different concepts and approaches that can facilitate self-organization in cyber-physical systems, and thus be exploited for design. Then I mention real-world examples of systems where self-organization has managed to provide solutions that outperform classical approaches, in particular related to urban mobility. Finally, I identify when a centralized, distributed, or self-organizing control is more appropriate.

Li Ma, Weidong Bao, Xiaomin Zhu et al.

Flocking model has been widely used to control robotic swarm. However, with the increasing scalability, there exist complex conflicts for robotic swarm in autonomous navigation, brought by internal pattern maintenance, external environment changes, and target area orientation, which results in poor stability and adaptability. Hence, optimizing the flocking model for robotic swarm in autonomous navigation is an important and meaningful research domain.

Bernard Chazelle

The {\em $s$-energy} is a generating function of wide applicability in network-based dynamics. We derive an (essentially) optimal bound of $(3/ρs)^{n-1}$ on the $s$-energy of an $n$-agent symmetric averaging system, for any positive real $s\leq 1$, where~$ρ$ is a lower bound on the nonzero weights. This is done by introducing the new dynamics of {\em twist systems}. We show how to use the new bound on the $s$-energy to tighten the convergence rate of systems in opinion dynamics, flocking, and synchronization.

Sergei Parsegov, Pavel Chebotarev

The paper addresses the problem of consensus seeking among second-order linear agents interconnected in a specific ring topology. Unlike the existing results in the field dealing with one-directional digraphs arising in various cyclic pursuit algorithms or two-directional graphs, we focus on the case where some arcs in a two-directional ring graph are dropped in a regular fashion. The derived condition for achieving consensus turns out to be independent of the number of agents in a network.

Margaretha Gansterer, Richard F. Hartl

In horizontal collaborations, carriers form coalitions in order to perform parts of their logistics operations jointly. By exchanging transportation requests among each other, they can operate more efficiently and in a more sustainable way. Collaborative vehicle routing has been extensively discussed in the literature. We identify three major streams of research: (i) centralized collaborative planning, (ii) decentralized planning without auctions, and (ii) auction-based decentralized planning. For each of them we give a structured overview on the state of knowledge and discuss future research directions.

Ricardo Sosa, Andy M. Connor

This paper presents a computational approach to modelling group creativity. It presents an analysis of two studies of group creativity selected from different research cultures and identifies a common theme ("idea build-up") that is then used in the formalisation of an agent-based model used to support reasoning about the complex dynamics of building on the ideas of others.

Nikola Bogdanović, Hans Driessen, Alexander Yarovoy

In this paper, a track selection problem for multi-target tracking in a multifunction radar network is studied using the concepts from game theory. The problem is formulated as a non-cooperative game, and specifically as an anti-coordination game, where each player aims to differ from what other players do. The players' utilities are modeled using a proper tracking accuracy criterion and, under different assumptions on the structure of these utilities, the corresponding Nash equilibria are characterized. To find an equilibrium, a distributed algorithm based on the best-response dynamics is proposed. Finally, computer simulations are carried out to verify the effectiveness of the proposed algorithm in a multi-target tracking scenario.

Sergey Tarasenko

In this study the concept of reflexia is applied to modeling behavior of autonomous units. The relationship between reflexia, on the one hand, and mirror neuron system and perception of emotions, on the other hand, is introduced. The main method of using reflexia in a group of autonomous units is Reflexive Game Theory (RGT). To embody RGT in a group of autonomous agents a communication system is employed. This communication system uses frequency domain multiplexing by means of Izhikevich's resonate-and-fire neural models. The result of socialization of autonomous units by means of RGT and communication system is illustrated in several examples.

Florian Brandl, Felix Brandt, Warut Suksompong

Random dictatorship has been characterized as the only social decision scheme that satisfies efficiency and strategyproofness when individual preferences are strict. We show that no extension of random dictatorship to weak preferences satisfies these properties, even when significantly weakening the required degree of strategyproofness.

Francisco Lopez

Norms are known to be a major factor determining humans behavior. It's also shown that norms can be quite effective tool for building agent-based societies. Various normative architectures have been proposed for designing normative multi-agent systems (NorMAS). Due to human nature of the concept norms, many of these architectures are built based on theories in social sciences. Tipping point theory, as is briefly discussed in this paper, seems to have a great potential to be used for designing normative architectures. This theory deals with the factors that affect social epidemics that arise in human societies. In this paper, we try to apply the main concepts of this theory to agent-based normative architectures. We show several ways to implement these concepts, and study their effects in an agent-based normative scenario.

Camelia-M. Pintea

During the last years several ant-based techniques were involved to solve hard and complex optimization problems. The current paper is a short study about the influence of artificial ant species in solving optimization problems. There are studied the artificial Pharaoh Ants, Lasius Niger and also artificial ants with no special specificity used commonly in Ant Colony Optimization.

Tobias Kretz

The F.A.S.T. model for microscopic simulation of pedestrians was formulated with the idea of parallelizability and small computation times in general in mind, but so far it was never demonstrated, if it can in fact be implemented efficiently for execution on a multi-core or multi-CPU system. In this contribution results are given on computation times for the F.A.S.T. model on an eight-core PC.

Frank W. Bentrem, John T. Sample, Michael M. Harris

New methods are being employed to meet the Navy's changing software-development environment.

Evan Hurwitz, Tshilidzi Marwala

Game theory has many limitations implicit in its application. By utilizing multiagent modeling, it is possible to solve a number of problems that are unsolvable using traditional game theory. In this paper reinforcement learning is applied to neural networks to create intelligent agents