arXiv subjects

Angelo Cenedese

Publications and source records attributed to Angelo Cenedese.

At least 37 records · Page 2Linked to original sources

arXiv2023

Quaternion-based non-singular terminal sliding mode control for a satellite-mounted space manipulator

In this paper, a robust control solution for a satellite equipped with a robotic manipulator is presented. First, the dynamic model of the system is derived based on quaternions to describe the evolution of the attitude of the base satellite. Then, a non-singular terminal sliding mode controller that employs quaternions for attitude control, is proposed for concurrently handling all the degrees of freedom of the space manipulator. Moreover, an additional adaptive term is embedded in the controller to estimate the upper bounds of disturbances and uncertainties. The result is a resilient solution able to withstand unmodelled dynamics and interactions. Lyapunov theory is used to prove the stability of the controller and numerical simulations allow assessing performance and fuel efficiency.

eess.SY↗

arXiv2022

Visual Sensor Network Stimulation Model Identification via Gaussian Mixture Model and Deep Embedded Features

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.

eess.SP↗

arXiv2022

Distributed Dual Quaternion Based Localization of Visual Sensor Networks

In this paper we consider the localization problem for a visual sensor network. Inspired by the alternate attitude and position distributed optimization framework discussed in [1], we propose an estimation scheme that exploits the unit dual quaternion algebra to describe the sensors pose. This representation is beneficial in the formulation of the optimization scheme allowing to solve the localization problem without designing two interlaced position and orientation estimators, thus improving the estimation error distribution over the two pose components and the overall localization performance. Furthermore, the numerical experimentation asserts the robustness of the proposed algorithm w.r.t. the initial conditions.

eess.SY↗

arXiv2022

Distributed Strategies for Dynamic Coverage with Limited Sensing Capabilities

In this work, it is presented the development of a novel distributed algorithm performing robotic coverage, clustering and dispatch around an event in static-obstacle structured environments without relying on metric information. Specifically, the aim is to account for the trade-off between local communication given by bearing visibility sensors installed on each agent involved, optimal deployment in closed unknown scenarios and focus of a group of agents on one point of interest. The particular targets of this study can be summarized as 1. the computation, under certain topological assumptions, of a lower bound for the number of required agents, which are provided by a realistic geometric model (e.g. a round shape) to emphasize physical limitations; 2. the minimization of the number of nodes and links maintaining a distributed approach over a connected communication graph; 3. the identification of an activation cluster around an event with a radial decreasing intensity, sensed by each agent; 4. the attempt to send the agents belonging to the cluster towards the most intense point in the scenario by minimizing a weighted isoperimetric functional.

eess.SY↗

arXiv2022

On the Distributed Estimation from Relative Measurements: a Graph-Based Convergence Analysis

For a multi-agent system state estimation resting upon noisy measurements constitutes a problem related to several application scenarios. Adopting the standard least-squares approach, in this work we derive both the (centralized) analytic solution to this issue and two distributed iterative schemes, which allow to establish a connection between the convergence behavior of consensus algorithm toward the optimal estimate and the theory of the stochastic matrices that describe the network system dynamics. This study on the one hand highlights the role of the topological links that define the neighborhood of agent nodes, while on the other allows to optimize the convergence rate by easy parameter tuning. The theoretical findings are validated considering different network topologies by means of numerical simulations.

eess.SY↗

arXiv2022

Optimal Time-Invariant Formation Tracking for a Second-Order Multi-Agent System

Given a multi-agent linear system, we formalize and solve a trajectory optimization problem that encapsulates trajectory tracking, distance-based formation control and input energy minimization. To this end, a numerical projection operator Newton's method is developed to find a solution by the minimization of a cost functional able to capture all these different tasks. To stabilize the formation, a particular potential function has been designed, allowing to obtain specified geometrical configurations while the barycenter position and velocity of the system follows a desired trajectory.

eess.SY↗

arXiv2021

Active Sensing for Search and Tracking: A Review

Active Position Estimation (APE) is the task of localizing one or more targets using one or more sensing platforms. APE is a key task for search and rescue missions, wildlife monitoring, source term estimation, and collaborative mobile robotics. Success in APE depends on the level of cooperation of the sensing platforms, their number, their degrees of freedom and the quality of the information gathered. APE control laws enable active sensing by satisfying either pure-exploitative or pure-explorative criteria. The former minimizes the uncertainty on position estimation; whereas the latter drives the platform closer to its task completion. In this paper, we define the main elements of APE to systematically classify and critically discuss the state of the art in this domain. We also propose a reference framework as a formalism to classify APE-related solutions. Overall, this survey explores the principal challenges and envisages the main research directions in the field of autonomous perception systems for localization tasks. It is also beneficial to promote the development of robust active sensing methods for search and tracking applications.

