Refining self-propelled particle models for collective behaviour

Swarming, schooling, flocking and herding are all names given to the wide variety of collective behaviours exhibited by groups of animals, bacteria and even individual cells. More generally, the term swarming describes the behaviour of an aggregate of agents (not necessarily biological) of similar size and shape which exhibit some emergent property such as directed migration or group cohesion. In this paper we review various individual-based models of collective behaviour and discuss their merits and drawbacks. We further analyse some one-dimensional models in the context of locust swarming. In specific models, in both one and two dimensions, we demonstrate how varying the parameters relating to how much attention individuals pay to their neighbours can dramatically change the behaviour of the group. We also introduce leader individuals to these models with the ability to guide the swarm to a greater or lesser degree as we vary the parameters of the model. We consider evolutionary scenarios for models with leaders in which individuals are allowed to evolve the degree of influence neighbouring individuals have on their subsequent motion

An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination

This article reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, task assignment, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations

Investigation of Communication Constraints in Distributed Multi-Agent Systems

Based on a simple flocking model with collision avoidance, a set of investigations of multi-agent system communication constraints have been conducted, including distributed estimation of global features, the influence of jamming, and communication performance optimization. In flocking control, it is necessary to achieve a common velocity among agents and maintain a safe distance between neighboring agents. The local information among agents is exchanged in a distributed fashion to help achieve velocity consensus. A distributed estimation algorithm was recently proposed to estimate the group’s global features based on achieving consensus among agents’ local estimations of such global features. To reduce the communication load, the exchange of local estimations among agents occurs at discrete time instants defined by an event-triggering mechanism. To confirm the effectiveness of the new distributed estimation algorithm, we simulated the algorithm while adopting a simple flocking control technique with collision avoidance. In addition, the effect of jamming on flocking control and the distributed algorithm is studied through computer simulations. Finally, to better exploit the communication channel among agents, we study a recently proposed formation control multi-agent algorithm, which optimizes the inter-agent distance in order to achieve optimum inter-agent communication performance. The study is also conducted through computer simulations, which confirms the effectiveness of the algorithm

Optimal control approaches for consensus and path planning in multi-agent systems

Optimal control is one of the most powerful, important and advantageous topics in control engineering. The two challenges in every optimal control problem are defining the proper cost function and obtaining the best method to minimize it. In this study, innovative optimal control approaches are developed to solve the two problems of consensus and path planning in multi-agent systems (MASs). The consensus problem for general Linear-Time Invariant systems is solved by implementing an inverse optimal control approach which enables us to start by deriving a control law based on the stability and optimality condition and then according to the derived control define the cost function. We will see that this method in which the cost function is not specified a priori as the conventional optimal control design has the benefit that the resulting control law is guaranteed to be both stabilizing and optimal. Three new theorems in related linear algebra are developed to enable us to use the algorithm for all the general LTI systems. The designed optimal control is distributed and only needs local neighbor-to-neighbor information based on the communication topology to make the agents achieve consensus and track a desired trajectory. Path planning problem is solved for a group are Unmanned Aerial Vehicles (UAVs) that are assigned to track the fronts of a fires in a process of wildfire management. We use Partially Observable Markov Decision Process (POMDP) in order to minimize the cost function that is defined according to the tracking error. Here the challenge is designing the algorithm such that (1) the UAVs are able to make decisions autonomously on which fire front to track and (2) they are able to track the fire fronts which evolve over time in random directions. We will see that by defining proper models, the designed algorithms provides real-time calculation of control variables which enables the UAVs to track the fronts and find their way autonomously. Furthermore, by implementing Nominal Belief-state Optimization (NBO) method, the dynamic constraints of the UAVs is considered and challenges such as collision avoidance is addressed completely in the context of POMDP

MS FT-2-2 7 Orthogonal polynomials and quadrature: Theory, computation, and applications

Quadrature rules find many applications in science and engineering. Their analysis is a classical area of applied mathematics and continues to attract considerable attention. This seminar brings together speakers with expertise in a large variety of quadrature rules. It is the aim of the seminar to provide an overview of recent developments in the analysis of quadrature rules. The computation of error estimates and novel applications also are described

Generalized averaged Gaussian quadrature and applications

A simple numerical method for constructing the optimal generalized averaged Gaussian quadrature formulas will be presented. These formulas exist in many cases in which real positive GaussKronrod formulas do not exist, and can be used as an adequate alternative in order to estimate the error of a Gaussian rule. We also investigate the conditions under which the optimal averaged Gaussian quadrature formulas and their truncated variants are internal