Characterized by a cross-disciplinary nature, the bearing-based target localization task involves estimating the position of an entity of interest by a group of agents capable of collecting noisy bearing measurements. In this work, this problem is tackled by resting both on the weighted least square estimation approach and on the active-sensing control paradigm. Indeed, we propose an iterative algorithm that provides an estimate of the target position under the assumption of Gaussian noise distribution, which can be considered valid when more specific information is missing. Then, we present a seeker agents control law that aims at minimizing the localization uncertainty by optimizing the covariance matrix associated with the estimated target position. The validity of the designed bearing-based target localization solution is confirmed by the results of an extensive Monte Carlo simulation campaign.

The agility and versatility offered by UAV platforms still encounter obstacles for full exploitation in industrial applications due to their indoor usage limitations. A significant challenge in this sense is finding a reliable and cost-effective way to localize aerial vehicles in a GNSS-denied environment. In this paper, we focus on the visual-based positioning paradigm: high accuracy in UAVs position and orientation estimation is achieved by leveraging the potentials offered by a dense and size-heterogenous map of tags. In detail, we propose an efficient visual odometry procedure focusing on hierarchical tags selection, outliers removal, and multi-tag estimation fusion, to facilitate the visual-inertial reconciliation. Experimental results show the validity of the proposed localization architecture as compared to the state of the art.

Tilted hexarotors embody a technology that remains partially unexploited in terms of its potential, especially concerning precise and concurrent position and attitude control. Focusing on these aerial platforms, we propose two control architectures that can tackle the trajectory tracking task, ensuring also the attitude regulation: one is designed resting on the differential flatness property of the system, which is investigated in the paper, and the other is a hierarchical nonlinear controller. We comparatively discuss the performance of the two control schemes, in terms of the accuracy of both the tracking control action and the attitude regulation, the input effort, and the robustness in the presence of disturbances. Numerical results reveal both the robustness of the hierarchical approach in the case of external disturbance and the accuracy of the differential flatness-based controller in unwindy conditions.

Nowadays, aerial formations are frequently employed in outdoor scenarios to cooperatively explore and monitor wide areas of interest. In these applications, the vehicles are often exposed to relevant security vulnerabilities, as, for instance, the alteration of navigation signals from an attacker with map counterfeiting (if not even hijacking) purposes. In this work, we focus on an Unmanned Aerial Vehicle (UAV) formation that monitors an area, wherein navigation spoofing attacks may occur. Letting the UAVs cooperate and exploiting the redundancy in the available sensing information, a distributed procedure is proposed to i) detect spoofing attacks, and ii) support the navigation in adverse conditions. The validity of the designed approach is confirmed by numerical results. Aerial vehicles for outdoor operation are generally endowed with inertial measurements, relative ranging, and GNSS sensing capability. In this work, two cascaded estimation algorithms for concurrent GNSS spoofing detection and localization in a multi-UAV scenario is proposed, to attain robust navigation in areas subject to GNSS spoofing attacks. The attack detection leverages on information theoretic tools to provide a practical threshold test by checking the multimodal measurement consistency. The localization procedures exploit a decision logic relying on measurement reliability to combine information sources that are different in nature, for UAV self-localization in both safe and under-attack conditions.

Visual sensor networks (VSNs) constitute a fundamental class of distributed sensing systems, with unique complexity and appealing performance features, which correspondingly bring in quite active lines of research. An important research direction consists in the identification and estimation of the VSN sensing features: these are practically useful when scaling with the number of cameras or with the observed scene complexity. With this context in mind, this paper introduces for the first time the idea of Stimulation Model (SM), as a mathematical relation between the set of detectable events and the corresponding stimulated cameras observing those events. The formulation of the related SM identification problem is proposed, along with a proper network observations model, and a solution approach based on deep embedded features and soft clustering. In detail: first, the Gaussian Mixture Modeling is employed to provide a suitable description for data distribution, while an autoencoder is used to reduce undesired effects due to the so-called curse of dimensionality emerging in case of large scale networks. Then, it is shown that a SM can be learnt by solving Maximum A-Posteriori estimation on the encoded features belonging to a space with lower dimensionality. Numerical results on synthetic scenarios are reported to validate the devised estimation algorithm.

