total 1387took 0.23s

From Game-theoretic Multi-agent Log Linear Learning to Reinforcement LearningFeb 07 2018Multi-agent Systems (MASs) have found a variety of industrial applications from economics to robotics, owing to their high adaptability, scalability and applicability. However, with the increasing complexity of MASs, multi-agent control has become a challenging ... More

On the Preliminary Investigation of Selfish Mining Strategy with Multiple Selfish MinersFeb 06 2018Eyal and Sirer's selfish mining strategy has demonstrated that Bitcoin system is not secure even if 50% of total mining power is held by altruistic miners. Since then, researchers have been investigating either to improve the efficiency of selfish mining, ... More

Local Wealth Redistribution Promotes Cooperation in Multiagent SystemsFeb 05 2018Designing mechanisms that leverage cooperation between agents has been a long-lasting goal in Multiagent Systems. The task is especially challenging when agents are selfish, lack common goals and face social dilemmas, i.e., situations in which individual ... More

The Anatomy of Leadership in Collective BehaviourFeb 04 2018Understanding the mechanics behind the coordinated movement of mobile animal groups provides key insights into their biology and ecology while also yielding algorithms for bio-inspired technologies and autonomous systems. It is becoming increasingly clear ... More

Mobility-aware, adaptive algorithms for wireless power transfer in ad hoc networksFeb 01 2018In this work, we investigate the interesting impact of mobility on the problem of efficient wireless power transfer in ad hoc networks. We consider a set of mobile agents (consuming energy to perform certain sensing and communication tasks), and a single ... More

The Optimal Majority Threshold as a Function of the Variation Coefficient of the EnvironmentJan 21 2018Within the model of social dynamics determined by collective decisions in a stochastic environment (ViSE model), we consider the case of a homogeneous society consisting of classically rational economic agents (or homines economici, or egoists). We present ... More

A Multi-Agent Neural Network for Dynamic Frequency Reuse in LTE NetworksJan 16 2018Fractional Frequency Reuse techniques can be employed to address interference in mobile networks, improving throughput for edge users. There is a tradeoff between the coverage and overall throughput achievable, as interference avoidance techniques lead ... More

A Design-Time/Run-Time Application Mapping Methodology for Predictable Execution Time in MPSoCsNov 16 2017Executing multiple applications on a single MPSoC brings the major challenge of satisfying multiple quality requirements regarding real-time, energy, etc. Hybrid application mapping denotes the combination of design-time analysis with run-time application ... More

The Social Benefits of Balancing Creativity and Imitation: Evidence from an Agent-based ModelApr 29 2017Although creativity is encouraged in the abstract it is often discouraged in educational and workplace settings. Using an agent-based model of cultural evolution, we investigated the idea that tempering the novelty-generating effects of creativity with ... More

Arrovian Aggregation of Convex Preferences and Pairwise UtilitarianismMar 16 2017Oct 10 2017We consider social welfare functions that satisfy Arrow's classic axioms of independence of irrelevant alternatives and Pareto optimality when the outcome space is the convex hull over some finite set of alternatives. Individual and collective preferences ... More

Social learning in a simple task allocation gameFeb 19 2017We investigate the effects of social interactions in task al- location using Evolutionary Game Theory (EGT). We propose a simple task-allocation game and study how different learning mechanisms can give rise to specialised and non- specialised colonies ... More

Attacking the V: On the Resiliency of Adaptive-Horizon MPCFeb 01 2017We introduce the concept of a V-formation game between a controller and an attacker, where controller's goal is to maneuver the plant (a simple model of flocking dynamics) into a V-formation, and the goal of the attacker is to prevent the controller from ... More

Distributed methods for synchronization of orthogonal matrices over graphsJan 25 2017Apr 07 2017This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as a least-squares ... More

ARES: Adaptive Receding-Horizon Synthesis of Optimal PlansDec 21 2016We introduce ARES, an efficient approximation algorithm for generating optimal plans (action sequences) that take an initial state of a Markov Decision Process (MDP) to a state whose cost is below a specified (convergence) threshold. ARES uses Particle ... More

