Simultaneous deployment and tracking multi-robot strategies with connectivity maintenance

Multi-robot teams composed of ground and aerial vehicles have gained attention during the last few years. We present a scenario where both types of robots must monitor the same area from different view points. In this paper, we propose two Lloyd-based tracking strategies to allow the ground robots (agents) to follow the aerial ones (targets), keeping the connectivity between the agents. The first strategy establishes density functions on the environment so that the targets acquire more importance than other zones, while the second one iteratively modifies the virtual limits of the working area depending on the positions of the targets. We consider the connectivity maintenance due to the fact that coverage tasks tend to spread the agents as much as possible, which is addressed by restricting their motions so that they keep the links of a minimum spanning tree of the communication graph. We provide a thorough parametric study of the performance of the proposed strategies under several simulated scenarios. In addition, the methods are implemented and tested using realistic robotic simulation environments and real experiments

Simultaneous Deployment and Tracking Multi-Robot Strategies with Connectivity Maintenance

Multi robot teams composed by ground and aerial vehicles have gained attention during the last years. We present a scenario where both types of robots must monitor the same area from different view points. In this paper we propose two Lloyd-based tracking strategies to allow the ground robots (agents) follow the aerial ones (targets), keeping the connectivity between the agents. The first strategy establishes density functions on the environment so that the targets acquire more importance than other zones, while the second one iteratively modifies the virtual limits of the working area depending on the positions of the targets. We consider the connectivity maintenance due to the fact that coverage tasks tend to spread the agents as much as possible, which is addressed by restricting their motions so that they keep the links of a Minimum Spanning Tree of the communication graph. We provide a thorough parametric study of the performance of the proposed strategies under several simulated scenarios. In addition, the methods are implemented and tested using realistic robotic simulation environments and real experiments

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

Resilient visual perception for multiagent systems

There has been an increasing interest in visual sensors and vision-based solutions for single and multi-robot systems. Vision-based sensors, e.g., traditional RGB cameras, grant rich semantic information and accurate directional measurements at a relatively low cost; however, such sensors have two major drawbacks. They do not generally provide reliable depth estimates, and typically have a limited field of view. These limitations considerably increase the complexity of controlling multiagent systems. This thesis studies some of the underlying problems in vision-based multiagent control and mapping. The first contribution of this thesis is a method for restoring bearing rigidity in non-rigid networks of robots. We introduce means to determine which bearing measurements can improve bearing rigidity in non-rigid graphs and provide a greedy algorithm that restores rigidity in 2D with a minimum number of added edges. The focus of the second part is on the formation control problem using only bearing measurements. We address the control problem for consensus and formation control through non-smooth Lyapunov functions and differential inclusion. We provide a stability analysis for undirected graphs and investigate the derived controllers for directed graphs. We also introduce a newer notion of bearing persistence for pure bearing-based control in directed graphs. The third part is concerned with the bearing-only visual homing problem with a limited field of view sensor. In essence, this problem is a special case of the formation control problem where there is a single moving agent with fixed neighbors. We introduce a navigational vector field composed of two orthogonal vector fields that converges to the goal position and does not violate the field of view constraints. Our method does not require the landmarks' locations and is robust to the landmarks' tracking loss. The last part of this dissertation considers outlier detection in pose graphs for Structure from Motion (SfM) and Simultaneous Localization and Mapping (SLAM) problems. We propose a method for detecting incorrect orientation measurements before pose graph optimization by checking their geometric consistency in cycles. We use Expectation-Maximization to fine-tune the noise's distribution parameters and propose a new approximate graph inference procedure specifically designed to take advantage of evidence on cycles with better performance than standard approaches. These works will help enable multi-robot systems to overcome visual sensors' limitations in collaborative tasks such as navigation and mapping

Behaviour monitoring: investigation of local and distributed approaches