The recent trend toward the development of IoT architectures has entailed the transformation of the standard camera networks into smart multi-device systems, capable of acquiring, elaborating, exchanging data and, often, dynamically adapting to the environment. Along this line, this work proposes a novel distributed solution that guarantees the real-time monitoring of 3D indoor structured areas and also the tracking of multiple targets, by employing an heterogeneous visual sensor network composed of both fixed and Pan-Tilt-Zoom (PTZ) cameras. Specifically, the fulfilment of the twofold mentioned goal is ensured through the implementation of a suitable optimization procedure regarding the PTZ devices controllable parameters, inspired by game theory. Numerical simulations in realistic scenarios confirm the capability of the outlined strategy of securing the simultaneous tracking of several targets, maintaining the total coverage of the surveilled area. In particular, the proposed solution results to be effective in dealing with conflicting goals like achieving a good tracking precision while obtaining high resolution frames of the tracked subjects.

This work presents a novel general regularized distributed solution for the state estimation problem in networked systems. Resting on the graph-based representation of sensor networks and adopting a multivariate least-squares approach, the designed solution exploits the set of the available inter-sensor relative measurements and leverages a general regularization framework, whose parameter selection is shown to control the estimation procedure convergence performance. As confirmed by the numerical results, this new estimation scheme allows (i) the extension of other approaches investigated in the literature and (ii) the convergence optimization in correspondence to any (undirected) graph modeling the given sensor network.

This work focuses on bearing rigidity theory, namely the branch of knowledge investigating the structural properties necessary for multi-element systems to preserve the inter-unit bearings under deformations. The contributions of this work are twofold. The first one consists in the development of a general framework for the statement of the principal definitions and properties of bearing rigidity. We show that this approach encompasses results existing in the literature, and also provides a systematic approach for studying bearing rigidity on any differential manifold in SE(3)^n, where n is the number of agents.The second contribution is the derivation of a general form of the rigidity matrix, a central construct in the study of rigidity theory. We provide a necessary and sufficient condition for the infinitesimal rigidity of a bearing framework as a property of the rank of the rigidity matrix. Finally, we present two examples of multi-agent systems not encountered in the literature and we study their rigidity properties using the developed methods

This work proposes a formation control law for multi-agent systems whose components are heterogeneous in terms of actuation capabilities, but at the same time are all able to retrieve bearing information w.r.t. some neighbors in the group. The designed controller exploits the results of the bearing rigidity theory deriving from the modeling of heterogeneous formations as generalized frameworks. The outlined solution is compared with a leader-follower combination of existing rigidity based homogeneous formation controllers in order to highlight the easy tuning, the flexibility w.r.t. the formation composition, and the increased efficiency of the new proposed control approach. A sufficient condition ensuring the convergence of the designed controller is also given.

The transportation of large payloads can be made possible with Multi-Robot Systems(MRS) implementing cooperative strategies. In this work, we focus on the coordinated MRS trajectory planning task exploiting a Model Predictive Control (MPC) framework addressing both the actingrobots and the transported load. In this context, the main challenge is the possible occurrence of a temporary mismatch among agents’ actions with consequent formation errors that can cause severe damage to the carried load. To mitigate this risk, the coordination scheme may leverage a leader–follower approach, in which a hierarchical strategy is in place to trade-off between the task accomplishment and the dynamics and environment constraints. Nonetheless, particularly in narrow spaces or cluttered environments, the leader’s optimal choice may lead to trajectories that are infeasible for the follower and the load. To this aim, we propose a feasibility-aware leader–follower strategy, where the leader computes a reference trajectory, and the follower accounts for its own and the load constraints; moreover, the follower is able to communicate the trajectory infeasibility to the leader, which reacts by temporarily switching to a conservative policy. The consistent MRS co-design is allowed by the MPC formulation, for both the leader and the follower: here, the prediction capability of MPC is key to guarantee a correct and efficient execution of the leader–follower coordinated action. The approach is formally stated and discussed, and a numerical campaign is conducted to validate and assess the proposed scheme, with respect to different scenarios with growing complexity.