cs.RO↗

arXiv2021

A General Regularized Distributed Solution for System State Estimation from Relative Measurements

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.

eess.SY↗

arXiv2021

Nonlinear modeling and feedback control of boom barrier automation

We address modeling and control of a gate access automation system. A model of the mechatronic system is derived and identified. Then an approximate explicit feedback linearization scheme is proposed, which ensures almost linear response between the external input and the delivered torque. A nonlinear optimization problem is solved offline to generate a feasible trajectory associated with a feedforward action and a low level feedback controller is designed to track it. The feedback gains can be conveniently tuned by solving a set of convex linear matrix inequalities, performing a multi-objective trade-off between disturbances attenuation and closed-loop performance. Finally, the proposed control strategy is tested on the real system and experimental results show that it can effectively meet the requirements in terms of robustness, load disturbance rejection and tracking performance.

eess.SY↗

arXiv2021

Probabilistic RF-Assisted Camera Wake-Up through Self-Supervised Gaussian Process Regression

Research on wireless sensors represents a continuously evolving technological domain thanks to their high flexibility and scalability, fast and economical deployment, pervasiveness in industrial, civil and domestic contexts. However, the maintenance costs and the sensors reliability are strongly affected by the battery lifetime, which may limit their use. In this paper we consider a wireless smart camera, equipped with a low-energy radio receiver, and used to visually detect a moving radio-emitting target. To preserve the camera lifetime without sacrificing the detection capabilities, we design a probabilistic energy-aware controller to switch on/off the camera. The radio signal strength is used to predict the target detectability, via self-supervised Gaussian Process Regression combined with Recursive Bayesian Estimation. The automatic training process minimizes the human intervention, while the controller guarantees high detection accuracy and low energy consumption, as numerical and experimental results show.

eess.SP↗

arXiv2021

Online and Adaptive Parking Availability Mapping: An Uncertainty-Aware Active Sensing Approach for Connected Vehicles

Research on connected vehicles represents a continuously evolving technological domain, fostered by the emerging Internet of Things (IoT) paradigm and the recent advances in intelligent transportation systems. Nowadays, vehicles are platforms capable of generating, receiving and automatically act based on large amount of data. In the context of assisted driving, connected vehicle technology provides real-time information about the surrounding traffic conditions. Such information is expected to improve drivers' quality of life, for example, by adopting decision making strategies according to the current parking availability status. In this context, we propose an online and adaptive scheme for parking availability mapping. Specifically, we adopt an information-seeking active sensing approach to select the incoming data, thus preserving the onboard storage and processing resources; then, we estimate the parking availability through Gaussian Process Regression. We compare the proposed algorithm with several baselines, which attain inferior performance in terms of mapping convergence speed and adaptivity capabilities; moreover, the proposed approach comes at the cost of a very small computational demand.

eess.SP↗

arXiv2021

Transmitter Discovery through Radio-Visual Probabilistic Active Sensing

Multi-modal Probabilistic Active Sensing (MMPAS) uses sensor fusion and probabilistic models to control the perception process of robotic sensing platforms. MMPAS is successfully employed in environmental exploration, collaborative mobile robotics, and target tracking, being fostered by the high performance guarantees on autonomous perception. In this context, we propose a bi-Radio-Visual PAS scheme to solve the transmitter discovery problem. Specifically, we firstly exploit the correlation between radio and visual measurements to learn a target detection model in a self-supervised manner. Then, the model is combined with antenna radiation anisotropies into a Bayesian Optimization framework that controls the platform. We show that the proposed algorithm attains an accuracy of 92%, overcoming two other probabilistic active sensing baselines.

cs.RO↗

arXiv2021

A Unified Dissertation on Bearing Rigidity Theory

This work focuses on the bearing rigidity theory, namely the branch of knowledge investigating the structural properties necessary for multi-element systems to preserve the inter-units bearings when exposed to deformations. The original contributions are twofold. The first one consists in the definition of a general framework for the statement of the principal definitions and results that are then particularized by evaluating the most studied metric spaces, providing a complete overview of the existing literature about the bearing rigidity theory. The second one rests on the determination of a necessary and sufficient condition guaranteeing the rigidity properties of a given multi-element system, independently of its metric space.

