Publications Lists     [ all BibTeX ]  

Adversarial Training has proved to be an effective training paradigm to enforce robustness against adversarial examples in modern neural network architectures. Despite many efforts, explanations of the foundational principles underpinning the effectiveness of Adversarial Training are limited and far from being widely accepted by the Deep Learning community. In this paper, we describe surprising properties of adversarially-trained models, shedding light on mechanisms through which robustness against adversarial attacks is implemented. Moreover, we highlight limitations and failure modes affecting these models that were not discussed by prior works. We conduct extensive analyses on a wide range of architectures and datasets, performing a deep comparison between robust and natural models.

The Multi–Rate Support feature has been introduced by the IEEE 802.11 standard to improve system performance, and has been widely exploited by means of Rate Adaptation (RA) strategies within general purpose Wireless LANs. These strategies revealed ineffective for real–time industrial communications, and alternative solutions, better tailored for such a specific field of application, were investigated. The preliminary outcomes of the analyses carried out were promising, even if they clearly indicated that further efforts were necessary. In this direction, this paper firstly proposes Rate Selection for Industrial Networks (RSIN), an innovative RA algorithm specifically conceived for the real–time industrial scenario with
the goal of minimizing the transmission error probability, while taking into account the deadline imposed to packet delivery. Then, it describes the practical implementation of RSIN on commercial devices, along with that of other formerly introduced RA techniques. Finally, the paper presents a thorough performance
analysis, carried out to investigate the behavior of the addressed RA schemes. Such an assessment was performed via both experimental campaigns and simulations. The obtained results, on the one hand, confirm the effectiveness of the RA techniques purposely designed for real–time industrial communication. On the other hand, they clearly indicate that RSIN outperforms all the other strategies.

This paper aims to delineate a comprehensive method that integrates machine vision and deep learning for quality control within an industrial setting. The innovative approach proposed in this solution leverages a microservice architecture that ensures adaptability and flexibility to different scenarios while focusing on the employment of affordable, compact hardware, and achieves exceptionally high accuracy in performing the quality control task keeping a minimal computational time. Consequently, the developed system operates entirely on a portable smart camera, eliminating the need for additional sensors like photocells and external computation, which simplifies setup and commissioning phases and reduces the overall impact on the production line. By leveraging the integration of the embedded system with the machinery, this approach offers real-time monitoring and analysis capabilities, facilitating swift detection of defects and deviations from desired standards. Moreover, the low-cost nature of the solution makes it accessible to a wider range of manufacturing enterprises, democratizing quality processes in Industry 5.0. The system has been successfully implemented and is fully operational in a real industrial environment and the experimental results obtained from this implementation are also presented in the work.

The work considers the design of an indirect adaptive controller for a satellite equipped with a robotic arm manipulating an object. Uncertainty on the manipulated object can considerably impact the overall behavior of the system. In addition, the dynamics of the actuators of the base satellite are non-linear and can be affected by malfunctioning. Neglecting these two phenomena may lead to excessive control effort or degrade performance. An indirect adaptive control approach is pursued, which allows consideration of relevant features of the actuators dynamics, such as loss of effectiveness. Furthermore, an adaptive law that preserves the physical consistency of the inertial parameters of the various rigid bodies comprising the system is employed. The performance and robustness of the controller are first analyzed and then validated in simulation.

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.

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.

In fast nonlinear model predictive control the sensitivitycomputation is one of the key aspects to reducecomputational burden, in fact specific automated andefficient procedures for that have been developed. Howeverthe number of sensitivity computations required toadequately approximate the nonlinear dynamics is typicallyhigh and fixed a priori. In this paper, we developa sensitivity updating scheme capable of reducing thenumber of sensitivity computations exploiting an onlinecurvature-based measure of nonlinearity of the system.The proposed strategy is applied to the sequentialquadratic programming framework with specific attentionto the Real-Time Iteration implementation. Simulationson the inverted pendulum benchmark show asignificant reduction of the number of the sensitivity updates,hence a reduction of the overall computationaltime.

In the last years, IEEE 802.11 Wireless LANs (WLANs) have proved their eectiveness for a wide range of real– time industrial communication applications. Nonetheless, the introduction of the important IEEE 802.11n amendment, which is commonly implemented in commercial devices, has not been adequately addressed in this operational framework yet. IEEE 802.11n encompasses several enhancements both at the physical (PHY) and medium access control (MAC) layers that may bring considerable improvements to the performance of WLANs deployed in real–time industrial communication systems. To this regard, in this paper we present a thorough investigation of the most important IEEE 802.11n features, addressing in particular specific performance indicators, such as timeliness and reliability, that are crucial for industrial communication systems. To this aim, after an accurate theoretical analysis, we implemented a suitable experimental setup and carried out several measurement sessions to obtain an exhaustive performance assessment. The outcomes of these experiments, on the one hand revealed that the adoption of IEEE 802.11n can actually provide significant improvements to the performance of the IEEE 802.11 WLAN in the industrial communication scenario. On the other hand, the assessment allowed to select, among the various options of IEEE 802.11n, the parameter settings which may ensure the best behavior in this specific (and demanding) field of application.

This paper addresses the optimal time-invariant formation tracking problem with the aim of providing a distributed solution for multi-agent systems with second-order integrator dynamics. In the literature, most of the results related to multi-agent formation tracking do not consider energy issues while investigating distributed feedback control laws. In order to account for this crucial design aspect, we contribute by formalizing and proposing a solution to an optimization problem that encapsulates trajectory tracking, distance-based formation control, and input energy minimization, through a specific and key choice of potential functions in the optimization cost. To this end, we show how to compute the inverse dynamics in a centralized fashion by means of the Projector-Operator-based Newton's method for Trajectory Optimization (PRONTO) and, more importantly, we exploit such an offline solution as a general reference to devise a stabilizing online distributed control law. Finally, numerical examples involving a cubic formation following a straight path in the 3D space are provided to validate the proposed control strategies.

We propose a unified framework for time-varying convex optimization based on the prediction-correction paradigm, both in the primal and dual spaces. In this framework, a continuously varying optimization problem is sampled at fixed intervals, and each problem is approximately solved with a primal or dual correction step. The solution method is warm-started with the output of a prediction step, which solves an approximation of a future problem using past information. Prediction approaches are studied and compared under different sets of assumptions. Examples of algorithms covered by this framework are time-varying versions of the gradient method, splitting methods, and the celebrated alternating direction method of multipliers (ADMM).

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.

Industrial applications aimed at real–time control and monitoring of cyber–physical systems pose significant challenges to the underlying communication networks in terms of determinism, low latency and high reliability. The migration of these networks from wired to wireless could bring several benefits in terms of cost reduction and simplification of design, but currently available wireless techniques cannot cope with the stringent requirements of the most critical applications. In this work, we consider the problem of designing a high–performance wireless network for industrial control, targeting at Gbps data rates and 10 ?s–level cycle time. To this aim, we start from analysing the required performance and deployment scenarios, then we take a look at the most advanced standards and emerging trends that may be applicable. Building on this investigation, we outline the main directions for the development of a wireless high performance system.

This paper deals with water management over open-channel networks (OCNs) subject to water height imbalance. The OCN is modeled by means of graph theory tools and a regulation scheme is designed basing on an outer reference generation loop for the whole OCN and a set of local controllers. Specifically, it is devised a fully distributed adaptive consensus-based algorithm within the discrete-time domain capable of (i) generating a suitable tracking reference that stabilizes the water increments over the underlying network at a common level; (ii) coping with general flow constraints related to each channel of the considered system. This iterative procedure is derived by solving a guidance problem that guarantees to steer the regulated network - represented as a closed-loop system - while satisfying requirements (i) and (ii), provided that a suitable design for the local feedback law controlling each channel flow is already available. The proposed solution converges exponentially fast towards the average consensus thanks to a Metropolis-Hastings design of the network parameters without violating the imposed constraints over time. In addition, numerical results are reported to support the theoretical findings, and the performance of the developed algorithm is discussed in the context of a realistic scenario. 

Anomaly Detection is an unsupervised learning task aimed at detecting anomalous behaviors with respect to historical data. In particular, multivariate Anomaly Detection has an important role in many applications thanks to the capability of summarizing the status of a complex system or observed phenomenon with a single indicator (typically called ‘anomaly score’) and thanks to the unsupervised nature of the task that does not require human tagging. The Isolation Forest is one of the most commonly adopted algorithms in the field of Anomaly Detection due to its proven effectiveness and low computational complexity. A major problem affecting Isolation Forest is represented by the lack of interpretability, an effect of the inherent randomness governing the splits performed by the Isolation Trees, the building blocks of the Isolation Forest. In this paper, we propose effective yet computationally inexpensive methods to define feature importance scores at both global and local levels for the Isolation Forest. Moreover, we define a procedure to perform unsupervised feature selection for Anomaly Detection problems based on our interpretability method. Such a procedure also serves the purpose of tackling the challenging task of feature importance evaluation in unsupervised anomaly detection. We assess the performance on several synthetic and real-world datasets, including comparisons against state-of-the-art interpretability techniques, and make the code publicly available to enhance reproducibility and foster research in the field.

Data-driven Anomaly Detection approaches have received increasing attention in  many other application areas in the past fewyears as a tool for monitoring of complex systems in addition to classical univariatecontrol charts. Tree-based approaches have proven to be particularly effective when dealing with high-dimensional Anomaly Detection problems and with underlying non-gaussian data distributions. The most popular approach in this family is the Isolation Forest, which is currently one of the mostpopular choices for scientists and practitioners when dealing with Anomaly Detection tasks. The Isolation Forest represents a seminal algorithm upon which many extended approaches have been presented in the past years aiming at improving the original method or at dealing with peculiar applicationscenarios. In this work, we revise some of the most popular and powerful Tree-based approaches to Anomaly Detection (extensions of the Isolation Forest and other approaches), considering both batch and streaming datascenarios. This work will review several relevant aspects of the methods, like computational costs and interpretability traits. To help practitioners, we also report available relevant libraries and open implementations and we review real-world industrial applications of the considered approaches.

The monitoring of rotating machinery is an essential task in today's production processes. Currently, several machine learning and deep learning-based modules have achieved excellent results in fault detection and diagnosis. Nevertheless, to further increase user adoption and diffusion of such technologies, users and human experts must be provided with explanations and insights by the modules. Another issue is related, in most cases, with the unavailability of labeled historical data that makes the use of supervised models unfeasible. Therefore, a new approach for fault detection and diagnosis in rotating machinery is here proposed. The methodology consists of three parts: feature extraction, fault detection and fault diagnosis. In the first part, the vibration features in the time and frequency domains are extracted. Secondly, in the fault detection, the presence of fault is verified in an unsupervised manner based on anomaly detection algorithms. The modularity of the methodology allows different algorithms to be implemented. Finally, in fault diagnosis, Shapley Additive Explanations (SHAP), a technique to interpret black-box models, is used. Through the feature importance ranking obtained by the model explainability, the fault diagnosis is performed. Two tools for diagnosis are proposed, namely: unsupervised classification and root cause analysis. The effectiveness of the proposed approach is shown on three datasets containing different mechanical faults in rotating machinery. The study also presents a comparison between models used in machine learning explainability: SHAP and Local Depth-based Feature Importance for the Isolation Forest (Local- DIFFI). Lastly, an analysis of several state-of-art anomaly detection algorithms in rotating machinery is included.

Learning useful representations of complex data has been the subject of extensive research for many years. With the diffusion of Deep Neural Networks, Variational Autoencoders have gained lots of attention since they provide an explicit model of the data distribution based on an encoder/decoder architecture which is able to both generate images and encode them in a low-dimensional subspace. However, the latent space is not easily interpretable and the generation capabilities show some limitations since images typically look blurry and lack details. In this paper, we propose the Introspective Variational Classifier (IntroVAC), a model that learns interpretable latent subspaces by exploiting information from an additional label and provides improved image quality thanks to an adversarial training strategy.We show that IntroVAC is able to learn meaningful directions in the latent space enabling fine-grained manipulation of image attributes. We validate our approach on the CelebA dataset.

LEarning TO Rank (LETOR) algorithms are usually trained on annotated corpora where a single relevance label is assigned to each available document-topic pair. Within the Cranfield framework, relevance labels result from merging either multiple expertly curated or crowdsourced human assessments. In this paper, we explore how to train LETOR models with relevance judgments distributions (either real or synthetically generated) assigned to document-topic pairs instead of single-valued relevance labels. We propose five new probabilistic loss functions to deal with the higher expressive power provided by relevance judgments distributions and show how they can be applied both to neural and gradient boosting machine (GBM) architectures. Moreover, we show how training a LETOR model on a sampled version of the relevance judgments from certain probability distributions can improve its performance when relying either on traditional or probabilistic loss functions. Finally, we validate our hypothesis on real-world crowdsourced relevance judgments distributions. Overall, we observe that relying on relevance judgments distributions to train different LETOR models can boost their performance and even outperform strong baselines such as LambdaMART on several test collections.

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 electronic driver duty cycle 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 multiobjective tradeoff between disturbance attenuation and transient response. The proposed control strategy is tested on an industrial device. The experiments show that it can effectively meet the requirements in terms of robustness, load disturbance rejection, and tracking performance.

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.

The diffusion of the Industry 4.0 paradigm lead to the creation and collection of huge manufacturing datasets; such datasets contain for example measurements coming from physical sensors located in different equipment or even in different productive manufacturing organizations. Such large and heterogeneous datasets represent a challenge when aiming for developing data-driven approaches like Anomaly Detection or Predictive Maintenance. In this work we present a new approach for performing Anomaly Detection that is able to handle heterogeneous data coming from different equipment, work centers or production sites.

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

Recent results show that features of adversarially trained networks for classification, in addition to being robust, enable desirable properties such as invertibility. The latter property may seem counter-intuitive as it is widely accepted by the community that classification models should only capture the minimal information (features) required for the task. Motivated by this discrepancy, we investigate the dual relationship between Adversarial Training and Information Theory. We show that the Adversarial Training can improve linear transferability to new tasks, from which arises a new trade-off between transferability of representations and accuracy on the source task. We validate our results employing robust networks trained on CIFAR-10, CIFAR-100 and ImageNet on several datasets. Moreover, we show that Adversarial Training reduces Fisher information of representations about the input and of the weights about the task, and we provide a theoretical argument which explains the invertibility of deterministic networks without violating the principle of minimality. Finally, we leverage our theoretical insights to remarkably improve the quality of reconstructed images through inversion.

In this work we focus on the problem of minimizing the sum of convex cost functions in a distributed fashion over a peer-to-peer network. In particular, we are interested in the case in which communications between nodes are prone to failures and the agents are not synchronized among themselves. We address the problem proposing a modified version of the relaxed ADMM, which corresponds to the Peaceman-Rachford splitting method applied to the dual. By exploiting results from operator theory, we are able to prove the almost sure convergence of the proposed algorithm under general assumptions on the distribution of communication loss and node activation events. By further assuming the cost functions to be strongly convex, we prove the linear convergence of the algorithm in mean square in a neighborhood of the optimal solution, and provide an upper bound to the convergence rate. Finally, we present numerical results testing the proposed method in different scenarios.

The potentialities of In-Orbit Servicing (IOS) to extend the operational life of satellites and the need to implement Active Debris Removal (ADR) to effectively tackle the space debris problem are well known among the space community. Research on technical solutions to enable this class of missions is thriving, also pushed by the development of new generation sensors and control systems. Among private companies, space agencies and universities, the European Space Agency (ESA) has been developing technologies in this field for decades. Several solutions have been proposed over the years to safely capture orbital objects, the majority relying on robotic systems. A promising option is the employment of an autonomous spacecraft (chaser) equipped with a highly dexterous robotic arm able to perform the berthing with a resident space object. This operation poses complex technical challenges both during the approach phase and after contact. In this respect, the design of an effective, reliable, and robust Guidance, Navigation and Control (GNC) system, for which several algorithmic architectures and hardware configurations are possible, plays a key role to ensure safe mission execution. This work presents the outcomes of a research activity performed by a consortium of universities under contract with ESA with the goal to develop the navigation and control subsystems of a GNC system for controlling a chaser equipped with a redundant manipulator. Both the final approach until capture and the target stabilization phase after capture are considered in the study. The proposed solution aims at the implementation of a combined control strategy. Robust control methods are adopted to design control laws for the uncertain, nonlinear dynamics of the chaser and of the complete chaser–target stack after capture. Visual–based solutions, i.e., relying on active/passive electro– optical sensors, are selected for relative navigation. A complete sensor suite for relative and absolute navigation is part of the GNC system, including transducers for robot joint measurements. To properly validate the proposed solutions, a complete numerical simulator has been developed. This software tool allows to thoroughly assess the system performance, accounting for all the relevant external disturbances and error sources. A realistic synthetic image generator is also used for relative navigation performance assessment. This paper presents the design solutions and the results of preliminary numerical testing, considering three mission scenarios to prove the flexibility of the solution and its applicability to a wide range of operational cases.

Deep Learning approaches have revolutionized in the past decade the field of Computer Vision and, as a consequence, they are having a major impact in Industry 4.0 applications like automatic defect classification. Nevertheless, additional data, beside the image/video itself, is typically never exploited in a defect classification module: this aspect, given the abundance of data in data-intensive manufacturing environments (like semiconductor manufacturing) represents a missed opportunity. In this work we present a use case related to Scanning Electron Microscope (SEM) images where we exploit a  Bayesian approach to improve defect classification. We validate our approach on a real-world case study and by employing modern Deep Learning architectures for classification.

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.

Visual inspection has recently gained increasing importance in the manufacturing industry and is often addressed by means of learning methodologies applied to data obtained from specific lighting and camera system setups. The industrial scenario becomes particularly challenging when the inspection regards reflective objects, which may affect both the data acquisition and the classification decision process, thus limiting the overall performance. In this context, we observe that the dynamics of the reflected light is the key aspect to characterize these surfaces and needs to be accurately exploited to improve the performances of the learning algorithms. To this aim, we propose a combined model-based and data-driven approach designed to detect defects on the reflective surfaces of industrial products, captured as video sequences under coaxial structured illumination. Specifically, a tunable spatial-temporal descriptor of the evolution of the reflected light (Dynamic Evolution of the Light, DEL) is designed and employed within a Hybrid Learning (HL) framework, where the learning process of a Convolutional Neural Network (CNN) is driven by the model-based descriptor. This approach is also extended by adopting the similar in nature descriptor Dynamic Image. The proposed HL solutions are validated against a whole spectrum of state-of-the-art learning procedures and different descriptors. Experiments run on a dataset coming from an actual industrial scenario confirm the ability of DEL to accurately characterize reflective surfaces and the validity of the HL method, which shows remarkably better performance in fault detection even with respect to modern 3D- CNNs with comparable computational effort.

Particle accelerators are complex systems composed of multiple subsystems that must work together to produce high quality beams employed for physics experiments. A fault or an anomalous behaviour in one of such subsystems can lead to expensive downtime for the whole facility. Thus, it is of paramount importance to be able to promptly detect anomalies.Given the vast amount of streaming data generated by accelerator field sensors, Machine Learning (ML)-based tools are promising candidates for efficient monitoring of such systems: an approach based on unsupervised ML techniques exploiting the data from a Radio Frequency tuning system is here proposed. Feature importance is exploited to guide the definition of the optimal windowing for feature extraction. The proposed approach is here validated on real-world data related to the ALPI accelerator at Legnaro National Laboratories in Italy.

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.

The functional architecture of the resting brain, as measured with the blood oxygenation level-dependent functional connectivity (BOLD-FC), is slightly modified during task performance. In previous work, we reported behaviorally relevant BOLD-FC modulations between visual and dorsal attention regions when subjects performed a visuospatial attention task as compared to central fixation (Spadone et al., 2015).

Here we use magnetoencephalography (MEG) in the same group of subjects to identify the electrophysiological correlates of the BOLD-FC modulation found in our previous work. While BOLD-FC topography, separately at rest and during visual attention, corresponded to neuromagnetic Band-Limited Power (BLP) correlation in the alpha and beta bands (8-30 Hz), BOLD-FC modulations evoked by performing the visual attention task (Spadone et al. 2015) did not match any specific oscillatory band BLP modulation. Conversely, following the application of an orthogonal spatial decomposition that identifies common inter-subject co-variations, we found that attention–rest BOLD-FC modulations were recapitulated by multi-spectral BLP-FC components. Notably, individual variability of alpha connectivity between Frontal Eye Fields and visual occipital regions, jointly with decreased interaction in the Visual network, correlated with visual discrimination accuracy. In summary, task-rest BOLD connectivity modulations match multi-spectral MEG BLP connectivity.

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.

Active Search and Tracking for search and rescue missions or collaborative mobile robotics relies on the actuation of a sensing platform to detect and localize a target. In this paper we focus on visually detecting a radio-emitting target with an aerial robot equipped with a radio receiver and a camera. Visual-based tracking provides high accuracy, but the directionality of the sensing domain often requires long search times before detecting the target. Conversely,radio signals have larger coverage, but lower tracking accuracy. Thus, we design a Recursive Bayesian Estimation scheme that uses camera observations to refine radio measurements. To regulate the camera pose, we design an optimal controller whose cost function is built upon a probabilistic map. Theoretical results support the proposed algorithm, while numerical analyses show higher robustness and efficiency with respect to visual and radio-only baselines.

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.

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.