Nowadays, the widespread availability of cheap and efficient unmanned systems (either aerial, ground or surface) has led to significant opportunities in the field of remote sensing and automated monitoring. On the one hand, the definition of efficient approaches to information collection, filtering and fusion has been the focus of extremely relevant research streams over the last decades. On the other hand, far less attention has been given to the problem of ‘interpreting’ the data, thus implementing inference processes able to, e.g., spot anomalies and possible threats in the monitored scenario. It is easy to understand how the automation of the ‘target assessment’ process could bring a great impact on monitoring applications since it would allow sensibly alleviating the analysis burden for human operators. To this end, the research project proposed in this thesis addresses the problem of behaviour assessment leading to the identification of targets that exhibit features “of interest”. Firstly, this thesis has addressed the problem of distributed target assessment based on behavioural and contextual features. The assessment problem is analysed making reference to a layered structure and a possible implementation approach for the middle-layer has been proposed. An extensive analysis of the ‘feature’ concept is provided, together with considerations about the target assessment process. A case study considering a road-traffic monitoring application is then introduced, suggesting a possible implementation for a set of features related to this particular scenario. The distributed approach has been implemented employing a consensus protocol, which allows achieving agreement about high-level, non-measurable, characteristics of the monitored vehicles. Two different techniques, ‘Belief’ and ‘Average’ consensus, for distributed target assessment based on features are finally presented, enabling the comparison of consensus effects when implemented at different level of the considered conceptual hierarchy. Then, the problem of identifying targets concerning features is tackled using a different approach: a probabilistic description is adopted for the target characteristics of interest and a hypothesis testing technique is applied to the feature probability density functions. Such approach is expected to allow discerning whether a given vehicle is a target of interest or not. The assessment process introduced is also able to account for information about the context of the vehicle, i.e. the environment where it moves or is operated. In so doing the target assessment process can be effectively adapted to the contour conditions. Results from simulations involving a road monitoring scenario are presented, considering both synthetic and real-world data. Lastly, the thesis addresses the problem of manoeuvre recognition and behaviour anomalies detection for generic targets through pattern matching techniques. This problem is analysed considering motor vehicles in a multi-lane road scenario. The proposed approach, however, can be easily extended to significantly different monitoring contexts. The overall proposed solution consists in a trajectory analysis tool, which classifies the target position over time into a sequence of ‘driving modes’, and a string-matching technique. This classification allows, as result of two different approaches, detecting both a priori defined patterns of interest and general behaviours standing out from those regularly exhibited from the monitored targets. Regarding the pattern matching process, two techniques are introduced and compared: a basic approach based on simple strings and a newly proposed method based on ‘regular expressions’. About reference patterns, a technique for the automatic definition of a dictionary of regular expressions matching the commonly observed target manoeuvres is presented. Its assessment results are then compared to those of a classic multi-layered neural network. In conclusion, this thesis proposes some novel approaches, both local and distributed, for the identification of the ‘targets of interest’ within a multi-target scenario. Such assessment is solely based on the behaviour actually exhibited by a target and does not involve any specific knowledge about the targets (analytic dynamic models, previous data, signatures of any type, etc.), being thus easily applicable to different scenarios and target types. For all the novel approaches described in the thesis, numerical results from simulations are reported: these results, in all the cases, confirm the effectiveness of the proposed techniques, even if they appear to be open to interpretation because of the inherent subjectivity of the assessment process

Control law and state estimators design for multi-agent system with reduction of communications by event-triggered approach

A large amount of research work has been recently dedicated to the study of Multi-Agent System and cooperative control. Applications to mobile robots, like unmanned air vehicles (UAVs), satellites, or aircraft have been tackled to insure complex mission such as exploration or surveillance. However, cooperative tasking requires communication between agents, and for a large number of agents, the number of communication exchanges may lead to network saturation, increased delays or loss of transferred packets, from the interest in reducing them. In event-triggered strategy, a communication is broadcast when a condition, based on chosen parameters and some threshold, is fulfilled. The main difficulty consists in determining the communication triggering condition (CTC) that will ensure the completion of the task assigned to the MAS. In a distributed strategy, each agent maintains an estimate value of others agents state to replace missing information due to limited communication. This thesis focuses on the development of distributed control laws and estimators for multi-agent system to limit the number of communication by using event-triggered strategy in the presence of perturbation with two main topics, i.e. consensus and formation control. The first part addresses the problem of distributed event-triggered communications for consensus of a multi-agent system with both general linear dynamics and state perturbations. To decrease the amount of required communications, an accurate estimator of the agent states is introduced, coupled with an estimator of the estimation error, and adaptation of communication protocol. By taking into account the control input of the agents, the proposed estimator allows to obtain a consensus with fewer communications than those obtained by a reference method. The second part proposes a strategy to reduce the number of communications for displacement-based formation control while following a desired reference trajectory. Agent dynamics are described by Euler-Lagrange models with perturbations and uncertainties on the model parameters. Several estimator structures are proposed to rebuilt missing information. The proposed distributed communication triggering condition accounts for inter-agent displacements and the relative discrepancy between actual and estimated agent states. A single a priori trajectory has to be evaluated to follow the desired path. Effect of state perturbations on the formation and on the communications are analyzed. Finally, the proposed methods have been adapted to consider packet dropouts and communication delays. For both type