Adaptive Control By Regulation-Triggered Batch Least-Squares Estimation of Non-Observable Parameters

The paper extends a recently proposed indirect, certainty-equivalence, event-triggered adaptive control scheme to the case of non-observable parameters. The extension is achieved by using a novel Batch Least-Squares Identifier (BaLSI), which is activated at the times of the events. The BaLSI guarantees the finite-time asymptotic constancy of the parameter estimates and the fact that the trajectories of the closed-loop system follow the trajectories of the nominal closed-loop system ("nominal" in the sense of the asymptotic parameter estimate, not in the sense of the true unknown parameter). Thus, if the nominal feedback guarantees global asymptotic stability and local exponential stability, then unlike conventional adaptive control, the newly proposed event-triggered adaptive scheme guarantees global asymptotic regulation with a uniform exponential convergence rate. The developed adaptive scheme is tested to a well-known control problem: the state regulation of the wing-rock model. Comparisons with other adaptive schemes are provided for this particular problem.Comment: 29 pages, 12 figure

Segmentation of Fault Networks Determined from Spatial Clustering of Earthquakes

We present a new method of data clustering applied to earthquake catalogs, with the goal of reconstructing the seismically active part of fault networks. We first use an original method to separate clustered events from uncorrelated seismicity using the distribution of volumes of tetrahedra defined by closest neighbor events in the original and randomized seismic catalogs. The spatial disorder of the complex geometry of fault networks is then taken into account by defining faults as probabilistic anisotropic kernels, whose structures are motivated by properties of discontinuous tectonic deformation and previous empirical observations of the geometry of faults and of earthquake clusters at many spatial and temporal scales. Combining this a priori knowledge with information theoretical arguments, we propose the Gaussian mixture approach implemented in an Expectation-Maximization (EM) procedure. A cross-validation scheme is then used and allows the determination of the number of kernels that should be used to provide an optimal data clustering of the catalog. This three-steps approach is applied to a high quality relocated catalog of the seismicity following the 1986 Mount Lewis ($M_l=5.7$) event in California and reveals that events cluster along planar patches of about 2 km$^2$, i.e. comparable to the size of the main event. The finite thickness of those clusters (about 290 m) suggests that events do not occur on well-defined euclidean fault core surfaces, but rather that the damage zone surrounding faults may be seismically active at depth. Finally, we propose a connection between our methodology and multi-scale spatial analysis, based on the derivation of spatial fractal dimension of about 1.8 for the set of hypocenters in the Mnt Lewis area, consistent with recent observations on relocated catalogs

A nonconservative LMI condition for stability of switched systems with guaranteed dwell time

Ensuring stability of switched linear systems with a guaranteed dwell time is an important problem in control systems. Several methods have been proposed in the literature to address this problem, but unfortunately they provide sufficient conditions only. This technical note proposes the use of homogeneous polynomial Lyapunov functions in the non-restrictive case where all the subsystems are Hurwitz, showing that a sufficient condition can be provided in terms of an LMI feasibility test by exploiting a key representation of polynomials. Several properties are proved for this condition, in particular that it is also necessary for a sufficiently large degree of these functions. As a result, the proposed condition provides a sequence of upper bounds of the minimum dwell time that approximate it arbitrarily well. Some examples illustrate the proposed approach. © 2012 IEEE.published_or_final_versio

School District Assessment for Sudden Cardiac Arrest Preparation

A literature review on pediatric sudden cardiac arrest (SCA) suggests that school nurses nationwide are well supported in their responsibilities to manage SCA in school children, despite budget and equipment challenges. In this Masters project, school nurses in a district in the Pacific Northwest completed an online survey to assess their perceptions of personal and organizational preparedness to respond to SCA. As described by the AHA, best practices include: an effective and efficient communication system; coordination, practice, and evaluation of a response plan; risk reduction; training and equipment for CPR and first aid; and in some schools, establishment of an automated external defibrillator (AED) program. Forty-four percent of respondents reported that they have received an adequate amount of resources, support, training and preparation in their school to manage a sudden cardiac arrest event

Towards Aggregating Time-Discounted Information in Sensor Networks

Sensor networks are deployed to monitor a seemingly endless list of events in a multitude of application domains. Through data collection and aggregation enhanced with data mining and machine learning techniques, many static and dynamic patterns can be found by sensor networks. The aggregation problem is complicated by the fact that the perceived value of the data collected by the sensors is affected by many factors such as time, location and user valuation. In addition, the value of information deteriorates often dramatically over time. Through our research, we already achieved some results: A formal algebraic analysis of information discounting, especially affected by time. A general model and two specific models are developed for information discounting. The two specific models formalize exponetial time-discount and linear time-discount. An algebraic analysis of aggregation of values that decay with time exponentially. Three types of aggregators that offset discounting effects are formalized and analyzed. A natural synthesis of these three aggregators is discovered and modeled. We apply our theoretical models to emergency response with thresholding and confirm with extensive simulation. For long-term monitoring tasks, we laid out a theoretical foundation for discovering an emergency through generations of sensors, analysed the achievability of a long-term task and found an optimum way to distribute sensors in a monitored area to maximize the achievability. We proposed an implementation for our alert system with state-of-art wireless microcontrollers, sensors, real-time operating systems and embedded internet protocols. By allowing aggregation of time-discounted information to proceed in an arbitrary, not necessarily pairwise manner, our results are also applicable to other similar homeland security and military application domains where there is a strong need to model not only timely aggregation of data collected by individual sensors, but also the dynamics of this aggregation. Our research can be applied to many real-world scenarios. A typical scenario is monitoring wildfire in the forest: A batch of first-generation sensors are deployed by UAVs to monitor a forest for possible wildfire. They monitor various weather quantities and recognize the area with the highest possibility of producing a fire --- the so-called area of interest (AoI). Since the environment changes dynamically, so after a certain time, the sensors re-identify the AoI. The value of the knowledge they learned about the previous AoI decays with time quickly, our methods of aggregation of time-discounted information can be applied to get update knowledge. Close to depletion of their energy of the current generation of sensors, a new generation of sensors are deployed and inherit the knowledge from the current generation. Through this way, monitoring long-term tasks becomes feasible. At the end of this thesis, we propose some extensions and directions from our current research: Generalize and extend the special classes of Type 1 and Type 2 aggregation operators; Analyze aggregation operator of Type 3 and Type 4, find some special applicable candidates; Data aggregation across consecutive generations of sensors in order to learn about events with discounting that take a long time to manifest themselves; Network implications of various aggregation strategies; Algorithms for implementation of some special classes of aggregators. Implement wireless sensor network that can autonomously learn and recognize patterns of emergencies, predict incidents and trigger alarms through machine learning

Event-based multi-objective filtering for multi-rate time-varying systems with random sensor saturation

summary:This paper focuses on the multi-objective filtering of multirate time-varying systems with random sensor saturations, where both the variance-constrained index and the $H_\infty$ index are employed to evaluate the filtering performance. According to address issues, the high-frequency period of the internal state of the system is nondestructively converted to the low-frequency period, which determined by the measurement devices. Then the saturated output of multiple sensors is modeled as a sector bounded nonlinearity. At the same time, in order to reduce the communication frequency between sensors and filters, a communication scheduling rule is designed by the utilization of an event-triggered mechanism. By means of random analysis technology, the sufficient conditions are given to guarantee the preset $H_\infty$ performance and variance constraint performance indexes of the system, and then the solution of the desired filter is obtained by using linear matrix inequalities. Finally, the validity and effectiveness of the proposed filter scheme are verified by numerical simulation