In the world of autonomous driving high resolution maps play a fundamental role. Such maps are highly accurate representations of the environment and are essential for all the algorithms of strategy and path planning operations.

Unfortunately it is not always possible to guarantee the total reliability of these maps and therefore it is necessary to introduce a system for its validation. In this paper we introduce a framework for validating map data at run-time based on probabilistic graphical models. Results from simulations show the capabilities of the proposed approach and highlight the need to find an appropriate balance between model accuracy and complexity.

The advent of the Industrial Internet of Things (IIoT) has led to the availability of huge amounts of data, that can be used to train advanced Machine Learning algorithms to perform tasks such as Anomaly Detection, Fault Classification and Predictive Maintenance. Even though not all pieces of equipment are equipped with sensors yet, usually most of them are already capable of logging warnings and alarms occurring during operation. Turning this data, which is easy to collect, into meaningful information about the health state of machinery can have a disruptive impact on the improvement of efficiency and up-time. The provided dataset consists of a sequence of alarms logged by packaging equipment in an industrial environment. The collection includes data logged by 20 machines, deployed in different plants around the world, from 2019-02-21 to 2020-06-17. There are 154 distinct alarm codes, whose distribution is highly unbalanced. This data can be used to address the following tasks: 

1. Next alarm forecasting: this problem can be framed as a supervised multi-class classification task, or a binary classification task when a specific alarm code is considered.
2. Predicting alarms occurring in a future time frame: here the goal is to forecast the occurrence of certain alarm types in a future time window. Since many alarms can occur, this is a supervised multi-label classification.
3. Future alarm sequence prediction: here the goal is predicting an ordered sequence of future alarms, in a sequence-to-sequence forecasting scenario.
4. Anomaly Detection: the task is to detect abnormal equipment conditions, based on the pattern of alarms sequence. This task can be either unsupervised, if only the input sequence is considered, or supervised if future alarms are taken into account to assess whether or not there is an anomaly.

 All of the above tasks can also be studied from a continual learning perspective. Indeed, information about the serial code of the specific piece of equipment can be used to train the model; however, a scalable model should also be easy to apply to new machines, without the need of a new training from scratch. The collection and release of this dataset has been supported by the Regione Veneto project PreMANI (MANIFATTURA PREDITTIVA: progettazione, sviluppo e implementazione di soluzioni di Digital Manufacturing per la previsione della Qualita e la Manutenzione Intelligente - PREDICTIVE MAINTENANCE: design, development and implementation of Digital Manufacturing solutions for the intelligent quality and maintenance systems).

The Industrial IoT (IIoT) paradigm represents an attractive opportunity for new generation measurement applications, which are increasingly based on efficient and reliable communication systems to allow the extensive availability of continuous data from instruments and/or sensors, thus enabling real-time measurement analysis. Nevertheless, different communication systems and heterogeneous sensors and acquisition systems may be found in an IIoT-enabled measurement application, so that solutions need to be defined to tackle the issue of seamless, effective, and low-latency interoperability. A significant and appropriate solution is the Open Platform Communications (OPC) Unified Architecture (UA) protocol, thanks to its object–oriented structure that allows a complete contextualization of the information. The intrinsic complexity of OPC UA, however, imposes a meaningful performance assessment to evaluate its suitability in the aforementioned context. To this aim, this paper presents the design of a general yet accurate and reproducible measurement setup that will be exploited to assess the performance of the main open source implementations of OPC UA. The final goal of this work is to provide a characterization of the impact of this protocol stack in an IIoT-enabled Measurement System, in particular in terms of both the latency introduced in the measurement process and the power consumption.

The last decade has seen tremendous improvements in technologies for Type 1 Diabetes (T1D) management, in particular the so-called artificial pancreas (AP), a wearable closed-loop device modulating insulin injection based on glucose sensor readings. Unluckily, the AP actuator, an insulin pump, is subject to failures, with potentially serious consequences for subject safety. This calls for the development of advanced monitoring systems, leveraging the unprecedented data availability. This paper tackles for the first time the problem of automatically detecting pump faults with multidimensional data-driven anomaly detection (AD) methodologies. The approach allows to avoid the subtask of identifying a physiological model, typical of model-based approaches. Furthermore, we employ unsupervised methods, removing the need of labeled data for training, hardly available in practice. The adopted data-driven AD methods are local outlier factor, connectivity-based outlier factor, and isolation forest. Moreover, we propose a modification of these methods to cope with the dynamic nature of the underlying problem. The algorithms were tuned and tested on: 1) two-synthetic 100-patients' data set, of one-month data each, generated using the ``UVA/Padova T1D Simulator,'' a large-scale nonlinear computer simulator of T1D subject physiology, largely adopted in AP research and accepted by the American Food and Drug Administration as a replacement of preclinical animal trials for AP and 2) a real 7-patients' data set consisting of one month in free-living conditions. The satisfactory accuracy of the proposed approach paves the way to the embedding of these methodologies in AP systems or their deployment in remote monitoring systems.

Cooperative robotics is a trending topic nowadays as it makes possible a number of tasks that cannot be performed by individual robots, such as heavy payload transportation and agile manipulation. In this work, we address the problem of cooperative transportation by heterogeneous, manipulatorendowed robots. Specifically, we consider a generic number of robotic agents simultaneously grasping an object, which is to be transported to a prescribed set point while avoiding obstacles. The procedure is based on a decentralized leader-follower Model Predictive Control scheme, where a designated leader agent is responsible for generating a trajectory compatible with its dynamics, and the followers must compute a trajectory for their own manipulators that aims at minimizing the internal forces and torques that might be applied to the object by the different grippers. The Model Predictive Control approach appears to be well suited to solve such a problem, because it provides both a control law and a technique to generate trajectories, which can be shared among the agents. The proposed algorithm is implemented using a system comprised of a ground and an aerial robot, both in the robotic Gazebo simulator as well as in experiments with real robots, where the methodological approach is assessed and the controller design is shown to be effective for the cooperative transportation task.

In many real-world applications of Machine Learning it is of paramount importance not only to provide accurate predictions, but also to ensure certain levels of robustness. Adversarial Training is a training procedure aiming at providing models that are robust to worst-case perturbations around predefined points. Unfortunately, one of the main issues in adversarial training is that robustness w.r.t. gradient-based attackers is always achieved at the cost of prediction accuracy. In this paper, a new algorithm, called Wasserstein Projected Gradient Descent (WPGD), for adversarial training is proposed. WPGD provides a simple way to obtain cost-sensitive robustness, resulting in a finer control of the robustness-accuracy trade-off. Moreover, WPGD solves an optimal transport problem on the output space of the network and it can efficiently discover directions where robustness is required, allowing to control the directional trade-off between accuracy and robustness. The proposed WPGD is validated in this work on image recognition tasks with different benchmark datasets and architectures. Moreover, real world-like datasets are often unbalanced: this paper shows that when dealing with such type of datasets, the performance of adversarial training are mainly affected in term of standard accuracy.

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.

One of the main challenges in developing Machine Learning-based solutions for Semiconductor Manu-facturing is the high number of machines in the production and their differences, even when consideringchambers of the same machine; this poses a challenge in the scalability of Machine Learning-based so-lutions in this context, since the development of chamber-specific models for all equipment in the fab isunsustainable. In this work, we present a domain adaptation approach for Virtual Metrology (VM), one ofthe most successful Machine Learning-based technology in this context. The approach provides a commonVM model for two identical-in-design chambers whose data follow different distributions. The approach isbased on Domain-Adversarial Neural Networks and it has the merit of exploiting raw trace data, avoidingthe loss of information that typically affects VM modules based on features. The effectiveness of theapproach is demonstrated on real-world Etching.

Search Engines (SE) have been shown to perpetuate well-known gender stereotypes identified in psychology literature and to influence users accordingly. Similar biases were found encoded in Word Embeddings (WEs) learned from large online corpora. In this context, we propose the Gender Stereotype Reinforcement (GSR) measure, which quantifies the tendency of a SE to support gender stereotypes, leveraging gender-related information encoded in WEs.

Through the critical lens of construct validity, we validate the proposed measure on synthetic and real collections. Subsequently, we use GSR to compare widely-used Information Retrieval ranking algorithms, including lexical, semantic, and neural models. We check if and how ranking algorithms based on WEs inherit the biases of the underlying embeddings. We also consider the most common debiasing approaches for WEs proposed in the literature and test their impact in terms of GSR and common performance measures. To the best of our knowledge, GSR is the first specifically tailored measure for IR, capable of quantifying representational harms.

This paper presents an innovative mechatronic design of a high-accuracy pointing mechanism for orbital laser communication terminals. The system is based on a dual-stage architecture and is miniaturized to fit nanosatellite-class spacecraft, aiming to enable optical communication on small-size space platforms. The focus is on control design aspects and on the performance assessment of an experimental prototype under emulated external environmental disturbances.

To increase the classification, the rate of prediction based on existing models requires additional technique or in this case optimizing the model. Hyperparameter tuning is an optimization technique that evaluates and adjusts the free parameters that define the behaviour of classifiers. Data sets were classified practical with classifiers like SVM, k-NN, ANN and DA. To further improve the design efficiency, the secondary optimization level called hyperparameter tuning will be further investigated. DA, SVM, k-NN, decision tree (Tree), logistic regression (LR), random forest tree (RF) and neural network (NN) are evaluated. The k-NN provided 96.47% of the test sets with the best reliability in classifications. Bayesian optimization has been used to refine the hyperparameter; hence, standardize Euclidean distance metric with a k value of one is the ideal hyperparameters which could achieve classification performance of 97.16%.

This chapter demonstrates the pipeline from data collection until classifier models that achieve the best possible model in identifying the disparity between hunger states. The pre-processing segment describes the features of the data sets obtained by means of image processing. The method includes the simple moving average (SMA), downsizing factors, dynamic time warping (DTW) and clustering by the k-means method. This is to rationally assign the necessary significant information from the data collected and processed the images captured for demand feeder and fish motion as a synthesis for anticipating the state of fish starvation. The selection of features in this study takes place via the boxplot analysis and the principal component analysis (PCA) on dimensionality reduction. Finally, the validation of the hunger state will be addressed by comparing machine learning (ML) classifiers, namely the discriminant analysis (DA), support vector machine (SVM) and k-nearest neighbour (k-NN). The outcome in this chapter will validate the features from image processing as a tool for identifying the behavioural changes of the fish in school size.

Machine Learning-based Anomaly Detection (AD) approaches are efficient tools to monitor complexprocesses. One of the advantages of such approaches is that they provide a unique anomaly indicator,a quantitative index that captures the degree of ’outlierness’ of the process at hand considering possiblyhundreds or more variables at the same time, the typical scenario in semiconductor manufacturing. Oneof the drawback of such approaches is that Root Cause Analysis is not guided by the system itself. Inthis work, we show the effectiveness of a method, called DIFFI, to equip Isolation Forest, one of themost popular AD algorithms, with interpretability traits that can help corrective actions and knowledgeunderstanding. Such approach is validated on real world semiconductor manufacturing data related to aChemical Vapor Deposition process.

This book highlights the fundamental association between aquaculture and engineering in classifying fish hunger behaviour by means of machine learning techniques. Understanding the underlying factors that affect fish growth is essential, since they have implications for higher productivity in fish farms. Computer vision and machine learning techniques make it possible to quantify the subjective perception of hunger behaviour and so allow food to be provided as necessary. The book analyses the conceptual framework of motion tracking, feeding schedule and prediction classifiers in order to classify the hunger state, and proposes a system comprising an automated feeder system, image-processing module, as well as machine learning classifiers. Furthermore, the system substitutes conventional, complex modelling techniques with a robust, artificial intelligence approach. The findings presented are of interest to researchers, fish farmers, and aquaculture technologist wanting to gain insights into the productivity of fish and fish behaviour.

This chapter highlights the findings of the developmental monitoring systems for swimming pattern or motion analysis with regard to feeding behaviour. A benchmark for examining the framework on how scientists control fish in animal variable function factors was gathered and referred to gauge the adequate design in constructing a viable device. The validation of image processing and automated demand feeder to determine the results will also be considered, as a validation aspect between the system of tracking and the behaviour of the Lates calcarifer where the pixel intensity will be extracted as the features. The results of this chapter will enable the reader on the development of an integrated feeder scheme that consolidates surveillance scheme to identify the feeding behaviour and relation towards the specific growth rate (SGR).

Solutions for the quality control of metallic surfaces are proposed. Specifically, we study a deflectometric apparatus based on coaxial structured light and the related algorithmic procedure, which is able to detect the faulty surface of a sample captured by a video sequence. First, by considering the metallic surface a dynamic scene illuminated under different light conditions, we develop the descriptor residuals of linear evolution of light (RLEL) that extracts the defectiveness information starting from the movement of the object without explicitly considering the physical characteristics of the light structure. Then, leveraging on RLEL, we present a hybrid learning (HL) technique capable of overcoming the data-driven approach used in classic deep learning (DL). By exploiting a multisteps training process, we combine the model-based descriptor RLEL and a classical data-driven convolutional neural network (CNN) to obtain an unconventional gray-box CNN, which exceeds the performance of popular DL solutions such as 3-D-inception and 3-D-residual DL networks. Remarkably, HL also shows its validity in comparing the performance of the same network structures trained not in a hybrid way, namely without the injection of the model-based information given by RLEL.

We study the solution of a time-varying optimization problem which is observed, that is, it is known, only intermittently. We propose three approaches based on the prediction-correction scheme for solving this problem by exploiting splitting methods. We present convergence results in mean to a bounded asymptotical error, and showcase them in a numerical example featuring a regression problem.

Measuring systems are becoming increasingly sophisticated in order to tackle the challenges of modern industrial problems. In particular, the Multiphase Flow Meter (MPFM) combines different sensors and data fusion techniques to estimate quantities that are difficult to be measured like the water or gas content of a multiphase flow, coming from an oil well. The evaluation of the flow composition is essential for the well productivity prediction and management, and for this reason, the quantification of the meter measurement quality is crucial. While instrument complexity is increasing, demands for confidence levels in the provided measures are becoming increasingly more common. In this work, we propose an Anomaly Detection approach, based on unsupervised Machine Learning algorithms, that enables the metrology system to detect outliers and to provide a statistical level of confidence in the measures. The proposed approach, called AD4MPFM (Anomaly Detection for Multiphase Flow Meters), is designed for embedded implementation and for multivariate time-series data streams. The approach is validated both on real and synthetic data.

In knowledge-based systems, besides obtaining good output prediction accuracy, it is crucial to understand the subset of input variables that have most influence on the output, with the goal of gaining deeper insight into the underlying process. These requirements call for logistic model estimation techniques that provide a sparse solution, i.e., where coefficients associated with non-important variables are set to zero. In this work we compare the performance of two methods: the first one is based on the well known Least Absolute Shrinkage and Selection Operator (LASSO) which involves regularization with an ?1 norm; the second one is the Relevance Vector Machine (RVM) which is based on a Bayesian implementation of the linear logistic model. The two methods are extensively compared in this paper, on real and simulated datasets. Results show that, in general, the two approaches are comparable in terms of prediction performance. RVM outperforms the LASSO both in term of structure recovery (estimation of the correct non-zero model coefficients) and prediction accuracy when the dimensionality of the data tends to increase. However, LASSO shows comparable performance to RVM when the dimensionality of the data is much higher than number of samples that is p>>n 

The identification of relevant parameters that could describe the state of fish hunger is vital for ensuring the appropriate allocation of food to the fish. The establishment of these relevant parameters is non-trivial, particularly when developing an automated demand feeder system. The present inquiry is being undertaken to determine the hunger state of Lates calcarifer. For data collection, a video analysis system is used, and the video was taken all day, where the fish was fed by an automatic feeding system. Sixteen characteristics of the raw data set have been extracted through feature engineering for 0.5 min, 1.0 min, 1.5 min and 2.0 min, respectively, in accordance with the mean, peak, minimum and variability of each of the different time window scales. Furthermore, the features extracted have been evaluated through principal component analysis (PCA) both for dimension reduction and PCA with varimax rotation. The details were then categorized using support vector machine (SVM), K-NN and random forest tree (RF) classifiers. The best identification accuracy was shown with eight described features in the varimax-based PCA. The forecast results based on the K-NN model built on selected data characteristics showed a level of 96.5% indicating that the characteristics analysed were crucial to classifying the actions of hunger among fisheries.

The number of applications involving unmanned aerial vehicles (UAVs) grew dramatically during the last decade. Despite such incredible success, the use of drones is still quite limited in GNSS denied environment: indeed, the availability of a reliable GNSS estimates of the drone position is still fundamental in order to enable most of the UAV applications. Given such motivations, in this paper an alternative positioning system for UAVs, based on low cost ultra-wideband band (UWB) is considered. More specifically, this work aims at assessing the positioning accuracy of UWB-based positioning thanks to the comparison with positions provided by a motion capture (MoCap) system. Since the MoCap accuracy is much higher than that of the UWB system, it can be safely used as a reference trajectory for the validation of UWB estimates. In the considered experiment the UWB system allowed to obtain a root mean square error of 39.4?cm in 3D positioning based on the use of an adaptive extended Kalman filter, where the measurement noise covariance was adaptively estimated.

We propose a non-linear model predictive scheme for planning fuel efficient maneuvers of small spacecrafts that shall rendezvous space debris. The paper addresses the specific issues of potential limited on-board computational capabilities and low-thrust actuators in the chasing spacecraft, and solves them by using a novel MatLab-based toolbox for real-time non-linear model predictive control (MPC) called MATMPC. This tool computes the MPC rendezvous maneuvering solution in a numerically efficient way, and this allows to greatly extend the prediction horizon length. This implies that the overall MPC scheme can compute solutions that account for the long time-scales that usually characterize the low-thrust rendezvous maneuvers. The so-developed controller is then tested in a realistic scenario that includes all the near-Earth environmental disturbances. We thus show, through numerical simulations, that this MPC method can successfully be used to perform a fuel-efficient rendezvous maneuver with an uncontrolled object, plus evaluate performance indexes such as mission duration, fuel consumption, and robustness against sensor and process noises.

We propose a Deep Learning (DL)-based approach for production performance forecasting in fresh products packaging. On the one hand, this is a very demanding scenario where high throughput is mandatory; on the other, due to strict hygiene requirements, unexpected downtime caused by packaging machines can lead to huge product waste. Thus, our aim is predicting future values of key performance indexes such as Machine Mechanical Efficiency (MME) and Overall Equipment Effectiveness (OEE). We address this problem by leveraging DL-based approaches and historical production performance data related to measurements, warnings and alarms. Different architectures and prediction horizons are analyzed and compared to identify the most robust and effective solutions. We provide experimental results on a real industrial case, showing advantages with respect to current policies implemented by the industrial partner both in terms of forecasting accuracy and maintenance costs. The proposed architecture is shown to be effective on a real case study and it enables the development of predictive services in the area of Predictive Maintenance and Quality Monitoring for packaging equipment providers.

In modern manufacturing scenarios, detecting anomalies in production systems is pivotal to keep high-quality standards and reduce costs. Even in the Industry 4.0 context, realworld monitoring systems are often simple and based on the use of multiple univariate control charts. Data-driven technologies offer a whole range of tools to perform multivariate data analysis that allow to implement more effective monitoring procedures. However, when dealing with complex data, common data-driven methods cannot be directly used, and a feature extraction phase must be employed. Feature extraction is a particularly critical operation, especially in anomaly detection tasks, and it is generally associated with information loss and low scalability. In this paper we consider the task of Anomaly Detection with twodimensional, image-like input data, by adopting a Deep Learningbased monitoring procedure, that makes use of convolutional autoencoders. The procedure is tested on real Optical Emission Spectroscopy data, typical of semiconductor manufacturing. The results show that the proposed approach outperforms classical feature extraction procedures.

Gesture Recognition has a prominent importance in smart environment and home automation. Thanks to the availability of Machine Learning approaches it is possible for users to define gestures that can be associated with commands for the smart environment. In this paper we propose a Random Forest-based approach for Gesture Recognition of hand movements starting from wireless wearable motion capture data. In the presented approach, we evaluate different feature extraction procedures to handle gestures and data with different duration. To enhance reproducibility of our results and to foster research in the Gesture Recognition area, we share the dataset that we have collected and exploited for the present work.

With the rise of Industry 4.0 and of the Industrial Internet, the computing and communication infrastructures achieved an essential role within process and factory automation, and cyberphysical systems in general. In this scenario, the OPC UA standard is currently becoming a widespread opportunity to enable interoperability among heterogeneous industrial systems. Nonetheless, OPC UA is characterized by a complex protocol architecture, that may impair the scalability of applications and may represent a bottleneck for its effective implementation in resource-constrained devices, such as low-cost industrial embedded systems. Several different OPC UA implementations are available, which in some significant cases are released under an open source license. In this context, the aim of this paper is to provide an assessment of the performance provided by some of these different OPC UA implementations, focusing specifically on potential development and resource bottlenecks. The analysis is carried out through an extensive experimental campaign explicitly targeting general purpose low-cost embedded systems. The final goal is to provide a comprehensive performance comparisons to allow devising some useful practical guidelines.

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.