In aerial robotics, path following constitutes a popular
      task requiring a vehicle to pursue a given trajectory.
      Resting upon the fulfillment of a desired time law,
      trajectory tracking techniques often turn out to be
      ineffective in presence of external disturbances, favoring
      the adoption of maneuver regulation strategies wherein the
      desired trajectory is parameterized in terms of the
      path-variable. In this scenario, this work proposes a new
      delay-compensating maneuver regulation controller for fully
      actuated aerial vehicles, whose aim is to guarantee the
      perfect tracking of a given path in the shortest time
      interval. The innovative aspect of such a solution relies
      on the introduction of a recovery term that compensates for
      possible delays in
      the task execution. In addition, the dual-quaternion
      formalism is adopted to model the dynamics of the aerial
      platforms allowing feedback linearize the whole system,
      including both position and attitude, with a single
      controller. The tests conducted in Gazebo physic simulator
      show that the proposed controller outperforms the popular
      trajectory tracking PID regulators.

The use of unmanned vehicles to perform tiring, hazardous, repetitive tasks, is becoming a reality out of the academy laboratories, getting more and more interest for several application fields from the industrial, to the civil, to the military contexts. In particular, these technologies appear quite promising when they employ several low-cost resource-constrained vehicles leveraging their coordination to perform complex tasks with efficiency, flexibility, and adaptation that are superior to those of a single agent (even if more instrumented). In this work, we study one of said applications, namely the visual tracking of an evader (target) by means of a fleet of autonomous aerial vehicles, with the specific aim of focusing on the target so as to perform an accurate position estimation while concurrently allowing a wide coverage over the monitored area so as to limit the probability of losing the target itself. These clearly conflicting objectives call for an optimization approach that is here developed: by considering both aforementioned aspects and the cooperative capabilities of the fleet, the designed algorithm allows controling in real time the single fields of view so as to counteract evasion maneuvers and maximize an overall performance index. The proposed strategy is discussed and finally assessed through the realistic Gazebo-ROS simulation framework.

In this work, we deal with a double control task for a group of interacting agents having a second-order dynamics. Adopting the leader-follower paradigm, the given multi-agent system is required to maintain a desired formation and to collectively track of a velocity reference provided by an external source to a single agent. We prove that it is possible to optimize the group performance by persistently selecting online the leader among the agents. To do this, we first define a suitable error metric able to capture the tracking performance of the multi- agent group while maintaining a desired formation through a (even time-varying) communication-graph topology. Then we show that this depends on the algebraic connectivity and on the maximum eigenvalue of the Laplacian matrix of a special directed graph induced by the identity of the chosen leader. By exploiting these theoretical results, we finally design a fully- distributed adaptive procedure able to periodically select online the optimum leader among the neighbors of the current one. The effectiveness of the proposed solution against other possible strategies is confirmed by numerical simulations.

In this paper, we shed light on two fundamental actuation capabilities of multirotors. The first is the degree of coupling between the total force and total moment generated by the propellers. The second is the ability to robustly fly completely still in place after the loss of one or more propellers, in the case of mono-directional propellers. These are formalized through the definition of some algebraic conditions on the control allocation matrices. The theory is valid for any multirotor, with arbitrary number, position, and orientation of the propellers. As a show case for the general theory, we demonstrate that standard star-shaped hexarotors with collinear propellers are not able to robustly fly completely still at a constant spot using only five of their six propellers. To deeply understand this counterintuitive result, it is enough to apply our theory, which clarifies the role of the tilt angles and locations of the propellers. The theory is also able to explain why, on the contrary, both the tilted star-shaped and the Y-shaped hexarotors can fly with only five out of six propellers. The analysis is validated with both simulations and extensive experimental results showing recovery control after rotor losses.

Over the past few years, a huge number of distributed camera calibration strategies have been proposed for video surveillance and monitoring systems involving mobile terminals. Many of the proposed solutions rely on consensus-based algorithms, which aim at estimating the configuration of the network via a message passing protocol. In this paper we propose an improved consensus-based distributed camera calibration strategy that exploits a robust initialization, together with a pruning protocol to remove faulty links which could propagate excessively-noisy information through the network reducing the convergence time. The proposed solution seems to improve the state-of-the-art strategies in terms of accuracy, convergence speed, and computational complexity.