Agent-based Model for Spot and Balancing Electricity MarketsDec 14 2016We present a simple, yet realistic, agent-based model of an electricity market. The proposed model combines the spot and balancing markets with a resolution of one minute, which enables a more accurate depiction of the physical properties of the power ... More

Fixpoint Approximation of Strategic Abilities under Imperfect InformationDec 08 2016Model checking of strategic ability under imperfect information is known to be hard. In this paper, we propose translations of ATLir formulae that provide lower and upper bounds for their truth values, and are cheaper to verify than the original specifications. ... More

Collaborative Visual Area CoverageDec 06 2016This article examines the problem of visual area coverage by a network of Mobile Aerial Agents (MAAs). Each MAA is assumed to be equipped with a downwards facing camera with a conical field of view which covers all points within a circle on the ground. ... More

Collaborative Visual Area Coverage using Unmanned Aerial VehiclesDec 06 2016This article addresses the visual area coverage problem using a team of Unmanned Aerial Vehicles (UAVs). The UAVs are assumed to be equipped with a downward facing camera covering all points of interest within a circle on the ground. The diameter of this ... More

Distributed Gaussian Learning over Time-varying Directed GraphsDec 06 2016We present a distributed (non-Bayesian) learning algorithm for the problem of parameter estimation with Gaussian noise. The algorithm is expressed as explicit updates on the parameters of the Gaussian beliefs (i.e. means and precision). We show a convergence ... More

Distributed Gaussian Learning over Time-varying Directed GraphsDec 06 2016Dec 07 2016We present a distributed (non-Bayesian) learning algorithm for the problem of parameter estimation with Gaussian noise. The algorithm is expressed as explicit updates on the parameters of the Gaussian beliefs (i.e. means and precision). We show a convergence ... More

Proportional RankingsDec 05 2016In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that cohesive groups of ... More

Real-time Collision Handling in Railway Network:An Agent-based ApproachDec 05 2016Advancement in intelligent transportation systems with complex operations requires autonomous planning and management to avoid collisions in day-to-day traffic. As failure and/or inadequacy in traffic safety system are life-critical, such collisions must ... More

Disruptive innovations in RoboCup 2D Soccer Simulation League: from Cyberoos'98 to Gliders2016Dec 03 2016We review disruptive innovations introduced in the RoboCup 2D Soccer Simulation League over the twenty years since its inception, and trace the progress of our champion team (Gliders). We conjecture that the League has been developing as an ecosystem ... More

Expander Graph and Communication-Efficient Decentralized OptimizationDec 03 2016In this paper, we discuss how to design the graph topology to reduce the communication complexity of certain algorithms for decentralized optimization. Our goal is to minimize the total communication needed to achieve a prescribed accuracy. We discover ... More

A Scalable and Adaptable Multiple-Place Foraging Algorithm for Ant-Inspired Robot SwarmsDec 01 2016Individual robots are not effective at exploring large unmapped areas. An alternate approach is to use a swarm of simple robots that work together, rather than a single highly capable robot. The central-place foraging algorithm (CPFA) is effective for ... More

Decentralized Consensus Optimization with Asynchrony and DelaysDec 01 2016We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network in which the agents communicate with their neighbors and perform local computation. In the proposed algorithm, each agent can compute and ... More

A Majoritarian Representative Voting SystemNov 30 2016We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each ballot to a single ... More

Structural Controllability of Multi-Agent Networks: Robustness against Simultaneous FailuresNov 30 2016In this paper, structural controllability of a leader-follower multi-agent system with multiple leaders is studied from a graph-theoretic point of view. The problem of preservation of structural controllability under simultaneous failures in both the ... More

Digraphs with Distinguishable Dynamics under the Multi-Agent Agreement ProtocolNov 30 2016In this work, the ability to distinguish digraphs from the output response of some observing agents in a multi-agent network under the agreement protocol has been studied. Given a fixed observation point, it is desired to find sufficient graphical conditions ... More