eess.SY↗

arXiv2021

A Proximal Point Approach for Distributed System State Estimation

System state estimation constitutes a key problem in several applications involving multi-agent system architectures. This rests upon the estimation of the state of each agent in the group, which is supposed to access only relative measurements w.r.t. some neighbors state. Exploiting the standard least-squares paradigm, the system state estimation task is faced in this work by deriving a distributed Proximal Point-based iterative scheme. This solution entails the emergence of interesting connections between the structural properties of the stochastic matrices describing the system dynamics and the convergence behavior toward the optimal estimate. A deep analysis of such relations is provided, jointly with a further discussion on the penalty parameter that characterizes the Proximal Point approach.

eess.SY↗

arXiv2021

Learning to falsify automated driving vehicles with prior knowledge

While automated driving technology has achieved a tremendous progress, the scalable and rigorous testing and verification of safe automated and autonomous driving vehicles remain challenging. This paper proposes a learning-based falsification framework for testing the implementation of an automated or self-driving function in simulation. We assume that the function specification is associated with a violation metric on possible scenarios. Prior knowledge is incorporated to limit the scenario parameter variance and in a model-based falsifier to guide and improve the learning process. For an exemplary adaptive cruise controller, the presented framework yields non-trivial falsifying scenarios with higher reward, compared to scenarios obtained by purely learning-based or purely model-based falsification approaches.

cs.RO↗

arXiv2019

Hierarchical non-linear control for multi-rotor asymptotic stabilization based on zero-moment direction

We consider the hovering control problem for a class of multi-rotor aerial platforms with generically oriented propellers. Given the intrinsically coupled translational and rotational dynamics of such vehicles, we first discuss some assumptions for the considered systems to reject torque disturbances and to balance the gravity force, which are translated into a geometric characterization of the platforms that is usually fulfilled by both standard models and more general configurations. Hence, we propose a control strategy based on the identification of a zero-moment direction for the applied force and the dynamic state feedback linearization around this preferential direction, which allows to asymptotically stabilize the platform to a static hovering condition. Stability and convergence properties of the control law are rigorously proved through Lyapunov-based methods and reduction theorems for the stability of nested sets. Asymptotic zeroing of the error dynamics and convergence to the static hovering condition are then confirmed by simulation results on a star-shaped hexarotor model with tilted propellers.

eess.SY↗

arXiv2015

Newton-Raphson Consensus for Distributed Convex Optimization

We address the problem of distributed uncon- strained convex optimization under separability assumptions, i.e., the framework where each agent of a network is endowed with a local private multidimensional convex cost, is subject to communication constraints, and wants to collaborate to compute the minimizer of the sum of the local costs. We propose a design methodology that combines average consensus algorithms and separation of time-scales ideas. This strategy is proved, under suitable hypotheses, to be globally convergent to the true minimizer. Intuitively, the procedure lets the agents distributedly compute and sequentially update an approximated Newton- Raphson direction by means of suitable average consensus ratios. We show with numerical simulations that the speed of convergence of this strategy is comparable with alternative optimization strategies such as the Alternating Direction Method of Multipliers. Finally, we propose some alternative strategies which trade-off communication and computational requirements with convergence speed.

math.OC↗

arXiv2015

An Energy Efficient Ethernet Strategy Based on Traffic Prediction and Shaping

Recently, different communities in computer science, telecommunication and control systems have devoted a huge effort towards the design of energy efficient solutions for data transmission and network management. This paper collocates along this research line and presents a novel energy efficient strategy conceived for Ethernet networks. The proposed strategy combines the statistical properties of the network traffic with the opportunities offered by the IEEE 802.3az amendment to the Ethernet standard, called Energy Efficient Ethernet (EEE). This strategy exploits the possibility of predicting the incoming traffic from the analysis of the current data flow, which typically presents a self-similar behavior. Based on the prediction, Ethernet links can then be put in a low power consumption state for the intervals of time in which traffic is expected to be of low intensity. Theoretical bounds are derived that detail how the performance figures depend on the parameters of the designed strategy and scale with respect to the traffic load. Furthermore, simulations results, based on both real and synthetic traffic traces, are presented to prove the effectiveness of the strategy, which leads to considerable energy savings at the cost of only a limited bounded delay in data delivery.

cs.NI↗