Over the last decades, small satellites have become very appealing among the space community for their low complexity and high flexibility. Many proposed mission concepts foresee the employment of miniature spacecraft for a variety of applications, many of which are economically unfeasible with traditional vehicles. This is due to the fact that the development of miniaturized and standardized space vehicles may considerably reduce the design, manufacturing and lunch costs involved. Furthermore, the reduced unitary mass of small satellites allows launches of multiple vehicles equipped with independent functionalities, thus achieving increased flexibility and redundancy. In the future, one additional opportunity could be given by the capability to assemble spacecraft in orbit to form reconfigurable structures. This would further boost the number of possibilities in terms of applications and operations. Nevertheless, the novelty of such concept and the intrinsic complexity of its practical realization still require a considerable research effort. In fact, only few navigation and docking technologies for nano- and micro satellites have been designed and proved in relevant environment. In this framework, the authors focus on the development and validation of critical technologies for close navigation, rendezvous and docking suitable for nanosatellites.

This paper presents a laboratory experiment for the validation on a complete rendezvous, navigation and docking package compatible with the common CubeSat standard. The experiment is conducted on a low friction table, with one free moving vehicle (chaser) that approaches and docks to a fixed target interface. The test facility allows three degrees of freedom to the nanosat mock-up. The vehicle is equipped with an autonomous package that features (1) a camera-based vision system for relative navigation, (2) a set of independent electro-magnetic coils for final alignment and soft docking, (3) a single-actuator hard docking system for structural connection between the chaser and the target, (4) a dedicated electronics package for motion control and system status monitoring. The mobile platform is also equipped with a set of flat air bearing with a dedicated high-pressure pneumatic circuit for frictionless in-plane motion.

This paper describes the docking package, the CubeSat mock-up and the test facility in details, with reference to the main design considerations. Numerical simulations have been conducted to foresee the dynamical behaviour of the system and to select the appropriate control algorithm. An intensive experimental campaign aims at the validation of numerical results and at the functional verification and performance estimation for each subsystem and for the system as a whole. The numerical and experimental results are presented and compared, allowing to draw useful conclusions for the future development steps. 

Standard hexarotors are often mistakenly considered ‘by definition’ fail-safe multi-rotor platforms because of the two additional propellers when compared to quadrotors. However this is not true, in fact, a standard hexarotor cannot statically hover with ‘only’ five propellers. In this paper we provide a set of new general algebraic conditions to ensure static hover for any multi-rotor platform with any number of generically oriented rotors. These are elegantly formulated as the full-rankness of the control moment input matrix, and the non-orthogonality between its null-space and the row space of the control force input matrix. Input saturations and safety margins are also taken into account with an additional condition on the null-space of control moment input matrix. A deep analysis on the hoverability properties is then carried out focusing on the propeller loss in a hexarotor platform. Leveraging our general results we explain why a standard hexarotor is not robust and how it can be made robust thanks to a particular tilt of the rotors. We finally propose a novel cascaded controller based on a preferential direction in the null-space of the control moment input matrix for the large class of statically hoverable multi-rotors, which goes far beyond standard platforms, and we apply this controller to the case of failed tilted hexarotor.

Wireless sensor networks (WSNs) can provide numerous benefits in industrial automation. By removing the cable infrastructure, the wireless architecture enables the possibility for nodes in a network to dynamically and autonomously group into clusters according to the communication features and the data they collect. This capability allows to leverage the flexibility and robustness of industrial WSNs in supervisory intelligent systems for high-level tasks, such as, for example, environmental sensing, condition monitoring, and process automation. In this paper, a clustering strategy is studied that partitions a sensor network into a nonfixed number of nonoverlapping clusters according to the communication network topology and measurements distribution: To this aim, both a centralized and a distributed algorithm are designed that do not require a cluster-head structure or other network assumptions. As a validation, these strategies are tested on a real dataset coming from a structured environment and the effectiveness of the clustering procedure is also investigated to perform anomalies detection in an industrial production process.

In  this  paper  we  address  the  average  consensus problem in a Wireless Sensor-Actor Network with the particular focus  on  autonomous  fault  detection.  To  this  aim,  we  design  a distributed  clustering  procedure  that  partitions  the  network into  clusters  according  to  both  similarity  of  measurements and communication connectivity. The exploitation of clustering techniques   in   consensus   computation   allows   to   obtain   the detection   and   isolation   of   faulty   nodes,   thus   assuring   the convergence  of  the  other  nodes  to  the  exact  consensus  value. More  interestingly,  the  algorithm  can  be  integrated  into  a Kalman filtering framework to perform distributed estimation of  a  dynamic  quantity  in  presence  of  faults.  The  proposed approach is validated through numerical simulations and tests on a real world scenario dataset.