Distributed Estimation for Adaptive Networks Based on Serial-Inspired DiffusionNov 28 2016Distributed estimation and processing in networks modeled by graphs have received a great deal of interest recently, due to the benefits of decentralised processing in terms of performance and robustness to communications link failure between nodes of ... More

The Complexity of Succinct ElectionsNov 27 2016The computational study of elections generally assumes that the preferences of the electorate come in as a list of votes. Depending on the context, it may be much more natural to represent the list succinctly, as the distinct votes of the electorate and ... More

Multiwinner Approval Rules as Apportionment MethodsNov 26 2016We establish a link between multiwinner elections and apportionment problems by showing how approval-based multiwinner election rules can be interpreted as methods of apportionment. We consider several multiwinner rules and observe that they induce apportionment ... More

Robust Sequential Path Planning Under Disturbances and Adversarial IntruderNov 25 2016Provably safe and scalable multi-vehicle path planning is an important and urgent problem due to the expected increase of automation in civilian airspace in the near future. Although this problem has been studied in the past, there has not been a method ... More

An Agent-Based Model of Message Propagation in the Facebook Electronic Social NetworkNov 22 2016A large scale agent-based model of common Facebook users was designed to develop an understanding of the underlying mechanism of information diffusion within online social networks at a micro-level analysis. The agent-based model network structure is ... More

What Do We Elect Committees For? A Voting Committee Model for Multi-Winner RulesNov 21 2016We present a new model that describes the process of electing a group of representatives (e.g., a parliament) for a group of voters. In this model, called the voting committee model, the elected group of representatives runs a number of ballots to make ... More

Formalizing Multi-Agent Systems Using Action Descriptions in Single Agent PerspectiveNov 19 2016Logic-based representations of multi-agent systems have been extensively studied. In this work, we focus on the action language BC to formalize global views of MAS domains. Methodologically, we start representing the behaviour of each agent by an action ... More

Fictitious play for cooperative action selection in robot teamsNov 17 2016A game theoretic distributed decision making approach is presented for the problem of control effort allocation in a robotic team based on a novel variant of fictitious play. The proposed learning process allows the robots to accomplish their objectives ... More

On Location Hiding in Distributed SystemsNov 13 2016We consider the following problem - a group of mobile agents perform some task on a terrain modeled as a graph. In a given moment of time an adversary gets an access to the graph and positions of the agents. Shortly before adversary's observation the ... More

Recognizing and Eliciting Weakly Single Crossing Profiles on TreesNov 13 2016The domain of single crossing preference profiles is a widely studied domain in social choice theory. It has been generalized to the domain of single crossing preference profiles with respect to trees which inherits many desirable properties from the ... More

Learning to Play Guess Who? and Inventing a Grounded Language as a ConsequenceNov 10 2016Nov 27 2016Learning your first language is an incredible feat and not easily duplicated. Doing this using nothing but a few pictureless books, a corpus, would likely be impossible even for humans. As an alternative we propose to use situated interactions between ... More

Learning to Play Guess Who? and Inventing a Grounded Language as a ConsequenceNov 10 2016Learning your first language is an incredible feat and not easily duplicated. Doing this using nothing but a few pictureless books, a corpus, would likely be impossible even for humans. As an alternative we propose to use situated interactions between ... More

Distributed recovery of jointly sparse signals under communication constraintsNov 08 2016The problem of the distributed recovery of jointly sparse signals has attracted much attention recently. Let us assume that the nodes of a network observe different sparse signals with common support; starting from linear, compressed measurements, and ... More

Generative Multi-Adversarial NetworksNov 05 2016Nov 23 2016Generative adversarial networks (GANs) are a framework for producing a generative model by way of a two-player minimax game. In this paper, we propose the \emph{Generative Multi-Adversarial Network} (GMAN), a framework that extends GANs to multiple discriminators. ... More

Generative Multi-Adversarial NetworksNov 05 2016Generative adversarial networks (GANs) are a framework for producing a generative model by way of a two-player minimax game. In this paper, we propose the \emph{Generative Multi-Adversarial Network} (GMAN), a framework that extends GANs to multiple discriminators. ... More

