Topic overview
Map preview
Next steps
Open the full map for clusters, then return here to scan ranked papers and people.
Topic graph
Inspect nearby papers, researchers, institutions and communities without opening a separate graph page.
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Papers in this area
This article provides a short review of some structural results in controlled sensing when the problem is formulated as a partially observed Markov decision process. In particular, monotone value functions, Blackwell dominance and quickest detection are described.
We consider the model reduction problem for linear time-invariant dynamical systems having nonzero (but otherwise indeterminate) initial conditions. Building upon the observation that the full system response is decomposable as a superposition of the response map for an unforced system having nontrivial initial conditions and the response map for a forced system having null initial conditions, we develop a new approach that involves reducing these component responses independently and then combining the reduced responses into an aggregate reduced system response. This approach allows greater flexibility and offers better approximation properties than other comparable methods.
This paper presents the development of an in situ measurement system known as the Debris Resistive Acoustic Grid Orbital Navy/NASA Sensor (DRAGONS). The DRAGONS system is designed to detect impacts caused by particles ranging from 50 micrometers to 1 mm at both low-earth and geostationary orbits. DRAGONS utilizes a combination of low-cost sensor technologies to facilitate accurate measurements and approximations of the size, velocity, and angle of impacting micrometeoroids and orbital debris (MMOD). Two thin layers of kapton sheets with resistive traces are used to detect the changes in resistance that are directly proportional to the impacting force caused by the fast traveling particles. Four polyvinylidene fluoride-based sensors are positioned in the back of each kapton sheet to measure acoustic strain caused by an impact. The electronic hardware module that controls all operations employs a low-power, modular, and compact design that enables it to be installed as a low-resource load on a host satellite. Laboratory results demonstrate that in addition to having the ability to detect an impact event, the DRAGONS system can determine impact location, speed, and angle of impact wit
In this note we consider continuous-time systems x'(t) = A(t) x(t) + B(t) u(t), y(t) = C(t) x(t) + D(t) u(t), as well as discrete-time systems x(t+1) = A(t) x(t) + B(t) u(t), y(t) = C(t) x(t) + D(t) u(t) whose coefficient matrices A, B, C and D are not exactly known. More precisely, all that is known about the systems is their nonzero pattern, i.e., the locations of the nonzero entries in the coefficient matrices. We characterize the patterns that guarantee controllability and observability, respectively, for all choices of nonzero time functions at the matrix positions defined by the pattern, which extends a result by Mayeda and Yamada for time-invariant systems. As it turns out, the conditions on the patterns for time-invariant and for time-varying discrete-time systems coincide, provided that the underlying time interval is sufficiently long. In contrast, the conditions for time-varying continuous-time systems are more restrictive than in the time-invariant case.
The purpose of this article is to illustrate the role of connections and symmetries in the Wheeled Inverted Pendulum (WIP) mechanism - an underactuated system with rolling constraints - popularized commercially as the Segway, and thereby arrive at a set of simpler dynamical equations that could serve as the starting point for more complex feedback control designs. The first part of the article views the nonholonomic constraints enforced by the rolling assumption as defining an Ehresmann connection on a fiber bundle. The resulting equations are the reduced Euler-Lagrange equations, which are identical to the Lagrange d'Alembert equations of motion. In the second part we explore conserved quantities, in particular, nonholonomic momenta. To do so, we first introduce the notion of a symmetry group, whose action leaves both the Lagrangian and distribution invariant. We examine two symmetry groups - $SE (2)$ and $SE(2) \times \mathbb{S}^{1}$. The first group leads to the purely kinematic case while the second gives rise to nonholonomic momentum equations.
Learning from examples is one of the key problems in science and engineering. It deals with function reconstruction from a finite set of direct and noisy samples. Regularization in reproducing kernel Hilbert spaces (RKHSs) is widely used to solve this task and includes powerful estimators such as regularization networks. Recent achievements include the proof of the statistical consistency of these kernel- based approaches. Parallel to this, many different system identification techniques have been developed but the interaction with machine learning does not appear so strong yet. One reason is that the RKHSs usually employed in machine learning do not embed the information available on dynamic systems, e.g. BIBO stability. In addition, in system identification the independent data assumptions routinely adopted in machine learning are never satisfied in practice. This paper provides new results which strengthen the connection between system identification and machine learning. Our starting point is the introduction of RKHSs of dynamic systems. They contain functionals over spaces defined by system inputs and allow to interpret system identification as learning from examples. In both
We consider the problem of multiple sensor scheduling for remote state estimation of multiple process over a shared link. In this problem, a set of sensors monitor mutually independent dynamical systems in parallel but only one sensor can access the shared channel at each time to transmit the data packet to the estimator. We propose a stochastic event-based sensor scheduling in which each sensor makes transmission decisions based on both channel accessibility and distributed event-triggering conditions. The corresponding minimum mean squared error (MMSE) estimator is explicitly given. Considering information patterns accessed by sensor schedulers, time-based ones can be treated as a special case of the proposed one. By ultilizing realtime information, the proposed schedule outperforms the time-based ones in terms of the estimation quality. Resorting to solving an Markov decision process (MDP) problem with average cost criterion, we can find optimal parameters for the proposed schedule. As for practical use, a greedy algorithm is devised for parameter design, which has rather low computational complexity. We also provide a method to quantify the performance gap between the schedule
In this paper we propose a compositional scheme for the construction of abstractions for networks of control systems using the interconnection matrix and joint dissipativity-type properties of subsystems and their abstractions. In the proposed framework, the abstraction, itself a control system (possibly with a lower dimension), can be used as a substitution of the original system in the controller design process. Moreover, we provide a procedure for constructing abstractions of a class of nonlinear control systems by using the bounds on the slope of system nonlinearities. We illustrate the proposed results on a network of linear control systems by constructing its abstraction in a compositional way without requiring any condition on the number or gains of the subsystems. We use the abstraction as a substitute to synthesize a controller enforcing a certain linear temporal logic specification. This example particularly elucidates the effectiveness of dissipativity-type compositional reasoning for large-scale systems.
The dynamical processes taking place on a network depend on its topology. Influencing the growth process of a network therefore has important implications on such dynamical processes. We formulate the problem of influencing the growth of a network as a stochastic optimal control problem in which a structural cost function penalizes undesired topologies. We approximate this control problem with a restricted class of control problems that can be solved using probabilistic inference methods. To deal with the increasing problem dimensionality, we introduce an adaptive importance sampling method for approximating the optimal control. We illustrate this methodology in the context of formation of information cascades, considering the task of influencing the structure of a growing conversation thread, as in Internet forums. Using a realistic model of growing trees, we show that our approach can yield conversation threads with better structural properties than the ones observed without control.
We address the problem of minimal actuator placement in linear systems so that the volume of the set of states reachable with one unit or less of input energy is lower bounded by a desired value. First, following the recent work of Olshevsky, we prove that this is NP-hard. Then, we provide an efficient algorithm which, for a given range of problem parameters, approximates up to a multiplicative factor of O(logn), n being the network size, any optimal actuator set that meets the same energy criteria; this is the best approximation factor one can achieve in polynomial time, in the worst case. Moreover, the algorithm uses a perturbed version of the involved control energy metric, which we prove to be supermodular. Next, we focus on the related problem of cardinality-constrained actuator placement for minimum control effort, where the optimal actuator set is selected to maximize the volume of the set of states reachable with one unit or less of input energy. While this is also an NP-hard problem, we use our proposed algorithm to efficiently approximate its solutions as well.
In this paper, a method is presented for lowering the energy consumption and/or increasing the speed of a standard manipulator spray painting a surface. The approach is based on the observation that a small angle between the spray direction and the surface normal does not affect the quality of the paint job. Recent results in set-based kinematic control are utilized to develop a switched control system, where this angle is defined as a set-based task with a maximum allowed limit. Four different set-based methods are implemented and tested on a UR5 manipulator from Universal Robots. Experimental results verify the correctness of the method, and demonstrate that the set-based approaches can substantially lower the paint time and energy consumption compared to the current standard solution.
The trending integrations of Battery Energy Storage System (BESS, stationary battery) and Electric Vehicles (EV, mobile battery) to distribution grids call for advanced Demand Side Management (DSM) technique that addresses the scalability concerns of the system and stochastic availabilities of EVs. Towards this goal, a stochastic DSM is proposed to capture the uncertainties in EVs. Numerical approximation is then used to make the problem tractable. To accelerate the computational speed, the proposed DSM is tightly relaxed to a convex form using second-order cone programming. Furthermore, in light of the continuous increasing problem size, a distributed method with a guaranteed convergence is applied to shift the centralized computational burden to distributed controllers. To verify the proposed DSM, real-life EV data collected on UCLA campus is used to test the proposed DSM in an IEEE benchmark test system. Numerical results demonstrate the correctness and merits of the proposed approach.
This paper provides an alternative approach to the problem of preparing pure Gaussian states in a linear quantum system. It is shown that any pure Gaussian state can be generated by a cascade of one-dimensional open quantum harmonic oscillators, without any direct interaction Hamiltonians between these oscillators. This is physically advantageous from an experimental point of view. An example on the preparation of two-mode squeezed states is given to illustrate the theory.
The paper describes the robust algorithm for linear time-invariant plants under parametric uncertainties, external disturbances and high-frequency noises in measurements. The proposed algorithm allows one to reduce the noise impact on the output variable of the plant and to compensate parametric uncertainties and external disturbances independently. The modeling results illustrate the effectiveness of the algorithm.
In standard implementations of distributed secondary control for DC MicroGrids (MGs), the exchange of local measurements among neighboring control agents is enabled via off-the-shelf wireless solutions, such as IEEE 802.11. However, Denial of Service (DoS) attacks on the wireless interface through jamming prevents the secondary control system from performing its main tasks, which might compromise the stability of the MG. In this paper, we propose novel, robust and secure secondary control reconfiguration strategy, tailored to counteract DoS attacks. Specifically, upon detecting the impairment of the wireless interface, the jammed secondary control agent notifies its peers via a secure, low-rate powerline channel based on Power Talk communication. This triggers reconfiguration of the wireless communication graph through primary control mode switching, where the jammed agents leave the secondary control by switching to current source mode, and are replaced by nonjammed current sources that switch to voltage source mode and join the secondary control. The strategy fits within the software-defined networking framework, where the network control is split from the data plane using reliab
We consider a two-level discrete-time control framework with real-time constraints where a central controller issues setpoints to be implemented by local controllers. The local controllers implement the setpoints with some approximation and advertize a prediction of their constraints to the central controller. The local controllers might not be able to implement the setpoint exactly, due to prediction errors or because the central controller convexifies the problem for tractability. In this paper, we propose to compensate for these mismatches at the level of the local controller by using a variant of the error diffusion algorithm. We give conditions under which the minimal (convex) invariant set for the accumulated-error dynamics is bounded, and give a computational method to construct this set. This can be used to compute a bound on the accumulated error and hence establish convergence of the average error to zero. We illustrate the approach in the context of real-time control of electrical grids.
We consider a project that consists of activities to be performed in parallel under various temporal constraints, which include start-start, start-finish and finish-start precedence relationships, release times, deadlines, and due dates. Scheduling problems are formulated to find optimal schedules for the project with respect to different objective functions to be minimized, such as the project makespan, the maximum deviation from the due dates, the maximum flow-time, and the maximum deviation of finish times. We represent these problems as optimization problems in terms of tropical mathematics, and then solve them by applying direct solution methods of tropical optimization. As a result, new direct solutions of the scheduling problems are obtained in a compact vector form, which is ready for further analysis and practical implementation. The solutions are illustrated by simple numerical examples.
We propose a novel framework for secure and reliable authentication of Distributed Energy Resources to the centralized secondary/tertiary control system of a DC MicroGrid (MG), networked using the IEEE 802.11 wireless interface. The key idea is to perform the authentication using power talk, which is a powerline communication technique executed by the primary control loops of the power electronic converters, without the use of a dedicated hardware for its modem. In addition, the scheme also promotes direct and active participation of the control system in the authentication process, a feature not commonly encountered in current networked control systems for MicroGrids. The PLECS-based simulations verifies the viability of our scheme.
We consider the stabilization of an unstable discrete-time linear system that is observed over a channel corrupted by continuous multiplicative noise. Our main result shows that if the system growth is large enough, then the system cannot be stabilized in a second-moment sense. This is done by showing that the probability that the state magnitude remains bounded must go to zero with time. Our proof technique recursively bounds the conditional density of the system state (instead of focusing on the second moment) to bound the progress the controller can make. This sidesteps the difficulty encountered in using the standard data-rate theorem style approach; that approach does not work because the mutual information per round between the system state and the observation is potentially unbounded. It was known that a system with multiplicative observation noise can be stabilized using a simple memoryless linear strategy if the system growth is suitably bounded. In this paper, we show that while memory cannot improve the performance of a linear scheme, a simple non-linear scheme that uses one-step memory can do better than the best linear scheme.
We introduce ARES, an efficient approximation algorithm for generating optimal plans (action sequences) that take an initial state of a Markov Decision Process (MDP) to a state whose cost is below a specified (convergence) threshold. ARES uses Particle Swarm Optimization, with adaptive sizing for both the receding horizon and the particle swarm. Inspired by Importance Splitting, the length of the horizon and the number of particles are chosen such that at least one particle reaches a next-level state, that is, a state where the cost decreases by a required delta from the previous-level state. The level relation on states and the plans constructed by ARES implicitly define a Lyapunov function and an optimal policy, respectively, both of which could be explicitly generated by applying ARES to all states of the MDP, up to some topological equivalence relation. We also assess the effectiveness of ARES by statistically evaluating its rate of success in generating optimal plans. The ARES algorithm resulted from our desire to clarify if flying in V-formation is a flocking policy that optimizes energy conservation, clear view, and velocity alignment. That is, we were interested to see if o
Analyzing signals arising from dynamical systems typically requires many modeling assumptions and parameter estimation. In high dimensions, this modeling is particularly difficult due to the "curse of dimensionality". In this paper, we propose a method for building an intrinsic representation of such signals in a purely data-driven manner. First, we apply a manifold learning technique, diffusion maps, to learn the intrinsic model of the latent variables of the dynamical system, solely from the measurements. Second, we use concepts and tools from control theory and build a linear contracting observer to estimate the latent variables in a sequential manner from new incoming measurements. The effectiveness of the presented framework is demonstrated by applying it to a toy problem and to a music analysis application. In these examples we show that our method reveals the intrinsic variables of the analyzed dynamical systems.
This paper presents tracking control laws for two different objectives of a nonholonomic system - a spherical robot - using a geometric approach. The first control law addresses orientation tracking using a modified trace potential function. The second law addresses contact position tracking using a $right$ transport map for the angular velocity error. A special case of this is position and reduced orientation stabilization. Both control laws are coordinate free. The performance of the feedback control laws are demonstrated through simulations.
Many nonlinear systems can be described by a Wiener-Schetzen model. In this model, the linear dynamics are formulated in terms of orthonormal basis functions (OBFs). The nonlinearity is modeled by a multivariate polynomial. In general, an infinite number of OBFs is needed for an exact representation of the system. This paper considers the approximation of a Wiener system with finite-order infinite impulse response dynamics and a polynomial nonlinearity. We propose to use a limited number of generalized OBFs (GOBFs). The pole locations, needed to construct the GOBFs, are estimated via the best linear approximation of the system. The coefficients of the multivariate polynomial are determined with a linear regression. This paper provides a convergence analysis for the proposed identification scheme. It is shown that the estimated output converges in probability to the exact output. Fast convergence rates, in the order $O_p({N_F}^{-n_{rep}/2})$, can be achieved, with $N_F$ the number of excited frequencies and $n_{rep}$ the number of repetitions of the GOBFs.
Smart power grid enables intelligent automation at all levels of power system operation, from electricity generation at power plants to power usage at households. The key enabling factor of an efficient smart grid is its built-in information and communication technology (ICT) that monitors the real-time system operating state and makes control decisions accordingly. As an important building block of the ICT system, power system state estimation is of critical importance to maintain normal operation of the smart grid, which, however, is under mounting threat from potential cyber attacks. In this article, we introduce a graph-based framework for performing cyber-security analysis in power system state estimation. Compared to conventional arithmetic-based security analysis, the graphical characterization of state estimation security provides intuitive visualization of some complex problem structures and enables efficient graphical solution algorithms, which are useful for both defending and attacking the ICT system of smart grid. We also highlight several promising future research directions on graph-based security analysis and its applications in smart power grid.
People in this topic
Researcher
Yang Liu contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
Wei Zhang contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
Wei Chen contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
H. Vincent Poor contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
Yu Zhang contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
Rui Zhang contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
Feng Liu contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
Lei Wang contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
Xin Wang contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
J. Benton contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
Q. Liu contributes to research discovery and scholarly infrastructure.
Open to collaborateResearcher
Wei Liu contributes to research discovery and scholarly infrastructure.
Open to collaborate