Two methods based on Regression are presented to determine the moisture content of items, e.g. clothes and the like, which are introduced in a household laundry dryer appliance. The aim of this work is to develop Soft Sensors (SS) for a household Heat Pump Washer-Dryer (WD-HP) to provide an estimation of the desired signal (the laundry moisture during drying) avoiding the use of additional physical sensors with the goal of improving the current performance in terms of precision and energy consumption of the automatic drying cycle end and using the machine equipment already available. On an algorithmic point of view, the SS developed in this work exploits regularization methods and Genetic Programming for Symbolic Regression in order to find suitable models for the purpose at hand. Proposed approaches have been tested on real data provided by an industrial partner.

Industry 4.0 encapsulates methods, technologies, and procedures that transform data into informed decisions and added value inan industrial context. In this regard, technologies such as Virtual Metrology or Soft Sensing have gained much interest in thelast two decades due to their ability to provide valuable knowledge for production purposes at limited added expense. However,these technologies have struggled to achieve wide-scale industrial adoption, largely due to the challenges associated with handlingcomplex data structures and the feature extraction phase of model building. This phase is generally hand-engineered and basedon specific domain knowledge, making it time consuming, difficult to automate, and prone to loss of information, thus ultimatelylimiting portability. Moreover, in the presence of complex data structures, such as 2-dimensional input data, there are no establishedprocedures for feature extraction. In this paper, we present a Deep Learning approach for Virtual Metrology, called DeepVM,that exploits semi-supervised feature extraction based on Convolutional Autoencoders. The proposed approach is demonstratedusing a real world semiconductor manufacturing dataset where the Virtual Metrology input data is 2-dimensional Optical EmissionSpectrometry data. The feature extraction method is tested with different types of state-of-the-art autoencoder.

In the past recent years, Machine Learning methodologies have been applied in countless application areas. In particular, they play a key role in enabling Industry4.0. However, one of the main obstacles to the diffusion of Machine Learning-based applications is related to the lack of interpretability of most of these methods. In this work, we propose an approach for defining a ‘feature importance’ in Anomaly Detection problems. Anomaly Detection is an important Machine Learning task that has an enormous applicability in industrial scenarios. Indeed, it is extremely relevant for the purpose of quality monitoring. Moreover, it is often the first step towards the design of a Machine Learning based smart monitoring solutions because Anomaly Detection can be implemented without the need of labelled data. The proposed feature importance evaluation approach is designed for Isolation Forest, one of the most commonly used algorithm for Anomaly Detection. The efficacy of the proposed method is tested on synthetic and real industrial datasets.

In an automated demand feeder system, underlining the parameters that contribute to fish hunger is crucial in order to facilitate an optimised food allocation to the fish. The present investigation is carried out to classify the hunger state of Lates calcarifer. A video surveillance technique is employed for data collection. The video was taken throughout the daytime, and the fish were fed through an automated feeding system. It was demonstrated through this investigation that the use of such automated system does contribute towards a higher specific growth rate percentage of body weight as well as the total length by approximately 26.00% and 15.00%, respectively against the conventional time-based method. Sixteen features were feature engineered from the raw dataset into window sizes ranging from 0.5?min, 1.0?min, 1.5?min and 2.0?min, respectively coupled with the mean, maximum, minimum and variance for each of the distinctive temporal window sizes. In addition, the extracted features were analysed through Principal Component Analysis (PCA) for dimensionality reduction as well as PCA with varimax rotation. The data were then classified using a Support Vector Machine (SVM), k-Nearest Neighbor (k-NN) and Random Forest Tree models. It was demonstrated that the varimax based PCA yielded the highest classification accuracy with eight identified features. The prediction results based of the developed k-NN model on the selected features on the test data exhibited a classification rate of 96.5% was achieved suggesting that the features examined are non-trivial in classifying the fish hunger behaviour.

Embedding household appliances with smart capabilities is becoming common practice among major fabric-care producers that seek competitiveness on the market by providing more efficient and easy-to-use products. In Vertical Axis Washing Machines (VA-WM), knowing the laundry composition is fundamental to setting the washing cycle properly with positive impact both on energy/water consumption and on washing performance. An indication of the load typology composition (cotton, silk, etc.) is typically provided by the user through a physical selector that, unfortunately, is often placed by the user on the most general setting due to the discomfort of manually changing configurations. An automated mechanism to determine such key information would thus provide increased user experience, better washing performance, and reduced consumption; for this reason, we present here a data-driven soft sensor that exploits physical measurements already available on board a commercial VA-WM to provide an estimate of the load typology through a machine-learning-based statistical model of the process. The proposed method is able to work in a resource-constrained environment such as the firmware of a VA-WM.

The aim is to develop soft sensors (SSs) to provide an estimation of the laundry moisture of clothes introduced in a household Heat Pump Washer–Dryer (WD-HP) appliance. The developed SS represents a cost-effective alternative to physical sensors, and it aims at improving the WD-HP performance in terms of drying process efficiency of the automatic drying cycle. To this end, we make use of appropriate Machine Learning models, which are derived by means of Regularization and Symbolic Regression methods. These methods connect easy-to-measure variables with the laundry moisture content, which is a difficult and costly to measure variable. Thanks to the use of SSs, the laundry moisture estimation during the drying process is effectively available. The proposed models have been tested by exploiting real data through an experimental test campaign on household drying machines.

With this work we report on the design, development and testing of near UV LED-based systems for oxygen gas sensing. The design and developed system is an optoelectronic setup based on 405 nm LEDs which excites and measures the photoluminescence emitted from a porphyrin based luminophor. By means of an accurate optical and optoelectronic setup, the system is able to operate without the need of avalanche photodiodes, thus resulting in a compact and low energy structure. The optical setup is specifically designed to maximize both the LED light exciting the luminophor and converted light acquired from the sensor.

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.

We present an algorithm for minimizing the sum of a strongly convex time-varying function with a time-invariant, convex, and nonsmooth function.
The proposed algorithm employs the prediction-correction scheme alongside the forward-backward envelope, and we are able to prove the convergence of the solutions to a neighborhood of the optimizer that depends on the sampling time.
Numerical simulations for a time-varying regression problem with elastic net regularization highlight the effectiveness of the algorithm.

We address the solution of time-varying optimization problems characterized by the sum of a time-varying strongly convex function and a time-invariant nonsmooth convex function.
We design an algorithmic framework based on a prediction-correction scheme, which employs splitting methods to solve the sampled instances of the time-varying problem.
We describe the prediction-correction scheme and two splitting methods, the forward-backward and the Douglas-Rachford. Then by using a novel result for generalized equations, we prove convergence of the generated sequence of approximate optimizers to a neighborhood of the optimal solution trajectory. Simulation results for a leader following formation in robotics assess the performance of the proposed algorithm.

In this study, the solution of a convex distributed optimisation problem with a global coupling inequality constraint is considered. By using the Lagrange duality framework, the problem is transformed into a distributed consensus optimisation problem and then based on the recently proposed Hybrid Alternating Direction Method of Multipliers (H-ADMM), which merges distributed and centralised optimisation concepts problems, a novel distributed algorithm is developed. In particular, the authors offer a reformulation of the original H-ADMM in an operator theoretical framework, which exploits the known relationship between ADMM and Douglas–Rachford splitting. In addition, the authors' formulation allows us to generalise the H-ADMM by including a relaxation constant, not present in the original design of the algorithm. Moreover, an adaptive penalty parameter selection scheme that consistently improves the practical convergence properties of the algorithm is proposed. Finally, the convergence results of the proposed algorithm are discussed and moreover, in order to present the effectiveness and the major capabilities of the proposed algorithm in off-line and on-line scenarios, distributed quadratic programming and distributed model predictive control problems are considered in the simulation section.

In this paper we present a novel algorithm to solve the robot kinematic structure identification problem. Given a time series of data, typically obtained processing a set of visual observations, the proposed approach identifies the ordered sequence of links associated to the kinematic chain, the joint type interconnecting each couple of consecutive links, and the input signal influencing the relative motion. Compared to the state of the art, the proposed algorithm has reduced computational costs, and is able to identify also the joints' type sequence. 

Emotion Classification (EC) aims at assigning an emotion label to a textual document with two inputs – a set of emotion labels (e.g. anger, joy, sadness) and a document collection. The best performing approaches for EC are dictionary-based and suffer from two main limitations: (i) the out-of-vocabulary (OOV) keywords problem and (ii) they cannot be used across heterogeneous domains. In this work, we propose a way to overcome these limitations with a supervised approach based on TF-IDF indexing and Multinomial Linear Regression with Elastic-Net regularization to extract an emotion lexicon and classify short documents from diversified domains. We compare the proposed approach to state-of-the-art methods for document representation and classification by running an extensive experimental study on two shared and heterogeneous data sets.

Wireless networks are ever more deployed in industrial automation systems in various types of applications. A significant example in this context is represented by the transmission of safety data that, traditionally, was accomplished by wired systems. In this paper we propose an implementation of the Fail Safe over EtherCAT (FSoE) protocol on the top of IEEE 802.11 WLAN. The paper, after a general introduction of FSoE, focuses on the implementation of such protocol on commercial devices running UDP at the transport layer and connected via the IEEE 802.11 Wireless LAN. Then the paper presents some experimental setups and the tests that have been carried out on them. The obtained results are encouraging, since they show that good safety performance can be achieved even in the presence of wireless transmission media.

Exploiting the huge amount of data collected by industries is definitely one of the main challenges of the so-called Big Data era. In this sense, Machine Learning has gained growing attention in the scientific community, as it allows to extract valuable information by means of statistical predictive models trained on historical process data. In Semiconductor Manufacturing, one of the most extensively employed data-driven applications is Virtual Metrology, where a costly or unmeasurable variable is estimated by means of cheap and easy to obtain measures that are already available in the system. Often, these measures are multi-dimensional, so traditional Machine Learning algorithms cannot handle them directly. Instead, they require feature extraction, that is a preliminary step where relevant information is extracted from raw data and converted into a design matrix. Features are often hand-engineered and based on specific domain knowledge. Moreover, they may be difficult to scale and prone to information loss, affecting the effectiveness and maintainability of machine learning procedures. In this paper, we present a Deep Learning method for semi-supervised feature extraction based on Convolutional Autoencoders that is able to overcome the aforementioned problems. The proposed method is tested on a real dataset for Etch rate estimation. Optical Emission Spectrometry data, that exhibit a complex bi-dimensional time and wavelength evolution, are used as input.

In semiconductor manufacturing, metrology is generally a high cost, non-value added operation that impacts significantly on cycle time. As such, reducing wafer metrology continues to be a major target in semiconductor manufacturing efficiency initiatives. Data-driven spatial dynamic sampling methodologies are here compared. Such strategies aim at minimizing the number of sites that need to be measured across a wafer surface while maintaining an acceptable level of wafer profile reconstruction accuracy. The Spatial Dynamic Sampling approaches are based on analyzing historical metrology data to determine, from a set of candidate wafer sites, the minimum set of sites that need to be monitored in order to reconstruct the full wafer profile using statistical regression techniques. Spatial Dynamic sampling is then implemented in various strategies that guarantee coverage of all the possible sites in a given set of process iteration. In this way, the risk of not detecting previously unseen process behavior is mitigated. In this work, we demonstrate the efficacy of spatial dynamic sampling methodologies using both simulation studies and metrology data from a semiconductor manufacturing process.

On-line and phone banking frauds are responsible for millions of dollars loss every year. In this work, we propose a Machine Learning-based Decision Support System to automatically associate a risk factor to each transaction performed through an on-line/mobile banking system. The proposed approach has a hierarchical architecture: First, an unsupervised Machine Learning module is used to detect abnormal patterns or wrongly labeled transactions; then, a supervised module provides a risk factor for the transactions that were not marked as anomalies in the previous step. Our solution exploits personal and historical information about the user, statistics that describe online traffic generated on the online/mobile banking system, and features extracted from motives of the transactions. The proposed approach deals with dataset unbalancing effectively. Moreover, it has been validated on a large database of transactions and on-line traffic provided by an industrial partner.

In the context of Smart Monitoring and Fault Detection and Isolation in industrial systems, the aim of Predictive Maintenance technologies is to predict the happening of process or equipment faults. In order for a Predictive Maintenance technology to be effective, its predictions have to be both accurate and timely for taking strategic decisions on maintenance scheduling, in a cost-minimization perspective. A number of Predictive Maintenance technologies are based on the use of “health factors” quantitative indicators associated with the equipment wear that exhibit a monotone evolution. In real industrial environment, such indicators are usually affected by measurement noise and non-uniform sampling time. In this work we present a methodology, formulated as a stochastic filtering problem, to optimally predict the evolution of the aforementioned health factors based on noisy and irregularly sampled observations. In particular, a hidden Gamma process model is proposed to capture the nonnegativity and nonnegativity of the derivative of the health factor. As such filtering problem is not amenable to a closed form solution, a numerical Monte Carlo approach based on particle filtering is here employed. An adaptive parameter identification procedure is proposed to achieve the best trade-off between promptness and low noise sensitivity. Furthermore, a methodology to identify the risk function associated to the observed equipment based on previous maintenance data is proposed. The present study is motivated and tested on a real industrial Predictive Maintenance problem in semiconductor manufacturing, with reference to a dry etching equipment.

In semiconductor manufacturing, metrology is generally a high cost nonvalue-added operation that significantly impacts on cycle time. As such, reducing wafer metrology continues to be a major target in semiconductor manufacturing efficiency initiatives. A novel data-driven spatial dynamic sampling methodology is presented that minimizes the number of sites that need to be measured across a wafer surface while maintaining an acceptable level of wafer profile reconstruction accuracy. The methodology is based on analyzing historical metrology data using forward selection component analysis (FSCA) to determine, from a set of candidate wafer sites, the minimum set of sites that need to be monitored in order to reconstruct the full wafer profile using statistical regression techniques. Dynamic sampling is then implemented by clustering unmeasured sites in accordance with their similarity to the FSCA selected sites and temporally selecting a different sample from each cluster. In this way, the risk of not detecting previously unseen process behavior is mitigated. We demonstrate the efficacy of the proposed methodology using both simulation studies and metrology data from a semiconductor manufacturing process.