Multi-level Simulation of Internet of Things on Smart TerritoriesNov 04 2016In this paper, a methodology is presented and employed for simulating the Internet of Things (IoT). The requirement for scalability, due to the possibly huge amount of involved sensors and devices, and the heterogeneous scenarios that might occur, impose ... More

Bayesian Heuristics for Group DecisionsNov 02 2016We propose a model of inference and heuristic decision-making in groups that is rooted in the Bayes rule but avoids the complexities of rational inference in partially observed environments with incomplete information, which are characteristic of group ... More

A Dynamic Multi Agent based scheduling for flexible flow line manufacturing system accompanied by dynamic customer demandNov 02 2016Dynamic rescheduling decision-making problem is an important issue in modern manufacturing system with the feature of combinational computation complexity. This paper introduces a multi-agent based approach using the detailed process, provided by Prometheus ... More

SimAthens: A spatial microsimulation approach to the estimation and analysis of small-area income distributions and poverty rates in Athens, GreeceOct 31 2016Published during a severe economic crisis, this study presents the first spatial microsimulation model for the analysis of income inequalities and poverty in Greece. First, we present a brief overview of the method and discuss its potential for the analysis ... More

Decentralized Clustering and Linking by Networked AgentsOct 28 2016We consider the problem of decentralized clustering and estimation over multi-task networks, where agents infer and track different models of interest. The agents do not know beforehand which model is generating their own data. They also do not know which ... More

The Composition and Formation of Effective Teams. Computer Science meets PsychologyOct 27 2016Nowadays the composition and formation of effective teams is highly important for both companies to assure their competitiveness and for a wide range of emerging applications exploiting multiagent collaboration (e.g. crowdsourcing, human-agent collaborations). ... More

On the Exact Amount of Missing Information that makes Finding Possible Winners HardOct 26 2016We consider election scenarios with incomplete information, a situation that arises often in practice. There are several models of incomplete information and accordingly, different notions of outcomes of such elections. In one well-studied model of incompleteness, ... More

Location Aggregation of Spatial Population CTMC ModelsOct 26 2016In this paper we focus on spatial Markov population models, describing the stochastic evolution of populations of agents, explicitly modelling their spatial distribution, representing space as a discrete, finite graph. More specifically, we present a ... More

Avoid or Follow? Modelling Route Choice Based on Experimental Empirical EvidencesOct 25 2016Computer-based simulation of pedestrian dynamics reached meaningful results in the last decade, thanks to empirical evidences and acquired knowledge fitting fundamental diagram constraints and space utilization. Moreover, computational models for pedestrian ... More

Towards Modelling Pedestrian-Vehicle Interactions: Empirical Study on Urban Unsignalized IntersectionOct 25 2016The modelling and simulation of the interaction among vehicles and pedestrians during cross-walking is an open challenge for both research and practical computational solutions supporting urban/traffic decision makers and managers. The social cost of ... More

Social Groups and Pedestrian Crowds: Experiment on Dyads in a Counter Flow ScenarioOct 25 2016The calibration and validation of pedestrian simulations require the acquisition of empirical evidences of human behaviour. The current work presents the results of an experiment focused on the potentially combined effect of counter flow and grouping ... More

The Core of the Participatory Budgeting ProblemOct 11 2016Oct 14 2016In participatory budgeting, communities collectively decide on the allocation of public tax dollars for local public projects. In this work, we consider the question of fairly aggregating the preferences of community members to determine an allocation ... More

A Distributed Multi Agents Based Platform for High Performance Computing InfrastructuresOct 11 2016This work introduces a novel, modular, layered web based platform for managing machine learning experiments on grid-based High Performance Computing infrastructures. The coupling of the communication services offered by the grid, with an administration ... More

Differential Inequalities in Multi-Agent Coordination and Opinion Dynamics ModelingOct 11 2016Distributed algorithms of multi-agent coordination have attracted substantial attention from the research community; the simplest and most thoroughly studied of them are consensus protocols in the form of differential or difference equations over general ... More

