Dichotomic differential inequalities and multi-agent coordination

Distributed algorithms of multi-agent coordination have attracted substantial attention from the research communities. The most investigated are Laplacian-type dynamics over time-varying weighted graphs, whose applications include, but are not limited to, the problems of consensus, opinion dynamics, aggregation and containment control, target surrounding and distributed optimization. While the algorithms solving these problems are similar, for their analysis different mathematical techniques have been used. In this paper, we propose a novel approach, allowing to prove the stability of many Laplacian-type algorithms, arising in multi-agent coordination problems, in a unified elegant way. The key idea of this approach is to consider an associated linear differential inequality with the Laplacian matrix, satisfied by some bounded outputs of the agents (e.g. the distances to the desired set in aggregation and containment control problems). Although such inequalities have many unbounded solutions, under natural connectivity conditions all their bounded solutions converge (and even reach consensus), entailing the convergence of the original protocol. The differential inequality thus admits only convergent but not “oscillatory” bounded solutions. This property, referred to as the dichotomy, has been long studied in the theory of differential equations. We show that a number of recent results from multi-agent control can be derived from the dichotomy criteria for Laplacian differential inequalities, developed in this paper, discarding also some technical restrictions

Analysis and design of multiagent systems using MAS-CommonKADS

This article proposes an agent-oriented methodology called MAS-CommonKADS and develops a case study. This methodology extends the knowledge engineering methodology CommonKADSwith techniquesfrom objectoriented and protocol engineering methodologies. The methodology consists of the development of seven models: Agent Model, that describes the characteristics of each agent; Task Model, that describes the tasks that the agents carry out; Expertise Model, that describes the knowledge needed by the agents to achieve their goals; Organisation Model, that describes the structural relationships between agents (software agents and/or human agents); Coordination Model, that describes the dynamic relationships between software agents; Communication Model, that describes the dynamic relationships between human agents and their respective personal assistant software agents; and Design Model, that refines the previous models and determines the most suitable agent architecture for each agent, and the requirements of the agent network

MACS: Multi-agent COTR system for Defense Contracting

The field of intelligent multi-agent systems has expanded rapidly in the recent past. Multi-agent architectures and systems are being investigated and continue to develop. To date, little has been accomplished in applying multi-agent systems to the defense acquisition domain. This paper describes the design, development, and related considerations of a multi-agent system in the area of procurement and contracting for the defense acquisition community

Operational design co-ordination : an agent based approach

Operational design co-ordination has been identified as the basis for an approach to engineering design management that is more comprehensive than those that currently exist. As such, an integrated and holistic approach to operational design co-ordination has been developed that enables design to be managed in a coherent, appropriate and timely manner. Furthermore, the approach has been implemented within an agent-based software system, called the Design Co-ordination System, which has been applied to an industrial case study involving the computational design analysis of turbine blades. This application demonstrates that managing and adjusting in real-time in an operationally co-ordinated manner enables reductions in the time taken to complete the turbine blade design process to be achieved

Differential Inequalities in Multi-Agent Coordination and Opinion Dynamics Modeling

Distributed 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 time-varying weighted graphs. These graphs are usually characterized algebraically by their associated Laplacian matrices. Network algorithms with similar algebraic graph theoretic structures, called being of Laplacian-type in this paper, also arise in other related multi-agent control problems, such as aggregation and containment control, target surrounding, distributed optimization and modeling of opinion evolution in social groups. In spite of their similarities, each of such algorithms has often been studied using separate mathematical techniques. In this paper, a novel approach is offered, allowing a unified and elegant way to examine many Laplacian-type algorithms for multi-agent coordination. This approach is based on the analysis of some differential or difference inequalities that have to be satisfied by the some "outputs" of the agents (e.g. the distances to the desired set in aggregation problems). Although such inequalities may have many unbounded solutions, under natural graphic connectivity conditions all their bounded solutions converge (and even reach consensus), entailing the convergence of the corresponding distributed algorithms. In the theory of differential equations the absence of bounded non-convergent solutions is referred to as the equation's dichotomy. In this paper, we establish the dichotomy criteria of Laplacian-type differential and difference inequalities and show that these criteria enable one to extend a number of recent results, concerned with Laplacian-type algorithms for multi-agent coordination and modeling opinion formation in social groups.Comment: accepted to Automatic

Centralized versus market-based approaches to mobile task allocation problem: State-of-the-art

Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many real-life applications. On the other hand, market-based approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existence of some efforts to review the pros and cons of each approach in RAPs, the studies cannot be directly applied to specific problem domains like mobile task allocation problem which is characterised with high level of uncertainty on the availability of resources (workers). This paper aims to review existing studies on task allocation problems(TAPs) focusing on those two approaches and their comparison and identify major issues that need to be resolved for comparing the two approaches in mobile task allocation problems. Mobile Task Allocation Problem (MTAP) is defined and its problematic structures are explained in relation with task allocation to mobile workers. Solutions produced by each approach to some applications and variations of MTAP are also discussed and compared. Finally, some future research directions are identified in order to compare both approaches in function of uncertainty emerging from the mobile nature of the MTAP

Coordination of Mobile Mules via Facility Location Strategies

In this paper, we study the problem of wireless sensor network (WSN) maintenance using mobile entities called mules. The mules are deployed in the area of the WSN in such a way that would minimize the time it takes them to reach a failed sensor and fix it. The mules must constantly optimize their collective deployment to account for occupied mules. The objective is to define the optimal deployment and task allocation strategy for the mules, so that the sensors' downtime and the mules' traveling distance are minimized. Our solutions are inspired by research in the field of computational geometry and the design of our algorithms is based on state of the art approximation algorithms for the classical problem of facility location. Our empirical results demonstrate how cooperation enhances the team's performance, and indicate that a combination of k-Median based deployment with closest-available task allocation provides the best results in terms of minimizing the sensors' downtime but is inefficient in terms of the mules' travel distance. A k-Centroid based deployment produces good results in both criteria.Comment: 12 pages, 6 figures, conferenc