In this paper we propose a distributed implementation
of the relaxed Alternating Direction Method of Multipliers algorithm
(R-ADMM) for optimization of a separable convex cost
function, whose terms are stored by a set of interacting agents,
one for each agent. Specifically  the local cost stored by each node is in
general a function of both the state of the node and the states of its
neighbors, a framework that we refer to as `partition-based' optimization.
This framework presents a great flexibility and can be adapted to a large
number of different applications.
By recasting the problem into an operator theoretical framework, the proposed
algorithm is shown to be provably robust against random packet losses that
might occur in the communication between
neighboring nodes. Finally, the effectiveness of the proposed algorithm is
confirmed by  a set of compelling numerical simulations run over random
geometric graphs subject to i.i.d. random packet losses.

Fabric care home appliances are pervasive inhouses worldwide and manufactures are constantly working for improving product performance, efficiency, and usability. From a manufacturing perspective, increase of performancehas to be attained while minimizing the increase of production costs. In this context, a Soft Sensor for estimating the clothes load weight in a horizontal axis household washing machines ishere presented. The proposed Soft Sensor is based on Machine Learning approaches. Several methodologies, both time-seriesand feature-based, are employed and compared. The approach has been tested on real world data on commercial household washing machines.

In this work we address the problem of distributed optimization of the sum of convex cost functions in the context of multi-agent systems over lossy communication networks. Building upon operator theory, first, we derive an ADMM-like algorithm, referred to as relaxed ADMM (R-ADMM) via a generalized Peaceman-Rachford Splitting operator on the Lagrange dual formulation of the original optimization problem. This algorithm depends on two parameters, namely the averaging coefficient $\alpha$ and the augmented Lagrangian coefficient $\rho$ and we show that by setting $\alpha=1/2$ we recover the standard ADMM algorithm as a special case. Moreover, first, we reformulate our R-ADMM algorithm into an implementation that presents reduced complexity in terms of memory, communication and computational requirements. Second, we propose a further reformulation which let us provide the first ADMM-like algorithm with guaranteed convergence properties even in the presence of lossy communication. Finally, this work is complemented with a set of compelling numerical simulations of the proposed algorithms over random geometric graphs subject to i.i.d. random packet losses.

Subjects affected by Type I Diabetes (T1D) are constantly confronted with the complicated problem of administering themselves an adequate amount of insulin, so as to keep their blood-glucose concentration in a nearly physiological range. Recently, powerful technological tools have been developed to better face this challenge, in particular the so-called Artificial Pancreas (AP). Unluckily, the AP actuator, an insulin pump, is subject to faults, with potential serious consequences for subjects' safety. This calls for the development of advanced fault detection (FD) methods, leveraging the unprecedented data availability in this application. In this paper we tackle the problem of detecting insulin pump malfunctioning using a model-free approach, so that the complex sub-task of identifying a model of patients physiology is avoided. Moreover, we employed unsupervised methods since labeled data are hardly available in practice. The adopted data-driven Anomaly Detection (AD) methods are Local Outlier Factor and Connectivity-based Outlier Factor. The methods are applied on a feature set able to account for the physiological dynamics of T1D patients. The proposed algorithms are tested on a synthetic dataset, generated using the “UVA/Padova Type 1 Diabetic Simulator”, an accurate nonlinear computer simulator of the T1D subject physiology. Both methods show precision ~75% and recall ~60%• The described approach is suitable both for embedding in medical devices, such as the AP, and implementation in cloud-based remote monitoring systems.

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. 

In laundry treatment appliances, the weight ofthe laundry loaded by the user inside the drum dramaticallyaffects the operating behavior. Therefore, it is important toobtain a good estimate of the said quantity in order tocorrectly configure the machine before the washing/dryingstarts. In Vertical Axis Washing Machinesthe laundry weightis computed by exploiting the quantity of water absorbed bythe clothes. However, such approach does not grant accurateresults because the water absorption depends on the clothesfabric. For this reason, we propose a Soft Sensing approachfor weight estimation that exploits the information obtainedfrom physical sensors available on board without added costs.Data-driven Soft Sensors are developed, where, using MachineLearning techniques, a statistical model of the phenomenon ofinterest is created from a set of sample data.

Wafer metrology is an expensive and time consuming activity in semiconductor manufacturing, but is essential to support advanced process control, predictive maintenance and other quality assurance functions. Keeping metrology to a minimum is therefore desirable. In the context of spatial sampling of wafers this has motivated the development of a number of data driven methodologies for optimizing wafer sampling plans. Two such methodologies are considered in this paper. The first combines Principal Component Analysis and Minimum Variance Estimation (PCA-MVE) to determine an optimum subset of sites from historical metrology data from a larger candidate set, while the second employs Forward Selection Component Analysis (FSCA), an unsupervised variable selection technique, to achieve the same result. We investigate the relationship between these two approaches and show that under specific conditions a regularized extension of FSCA, denoted FSCA-R, and PCA-MVE are equivalent. Numerical studies using simulated data verify the equivalence conditions. Results for simulated and industrial case studies show that the improvement in wafer profile reconstruction accuracy with regularization is not statistically significant for the case studies considered, and that when PCA-MVE is implemented with a denoising step as originally proposed, it is outperformed by FSCA. Therefore, FSCA is the preferred methodology.

In the last years, international space-related companies and agencies are manifesting great interest in on-orbit servicing. Innovative solutions to perform on-orbit operations such as refuelling, payload updating and maintenance, subsystems repairing and inspection are under study and all the new ideas and technologies under development are perceived as extremely functional and cost-effective, capable of increasing the operational lifetime of a satellite and decreasing the costs related to its complete replacement.

For these reasons, the development of an automatic, standard and reliable docking system would simplify the accomplishment of on-orbit servicing procedures. Presently, there has been an increasing interest in developing different technologies for proximity navigation and rendezvous manoeuvres but no competitive or commercial technologies are currently available to perform autonomous rendezvous and docking between small-satellites. One promising solution is represented by relative magnetic navigation, where the chaser relative position and attitude can be controlled thanks to magnetic interactions with the target vehicle.

This paper presents an overview of the PACMAN experiment: PACMAN is a technology demonstrator developed by a team of university and PhD students in the framework of ESA Education Fly Your Thesis! 2017 programme and supported by the University of Padova. The experiment has been selected for the 68^th ESA Parabolic Flight Campaign that took place in December 2017. The main goal of the project was to develop and validate in low-gravity conditions an integrated system for proximity navigation and soft-docking based on magnetic interactions, suitable for small-scale spacecraft. This has been accomplished by launching a miniature spacecraft mock-up (1U CubeSat) towards a free-floating target that generates a static magnetic field; a set of actively-controlled magnetic coils on-board the spacecraft mock-up, assisted by dedicated localization sensors, have been used to control its attitude and position relative to the target. This experimental setup allowed to study the behaviour of a miniature spacecraft subjected to controlled magnetic interactions in low-gravity conditions and to validate the theoretical/numerical models that describe such interactions.

The paper describes the experiment design, realization and execution, from the initial concept to the Parabolic Flight Campaign tests. The experiment working principle is illustrated with particular attention towards the navigation and soft-docking subsystems, and the analysis of retrieved scientific results is finally presented.

Presently, no competitive or commercial solution is currently available to perform autonomous rendezvous and docking between small-satellites. Therefore, in the last years there has been an increasing interest in developing different technologies for proximity navigation and rendezvous manoeuvres, addressing the main issues of fuel consumption and the strong impact of close range navigation subsystems on satellites mass budget and complexity. One promising solution is represented by relative magnetic navigation, where the chaser relative position and attitude can be controlled thanks to magnetic interactions with the target vehicle.

PACMAN experiment is a technology demonstrator that has been developed by a team of university and PhDs students in the framework of ESA Education Fly Your Thesis! 2017 programme and supported by the University of Padova. The experiment has been selected to fly during the 68^th ESA Parabolic Flight Campaign, currently scheduled to take place this December. The main goal of the project is to develop and validate in low-gravity conditions an integrated system for proximity navigation and soft-docking based on magnetic interactions, suitable for small-scale spacecraft. This will be accomplished by launching a miniature spacecraft mock-up towards a free-floating target that generates a static magnetic field; a set of actively-controlled magnetic coils on-board the spacecraft mock-up, assisted by dedicated localization sensors, will be used to control its attitude and position relative to the target.

The realization of PACMAN experiment will allow to study the behaviour of a miniature spacecraft subjected to controlled magnetic interactions in low-gravity conditions and to validate the theoretical/numerical models that describe such interactions.

This paper presents an overview from the concept and design of the experiment to the Parabolic Flight Campaign tests. The experiment working principle will be illustrated, along with the design and assembly phases. Particular attention will be made towards the problem solving approach. Alternatives and backup solutions are introduced as part of the lessons learned during the entire programme. Finally, the analysis of retrieved scientific results will be showed.

The laundry weight of the loaded in the drum of a laundry treatment machine is an important piece of information; laundry weight can be used to set various washing/drying cycle parameters and to optimize performances and efficiency. Unfortunately, dedicated weight sensors cannot be included in consumer laundry equipment given the related costs. For this reason, we present in this work a soft sensor approach for estimating laundry weight based on sensors already in place in a laundry treatment equipment; in particular, we consider here a heat pump tumble dryer as case study. The proposed soft sensor is based on regularization, a popular approach in Machine Learning to provide models without overfitting the training data. Different studies are provided in this work, by considering different constrains on timing and complexity of the Soft Sensor solution. The developed Soft Sensors have been tested on laboratory data provided by an industrial partner.

The relationship between fMRI and MEG signals between different cortical regions (functional connectivity, FC) has been extensively analyzed in the resting state (De Pasquale et al 2010; Brookes et al 2011; Hipp et al 2012). Much less is known about FC modulations from rest to task states, and how they appear respectively in these two imaging modalities. Previously we have shown task-specific alterations of FC in fMRI during a visuospatial attention task (Spadone et al., PNAS, 2015). Specifically, decrements of resting correlation in visual areas were coupled with increments of correlation between visual and dorsal attention regions. Here, we compared fMRI with band-limited power (BLP) correlation obtained with MEG on the same group of subjects. Aim (i) is to measure frequency specific task-related FC modulations in MEG. Aim (ii) is to compare fMRI- and MEG-FC modulations (task-rest).

A purely geometric approach has been investigated to reconstruct the Demonstration Fusion Power Reactor (DEMO) plasma boundary for control purposes. The whole plasma boundary is reconstructed by using a deformable template method based on B-splines. The final curve shape is achieved by minimizing the distance between a limited number of estimated and measured (at present provided by an equilibrium code) plasma boundary points along the reflectometer lines of sight. The resulting unconstrained optimization problem is solved by a simulated annealing algorithm. The method is complemented by including the available plasma and poloidal field coil current measurements to refine the boundary reconstruction in the X-point region. The robustness with respect to random measurement random errors and to a reduction in the number of measurements is discussed. The main equilibrium and shape geometric quantities (such as plasma cross-sectional area, plasma center position, elongation, and triangularity) were computed and compared to the corresponding quantities of a DEMO reference equilibrium.

The goal of Aspect-Based Sentiment Analysis is to identify opinions regarding specific targets and the corresponding sentiment polarity in a document. The proposed approach is designed for real-world scenarios, where the amount of available information and annotated data is often too limited to train supervised models. We focus on the two core tasks of Aspect-Based Sentiment Analysis: aspect and sentiment polarity classification. The first task – which consists in the identification of the opinion targets in a document – is tackled by means of a weakly-supervised technique based on Non-negative Matrix Factorization. This strategy allows users to easily embed some a priori domain knowledge by means of short seed terms lists. Experimental results on publicly available data sets related to online reviews suggest that the proposed approach is very flexible and can be easily adapted to different languages and domains.

We consider the problem of controlling a smart lighting system of multiple luminaires with collocated occupancy and light sensors. The objective is to attain illumination levels higher than specified values (possibly changing over time) at the workplace by adapting dimming levels using sensor information, while minimizing energy consumption. We propose to estimate the daylight illuminance levels at the workplace based on the daylight illuminance measurements at the ceiling. More specifically, this daylight estimator is based on a model built from data collected by light sensors placed at workplace reference points and at the luminaires in a training phase. Three estimation methods are considered: Regularized least squares, locally weighted regularized least squares, and cluster-based regularized least squares. This model is then used in the operational phase by the lighting controller to compute dimming levels by solving a linear programming problem, in which power consumption is minimized under the constraint that the estimated illuminance is higher than a specified target value. The performance of the proposed approach with the three estimation methods is evaluated using an open-office lighting model with different daylight conditions. We show that the proposed approach offers reduced under-illumination and energy consumption in comparison to existing alternative approaches.

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.

Smart production monitoring is a crucial activity in advanced manufacturing for quality, control and maintenance purposes. Advanced Monitoring Systems aim to detect anomalies and trends; anomalies are data patterns that have different data characteristics from normal instances, while trends are tendencies of production to move in a particular direction over time. In this work, we compare state-of-the-art ML approaches (ABOD, LOF, onlinePCA and osPCA) to detect outliers and events in high-dimensional monitoring problems. The compared anomaly detection strategies have been tested on a real industrial dataset related to a Semiconductor Manufacturing Etching process

Advanced Monitoring Systems are fundamental in advanced manufacturing for control, quality and maintenance purposes. Nowadays, with the increasing availability of data in production and equipment, the need for high-dimensional Anomaly Detection techniques is thriving; anomalies are data patterns that have different data characteristics from normal production instances and that may be associated with faults or drifts in production. Tools for dealing with high-dimensional monitoring problems are provided by Machine Learning: in this paper, we test the performance of a state-of-the-art anomaly detection technique, called Isolation Forest, on a real industrial dataset related to Etching, one of the most important semiconductor manufacturing process. The monitoring has been performed exploiting Optical Spectroscopy Data.

In this paper, we study the problem of real-time optimal distributed partitioning for perimeter patrolling in the context of multicamera networks for surveillance, where each camera has limited mobility range and speed, and the communication is unreliable. The objective is to coordinate the cameras in order to minimize the time elapsed between two different visits of each point of the perimeter. We address this problem by casting it into a convex problem in which the perimeter is partitioned into nonoverlapping segments, each patrolled by a camera that sweeps back and forth at the maximum speed. We then propose an asynchronous distributed algorithm that guarantees that these segments cover the whole patrolling perimeter at any time and asymptotically converge to the optimal centralized solution under reliable communication. We finally modify the proposed algorithm in order to attain the same convergence and covering properties even in the more challenging scenario, where communication is lossy and there is no channel feedback, i.e., the transmitting camera is not aware whether a packet has been received or not by its neighbors.

In this paper we study cluster synchronization in a network of Kuramoto oscillators, where groups of oscillators evolve cohesively and at different frequencies from the neighboring oscillators. Synchronization is critical in a variety of systems, where it enables complex functionalities and behaviors. Synchronization over networks depends on the oscillators’ dynamics, the interaction topology, and coupling strengths, and the relationship between these different factors can be quite intricate. In this work we formally show that three network properties enable the emergence of cluster synchronization. Specifically, weak inter-cluster connections, strong intra-cluster connections, and sufficiently diverse natural frequencies among oscillators belonging to different groups. Our approach relies on system-theoretic tools, and is validated with numerical studies.

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.

Virtual Metrology is one of the most prominentAdvanced Process Control applications in SemiconductorManufacturing. The goal of Virtual Metrology is to provideestimations of quantities that are important for production andto assess process quality, but are costly or impossible to bemeasured. Virtual Metrology solutions are based on MachineLearning approaches. The bottleneck of developing VirtualMetrology solutions is generally the feature extraction phase thatcan be time-consuming, and can deeply affect the estimationperformance. In particular, in presence of data with additionaldimensions, such as time, feature extraction is typicallyperformed by means of heuristic approaches that may pickfeatures with poor predictive capabilities. In this work, wepropose the usage of modern Deep Learning approaches tobypass manual feature extraction and to provide highperformanceautomatic Virtual Metrology modules. Theproposed methodology is tested on a real industrial datasetrelated to Etching. The dataset at hand contains OpticalEmission Spectroscopy data and it is paradigmatic of the featureextraction problem under examination.

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.

The invention relates to a method for the determination of a laundry weight in a laundry treatment appliance comprising: Selecting a laundry program in the laundry treatment appliance; Starting the selected laundry program; Sensing a plurality of parameters indicating operating conditions of the laundry treatment appliance during the laundry program; and Predicting a weight of the laundry present within the laundry treatment appliance based on said plurality of parameters by means of a data-driven soft sensor.

This paper presents a robust technique, based on Krylov-subspace method, for the reduction of large-scale state-space models arising in many electromagnetic applications in fusion machines. The proposed approach, built on the Arnoldi algorithm, aims at reducing the number of states of the system and lowering the computational effort, with a negligible loss of accuracy in the numerical solution. A detailed performance study is presented on an ITER-like machine, addressing both 2-D and 3-D problems.

The 2014–2016 JET results are reviewed in the light of their significance for optimising the ITER research plan for the active and non-active operation. More than 60?h of plasma operation with ITER first wall materials successfully took place since its installation in 2011. New multi-machine scaling of the type I-ELM divertor energy flux density to ITER is supported by first principle modelling. ITER relevant disruption experiments and first principle modelling are reported with a set of three disruption mitigation valves mimicking the ITER setup. Insights of the L–H power threshold in Deuterium and Hydrogen are given, stressing the importance of the magnetic configurations and the recent measurements of fine-scale structures in the edge radial electric. Dimensionless scans of the core and pedestal confinement provide new information to elucidate the importance of the first wall material on the fusion performance. H-mode plasmas at ITER triangularity (H??=??1 at ? N ~ 1.8 and n/n GW ~ 0.6) have been sustained at 2 MA during 5?s. The ITER neutronics codes have been validated on high performance experiments. Prospects for the coming D–T campaign and 14 MeV neutron calibration strategy are reviewed.

The control and optimization of oxygen content in wine matrices is becoming more and more important in wine production in order to guarantee their best quality. It is well known that in a first phase O2 is necessary to facilitate the development and activity of yeasts, to favor the combination of anthocyanins and color stabilization, and to help reducing the astringency of red wines. In a second phase, however, during the maturation, O2 can severely deteriorate the organoleptic characteristics of the wine. The main oenological practices commonly performed in wine cellars causes remarkable amounts of oxygen to dissolve in wine. For this reason, an instrumentation able to be used in cellars is needed to detect the amount of dissolved oxygen in the wine; as well, a plant technology is needed which is capable of eliminating excess oxygen. In this work, a new economic prototype of optical sensor for oxygen measurements in oenological matrices is developed. It is based on the sampling of the light emission of a polysulfone polymer membrane containing 5,10,15,20-Tetraphenyl-21H,23H-porphyrin platinum (II) (PtTPP). The experimental parameter used for calibration of the sensor is the life time of the PtTPP, obtained from the fitting of the emission decay profile produced by stimulation of the membrane with short pulses emitted by a 390 nm excitation LED. The membrane guarantees a linear behavior of the Stern-Volmer equation and long-lasting signal stability [1,2]. Studies on the behavior of the sensor have been performed in different environments such as air, water, synthetic wine, and also in real red and white wine samples at different temperatures from 5 ° to 20 ° C. The sensor has been suitably designed to work in food matrices and to optimize the noise signal ratio, while keeping the price of the components as low as possible. The sensor was tested for a month within a barrel of 10 m containing wine in the first fermentation phase. In particular, two equal sensors were placed at two levels of depth compared to the wine infeed level: at 0.5 and 2.5 m, respectively. The oxygen content measured during this period was always constant and equal to 0.2%. We thank Smart Future S.r.l. and the project "WOW: DEPLOYMENT OF WSAN TECHNOLOGY FOR MONITORING OXYGEN IN WINE PRODUCTS" financed by the Veneto Region ex LR 5/2001 - ex LR 9/2007.

The diffusion in Power Systems of distributed renewable energy resources, electric vehicles and controllable loads has made advanced monitoring systems fundamental to cope with the consequent disturbances in power flows; advanced monitoring systems can be employed for Anomaly Detection, Root Cause Analysis and Control purposes.

Several Machine Learning-based approaches have been developed in the past recent years to detect if a power system is running under anomalous conditions and, eventually, to classify such situation with respect to known problems.

One of the aspects that makes Power Systems challenging to be tackled, is that the monitoring has to be performed on streams of data that have a time series evolution; this issue is generally tackled by performing a features extraction procedure before the classication phase. The features extraction phase consists of translating the informative content of time series data into scalar quantities: such procedure may be a time-consuming step that requires the involvement of process experts to avoid loss of information in the making; moreover, extracted features designed to capture certain behaviors of the system, may not be informative under unseen conditions leading to poor monitoring performances.

A different type of data-driven approaches, that will be reviewed in this chapter, allow to perform classication directly on the raw time series data, avoiding the features extraction phase: among these approaches, Dynamic Time Warping and Symbolic-based methodologies have been widely applied in many application areas.

In the following, pros and cons of each approach will be discussed and practical implementation guidelines will be provided.

In the context of activity recognition, wearable devices arenowadays the preferable hardware thanks to their usability, user expe-rience and performances; at the same time, these devices present limi-tations in terms of computational capability and memory, which forcethe algorithm design to be at the same time ecient and simple. Inthis work, we adopt Symbolic Aggregate Approximation (SAX), a sym-bolic approach for information retrieval in time series data that allowsdimensionality and numerosity reduction; SAX is employed here, in com-bination with 1-Nearest Neighbor classier, to identify activity phases incontinuous repetitive activities from inertial time-series data. The pro-posed approach is validated on a public activity recognition dataset.

The problem of daylight estimation in a smart lighting system is considered. The smart lighting system consists of multiple luminaires with collocated occupancy and light sensors. Using sensor information, the objective is to attain illumination levels higher than specified values at the workspaces. We consider a training phase wherein light sensors are used at the workspaces in addition. Data from the light sensors at the ceiling and workspaces is used to estimate the mapping across the sensors. In the operational phase, the estimated mapping is used at the lighting controller to obtain an estimate of the illuminance value at the workspaces. Under the constraint that the estimated illuminance is higher than a specified target value, the controller optimizes the dimming levels of the luminaires to minimize power consumption. We evaluate the performance of the proposed approach in an open-office lighting model by considering different daylight conditions.

The Multirate Support feature has been introduced by the IEEE 802.11 standard to improve system performance. It has been widely exploited within general purpose Wireless LANs by means of Rate Adaptation (RA) strategies, that unfortunately revealed ineffective for the case of real-time industrial communications. This paper presents the innovative Rate Selection for Industrial Networks (RSIN) algorithm, specifically conceived for the real-time industrial scenario with the goal of minimizing the transmission error probability, while taking into account the deadlines imposed to packet delivery.

In this paper an approach to deal with Predictive Maintenance (PdM) problems with time-series data is discussed. PdM is a important approach to tackle maintenance and it is gaining an increasing attention in advanced manufacturing to minimize scrap materials, downtime, and associated costs. PdM approaches are generally based on Machine Learning tools that require the availability of historical process and maintenance data. Given the exponential growth in data logging in modern equipment, time series dataset are increasingly available in PdM applications. To exploit time series data for PdM, a functional learning methodology, namely Supervised Aggregative Feature Extraction (SAFE), is here employed on a semiconductor manufacturing maintenance problem.

We address the problem of distributed unconstrained convex optimization under separability assumptions, i.e., the framework where a network of agents, each endowed with local private multidimensional convex cost and subject to communication constraints, 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 proven, 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.

The problem of emergent synchronization pat-terns in a complex network of coupled oscillators has caughtscientists’ interest in a lot of different disciplines. In particular,from a biological point of view, considerable attention has beenrecently devoted to the study of the human brain as a networkof different cortical regions that show coherent activity duringresting-state. In literature, there can be found different large-scale models of resting-state dynamics in health and disease.In this context, the Kuramoto model, a classical model apt todescribe oscillators’ dynamics, has been extended to capture thespatial displacement and the communication conditions in suchbrain network. Starting from a previous work in this ?eld ,we analyze this modi?ed model and compare it with otherexisting large-scale models. In doing so, our aim is to promotea set of mathematical tools useful to better understand realexperimental data in neuroscience and estimate brain dynamics.

In this paper we analyze the performances of some popular algorithms used to solve distributed optimization problems involving quadratic cost functions in a multi agent system. Namely, we study the performances of standard consensus, accelerated consensus and ADMM.  We analyze the scalar quadratic function case, under different scenarios and with structured graphs. We find that accelerated consensus is the algorithm with the best performance in all the cases analyzed. On the other hand, ADMM has performance comparable to the accelerated consensus when the graph is scarcely connected, while for dense graphs its performance deteriorates and becomes worse than the one of standard consensus. The results therefore suggest that the choice of the algorithm to solve the problem we analyze strongly depends on the graph, and that accelerated consensus should always be preferred.

In recent years complex networks have gained in-
creasing attention in different fields of science and engineering.
The problem of controlling these networks is an interesting and
challenging problem to investigate. In this paper we look at the
controllability problem focusing on the energy needed for the
control. Precisely not only we want to analyze whether a network
can be controlled, but we also want to establish whether the
control can be performed using a limited amount of energy.
We restrict our study to irreducible and (marginally) stable
networks and we find that the leading right and left eigenvectors
of the network matrix play a crucial role in this analysis.
Interestingly, our results suggest the existence of a connection
between controllability and network centrality, a well-known
concept in network science. In case the network is reversible, the
latter connection involves the PageRank, an extensively studied
type of centrality measure. Finally, the proposed results are
applied to examples concerning random graphs.

Recently, several working implementations of inband full-duplex wireless systems have been presented, where the same node can transmit and receive simultaneously in the same frequency band. The introduction of such a possibility at the physical layer could lead to improved performance but also poses several challenges at the MAC layer. In this paper, an innovative mechanism of channel contention in full-duplex OFDM wireless networks is proposed. This strategy is able to ensure efficient transmission scheduling with the result of avoiding collisions and effectively exploiting full-duplex opportunities. As a consequence, considerable performance improvements are observed with respect to standard and state-of-the-art MAC protocols for wireless networks, as highlighted by extensive simulations performed in ad hoc wireless networks with varying number of nodes.

In many applications, and especially thosewhere batch processes are involved, a target scalar outputof interest is often dependent on one or more time seriesof data. With the exponential growth in data logging inmodern industries such time series are increasingly availablefor statistical modeling in soft sensing applications. In orderto exploit time series data for predictive modelling, it isnecessary to summarise the information they contain as aset of features to use as model regressors. Typically thisis done in an unsupervised fashion using simple techniquessuch as computing statistical moments, principalcomponents or wavelet decompositions, often leading tosignificant information loss and hence suboptimal predictivemodels. In this paper, a functional learning paradigm isexploited in a supervised fashion to derive continuous,smooth estimates of time series data (yielding aggregatedlocal information), while simultaneously estimating a continuousshape function yielding optimal predictions. Theproposed Supervised Aggregative Feature Extraction (SAFE)methodology can be extended to support nonlinear predictivemodels by embedding the functional learning framework ina Reproducing Kernel Hilbert Spaces setting. SAFE has anumber of attractive features including closed form solutionand the ability to explicitly incorporate first and secondorder derivative information. Using simulation studies and apractical semiconductor manufacturing case study we highlightthe strengths of the new methodology with respect tostandard unsupervised feature extraction approaches.

In this paper, statistical Quality of Service provisioning in next generation heterogeneous mobile cellular networks is investigated. To this aim, any active entity of the cellular network is regarded as a queuing system, whose statistical QoS requirements depend on the specific application. In this context, by quantifying the performance in terms of effective capacity, we introduce a lower bound for the system performance that facilitates an efficient analysis. We exploit this analytical framework to give insights about the possible improvement of the statistical QoS experienced by the users if the current heterogeneous cellular network architecture migrates from a Half Duplex to a Full Duplex mode of operation. Numerical results and analysis are provided, where the network is modeled as a Mate?rn point processes with a hard core distance. The results demonstrate the accuracy and computational efficiency of the proposed scheme, especially in large scale wireless systems.

In this paper, two methods to reduce the complexity of multi-parametric programming modelpredictive control are proposed. We show that the standard multi-parametric programming problem can be modified by approximating the quadratic programming constraints. For a certain controlsequence, only constraints on the first element is considered, while constraints on future elements are ignored or approximated to a simple saturation function. Both the number of critical regions and the computation time are proven to be reduced. Geometric interpretations is given and complexityanalysis is conducted. The result is tested on an illustrating example to show its effectiveness.

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.

IEEE 802.11 systems are drawing an ever increasing interest for wireless industrial communication, also thanks to the interesting features provided by the most recent and advanced amendments to this standard, such as IEEE 802.11n. Due to the intrinsic unreliability of the wireless medium, the current research efforts aim at improving both timeliness and reliability of such a protocol in view of its adoption for real-time applications. A significant issue in this context is represented by the reduction of the randomness that affects packet delivery times. An important benefit in this direction can be obtained by the deactivation of the standard legacy carrier sensing and backoff procedures. In this paper we show, through a simulative assessment, that a fine control of such features leads to improved real-time performance.

A new Bayesian approach to linear system identification
has been proposed in a series of recent papers. The
main idea is to frame linear system identification as predictor
estimation in an infinite dimensional space, with the aid of
regularization/Bayesian techniques. This approach guarantees
the identification of stable predictors based on the prediction
error minimization. Unluckily, the stability of the predictors
does not guarantee the stability of the impulse response of
the system. In this paper we propose and compare various
techniques to guarantee that the final model identified following
this Bayesian approach is stable. First, we consider the socalled
“LMI - constraint” approach and adapt it to constrain
the eigenvalues of the estimated model within the unit circle.
A second possibility which is being considered is to add to the
“classic” Stable-Spline algorithm a penalty term, depending on
the maximum absolute value of the eigenvalue of the system.
This last technique has the advantage of being integrated
directly inside the pre-existing optimization problem and not to
simply post-process the estimated model to guarantee stability.
Finally, we considered a Monte Carlo Markov Chain approach
sampling in both the space of hyper-parameters and of impulse
responses. Simulations results comparing these techniques will
be provided.

The IEEE 802.11 standard, since its earliest versions, provides the multi-rate support feature typically exploited by Rate Adaptation (RA) techniques to dynamically select the most suitable transmission rate, based on an estimation of the channel status. With the release of the IEEE 802.11n amendment, several enhancements have been introduced to the standard, notably the support for MIMO architectures, whose benefits can be effectively combined with multi-rate support. In an industrial communication scenario, the RA algorithms commonly available for general purpose applications revealed ineffective. This led to the definition of purposely designed algorithms, with the aim of improving the real-time behavior of IEEE 802.11 networks. In this paper we take into consideration these techniques, as well as some general purpose RA strategies, and analyze their implementation on an IEEE 802.11n communication system deployed in an industrial scenario. Furthermore, we propose an effective parameters tuning for the considered RA algorithms, as well as some enhancements conceived to enforce their timeliness. An exhaustive assessment, carried out via numerical simulations, shows that the improved techniques allow to achieve excellent performance.

In this paper a multiple classifier machine learning methodology for Predictive Maintenance (PdM) is presented. PdM is a prominent strategy for dealing with maintenance issues given the increasing need to minimize downtime and associated costs. One of the challenges with PdM is generating so called ’health factors’ or quantitative indicators of the status of a system associated with a given maintenance issue, and determining their relationship to operating costs and failure risk. The proposed PdM methodology allows dynamical decision rules to be adopted for maintenance management and can be used with high-dimensionaland censored data problems. This is achieved by training multiple classification modules with different prediction horizons to provide different performance trade-offs in terms of frequency of unexpected breaks and unexploited lifetime and then employing this information in an operating cost based maintenance decision system to minimise expected costs. The effectiveness of the methodology is demonstrated using a simulated example and a benchmark semiconductor manufacturing maintenance problem.

In semiconductor manufacturing, wafer quality control strongly relies on product monitoring and physical metrology. However, the involved metrology operations, generally performed by means of scanning electron microscopes, are particularly cost-intensive and time-consuming. For this reason, in common practice a small subset of only a productive lot is measured at the metrology stations and it is devoted to represent the entire lot. Virtual Metrology (VM) methodologies are able to obtain reliable predictions of metrology results at process time, without actually performing physical measurements; this goal is usually achieved by means of statistical models and by linking process data and context information to target measurements. Since semiconductor manufacturing processes involve a high number of sequential operations, it is reasonable to assume that the quality features of a given wafer (such as layer thickness and critical dimensions) depend on the whole processing and not on the last step before measurement only. In this paper, we investigate the possibilities to enhance VM prediction accuracy by exploiting the knowledge collected from previous process steps. We present two different schemes of multi-step VM, along with dataset preparation indications; special consideration will be reserved to regression techniques capable of handling high-dimensional input spaces. The proposed multi-step approaches are tested on production data provided by a partner semiconductor manufacturing industry. 

In the paper output feedback control of Boolean control networks (BCNs) is investigated. First, necessary and sufficient
conditions for the existence of a time-invariant output feedback (TIOF) law, stabilizing the BCN to some equilibrium point,
are given, and constructive algorithms to test the existence of such a feedback law are proposed. Two sufficient conditions for
the existence of a stabilizing time-varying output feedback (TVOF) are then given. Finally, an example concerning the lac
Operon in the bacterium Escherichia Coli is presented, to illustrate the effectiveness of the proposed techniques.

Personal control with occupancy and daylight adaptation is considered in a lighting system with multiple luminaires. Each luminaire is equipped with a co-located occupancy sensor and light sensor that respectively provide local occupancy and illumination information to a central controller. Users may also provide control inputs to indicate a desired illuminance value. Using sensor feedback and user input, the central controller determines dimming values of the luminaires using an optimization framework. The cost function consists of a weighted sum of illumination errors at light sensors and the power consumption of the system. The optimum dimming values are determined with the constraints that the illuminance value at the light sensors are above the reference set-point at the light sensors and the dimming levels are within physical allowable limits. Different approaches to determine the set-points at light sensors associated with multiple user illumination requests are considered. The performance of the proposed constrained optimization problem is compared with a reference stand-alone controller under different simulation scenarios in an open-plan office lighting system.

Slow release drugs must be manufactured to meettarget speci?cations with respect to dissolution curve pro?les.In this paper we consider the problem of identifying thedrivers of dissolution curve variability of a drug from historicalmanufacturing data. Several data sources are considered: rawmaterial parameters, coating data, loss on drying and pellet sizestatistics. The methodology employed is to develop predictivemodels using LASSO, a powerful machine learning algorithmfor regression with high-dimensional datasets. LASSO providessparse solutions facilitating the identi?cation of the most importantcauses of variability in the drug fabrication process.The proposed methodology is illustrated using manufacturingdata for a slow release drug.

In the last years, IEEE 802.11 Wireless LANs (WLANs) have proved their effectiveness for a wide range of real-time industrial communication applications. Nonetheless, the enhancements at the PHY and MAC layers introduced by the IEEE 802.11n amendment have not yet been adequately addressed in the context of industrial communication. In this paper we investigate the impact of some IEEE 802.11n new features on some important performance figures for industrial applications, such as timeliness and reliability.

Faulty operations of Heating, Ventilation and Air Conditioning (HVAC) chiller systems can lead to discomfort for the occupants, energy wastage, unreliability and shorter equipment life. Such faults need to be detected early to prevent further escalation and energy losses. Commonly, data regarding unforeseen phenomena and abnormalities are rare or are not available at the moment of HVAC systems installation: for this reason in this paper an unsupervised One-Class SVM classifier employed as a novelty detection system to identify unknown status and possible faults is presented. The approach, that exploits Principal Component Analysis to accent novelties w.r.t. normal operations variability, has been tested on a HVAC literature dataset.

In recent years, Visual Sensor Networks (VSNs) have emerged as an interesting category of distributed sensor- actor systems to retrieve data from the observed scene and produce information. Indeed, the request for accurate 3D scene reconstruction in several applications is leading to the development of very large systems and more specifically to large scale motion capture systems. When dealing with such huge amount of data from a large number of cameras it becomes very hard to make real time reconstruction on a single machine.
Within this context, a distributed approach for reconstruc- tion on large scale camera networks is proposed. The approach is based on geometric triangulation performed in a distributed fashion on the computational grid formed by the camera net- work organized into a tree structure. Since the computational performance of the algorithm strongly depends on the order in which cameras are paired, to optimize the efficiency of the reconstruction a pairing strategy is designed that relies on an affinity score among cameras. This score is computed from a probabilistic perspective by studying the variance of the 3D target reconstruction error and resorting to a normalized cut graph partitioning.
The scaling laws and the results obtained in simulation suggest that the proposed optimization strategy allows to obtain a significant reduction of the computational time.

Process monitoring and Predictive Maintenance (PdM) are gaining increasing attention in most manufacturing environments as a means of reducing maintenance related costs and downtime. This is especially true in industries that are data intensive such as semiconductor manufacturing. In this paper an adaptive PdM based flexible maintenance scheduling decision support system, which pays particular attention to associated opportunity and risk costs, is presented. The proposed system, which employs Machine Learning and regularized regression methods, exploits new information as it becomes available from newly processed components to refine remaining useful life estimates and associated costs and risks. The system has been validated on a real industrial dataset related to an Ion Beam Etching process for semiconductor manufacturing.

We consider the problem of building a transitional model of an initially uncalibrated camera network. More specifically, we discuss an Hidden Markov Model (HMM) based strategy in which the model’s statespace is defined in terms of a partition of the physical network coverage. Transitions between any two such states are modeled by the distribution of the underlying Markov Process. Extending previous work in (Cenedese et al., 2010), we show how it is possible to infer the model structure and parameters from coordinate free observations and introduce a novel performance index that is used for model validation. We moreover show the predictive power of this HMM approach in simulated and real settings that comprise Pan-Tilt- Zoom (PTZ) cameras.

In this paper, we consider the problem of designing a distributed strategy to estimate the channel parameters for a generic Wireless Sensor-Actor Network. To this aim, we present a distributed least-square algorithm that complies with the constraint of transmitting only integer data through the wireless communication, which often characterizes Wireless Sensor-Actor Network embedded architectures. In this respect, we propose a quantized consensus strategy that mitigates the effects of the rounding operations applied to the wireless exchanged floating data. Moreover, the approach is based on a symmetric random gossip strategy, making it suitable for the actual deployment in multiagent networks. Finally, the effectiveness of the proposed algorithm and of its implementation as an open-source application is assessed and the employment of the procedure is illustrated through the application to radio-frequency localization experiments in a real world testbed.

The knowledge of the size of a network, i.e.\ of the number of nodes composing it, is important for maintenance and organization purposes. In networks where the identity of the nodes or is not unique or cannot be disclosed for privacy reasons, the size-estimation problem is particularly challenging since the exchanged messages cannot be uniquely associated with a specific node. In this work, we propose a totally distributed anonymous strategy based on statistical inference concepts. In our approach, each node starts generating a vector of independent random numbers from a known distribution. Then nodes compute a common function via some distributed consensus algorithms, and finally they compute the Maximum Likelihood (ML) estimate of the network size exploiting opportune statistical inferences. In this work we study the performance that can be obtained following this computational scheme when the consensus strategy is either the maximum or the average. In the max-consensus scenario, when data come from absolutely continuous distributions, we provide a complete characterization of the ML estimator. In particular, we show that the squared estimation error decreases as $1/M$, where $M$ is the amount of random numbers locally generated by each node, independently of the chosen probability distribution. Differently, in the average-consensus scenario, we show that if the locally generated data are independent Bernoulli trials, then the probability for the ML estimator to return a wrong answer decreases exponentially in $M$. Finally, we provide a discussion as how the numerical errors may affect the estimators performance under different scenarios.

Technological advances and the ever-growing human quest for improving the resolution of telescope observations are motivating the design of larger and larger ground telescopes: indeed, the larger is the telescope lens diameter, the better is the diffraction limited resolution of the telescope. Unfortunately, the terrestrial atmospheric turbulence, if not properly compensated, negatively affects the telescope observations, limiting its real resolution. Adaptive Optics (AO) systems are used in large ground telescopes in order to compensate the effect of the atmosphere, and hence to make the real telescope resolution be determined by the diffraction properties of the lens.

Technological advances and the ever-growing human quest for improving the resolution of telescope observations are motivating the design of larger and larger ground telescopes: indeed, the larger is the telescope lens diameter, the better is the diffraction limited resolution of the telescope. Unfortunately, the terrestrial atmospheric turbulence, if not properly compensated, negatively affects the telescope observations, limiting its real resolution. Adaptive Optics (AO) systems are used in large ground telescopes in order to compensate the effect of the atmosphere, and hence to make the real telescope resolution be determined by the diffraction properties of the lens. AO systems exploit the measurements of wavefront sensors to estimate the current values of the atmospheric turbulence, and compensate its effect by properly adapting the shape of a set of deformable mirrors. As the size of the telescope lenses is increasing, then the size of the AO system (e.g. the number of deformable mirror actuators and the size of the wavefront sensor) is increasing as well. This causes the increase of the computational burden needed to compute a proper compensation of the effect of the atmosphere. Consequently, as the potential telescope resolution increases, the task of the AO systems becomes more challenging. Motivated by the need of providing AO solutions useful for the next generations of ground telescopes, then a number of efficient algorithms have been recently considered in the literature to solve the problems related to the AO system. This paper considers the combination of a recently proposed very efficient phase reconstruction method, namely the CuRe, with a properly defined Kalman filter in order to obtain a dynamic compensation of the atmospheric turbulence. The performance of the proposed approach is investigated in some simulations.

In the semiconductor manufacturing environment it is very important to understand which factors have the most impact on process outcomes and to control them accordingly. This is usually achieved through design of experiments at process start-up and long term observation of production. As such it relies heavily on the expertise of the process engineer. In this work, we present an automatic approach to extracting useful insights about production processes and equipment based on state-of-the-art Machine Learning techniques. The main goal of this activity is to provide tools to process engineers to accelerate the learning-by-observation phase of process analysis. Using a Metal Deposition process as an example, we highlight various ways in which the extracted information can be employed.

We propose a new modeling paradigm for large dimensional aggregates of stochastic systems by Generalized Factor Analysis (GFA) models. These models describe the data as the sum of a flocking plus an uncorrelated idiosyncratic component. The flocking component describes a sort of collective orderly motion  which admits a much simpler   mathematical description than the whole ensemble while the idiosyncratic component describes weakly correlated noise. We first discuss static GFA representations and characterize in a rigorous way the properties of the two components. For wide-sense stationary sequences the character and existence of GFA models is completely clarified. The extraction of the flocking component of a random field is discussed for a simple class of separable random fields.

Turbulence simulation methods are of fundamental importance for evaluating the performance of control strategies for Adaptive Optics (AO) systems. In order to obtain a reliable evaluation of the performance a statistically accurate turbulence simulation method has to be used. This work generalizes a previously proposed method for turbulence simulation based on the use of a multiscale stochastic model. The main contributions of this work are: first, a multiresolution local PCA representation is considered. In typical operating conditions, the computational load for turbulence simulation is reduced approximately by a factor of 4, with respect to the previously proposed method, by means of this PCA representation. Second, thanks to a different low resolution method, based on a moving average model, the wind velocity can be in any direction (not necessarily that of the spatial axes). Finally, this paper extends the simulation procedure to generate, if needed, turbulence samples by using a more general model than that of the frozen flow hypothesis.

The property of single prediction predictive control in the form of dynamic matrix control is studied within internal model control framework. The sensitivity function and integral squared error are used as performance evaluation criteria in the frequency and time domain respectively, to quantitativelyanalyze single prediction strategy, especially on controller with the prediction and control horizon P = M = 1. We present the correlation between system performance and model mismatch in this case. The performance limitation for tracking unit step signal is obtained through derivation and simulation.

This paper investigates an original system for wireless control and monitoring of an agricultural machine. The system is implemented by means of an IEEE 802.11-based soft realtime communication architecture which enables the connection of the machine with off-the-shelf mobile devices, like widespread tablet PCs, that could hence replace traditional ad-hoc developed operator panels. The harsh surrounding environment, however, introduces severe requirements. Hence, focusing on the wireless communication behavior, the paper yields a thorough performance analysis derived by extensive experimental campaigns. By investigating the outcomes of these measurement sessions, the paper assesses some causes of performance degradation, and provides viable and easy to implement solutions to improve the overall system behavior.

Classification methods with embedded feature selection capability are very appealing for the analysis of complex processes since they allow the analysis of root causes even when the number of input variables is high. In this work, we investigate the performance of three techniques for classification within a Monte Carlo strategy with the aim of root cause analysis. We consider the naive Bayes classifier and the logistic regression model with two different implementations for controlling model complexity, namely, a LASSO-like implementation with a l1 norm regularization and a fully Bayesian implementation of the logistic model, the so called relevance vector machine. Several challenges can arise when estimating such models mainly linked to the characteristics of the data: a large number of input variables, high correlation among subsets of variables, the situation where the number of variables is higher than the number of available data points and the case of unbalanced datasets. Using an ecological and a semiconductor manufacturing dataset, we show advantages and drawbacks of each method, highlighting the superior performance in term of classification accuracy for the relevance vector machine with respect to the other classifiers. Moreover, we show how the combination of the proposed techniques and the Monte Carlo approach can be used to get more robust insights into the problem under analysis when faced with challenging modelling conditions.

The diffusion of visual sensor networks, and in particular of smart camera networks, is motivating an increasing interest on the research of distributed solutions for several vision problems. Specifically, in this paper we propose a distributed solution to the problem of reconstructing target positions in large Motion Capture (MoCap) systems. Real time reconstruction by means of centralized procedures is practically unfeasible for very large systems, while the use of distributed computation allows to significantly reduce the computational time required for reconstruction, thus allowing the development of real time solutions.
Then the proposed distributed reconstruction procedure is optimized by exploiting information about the structure of the system: the visibility matrix states which objects in the scene are somehow measurable by a sensor (sensor-object matrix). Often, the typical localization of data from real application scenarios induces an underlying structure on the visibility matrix, that can be exploited to improve the performance of the system in understanding the surrounding environment. Unfortunately, usually these data are not properly organized in the visibility matrix: for instance, listing the sensors in a pseudo-random order can hide the underlying structure of the matrix. This paper considers the problem of recovering such underlying structure directly from the visibility matrix and designs an algorithm to perform this task.
Our simulations show that the distributed reconstruction algorithm optimized by means of the estimation of the structure of the visibility matrix allows a particularly relevant computational time reduction with respect to the standard (centralized) reconstruction algorithm.

We consider the problem of optimal reactive power compensation for the minimization of power distribution losses in a smart microgrid. We first propose an approximate model for the power distribution network, which allows us to cast the problem into the class of convex quadratic, linearly constrained, optimization problems. Then, we design a randomized, gossip-like optimization algorithm based on that model. We show how a distributed approach is possible, where agents have a partial knowledge of the problem parameters and state, and can only perform local measurements. For the proposed algorithm, we provide conditions for convergence together with an analytic characterization of the convergence speed. The analysis shows that the best performance can be achieved when we command cooperation among agents that are neighbors in the electric topology. Numerical simulations are included to validate the proposed model and to confirm the analytic results about the performance of the proposed algorithm.

In semiconductor fabrication processes, effectivemanagement of maintenance operations is fundamental todecrease costs associated with failures and downtime. PredictiveMaintenance (PdM) approaches, based on statistical methodsand historical data, are becoming popular for their predictivecapabilities and low (potentially zero) added costs. We presenthere a PdM module based on Support Vector Machines forprediction of integral type faults, that is, the kind of failuresthat happen due to machine usage and stress of equipmentparts. The proposed module may also be employed as a healthfactor indicator. The module has been applied to a frequentmaintenance problem in semiconductor manufacturing industry,namely the breaking of the filament in the ion-source ofion-implantation tools. The PdM has been tested on a realproduction dataset.

This paper considers a variation of the 17$^{\text{th}}$ century problem commonly known as the Newton-Pepys problem, or the John Smith's problem. We provide its solution, interpreting the result in terms of maximum likelihood estimation and Ockham's razor. In addition, we illustrate the practical relevance of these findings for solving size-estimation problems, and in particular for determining the number of agents in a wireless sensor network.

In semiconductor manufacturing plants, monitoring physical properties of all wafers is crucial to maintain good yield and high quality standards. However, such an approach is too costly, and in practice, only few wafers in a lot are actually monitored. Virtual metrology (VM) systems allow to partly overcome the lack of physical metrology. In a VM scheme, tool data are used to predict, for every wafer, metrology measurements. In this paper, we present a VM system for a chemical vapor deposition (CVD) process. On the basis of the available metrology results and of the knowledge, for every wafer, of equipment variables, it is possible to predict CVD thickness. In this work, we propose a VM module based on least angle regression to overcome the problem of high dimensionality and model interpretability. We also present a statistical distance-based clustering approach for the modeling of the whole tool production. The proposed VM models have been tested on industrial production data sets.

In this paper we consider discrete-time positive switched systems, switching among autonomous
subsystems, characterized either by monomial matrices or by circulant matrices. For these two classes of
systems, some interesting necessary and sufficient conditions for (global uniform) asymptotic stability
and stabilizability are provided. Such conditions lead to simple algorithms that allow to easily detect,
under suitable conditions, whether a given positive switched system is not stabilizable.

We describe tradeoffs between the performance in visual decision problems and the control authority that the agent can exercise on the sensing process. We focus on problems of “coverage” (ensuring that all regions in the scene are seen) and “change estimation” (finding and learning an unknown object in an otherwise known and static scene), propose a measure of control authority and empirically relate it to the expected risk and its proxy (conditional entropy of the posterior density). We then show that a “passive” agent can provide no guarantees on performance beyond what is afforded by the priors, and that an “omnipotent” agent, capable of infinite control authority, can achieve arbitrarily good performance (asymptotically).

The paper considers the classification problem using Support Vector Machines, and investigates how to maximally reduce the size of the training set without losing information. Under linearly separable dataset assumptions, we derive the exact conditions stating which observations can be discarded without diminishing the overall information content. For this purpose, we introduce the concept of Potential Support Vectors, i.e., those data that can become Support Vectors when future data become available. Complementary, we also characterize the set of Discardable Vectors, i.e., those data that, given the current dataset, can never become Support Vectors. These vectors are thus useless for future training purposes, and can eventually be removed without loss of information. We then provide an efficient algorithm based on linear programming which returns the potential and discardable vectors by constructing a simplex tableau. Finally we compare it with alternative algorithms available in the literature on some synthetic data as well as on datasets from standard repositories.

In past years the Reversed Field Pinch RFX-mod has also been operated as a low current Tokamak to perform experiments of active control of MHD modes particularly harmful to a prospective reactor. The stabilization of m=2, n=1 mode has been achieved for 150 kA plasma currents in circular shape discharges at q(a)<2. In order to test the system capability of stabilizing such modes in improved confinement regimes, the possibility of producing D- shaped plasma discharges has been explored. Preliminary experiments were carried out in open loop in 2011. In the meantime a completely new plasma position and shape control system was designed and its performances simulated with the finite element 2D MHD equilibrium code MAXFEA. According to the simulation results, feedback control of the D- shape configuration was capable of meeting the design requirements. As a first step, the recent experimental campaign in Tokamak configuration was partially dedicated to demonstrate the possibility of a stable feedback controlled operation with an elongated plasma. In the paper the identification of the transfer function between a dedicated Field Shaping (FS) coil current distribution and the plasma elongation, the design of the control system, its implementation and successful testing are described.

Camera positioning units are widely used in surveillance and they are sometimes mounted on floating supports, e.g.
on patrolling ships or buoys. The support motion, in turn, induces an apparent motion in the image plane, which can create troubles to the image processing, especially when a specific feature must be tracked (e.g. a distant ship, getting close to a forbidden area). Low cost devices are often characterized by low frame rate and low image resolution, for which traditional image stabilization techniques usually results to be rather ineffective. Additionally, low-end camera units are usually driven by hybrid stepper motors and, being conceived to work in an harsh environment, they do not mount any optical image stabilization (OIS) system, either in the camera lenses or in the image sensor. In this paper, the image acquired by a pan–tilt camera positing unit mounted on a moving support is stabilized by exploiting the camera attitude information provided by a MEMS-based IMU with an embedded magnetometer. In particular, two independent integral control loops are designed for the pan and tilt motors in order to compensate for the yaw and pitch motions of the support. As for the roll motion, since it relates to an unavailable degree of freedom in the positioning unit, it can be compensated only on the captured image. The proposed solution is experimentally tested on a real device mounted on a moving table actuated by a 6 degrees–of–freedom pneumatic hexapod. Realistic motions are recreated by using the data recordings taken aboard of a patrolling ship and a costal buoy. Experimental results show that the proposed solution is capable of keeping the camera pointing at a fixed target with a good accuracy, thus making higher-level image processing easier and more effective.

Camera positioning units for surveillance applica- tions are often mounted on mobile supports or vehicles. In such circumstances, the motion of the supporting base affects the camera field of view, thus making the task of pointing and tracking a specific target problematic, especially when using low cost devices that are usually not equipped with rapid actuators and fast video processing units. Visual tracking capabilities can be improved if the camera field of view is preliminarily stabilized against the movements of the base. Although some cameras available on the market are already equipped with an optical image stabilization (OIS) system, implemented either in the camera lenses or in the image sensor, these are usually too expensive to be installed on low–end positioning devices.
A cheaper approach to image stabilization consists of stabilizing the camera motion using the motors of the positioning unit and the inertial measurements provided by a low–cost MEMS Inertial Measurement Unit (IMU). This paper explores the feasibility of applying such image stabilization system to a low cost pan–tilt– zoom (PTZ) camera positioning unit driven by hybrid stepper motors (HSMs), in order to aid the task of pointing and tracking of a specific target on the camera image plane. In the proposed solution, a two–level cascaded control structure, consisting of inner inertial stabilizing control loop and an outer visual servoing control loop, is used to control the PTZ unit. Several tests are carried out on a real device mounted on a moving table actuated by a 6 degrees–of–freedom pneumatic hexapod. Realistic motions are recreated by using the data recordings taken aboard of a patrolling ship.

In this paper, we study modeling and identification of stochastic systems by Generalized Factor Analysis models. Although this class of models was originally introduced for econometric purposes, we present some possible  applications of engineering interest. We show that there is a natural connection between Generalized Factor Analysis models and multi-agents systems. The common factor component of the model has an interpretation as a flocking component of the system behaviour.

Models typically used to simulate the influence of atmospheric turbulence on ground telescope observations are usually based on the frozen flow hypothesis. However, the frozen flow model of the atmosphere is valid at time scales of the order of tens/hundreds of milliseconds. This paper generalizes a previous model for turbulence simulation to ensure reliable tests of AO system performance in realistic working conditions. The proposed method relies on the use of two simulation models: First, the part of turbulence that shows a coherent flow at short time scales is simulated by means of a multiscale autoregressive-moving average model, which allows to efficiently simulate (with computational complexity O(n)) the coherent evolution of the turbulence. Secondly, an approach similar to that considered for dynamic textures, is used to simulate aberrations caused by processes that evolve on much longer time scales. The proposed procedure is tested on simulations.

Motivated by the increasing importance of Adap- tive Optics (AO) systems for improving the real resolution of large ground telescopes, and by the need of testing the AO system performance in realistic working conditions, in this paper we address the problem of simulating the turbulence effect on ground telescope observations at high resolution. The multiscale approach presented here generalizes that in [3]: First, a relevant computational time reduction is obtained by exploiting a local spatial principal component analysis (PCA) representation of the turbulence. Furthermore, differently from [3], the turbulence at low resolution is modeled as a moving average (MA) process. While in [3] the wind velocity was restricted to be directed along one of the two spatial axes, the approach proposed here allows to evolve the turbulence indifferently in all the directions. In our simulations the pro- posed procedure reproduces with good accuracy the theoretical statistical characteristics of the turbulent phase.

Motivated by the increasing importance of adaptive optics (AO) systems for improving the real resolution of large ground telescopes, and by the need of testing the AO system performance in realistic working conditions, in this paper we address the problem of simulating the turbulence effect on ground telescope observations at high resolution. The procedure presented here generalizes the multiscale stochastic approach introduced in our earlier paper [Appl. Opt. 50, 4124 (2011)], with respect to the previous solution, a relevant computational time reduction is obtained by exploiting a local spatial principal component analysis (PCA) representation of the turbulence. Furthermore, the turbulence at low resolution is modeled as a moving average (MA) process, while previously [Appl. Opt. 50, 4124 (2011)] the wind velocity was restricted to be directed along one of the two spatial axes, the use of such MA model allows the turbulence to evolve indifferently in all the directions. In our simulations, the proposed procedure reproduces the theoretical statistical characteristics of the turbulent phase with good accuracy.

We revisit the classic slow coherency and area
aggregation approach to model reduction in power networks.
The slow coherency approach is based on identifying sparsely
and densely connected areas of a network, within which
all generators swing coherently. A time-scale separation and
singular perturbation analysis then results in a reduced loworder
system, where coherent areas are collapsed into aggregate
variables. Here, we study the application of slow coherency
and area aggregation to first-order consensus systems and
second-order power system swing dynamics. We unify different
theoretic approaches and ideas found throughout the literature,
we relax some technical assumptions, and we extend existing
results. In particular, we provide a complete analysis of the
second-order swing dynamics – without restrictive assumptions
on the system damping. Moreover, we identify the reduced
aggregate models as generalized first or second-order Laplacian
flows with multiple time constants, aggregate damping and
inertia matrices, and possibly adverse interactions.

Abstract—The aim of this paper is to introduce and characterize
observability and reconstructibility properties for Boolean
networks and Boolean control networks, described according to
the algebraic approach proposed by D. Cheng and co-authors in
the series of papers [3], [6], [7] and in the recent monography
[8]. A complete characterization of these properties, based both
on the Boolean matrices involved in the network description and
on the corresponding digraphs, is provided. Finally, the problem
of state observer design for reconstructible BNs and BCNs is
addressed, and two different solutions are proposed.

In large ground telescopes the Adaptive Optics (AO) system aims at compensating the atmosphere effect on telescope measurements, and, the use of optimal filtering is fundamental for such task. This work is motivated by two important characteristics of new AO systems: on one hand, because of the request of very high measurement resolutions, the size of new telescopes, and of their sensors, is quickly increasing in the last decades, thus imposing to the AO systems the analysis of larger amount of data. On the other hand, the optimal filter has to be periodically updated according to temporal changes in atmosphere characteristics. Hence, it is of fundamental importance the use of computationally efficient algorithms for the update of the optimal filter gain.
This paper proposes some changes to a recently presented method for the efficient computation, in the frequency domain, of the Kalman gain for large AO systems [15]. The proposed changes, which mainly aim at correcting some issues due to the conversion spatial–frequency domain, and viceversa, allow to compute a better approximation of the optimal Kalman gain, and, consequently, significantly improve the performance of the AO system.

In current and next generation of ground tele- scopes, Adaptive Optics (AO) are employed to overcome the detrimental effects induced by the presence of atmospheric turbulence, that strongly affects the quality of data transmission and limits the actual resolution of the overall system. The analysis as well as the prediction of the turbulent phase affecting the light wavefront is therefore of paramount importance to guarantee the effective performance of the AO solution.
In this work, a layered model of turbulence is proposed, based on the definition of a Markov-Random-Field whose pa- rameters are determined according to the turbulence statistics. The problem of turbulence estimation is formalized within the stochastic framework and conditions for the identifiability of the turbulence structure (numbers of layers, energies and velocities) are stated. Finally, an algorithm to allow the layer detection and characterization from measurements is designed. Numerical simulations are used to assess the proposed procedure and validate the results, confirming the validity of the approach and the accuracy of the detection.

In this note we rst characterize the periodic trajectories (or, equivalently, the limit cycles) of a Boolean network, and their global attractiveness. We then investigate under which conditions all the trajectories of a Boolean control network may be forced to converge to the same periodic trajectory. If every trajectory can be driven to such a periodic trajectory, this is possible by means of a feedback control law.

Following the completion in May 2011 of the shutdown for the installation of the beryllium wall and the tungsten divertor, the first set of JET campaigns have addressed the investigation of the retention properties and the development of operational scenarios with the new plasma-facing materials. The large reduction in the carbon content (more than a factor ten) led to a much lower Z_eff (1.2–1.4) during L- and H-mode plasmas, and radiation during the burn-through phase of the plasma initiation with the consequence that breakdown failures are almost absent. Gas balance experiments have shown that the fuel retention rate with the new wall is substantially reduced with respect to the C wall. The re-establishment of the baseline H-mode and hybrid scenarios compatible with the new wall has required an optimization of the control of metallic impurity sources and heat loads. Stable type-I ELMy H-mode regimes with H_98,y2 close to 1 and ?_N ~ 1.6 have been achieved using gas injection. ELM frequency is a key factor for the control of the metallic impurity accumulation. Pedestal temperatures tend to be lower with the new wall, leading to reduced confinement, but nitrogen seeding restores high pedestal temperatures and confinement. Compared with the carbon wall, major disruptions with the new wall show a lower radiated power and a slower current quench. The higher heat loads on Be wall plasma-facing components due to lower radiation made the routine use of massive gas injection for disruption mitigation essential.

Smart management of maintenances has become fundamental in manufacturing environments in order to decrease downtime and costs associated with failures. Predictive Maintenance (PdM) systems based on Machine Learning (ML) techniques have the possibility with low added costs of drastically decrease failures-related expenses; given the increase of availability of data and capabilities of ML tools, PdM systems are becoming really popular, especially in semiconductor manufacturing. A PdM module based on Classification methods is presented here for the prediction of integral type faults that are related to machine usage and stress of equipment parts. The module has been applied to an important class of semiconductor processes, ion-implantation, for the predictionof ion-source tungsten filament breaks. The PdM has been tested on a real production dataset.

Tissue engineering of autologous lung tissue aims to become a therapeutic alternative to transplantation. Efforts published so far in creating scaffolds have used harsh decellularization techniques that damage the extracellular matrix (ECM), deplete its components and take up to 5 weeks to perform. The aim of this study was to create a lung natural acellular scaffold using a method that will reduce the time of production and better preserve scaffold architecture and ECM components. Decellularization of rat lungs via the intratracheal route removed most of the nuclear material when compared to the other entry points. An intermittent inflation approach that mimics lung respiration yielded an acellular scaffold in a shorter time with an improved preservation of pulmonary micro-architecture. Electron microscopy demonstrated the maintenance of an intact alveolar network, with no evidence of collapse or tearing. Pulsatile dye injection via the vasculature indicated an intact capillary network in the scaffold. Morphometry analysis demonstrated a significant increase in alveolar fractional volume, with alveolar size analysis confirming that alveolar dimensions were maintained. Biomechanical testing of the scaffolds indicated an increase in resistance and elastance when compared to fresh lungs. Staining and quantification for ECM components showed a presence of collagen, elastin, GAG and laminin. The intratracheal intermittent decellularization methodology could be translated to sheep lungs, demonstrating a preservation of ECM components, alveolar and vascular architecture. Decellularization treatment and methodology preserves lung architecture and ECM whilst reducing the production time to 3 h. Cell seeding and in vivo experiments are necessary to proceed towards clinical translation.

We consider the problem of controlling two agents with competitive objectives. Agents are modelled as linear discrete time systems, and collect each other’s state information without delays. The competitive problem is  formulated in a receding horizon framework, where each agent’s controllers are computed by minimizing a linear, quadratic cost function which depends on both agents’ states. The two agents specify their state tracking objective in a coordinated or competitive manner. We do not consider state constraints. The simplicity of our framework allows us to provide the following results analytically: 1) When agents compete, their states converge to an equilibrium trajectory where the steady state tracking error is finite. 2) Limit-cycles cannot occur. Numerical simulations and experiments done with a LEGO mindstorm multiagent platform match our analytical results.

The integration of renewable energy sources in power systems requires a well-balanced
control to guarantee system stability in view of fast
uctuating power injections. We present
several conditions on the stability reserve of a power system in terms of the region of attraction
of its steady state that can be used to design and evaluate such controllers. The power system
is modeled by coupled swing equations. The region of attraction of this nonlinear systems is
determined based on Lyapunov theory and Barbalat's lemma. The resulting conditions provide
both 2-norm and 1-norm regions of attractions. The dierent conditions dier, e.g., in their
conservatism and in the required knowledge of the power system parameters.

In this work the design and implementation of an application to track multiple agents in a indoor Wireless Sensor Actor Network (WSAN) is proposed. We developed a tracking algorithm that falls into the category of the radio frequency localization/tracking methods, that exploit the strength of the wireless communications among fixed and mobile agents to establish the position of the mobile ones. The algorithm resorts to an Extended Kalman Filter to process the agents measurements and reach a desired level of tracking performance. The tracking application, namely Teseo, is composed by a low-level NesC management software for the agents side and a Java graphical interface provided to users connected to mobile agents. A detailed description of the operations performed by Teseo is given, accompanied both by simulations to validate the tracking algorithm and experiments on a real testbed to test Teseo.

Measurements of large ground telescopes are af- fected by the presence of the terrestrial atmospheric turbulence: local changes of the atmospheric refraction index (e.g. due to wind and temperature variations) cause a non flat surface of the wavefront of light beams incoming on the telescope, thus degrading the quality of the observed images. Adaptive Optics (AO) systems are of fundamental importance to reduce such atmospheric influence on ground telescopes and thus to obtain high resolution observations. The goal of the AO system is that of estimating and compensating the atmospheric turbulence effect by properly commanding a set of deformable mirrors.
Because of delays in the closed loop system, the Kalman filter plays an important role in ensuring an effective control perfor- mance by providing good atmosphere predictions. However, the need of periodically updating the Kalman filter gain because of changes in the atmosphere characteristics, the increase of telescopes and sensors resolutions and the high sampling rate impose quite strict restrictions to the computational load for computing the Kalman gain.
Motivated by the above considerations, some strategies have been recently considered in the system theory and astronomical communities for the efficient computation of the Kalman gain for large AO systems. Specifically, this paper presents some changes to a recently proposed procedure: the proposed approach, which exploits some results in the control theory of distributed systems, computes an approximation of the optimal gain in the frequency domain exploiting the spatial homogeneity of the system. Then, the control strategy takes advantage of some information on the turbulent phase dynamic, that is estimated from the turbulence measurements. Performances of the proposed method are investigated in some simulations.

Semiconductor fabrication involves several sequentialprocessing steps with the result that critical productionvariables are often affected by a superposition of affects overmultiple steps. In this paper a Virtual Metrology (VM) systemfor early stage measurement of such variables is presented;the VM system seeks to express the contribution to theoutput variability that is due to a defined observable partof the production line. The outputs of the processed systemmay be used for process monitoring and control purposes. Asecond contribution of this work is the introduction of ElasticNets, a regularization and variable selection technique for themodelling of highly-correlated datasets, as a technique for thedevelopment of VM models. Elastic Nets and the proposed VMsystem are illustrated using real data from a multi-stage etchprocess used in the fabrication of disk drive read/write heads.

In this paper two-dimensional (2D) discrete behaviors, dened on the grid Z+ 
Z and having the time as (rst) independent variable, are investigated. For these behaviors, by
emphasizing the causality notion that is naturally associated with the time variable, we introduce
two new concepts of controllability. Algebraic characterizations of time-controllability and of zero-
time-controllability are provided, and it is shown that behaviors endowed with these properties admit
special decompositions. Next, the dead-beat control (DBC) problem and the concept of admissible
DBC are introduced and related to the zero-time-controllability property. Dierently from what
happens with one-dimensional behaviors, zero-time-controllability does not ensure the existence of
regular DBC's, and stronger algebraic properties need to be imposed on the behavior. Finally,
necessary and sucient conditions for the existence of a DBC that makes the resulting behavior
both strongly autonomous and nilpotent are provided.

The request for very accurate 3D reconstruction in several applications is leading to the development of very large motion capture systems. A good synchronization of all the cameras in the system is of fundamental importance to guarantee the effectiveness of the 3D reconstruction.
In this work, first, an approximation of the reconstruction error variance taking into account of synchronization errors is derived. Then, a Kalman filter approach is considered to estimate the cameras synchronization errors. The estimated delays can be used to compensate the synchronization error effect on the reconstruction of target positions. The results obtained in some simulations suggest that the proposed strategy allows to obtain a significant reduction of the 3D reconstruction error.

Ion Implantation is one of the most sensitiveprocesses in Semiconductor Manufacturing. It consists inimpacting accelerated ions with a material substrate and isperformed by an Implanter tool. The major maintenanceissue of such tool concerns the breaking of the tungstenfilament contained within the ion source of the tool. Thiskind of fault can happen on a weekly basis, and theassociated maintenance operations can last up to 3 hours.It is important to optimize the maintenance activities bysynchronizing the Filament change operations with otherminor maintenance interventions. In this paper, a PredictiveMaintenance (PdM) system is proposed to tackle such issue;the filament lifetime is estimated on a statistical basisexploiting the knowledge of physical variables acting onthe process. Given the high-dimensionality of the data,the statistical modeling has been based on RegularizationMethods: Lasso, Ridge Regression and Elastic Nets. Thepredictive performances of the aforementioned regularizationmethods and of the proposed PdM module have beentested on actual productive semiconductor data.

Silicon Epitaxial Deposition is a process strongly influenced by wafer temperature behaviour, that has to be constantly monitored to avoid the production of defective wafers. However, temperature measurements are not reliable and the sensors have to be appropriately calibrated with some dedicated procedure. A Predictive Maintenance (PdM) System is proposed here with the aim of predicting process behaviour and scheduling control actions on the sensors in advance. Two different prediction techniques have been employed and compared: the Kalman predictor and the Particle Filter with Gaussian Kernel Density Estimator. The accuracy of the PdM module has been tested on real industrial production datasets.

Mutations in the survival of motor neuron gene (SMN1) are responsible for spinal muscular atrophy (SMA), a fatal neuromuscular disorder. Mice carrying a homozygous deletion of Smn exon 7 directed to skeletal muscle (HSA-Cre, Smn^F7/F7 mice) present clinical features of human muscular dystrophies for which new therapeutic approaches are highly warranted. Herein we demonstrate that tail vein transplantation of mouse amniotic fluid stem (AFS) cells enhances the muscle strength and improves the survival rate of the affected animals. Secondly, after cardiotoxin injury of the Tibialis Anterior, only AFS-transplanted mice efficiently regenerate. Most importantly, secondary transplants of satellite cells (SC) derived from treated mice show that AFS cells integrate into the muscle stem cell compartment, and have long term muscle regeneration capacity indistinguishable from that of wild type-derived SC. This is the first study demonstrating the functional and stable integration of AFS cells into the skeletal muscle, highlighting their value as cell source for the treatment of muscular dystrophies.

Soft Sensors (SSs) are on-line estimators of “hardly to be measured” quantities of a process. The difficultyin measuring can be related to economic or temporal costs that cannot be afforded in a high-intensivemanufacturing production. In semiconductor manufacturing this technology goes with the name of Virtual Metrology(VM) systems. While a lot of efforts in research have been produced in the past years to identify the bestregression algorithms for these statistical modules, small amount of work has been done to develop algorithms fordata clustering of the entire production. This paper contains a new Information Theory-based approach to dataclustering for Virtual Metrology and Soft Sensors; the proposed algorithm allows to automatically split the datasetinto groups to be equally modeled. The proposed approach has been tested on real industrial dataset.

Virtual Metrology (VM) module have become popular in the past years and they are now widely adopted in the semiconductor plants. However, nowadays, still few works have been presented to deal with the interaction between VM and Run-to-Run (R2R), the most common control approach in the fabs. We present in this paper a new strategy to integrate VM with R2R based on Information Theory measure. The proposed control method penalizes statistical measure based on their statistical distance from the physical measure. This new approach also cope with the virtual loop control, where the R2R runs for several process iterations without in-situ measures, but based only on VM predictions. The results are compared with the actual state-of-the-art. 

In fusion devices, the accurate reconstruction of the boundary location and shape from magnetic diagnostics is of paramount importance for the efficient control of the plasma evolution and the safe running of the experiment. In addition to a good and consistent performance in the reconstruction, the task must be performed in real time as the input for the shape controller and more in general for the scenario optimization. To this aim, a statistical procedure for the evaluation of the reconstruction capability of different magnetic sensor sets is presented, which can drive the choice for an optimal set to be used for the reconstruction of plasma location and boundary shape during real time operation. In addition, an algorithm to approximately solve the free boundary problem and estimate the plasma shape starting from the magnetics is devised. Beyond representing a first step towards the definition of a boundary reconstruction code for plasma shape control, this tool is also used to cross validate and confirm the statistical analysis on the diagnostics.

We consider the distributed unconstrained minimization of separable convex costfunctions, where the global cost is given by the sum of several local and private costs, eachassociated to a specific agent of a given communication network. We specifically address anasynchronous distributed optimization technique called Newton-Raphson consensus. Besidehaving low computational complexity, low communication requirements and being interpretableas a distributed Newton-Raphson algorithm, the technique has also the beneficial properties ofrequiring very little coordination and naturally support time-varying topologies. In this workwe analytically prove that under some assumptions it shows local convergence properties, andcorroborate this result by means of numerical simulations.

Semiconductor manufacturing is one of the most technologically advanced industrial sectors. Process quality and control are critical for decreasing costs and increasing yield. The contribution of automatic control and statistical modeling in this area can drastically impact production performance. For this reason in the past decade major collaborative research projects have been undertaken between fab industries and academia in the areas of Virtual Metrology, Predictive Maintenance, Fault Detection, Run-to-Run control and modeling. In this paper we review some this research, discuss its impact on production and highlight current challenges. 

The paper considers the problem of reconstructing a probability density function from a finite set of samples independently drawn from it. We cast the problem in a Bayesian setting where the unknown density is modeled via a nonlinear transformation of a Bayesian prior placed on a Reproducing Kernel Hilbert Space. The learning of the unknown density function is then formulated as a minimum variance estimation problem. Since this requires the solution of analytically intractable integrals, we solve this problem by proposing a novel algorithm based on the Markov chain Monte Carlo framework. Simulations are used to corroborate the goodness of the new approach.

In this paper exponential stabilizability
of continuous-time positive switched systems is in-
vestigated. For two-dimensional systems, exponential
stabilizability by means of a switching control law can
be achieved if and only if there exists a Hurwitz convex
combination of the (Metzler) system matrices. In the
higher dimensional case, it is shown by means of an
example that the existence of a Hurwitz convex combi-
nation is only sufficient for exponential stabilizability,
and that such a combination can be found if and only
if there exists a smooth, positively homogeneous and
co-positive control Lyapunov function for the system.
In the general case, exponential stabilizability ensures
the existence of a concave, positively homogeneous and
co-positive control Lyapunov function, but this is not
always smooth. The results obtained in the first part
of the paper are exploited to characterize exponential
stabilizability of positive switched systems with delays,
and to provide a description of all the “switched equi-
librium points” of an affine positive switched system.

To maintain and organize distributed systems it is necessary to have a certain degree of knowledge of their status like the number of cooperating agents. The estimation of this number, usually referred as the network size, can pose challenging questions when agents' identification information cannot be disclosed, since the exchanged information cannot be associated to who originated it. In this paper we propose a totally distributed network size estimation strategy based on statistical inference concepts that can be applied under anonymity constraints. The scheme is based on the following paradigm: agents locally generate some Bernoulli trials, then distributedly compute averages of these generated data, finally locally compute the Maximum Likelihood estimate of the network size exploiting its probabilistic dependencies with the previously computed averages. In this work we study the statistical properties of this estimation strategy, and show how the probability of returning a wrong evaluation decreases exponentially in the number of locally generated trials. Finally, we discuss how practical implementation issues may affect the estimator, and show that there exists a neat phase transition between insensitivity to numerical errors and uselessness of the results.

We consider the problem of commanding the electronic power interfaces of the microgenerators in a low voltage microgrid for the task of optimal reactive power compensation. In this work, we analyze the convergence of the strategy proposed by Tenti et al. in 2012. The proof of convergence gives some additional insight on the behavior of the algorithm and allows the characterization of its rate of convergence as a function of the microgrid parameters.

Abstract—In this paper the concepts of controllability and
zero-controllability of a variable w, appearing either in a
standard or in a latent variable description (as manifest variable),
are introduced and characterized. By assuming this perspective,
the dead-beat control (DBC) problem is posed as the problem of
designing a controller, involving both w and the latent variable
c, such that, for the resulting controlled behavior, the variable w
goes to zero in a finite number of steps in every trajectory. Zerocontrollability
of w turns out to be a necessary and sufficient
condition for the existence of “admissible” DBC’s as well as for
the existence of regular DBC’s. The class of minimal DBC’s,
namely DBC’s with the least possible number of rows, is singledout
and a parametrization of such controllers is provided. Finally,
a necessary and sufficient condition for the existence of DBC’s
that can be implemented via a feedback law, for which w is
the input and the latent variable c the corresponding output, is
provided.

We consider how a set of collaborating agents can distributedly infer some of theproperties of the communication network that they form. We specifically focus on estimatingquantities that can characterize the performance of other distributed algorithms, namely theeccentricities of the nodes, and the radius and diameter of the network. We propose a strategythat can be implemented in any network, even under anonymity constraints, and has thedesirable properties of being fully distributed, parallel and scalable. We analytically characterizethe statistics of the estimation error, and highlight how the performance of the algorithmdepends on a parameter tuning the communication complexity.

In this paper we address the problem of exploitingthe distributed energy resources (DER) available in a smartmicro-grid to minimize the power distribution losses via optimalreactive power compensation. Due to their typically smallsize, the amount of reactive power provided by each micro-generator is subject to tight saturation constraints. As aconsequence, it might be impossible to achieve convergence tothe global optimum based on algorithms that rely on short-range, gossip-type communication. We therefore propose arandomized multi-hop protocol that guarantees convergence ofthe distributed optimization algorithm also when only short-range communications are possible, at the expense of someadditional communication overhead.

In this paper we focus on collaborative wireless sensor networks, where agents are randomly distributed over a region of interest and collaborate to achieve a common estimation goal. In particular, we introduce two consensus-based distributed linear estimators. The first one is designed for a Bayesian scenario, where an unknown common finite-dimensional parameter vector has to be reconstructed,  while the second one  regards the nonparametric reconstruction of an unknown function sampled at different locations by the sensors. Both of the algorithms are characterized in terms of the trade-off between estimation performance, communication, computation and memory complexity. In the finite-dimensional setting, we derive mild sufficient conditions which ensure that distributed estimator performs better than the local optimal ones in terms of estimation error variance. In the nonparametric setting, we introduce an on-line algorithm that allows the agents both to compute the function estimate with small computational, communication and data storage efforts, and to quantify its distance from the centralized estimate given by a Regularization Network, one of the most powerful regularized kernel methods. These results are obtained by deriving bounds on the estimation error that provide insights on how the uncertainty inherent in a sensor network, such as imperfect knowledge on the number of agents and the measurement models used by the sensors, can degrade the performance of the estimation process. Numerical experiments are included to support the theoretical findings.

We consider the problem of estimating the size of dynamic anonymous networks, motivated by network maintenance. The proposed algorithm is based on max-consensus information exchange protocols, and extends a previous algorithm for static anonymous networks. A regularization term is accounting for a-priori assumptions on the smoothness of the estimate, and we specifically consider quadratic regularization terms since they lead to closed-form solutions and intuitive design laws. We derive an explicit estimation scheme for a particular peer-to-peer service network, starting from its statistical model. To validate the accuracy of the algorithm, we perform numerical experiments and show how the algorithm can be implemented using finite precision arithmetics as well as small communication burdens.

A new boundary reconstruction procedure is presented and validated against ITER nominal equilibria. An approxima- tion of the plasma with an equivalent filamentary current model is employed, which is computed iteratively and allows to describe a wide variety of plasma current distributions (from the peaked ones, to the pedestal current ones). One of the specific features of the procedure is how the filaments are switched on and how the total current is distributed over the entire set, being the filaments independently considered: this allows more degrees of freedom to the model to adapt to particular current distributions, yielding better performances with a negligible additional computational burden. The code also implements a special points search making it well suited for both diverted (be they top or bottom x-point) and limiter configurations. In addition also the reconstruction in presence of noise has been explored.

A new boundary reconstruction procedure is presented and validated against ITER nominal equilibria. An approximation of the plasma with an equivalent filamentary current model is employed, which is computed iteratively and allows to describe a wide variety of plasma current distributions (from the peaked ones, to the pedestal current ones). One of the specific features of the procedure is how the filaments are switched on and how the total current is distributed over the entire set, being the filaments independently considered: this allows more degrees of freedom to the model to adapt to particular current distributions, yielding better performances with a negligible additional computational burden. The code also implements a special points search making it well suited for both diverted (be they top or bottom x-point) and limiter configurations. In addition also the reconstruction in presence of noise has been explored.

Many modeling problems require to estimate ascalar output from one or more time series. Such problemsare usually tackled by extracting a fixed number of featuresfrom the time series (like their statistical moments), with aconsequent loss in information that leads to suboptimal predictivemodels. Moreover, feature extraction techniques usuallymake assumptions that are not met by real world settings (e.g.uniformly sampled time series of constant length), and failto deliver a thorough methodology to deal with noisy data.In this paper a methodology based on functional learningis proposed to overcome the aforementioned problems; theproposed Supervised Aggregative Feature Extraction (SAFE)approach allows to derive continuous, smooth estimates oftime series data (yielding aggregate local information), whilesimultaneously estimating a continuous shape function yieldingoptimal predictions. The SAFE paradigm enjoys severalproperties like closed form solution, incorporation of first andsecond order derivative information into the regressor matrix,interpretability of the generated functional predictor and thepossibility to exploit Reproducing Kernel Hilbert Spaces settingto yield nonlinear predictive models. Simulation studies areprovided to highlight the strengths of the new methodology withrespect to standard unsupervised feature selection approaches.

In semiconductor manufacturing plants, monitoringphysical properties of all wafers is fundamental in order tomaintain good yield and high quality standards. However, suchan approach is too costly and in practice only few wafers in a lotare actually monitored. Virtual Metrology (VM) systems allowto partly overcome the lack of physical metrology. In a VMscheme, tool data are used to predict, for every wafer, metrologymeasurements. In this paper, we present a VM system for aChemical Vapor Deposition (CVD) process. On the basis ofthe available metrology results and of the knowledge, for everywafer, of equipment variables, it is possible to predict CVDthickness. In this work we propose a VM module based onLARS to overcome the problem of high dimensionality andmodel interpretability. The proposed VM models have beentested on industrial production data sets.

In this paper we study the problem of real-time optimal distributed partitioning for perimeter patrolling in the context of multi-camera networks for surveillance. The objective is to partition a given segment into non-overlapping sub-segments, each assigned to a different camera to patrol. Each camera has both physical mobility range and limited speed, and it must patrol its assigned sub-segment by sweeping it back and forth at maximum speed. Here we first review the solution for the centralized optimal partitioning. Then we propose two different distributed control strategies to determine the extremes of the optimal patrolling areas of each camera. Both these strategies require only local communication with the neighboring cameras but adopt different communication schemes, respectively, symmetric gossip and asynchronous asymmetric broadcast. The first scheme is shown to be provably convergent to the optimal solution. Some theoretical insights are provided also for the second scheme whose effectiveness is validated through numerical simulations.

In this work the design and implementation of an application to track multiple agents in a indoor Wireless Sensor Actor Network (WSAN) is proposed. The adopted embedded hardware for the network nodes is theTmote Sky, an ultra low power IEEE 802.15.4 compliant wireless device, which has become a reference in the academia for the early development of algorithms and applications for Wireless Sensor Actor Networks (WSANs). These devices are based on the TinyOS operative system and are programmed in NesC a C-derived language specifically developed for embedded systems. NesC has become indispensable for low-level management ofindividual agents while Java was chosen to provide the user with a simple and intuitive graphical interface with whom showing and coordinating the tracking.

In this work an algorithm to track multiple agents in an indoor Wireless Sensor Actor Network (WSAN) is proposed. The algorithm falls into the category of the radio frequency localization methods, since it exploits the strength of the wireless communications among nodes to establish the position of a set of mobile nodes within a network of fixed nodes placed in known locations. In this sense, a radio channel model is introduced that allows to estimate the distances among nodes to attain localization and tracking (range-based approach). Moreover, to compensate for the scant robustness of power measurements, the loss effects induced by wireless communication,the intrinsic uncertainty of unstructured environments, the algorithm resorts to an Extended Kalman Filter to process the node measurements and reach a desired level of localization performance. Finally, the design phase is validated through the implementation and the experiments on a real testbed.

In this work we consider a multidimensional distributed optimization technique that is suitable for multiagents systems subject to limited communication connectivity. In particular, we consider a convex unconstrained additive problem, i.e. a case where the global convex unconstrained multidimensional cost function is given by the sum of local cost functions available only to the specific owning agents. We show how, by exploiting the separation of time-scales principle,the multidimensional consensus-based strategy approximates a Newton-Raphson descent algorithm. We propose two alternative optimization strategies corresponding to approximations of the main procedure. These approximations introduce tradeoffs between the required communication bandwidth and the convergence speed/accuracy of the results. We provide analytical proofs of convergence and numerical simulations supporting the intuitions developed through the paper.

In semiconductor manufacturing, state of the art for wafer quality control relies on product monitoring and feedback control loops; the involved metrology operations, performed by means of scanning electron microscopes, are particularly cost-intensive and time-consuming. For this reason, it is not possible to evaluate every wafer: in common practice, a small subset of a productive lot is measured at the metrology station and devoted to represent the whole lot. Virtual Metrology (VM) methodologies are able to obtain reliable predictions of metrology results at process time, without actually performing physical measurements; this goal is usually achieved by means of statistical models, linking process data and context information to target measurements. Since semiconductor manufacturing processes involve a high number of sequential operations, it is reasonable to assume that the quality features of a certain wafer (such as layer thickness, critical dimensions, electrical test results) depend on the whole processing and not only on the last step before measurement. In this paper, we investigate the possibilities to improve the Virtual Metrology quality relying on knowledge collected from previous process steps. We will present two different scheme of multistep VM, along with dataset preparation indications; special consideration will be reserved to regression techniques capable of handling high dimensional input spaces. The proposed multistep approaches will be tested against actual data from semiconductor manufacturing industry. 

This paper considers the problem of simulating the turbulence effect on ground telescope observations. The approach presented here is an evolution of a recently proposed approach [3]. The main contributions with respect to [3] are: First, the Haar transform at the basis of the multiscale model in [3] is shown to be equivalent to a local PCA representation. This equivalence allows to reduce the computational complexity of the simulation algorithm by neglecting the components in the signal with lower energy. Furthermore, the simulation of nonstationary turbulence is obtained by properly changing the values of the multiscale model: Such change is eased by the invariance of the PCA spatial basis with respect to the change of turbulence statistical characteristics. The proposed approach is validated by means of some simulations.

In this paper we consider a supervisory control scheme for non-homogenous multi-agent systems. Each
agent is modeled through an independent strictly proper SISO state space model, and the supervisory
controller, representing the information exchange among the agents, is implemented in turn via a linear
state-space model. Controllability and observability of the overall system are characterized, and some
preliminary results about stability and stabilizability are provided. The paper extends to non-homogenous
multi-agent systems some of the results obtained in Hara et al. (2007, 2009) [4,5,7] for the homogenous
case.

This paper reviews a number of recent results dealing with the zeros of rational  transfer functions, and including transfer functions of blocked discrete-time systems having more than one underlying sampling period.  A non-square system which is finite-dimensional, linear and time-invariant generically has  no zeros; in contrast, for a square system, generically all zeros will be distinct, finite and simple.  For  systems subjected to loss of some output values, so that with inputs  every T seconds,  some outputs available every T seconds and others only available every NT seconds, a blocked transfer function can be constructed. Similar conclusions hold, save that special attention nis needed for zeros at 0 and infinity.  The multi-frequency results are potentially very important in econometric modelling, where different time-series are available at different frequencies, e.g. monthly and quarterly, and offer the possibility of great simplification in the associated identification problem.

Geometric triangulation is at the basis of the estimation of the 3D position of a target from a set of camera measurements. The problem of optimal estimation (minimizing the L2 norm) of the target position from multi-view perspective projective measurements is typically a hard problem to solve. In literature there are different types of algorithms for this purpose, based for example on the exhaustive check of all the local minima of a proper eigenvalue problem [2], or branch- and-bound techniques [3]. However, such methods typically become unfeasible for real time applications when the number of cameras and targets become large, calling for the definition of approximate procedures to solve the reconstruction problem.
In the first part of this paper, linear (fast) algorithms, computing an approximate solution to such problems, are described and compared in simulation. Then, in the second part, a Gaussian approximation to the measurement error is used to express the reconstruction error’s standard deviation as a function of the position of the reconstructed point. An upper bound, valid over all the target domain, to this expression is obtained for a case of interest. Such upper bound allows to compute a number of cameras sufficient to obtain a user defined level of position estimation accuracy.

Epitaxy is a process strongly dependent onwafer temperature. Unfortunately, the performance ofthe pyrometers in charge of sensing wafer temperaturedeteriorate with the usage. This represents the majormaintenance issue for epitaxy process engineers who haveto frequently calibrate pyrometers emissivity coefficient. Atthe present state the change of the emissivity coefficient isheuristically based on fab tradition and process engineersexperience. We present a statistical tool to map therelationship between change in the temperature readingsand emissivity adjustments. The module has been testedon real industrial dataset.

This paper proposes a real-time distributed algorithm for a team of smart camerasto self-organize and perform video surveillance of an open boundary. In particular, our algorithmsimultaneously partitions the boundary among the cameras, and synchronizes the motion of thecameras to optimize the surveillance performance. We focus on the detection of smart intruders,who are aware of the cameras configuration at each time instant, and who schedule their motionto avoid detection for as long as possible. We consider both the worst-case and the averagedetection times of smart intruders. Our algorithm achieves minimum worst-case detection time,and, under some reasonable assumptions, constant-factor optimal average detection time.

In this paper we consider the class of discretetime
switched systems switching between p autonomous positive
subsystems. First, sufficient conditions for testing stability, based
on the existence of special classes of common Lyapunov functions,
are investigated, and these conditions are mutually related, thus
proving that if a linear copositive common Lyapunov function can
be found, then a quadratic positive definite common function can
be found, too, and this latter, in turn, ensures the existence of a
quadratic copositive common function. Secondly, stabilizability
is introduced and characterized. It is shown that if these
systems are stabilizable, they can be stabilized by means of a
periodic switching sequence, which asymptotically drives to zero
every positive initial state. Conditions for the existence of statedependent
stabilizing switching laws, based on the values of a
copositive (linear/quadratic) Lyapunov function, are investigated
and mutually related, too.
Finally, some properties of the patterns of the stabilizing
switching sequences are investigated, and the relationship between
a sufficient condition for stabilizability (the existence of
a Schur convex combination of the subsystem matrices) and an
equivalent condition for stabilizability (the existence of a Schur
matrix product of the subsystem matrices) is explored.

We consider the convergence rates of two peculiar2 convex optimization strategies in the context of multi agent3 systems, namely the Newton-Raphson consensus optimization4 and a distributed Gradient-Descent opportunely derived from5 the first. To allow analytical derivations, the convergence6 analyses are performed under the simplificative assumption of7 quadratic local cost functions. In this framework we derive8 sufficient conditions which guarantee the convergence of the9 algorithms. From these conditions we then obtain closed form10 expressions that can be used to tune the parameters for11 maximizing the rate of convergence. Despite these formulae12 have been derived under quadratic local cost functions13 assumptions, they can be used as rules-of-thumb for tuning14 the parameters of the algorithms in general situations.

Nowadays, the adaptive optics (AO) system is of fundamental importance to reduce the effect of atmospheric turbulence on the images formed on large ground telescopes. In this paper the AO system takes advantage of the knowledge of the current turbulence characteristics, that are estimated by data, to properly control the deformable mirrors. The turbulence model considered in this paper is based on two assumptions: considering the turbulence as formed by a discrete set of layers moving over the telescope lens, and each layer is modeled as a Markov-Random-Field. The proposed Markov-Random-Field approach is exploited for estimating the layers’ characteristics. Then, a linear predictor of the turbulent phase, based on the computed information on the turbulence layers, is constructed. Since scalability and low computational complexity of the control algorithms are important requirements for real AO systems, the computational complexity properties of the proposed model are investigated. Interestingly, the proposed model shows a good scalability and an almost linear computational complexity thanks to its block diagonal structure. Performances of the proposed method are investigated by means of some simulations.

We considered the problem of minimizing reactive power flows in a smart microgrid. First we modeled this problem as a linearly constrained quadratic optimization, in which the decision variables are the amount of reactive power that compensators inject into the network. Then, we designed a distributed algorithm in which agents are clustered into overlapping subsets, according to a given communication graph that allows them to coordinate and to exchange information. At each time, one subset is triggered, and agents belonging to it update their states in order to minimize the reactive power flows on the grid. We showed that, by sensing the network at their points of connection, agents can perform this minimization with just the data that they can gather from the other agents belonging to the subset. We characterized convergence of this algorithm in term of conditions on the subsets and on the randomized triggering sequence. Moreover, we studied the rate of convergence, obtaining also a convenient upper bound. We finally analyzed the rate of convergence for some specic topologies of the grid and for some choices of the agents communication topologies.

We consider the scenario of a low voltage microgrid populated by a number of distributed microgenerators. We focus on the problem of obtaining a dynamic model that describes the input-output relation between complex power commands sent to the microgenerator inverters and the voltage measurements across the network. Such a model is intended as a necessary tool in the design of distributed and centralized control algorithms for the provision of ancillary services in the power distribution grid. Because this model is to be used for the design of such algorithms, we look for an analytical derivation instead of a simulative tool. The proposed model is linear and explicitly contains the network parameters and topology. Simulation shows how the proposed model approximates well the behavior of the original nonlinear system.

Simulating the turbulence effect on ground telescope observations is of fundamental importance for the design and test of suitable control algorithms for adaptive optics systems. In this paper we propose a multiscale approach for efficiently synthesizing turbulent phases at very high resolution. First, the turbulence is simulated at low resolution, taking advantage of a previously developed method for generating phase screens. Then, high-resolution phase screens are obtained as the output of a multiscale linear stochastic system. The multiscale approach significantly improves the computational efficiency of turbulence simulation with respect to recently developed methods. Furthermore, the proposed procedure ensures good accuracy in reproducing the statistical characteristics of the turbulent phase.

Silicon Epitaxial Deposition is a process strongly influenced by wafer temperature behavior, that has to be constantly monitored to avoid the production of defective wafers. A Predictive Maintenance (PdM) System is here proposed with the aim of predicting process behavior and scheduling control actions in advance. Two different prediction techniques have been employed and compared: the Kalman predictor and the Particle Filter with Gaussian Kernel Density Estimator. The accuracy of the PdM module has been tested on real fab data. The proposed approach is flexible and can handle the presence of different recipes on the same equipment.

In semiconductor manufacturing plants, monitoring of all wafers is fundamental in order to maintain good yield and high quality standards. However, this is a costly approach and in practice only few wafers in a lot are actually monitored. With a Virtual Metrology (VM) system it is possible to partly overcome the lack of physical metrology. In a VM scheme, tool data are used to predict, for every wafer, metrology measurements. In this paper, we present a VM system for a Chemical Vapor Deposition (CVD) process. Various data mining techniques are proposed. Due to the huge fragmentation of data derived from CVD's mixed production, several kind of data clustering have been adopted. The proposed models have been tested on real productive industrial data sets.

We consider the problem of optimal reactive power compensation for the minimization of power distribution losses in a smart microgrid. We first propose an approximate model for the power distribution network, which allows us to cast the problem into the class of convex quadratic, linearly constrained, optimization problems.

We also show how this model provides the tools for a distributed approach, in which agents have a partial knowledge of the problem parameters and state, and can only perform local measurements.

Then, we design a randomized, gossip-like optimization algorithm, providing conditions for convergence together with an analytical characterization of the convergence speed. The analysis shows that the best performance can be achieved when we command cooperation among agents that are neighbors in the smart microgrid topology. Numerical simulations are included to validate the proposed model and to confirm the analytical results about the performance of the proposed algorithm.

In this work we study the problem of unconstrained distributed optimization in the context of multi-agents systems subject to limited communication connectivity. In particular we focus on the minimization of a sum of convex cost functions, where each component of the global function is available only to a specific agent and can thus be seen as a private local cost. The agents need to cooperate to compute the minimizer of the sum of all costs. We propose a consensus-like strategy to estimate a Newton-Raphson descending update for the local estimates of the global minimizer at each agent. In particular, the algorithm is based on the separation of time-scales principle and it is proved to converge to the global minimizer if a specific parameter that tunes the rate of convergence is chosen sufficiently small. We also provide numerical simulations and compare them with alternative distributed optimization strategies like the Alternating Direction Method of Multipliers and the Distributed Subgradient Method.

We analyze the problem of data sets reduction

for support vector classification. The work is also motivated

by distributed problems, where sensors collect binary mea-

surements at different locations moving inside an environment

that needs to be divided into a collection of regions labeled in

two different ways. The scope is to let each agent retain and

exchange only those measurements that are mostly informative

for the collective reconstruction of the decision boundary. For

the case of separable classes, we provide the exact conditions

and an efficient algorithm to determine if an element in the

training set can become a support vector when new data arrive.

The analysis is then extended to the non-separable case deriving

a sufficient discardability condition and a general data selection

scheme for classification. Numerical experiments relative to the

distributed problem show that the proposed procedure allows

the agents to exchange a small amount of the collected data to

obtain a highly predictive decision boundary.

We discuss identifiability of dynamic SISO errors-in-variables (EIV) models with white measurement errors. Although this class of models turns out to be generically identifiable, it has been pointed out that in certain circumstances there may be two EIV models which are indistinguishable from external input–output experiments. This lack of (global) identifiability may be prejudicial to identification and needs better understanding. The identifiability conditions found in the literature guarantee uniqueness under certain coprimality assumptions on the (rational) transfer function of the ideal “true” system and the spectral density of the noiseless “true” input. Unfortunately these conditions are not testable since they concern precisely the unknowns of the problem which are not available to the experimenter. We provide new identifiability conditions which are instead expressible in terms of the external description of the observable signals, namely their joint power spectral densities.

Since the last IAEA Conference JET has been in operation for one year with a programmatic focus on the qualification of ITER operating scenarios, the consolidation of ITER design choices and preparation for plasma operation with the ITER-like wall presently being installed in JET. Good progress has been achieved, including stationary ELMy H-mode operation at 4.5?MA. The high confinement hybrid scenario has been extended to high triangularity, lower ?^* and to pulse lengths comparable to the resistive time. The steady-state scenario has also been extended to lower ?^* and ?^* and optimized to simultaneously achieve, under stationary conditions, ITER-like values of all other relevant normalized parameters. A dedicated helium campaign has allowed key aspects of plasma control and H-mode operation for the ITER non-activated phase to be evaluated. Effective sawtooth control by fast ions has been demonstrated with ³He minority ICRH, a scenario with negligible minority current drive. Edge localized mode (ELM) control studies using external n = 1 and n = 2 perturbation fields have found a resonance effect in ELM frequency for specific q₉₅ values. Complete ELM suppression has, however, not been observed, even with an edge Chirikov parameter larger than 1. Pellet ELM pacing has been demonstrated and the minimum pellet size needed to trigger an ELM has been estimated. For both natural and mitigated ELMs a broadening of the divertor ELM-wetted area with increasing ELM size has been found. In disruption studies with massive gas injection up to 50% of the thermal energy could be radiated before, and 20% during, the thermal quench. Halo currents could be reduced by 60% and, using argon/deuterium and neon/deuterium gas mixtures, runaway electron generation could be avoided. Most objectives of the ITER-like ICRH antenna have been demonstrated; matching with closely packed straps, ELM resilience, scattering matrix arc detection and operation at high power density (6.2?MW?m^?2) and antenna strap voltages (42?kV). Coupling measurements are in very good agreement with TOPICA modelling.

This paper presents a counterexample to the conjecture that the semi-explicit Lie-Newmark algorithm is variational. As a consequence the Lie-Newmark method is not well-suited for long-time simulation of rigid body-type mechanical systems. The counterexample consists of a rigid body in a static potential field.

In this paper we study the problem of estimating the channel parameters for a generic wireless sensor network (WSN) in a completely distributed manner, using consensus algorithms. Specifically, we first propose a distributed strategy to minimize the effects of unknown constant offsets in the reading ofthe Radio Strength Signal Indicator (RSSI) due to uncalibrated sensors. Then we show how the computation of the optimal wireless channels parameters, which are the solution of a global least-square optimization problem, can be obtained with a consensus-based algorithm. The proposed algorithms are general algorithms for sensor calibration and distributed least-square parameter identification,and do not require any knowledge on the global topology of the network nor the total number of nodes. Finally, we apply these algorithms to experimental data collected from an indoor wireless sensor network.

We extend several recent results on full-state feedback stabilization and state estimation of PDE–ODE cascades, where the PDEs are either of heat type or of wave type, from the previously considered cases where the interconnections are of Dirichlet type, to interconnections of Neumann type. The Neumann type interconnections constrain the PDE state to be subject to a Dirichlet boundary condition at the PDE–ODE interface, and employ the boundary value of the first spatial derivative of the PDE state to be the input to the ODE. In addition to considering heat-ODE and wave-ODE cascades, we also consider a cascade of a diffusion–convection PDE with an ODE, where the convection direction is “away” from the ODE. We refer to this case as a PDE–ODE cascade with “counter-convection.” This case is not only interesting because the PDE subsystem is unstable, but because the control signal is subject to competing effects of diffusion, which is in both directions in the one-dimensional domain, and counter-convection, which is in the direction that is opposite from the propagation direction of the standard delay (transport PDE) process. We rely on the diffusion process to propagate the control signal through the PDE towards the ODE, to stabilize the ODE.

We consider a distributed system of N agents, on which we define a quadratic optimization problem subject to a linear equality constraint. We assume that the nodes can estimate the gradient of the cost function by measuring the steady state response of the system. Even if the cost function cannot be decoupled into individual terms for the agents, and the linear constraint involves the whole system state, we are able to design a distributed, gradient-driven, algorithm, for the solution of the optimization problem. This algorithm belongs to the class of quasi-Newton methods and requires minimal knowledge of the system to behave fairly well. We proved finite time convergence of the algorithm in its centralized version, and we designed its distributed implementation in the case in which a communication graph is given. In this latter case, the tool of average consensus results to be fundamental for the distribution of the algorithm. As a testbed for the proposed method, we consider the problem of optimal distributed reactive power compensation in smart microgrids.

The distributed estimation of the number of active sensors in a network can be important for estimation and organization purposes. We propose a design methodology based on the following paradigm: some locally randomly generated values are exchanged among the various sensors and thus modified by known consensus-based strategies. Statistical analysis of the a-consensus values allows estimation of the number of participant sensors. The main features of this approach are: algorithms are completely distributed, since they do not require leader election steps; sensors are not requested to transmit authenticative information (for example identificative numbers or similar data), and thus the strategy can be implemented whenever privacy problems arise. After a rigorous formulation of the paradigma we analyze some practical examples, fully characterize them from a statistical point of view, and finally we provide some general theoretical results and asymptotic analyses.

We analyze the asymptotic behavior of discrete-time, Markovian quantum systems with respect to a subspace of interest. Global asymptotic stability of subspaces is relevant to quantum information processing, in particular for initializing the system in pure states or subspace codes. We provide a linear-algebraic characterization of the dynamical properties leading to invariance and attractivity of a given quantum subspace. We then construct a design algorithm for discrete-time feedback control that allows to stabilize a target subspace, proving that if the control problem is feasible, then the algorithm returns an effective control choice. In order to prove this result, a canonical QR matrix decomposition is derived, and also used to establish the control scheme potential for the simulation of open-system dynamics.

We study feedback-controlled, discrete-time quantum Markovian dynamics focusing on pure-state stabilization problem. Assuming that the system is unitarily controllable, and accessible via a given quantum measurement, we explicitly construct a choice of control actions conditioned on the measurement outcome that globally stabilizes the target state for the averaged dynamics. A key step in deriving this result is the definition of a canonical QR decomposition for complex matrices.

Nowadays, wireless communication technologies arebeing employed in an ever increasing number of different appli-cation areas, including industrial environments. Benefits derivingfrom such a choice are manifold and include, among the others, re-duced deployment costs, enhanced flexibility and support for mo-bility. Unfortunately, because of a number of reasons that havebeen largely debated in the literature, wireless systems cannot bethought of as a means able to fully replace wired networks in pro-ductionplants,inparticular,whenreal-timebehaviorisakeyissue.In this paper, an analysis of the real-time performance that canbe achieved in quality-of-service (QoS)-enabled 802.11 networkshas been carried out. In particular, a detailed analysis of latenciesand packet loss ratios for a typical enhanced distributed channelaccess(EDCA)infrastructurewirelesslocalareanetwork(WLAN)is presented, obtained through numerical simulations. A numberof aspects that may affect suitability for the use in control systemshave been taken into account, including the Transmission Oppor-tunity (TXOP) mechanism, the internal architecture of the AP, theuse of a time-division multiple access (TDMA)-based communica-tion scheme as well as the adoption of broadcast communications.

Wind energy is a random, uncontrollable, and highly variable source of energy, which will lead to serious challenges to grid integration at deep penetration levels. It is clear that the current extra-market approach to supporting wind integration (ex: California's Participating Intermittent Renewable Program (PIRP)) will not scale with an increase in installed wind capacity. At these deep penetration levels, forecasting, storage, demand response, and novel market mechanisms all become necessary ingredients to realize the promise of wind energy. In this paper, we examine the interplay between energy storage and market strategies to address the difficulties of wind integration. We attempt to answer the basic question: when faced with uncertainty in future market prices and wind power, how should a scheduling coordinator for a wind power plant exploit the ability to store energy so as to maximize revenue when scheduling wind power in a sequence of nested markets (day-ahead, hour-ahead, and real-time)? The problem is framed as a nonstandard chance-constrained model predictive control (MPC) problem. In formalizing the problem, we develop idealized models for electricity markets, wind energy revenue, energy storage, and the physical wind process. As chance constraints are, in general, nonlinear and difficult to handle in optimization problems, we suggest several stochastic models for wind that lead to tractable computations. This approach provides a contrast to scenario-based techniques for dealing with uncertainty in stochastic optimization problems.

Global asymptotic stabilization of quantum pure states is relevant to chemical process control, quantum cooling, state purification, and is crucial to the initialization of quantum information processing algorithms. We provide a linear-algebraic characterization of discrete-time Markovian dynamics leading to invariance and attractivity of a given quantum state. Assuming that the system is unitarily controllable, and accessible via a given quantum measurement, we provide a condition that that characterize the stabilizable target states. We also argue that if the control problem is feasible, then an effective control choice can be explicitly constructed. The result strongly relies on some remarlable properties of a canonical QR decomposition for complex matrices.

In this paper a distributed clock synchronization algorithm is proposed. The algorithm requires gossip asynchronous communication between the nodes of the network, and because of its proportional-integral (PI) structure it is able to compensate both initial offsets and different clock speeds. Convergence of the algorithm is proved and analysed with respect to the controller parameter, while scalability issues are addressed by simulations.

The paper deals with a Model Predictive Control (MPC) algorithm applied to electrical drives. The main contribution is a comprehensive and detailed description of the controller design process that points out the most critical aspects and gives also some practical hints for implementation. As an example, the MPC is developed for a permanent magnet synchronous motor drive. Speed and current controllers are combined together, including all of the state variables of the system, instead of keeping the conventional cascade structure. This way the controller enforces both the current and the voltage limits. Both simulation and experimental results point out the validity ofthe design procedure and the potentials of the MPC in the electrical drives field.

In this paper we analyze the problem of estimating a function from different noisy data sets collected by spatially distributed sensors and subject to unknown temporal shifts. We propose a novel approach based on non-parametric Gaussian regression and reproducing kernel Hilbert space theory that exploit compact and accurate representations of function estimates. As a first result, suitable minimization of inner products in reproducing kernel Hilbert spaces is used to obtain a novel time delay estimation technique when attention is restricted only to two signals. Then, we derive both a centralized and a distributed estimator to simultaneously identify the unknown function and delays for a generic number of networked sensors subject to a restricted communication graph. Numerical simulations are used to test the effectiveness of the proposed approaches.

The employment of Real-Time Ethernet networks in factory automation systems is rapidly increasing and several commercial products, with different characteristics, are already available from various manufacturers. Most of these networks have been included in both the IEC 61158 and IEC 61784 International Standards that, in addition, define a set of Performance Indicators. In this paper we focus on two popular Real Time Ethernet networks, namely Ethernet POWERLINK and EtherCAT, and we evaluate their performance for a typically deployed factory automation configuration. Specifically, we compute the most relevant performance indicators introduced by IEC 61784 standard and two (purposely defined) additional ones, namely minimum cycle time and jitter, which are suitable for the two networks considered.

In the last years the use of Ethernet as the communication technology for automation systems has been sensibly increasing. In particular, Real-Time Ethernet networks have become widely adopted. In this paper we consider one of the most popular Real-Time Ethernet networks, namely EtherCAT. We firstly provide a short outline of the protocol, along with a description of a simulation model we have developed. Subsequently, we focus on some typical network configurations and provide some insights on their performance by means of both theoretical analysis and numerical simulations.

We study a problem of output feedback stabi-lization of complex-valued reaction-advection-diffusion systems with parametric uncertainties (these systems can also be viewedas coupled parabolic PDEs). Both sensing and actuation are performed at the boundary of the PDE domain and the unknown parameters are allowed to be spatially varying. First, we transform the original system into the form where unknown functional parameters multiply the output, which can be viewed as a PDE analog of observer canonical form. Input and output filters are then introduced to convert a dynamic parametrization of the problem into a static parametrization where a gradient estimation algorithm is used. The control gain is obtained by solving a simple complex-valued integral equation online. The solution of the closed-loop system is shown to be bounded and asymptotically stable around the zero equilibrium. The results are illustrated by simulations.

The paper deals with the Model Predictive Control(MPC) algorithm applied to control a permanent magnet synchronous motor, which is, at present, among the motors with the highest power efficiency and then very attractive for energy-saving applications. Absolute novelty of the proposed MPC is its feature of inherently managing the flux weakening control above base speed.Speed and current controller are combined together, including all the state variables of the system, instead of keeping the conventional cascade structure. This way it is possible to enforce in the controller the current and voltage limits. Simulation and experimental results point out the validity of the design procedure and the powerful capabilities of the MPC in the electrical drives field.

In this paper we study the problem of estimatingthe channel parameters for a generic wireless sensor network(WSN) in a completely distributed manner, using consensusalgorithms. Specifically, we first propose a distributed strategyto minimize the effects of unknown constant offsets in thereading of the Radio Strength Signal Indicator (RSSI) due touncalibrated sensors. Then we show how the computation of theoptimal wireless channels parameters, which are the solutionof a global least-square optimization problem, can be obtainedwith a consensus-based algorithm. The proposed algorithmsare general algorithms for sensor calibration and distributedleast-square parameter identification, and do not require anyknowledge on the global topology of the network nor thetotal number of nodes. Finally, we apply these algorithms toexperimental data collected from an indoor WSN.

A detailed study of position changes of plasma strike points before and after edge localized modes (ELMs) in JET was carried out. A hypothesis being tested is that in an ELM previously closed edge field lines would open up, releasing plasma current and leading to the formation of a new, smaller separatrix. It was observed that after each ELM strike points have shifted a few centimetres towards the plasma centre (up in JET). In some cases a transient (<100?µs), upwards large (>10?cm) jump of strike positions was observed first. It was followed by an equally fast jump down to the shifted strike positions. Such behaviour has not been described in previous computational models of the ELM. Therefore two novel instability mechanisms are presented, which contribute to explain the changes in strike point position: an X-point instability, due to positive toroidal current density at the X-point, and a diamagnetic instability, due to negative inboard toroidal current density.

Recently, two new types of communication networks have become available at the low levels of factory automation systems. Besides fieldbuses, which have been traditionally used since long time, both Real–Time Ethernet (RTE) and wireless networks may now be employed. Consequently, it is envisaged that hybrid configurations using all types of the available communication systems will be even more deployed in the future. In this paper we focus, specifically, on hybrid systems which realize wireless extensions of wired networks. In detail, we address the extension of Ethernet Powerlink, a popular RTE network, by means of the IEEE 802.11 WLAN. We consider two types of extensions based on both bridge and gateway devices. After a discussion concerning the actual implementation of the extensions, we provide some performance figures obtained from both a theoretical analysis and numerical simulations.