Diffusion LMS for Multitask Problems with Local Linear Equality ConstraintsOct 10 2016We consider distributed multitask learning problems over a network of agents where each agent is interested in estimating its own parameter vector, also called task, and where the tasks at neighboring agents are related according to a set of linear equality ... More

Model Reduction of Linear Multi-Agent Systems by Clustering and Associated $\mathcal{H}_2$- and $\mathcal{H}_\infty$-Error BoundsOct 07 2016In this paper, we study a model reduction technique for leader-follower networked multi-agent systems defined on weighted, undirected graphs with arbitrary linear multivariable agent dynamics. In the network graph of this network, nodes represent the ... More

Census Signal Temporal Logic Inference for Multi-Agent Group Behavior AnalysisOct 05 2016In this paper, we define a novel census signal temporal logic (CensusSTL) that focuses on the number of agents in different subsets of a group that complete a certain task specified by the signal temporal logic (STL). CensusSTL consists of an "inner logic" ... More

The Simulation Model Partitioning Problem: an Adaptive Solution Based on Self-Clustering (Extended Version)Oct 05 2016Nov 04 2016This paper is about partitioning in parallel and distributed simulation. That means decomposing the simulation model into a numberof components and to properly allocate them on the execution units. An adaptive solution based on self-clustering, that considers ... More

The Simulation Model Partitioning Problem: an Adaptive Solution Based on Self-Clustering (Extended Version)Oct 05 2016This paper is about partitioning in parallel and distributed simulation. That means decomposing the simulation model into a numberof components and to properly allocate them on the execution units. An adaptive solution based on self-clustering, that considers ... More

Trial-Offer Markets with ContinuationOct 05 2016Trial-offer markets, where customers can sample a product before deciding whether to buy it, are ubiquitous in the online experience. Their static and dynamic properties are often studied by assuming that consumers follow a multinomial logit model and ... More

Competitive Propagation: Models, Asymptotic Behavior and Multi-stage GamesSep 29 2016In this paper we propose a class of propagation models for multiple competing products over a social network. We consider two propagation mechanisms: social conversion and self conversion, corresponding, respectively, to endogenous and exogenous factors. ... More

Dynamic Models of Appraisal Networks Explaining Collective LearningSep 29 2016This paper proposes models of learning process in teams of individuals who collectively execute a sequence of tasks and whose actions are determined by individual skill levels and networks of interpersonal appraisals and influence. The closely-related ... More

The phase transition of Axelrod's model revisitedSep 28 2016Axelrod's model with $F=2$ cultural features, where each feature can assume $k$ states drawn from a Poisson distribution of parameter $q$, exhibits a continuous nonequilibrium phase transition in the square lattice. Here we use extensive Monte Carlo simulations ... More

Effect of long-range interactions on the phase transition of Axelrod's modelSep 28 2016Nov 30 2016Axelrod's model with $F=2$ cultural features, where each feature can assume $k$ states drawn from a Poisson distribution of parameter $q$, exhibits a continuous nonequilibrium phase transition in the square lattice. Here we use extensive Monte Carlo simulations ... More

Dynamic control of agents playing aggregative gamesSep 28 2016We address the problem to control a population of noncooperative heterogeneous agents, each with strongly convex cost function depending on the average population state, and all sharing a convex constraint, towards a competitive aggregative equilibrium. ... More

When Big Data Fails! Relative success of adaptive agents using coarse-grained information to compete for limited resourcesSep 28 2016The recent trend for acquiring big data assumes that possessing quantitatively more and qualitatively finer data necessarily provides an advantage that may be critical in competitive situations. Using a model complex adaptive system where agents compete ... More

Predictive Positioning and Quality Of Service Ridesharing for Campus Mobility On Demand SystemsSep 26 2016Autonomous Mobility On Demand (MOD) systems can utilize fleet management strategies to properly position vehicles and allocate customers in order to maintain a high customer quality of service (QoS). Previous works on autonomous MOD systems have developed ... More

Decentralized Non-communicating Multiagent Collision Avoidance with Deep Reinforcement LearningSep 26 2016Sep 28 2016Finding feasible, collision-free paths for multiagent systems can be challenging, particularly in non-communicating scenarios where each agent's intent (e.g. goal) is unobservable to the others. In particular, finding time efficient paths often requires ... More

Coverage and Field Estimation on Bounded Domains by Diffusive SwarmsSep 25 2016Oct 02 2016In this paper, we consider stochastic coverage of bounded domains by a diffusing swarm of robots that take local measurements of an underlying scalar field. We introduce three control methodologies with diffusion, advection, and reaction as independent ... More

Coverage and Field Estimation on Bounded Domains by Diffusive SwarmsSep 25 2016Sep 28 2016In this paper, we consider stochastic coverage of bounded domains by a diffusing swarm of robots that take local measurements of an underlying scalar field. We introduce three control methodologies with diffusion, advection, and reaction as independent ... More

A Tutorial on Distributed (Non-Bayesian) Learning: Problem, Algorithms and ResultsSep 23 2016We overview some results on distributed learning with focus on a family of recently proposed algorithms known as non-Bayesian social learning. We consider different approaches to the distributed learning problem and its algorithmic solutions for the case ... More

Popular Matchings with Multiple PartnersSep 23 2016Our input is a bipartite graph $G = (R \cup H,E)$ where each vertex in $R \cup H$ has a preference list strictly ranking its neighbors. The vertices in $R$ (similarly, in $H$) are called residents (resp., hospitals): each resident seeks to be matched ... More

Safety Certified Cooperative Adaptive Cruise Control under Unreliable Inter-vehicle CommunicationsSep 23 2016Cooperative adaptive cruise control(CACC) system provides a great promise to significantly reduce traffic congestion while maintaining a high level of safety. Recent years have seen an increase of using formal methods in the analysis and design of cooperative ... More

Distributed scaling control of rigid formationsSep 23 2016Recently it has been reported that biased range-measurements among neighboring agents in the gradient distance-based formation control can lead to predictable collective motion. In this paper we take advantage of this effect and by introducing distributed ... More

Simultaneous Intermittent Communication Control and Path Optimization in Networks of Mobile RobotsSep 22 2016In this paper, we propose an intermittent communication framework for mobile robot networks. Specifically, we consider robots that move along the edges of a connected mobility graph and communicate only when they meet at the nodes of that graph giving ... More

Distributed Consistent Data AssociationSep 22 2016Data association is one of the fundamental problems in multi-sensor systems. Most current techniques rely on pairwise data associations which can be spurious even after the employment of outlier rejection schemes. Considering multiple pairwise associations ... More

Distributed Consistent Data AssociationSep 22 2016Oct 25 2016Data association is one of the fundamental problems in multi-sensor systems. Most current techniques rely on pairwise data associations which can be spurious even after the employment of outlier rejection schemes. Considering multiple pairwise associations ... More

SafeGuardPF: Safety Guaranteed Reactive Potential Fields for Mobile Robots in Unknown and Dynamic EnvironmentsSep 22 2016An autonomous navigation with proven collision avoidance in unknown and dynamic environments is still a challenge, particularly when there are moving obstacles. A popular approach to collision avoidance in the face of moving obstacles is based on model ... More

The Optional Prisoner's Dilemma in a Spatial Environment: Coevolving Game Strategy and Link WeightsSep 19 2016In this paper, the Optional Prisoner's Dilemma game in a spatial environment, with coevolutionary rules for both the strategy and network links between agents, is studied. Using a Monte Carlo simulation approach, a number of experiments are performed ... More

Asynchronous and Dynamic Coverage Control Scheme for Persistent Surveillance MissionsSep 17 2016A decomposition-based coverage control scheme is proposed for multi-agent, persistent surveillance missions operating in a communication-constrained, dynamic environment. The proposed approach decouples high-level task assignment from low-level motion ... More

On Covering Codes and Upper Bounds for the Dimension of Simple GamesSep 16 2016Consider a situation with $n$ agents or players where some of the players form a coalition with a certain collective objective. Simple games are used to model systems that can decide whether coalitions are successful (winning) or not (losing). A simple ... More

Network learning via multi-agent inverse transportation problemsSep 14 2016Sep 18 2016Despite the ubiquity of transportation data, statistical inference methods alone are not able to explain mechanistic relations within a network. Inverse optimization methods fulfill this gap, but they are designed to take observations of the same model ... More

A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract)Sep 14 2016We consider a dynamical approach to sequential games. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding restriction of better-response ... More

SEAL's operating manual: a Spatially-bounded Economic Agent-based LabSep 13 2016This text reports in detail how SEAL, a modeling framework for the economy based on individual agents and firms, works. Thus, it aims to be an usage manual for those wishing to use SEAL or SEAL's results. As a reference work, theoretical and research ... More

Social Learning over Weakly-Connected GraphsSep 13 2016In this paper, we study diffusion social learning over weakly-connected graphs. We show that the asymmetric flow of information hinders the learning abilities of certain agents regardless of their local observations. Under some circumstances that we clarify ... More

Ms. Pac-Man Versus Ghost Team CIG 2016 CompetitionSep 08 2016This paper introduces the revival of the popular Ms. Pac-Man Versus Ghost Team competition. We present an updated game engine with Partial Observability constraints, a new Multi-Agent Systems approach to developing Ghost agents and several sample controllers ... More

Determination of Pedestrian Flow Performance Based on Video Tracking and Microscopic SimulationsSep 08 2016One of the objectives of understanding pedestrian behavior is to predict the effect of proposed changes in the design or evaluation of pedestrian facilities. We want to know the impact to the user of the facilities, as the design of the facilities change. ... More

Distributed sampled-data control of nonholonomic multi-robot systems with proximity networksSep 07 2016This paper considers the distributed sampled-data control problem of a group of mobile robots connected via distance-induced proximity networks. A dwell time is assumed in order to avoid chattering in the neighbor relations that may be caused by abrupt ... More

Tracking System to Automate Data Collection of Microscopic Pedestrian Traffic FlowSep 07 2016To deal with many pedestrian data, automatic data collection is needed. This paper describes how to automate the microscopic pedestrian flow data collection from video files. The study is restricted only to pedestrians without considering vehicular - ... More

Microscopic Pedestrian Simulation Model to Evaluate "Lane-Like Segregation" of Pedestrian CrossingSep 07 2016One of the objectives of the pedestrian analysis is to evaluate the effects of proposed policy on the pedestrian facilities before its implementation. The implementation of a policy without pedestrian analysis might lead to a very costly trial and error ... More

Review on Microscopic Pedestrian Simulation ModelSep 07 2016Microscopic Pedestrian Simulation Model is computer simulation model of pedestrian movement where every pedestrian in the model is treated as individual. Most of pedestrian researches have been done on macroscopic level, which does not consider the interaction ... More

Automation of Pedestrian Tracking in a Crowded SituationSep 06 2016Studies on microscopic pedestrian requires large amounts of trajectory data from real-world pedestrian crowds. Such data collection, if done manually, needs tremendous effort and is very time consuming. Though many studies have asserted the possibility ... More

Multi Exit Configuration of Mesoscopic Pedestrian SimulationSep 06 2016A mesoscopic approach to modeling pedestrian simulation with multiple exits is proposed in this paper. A floor field based on Qlearning Algorithm is used. Attractiveness of exits to pedestrian typically is based on shortest path. However, several factors ... More

Topological aggregation, the twin paradox and the no show paradoxAug 26 2016Consider the framework of topological aggregation introduced by Chichilnisky (1980). We prove that in this framework the Twin Paradox and the No Show Paradox cannot be avoided. Anonymity and unanimity are not needed to obtain these results.

Distributed Probabilistic Bisection Search using Social LearningAug 21 2016We present a novel distributed probabilistic bisection algorithm using social learning with application to target localization. Each agent in the network first constructs a query about the target based on its local information and obtains a noisy response. ... More

On Nonconvex Decentralized Gradient DescentAug 20 2016Consensus optimization has received considerable attention in recent years. A number of decentralized algorithms have been proposed for {convex} consensus optimization. However, on \emph{nonconvex} consensus optimization, our understanding to the behavior ... More