8 research outputs found
Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey
This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
Mathematical control of complex systems 2013
Mathematical control of complex systems have already become an ideal research area for control engineers, mathematicians, computer scientists, and biologists to understand, manage, analyze, and interpret functional information/dynamical behaviours from real-world complex dynamical systems, such as communication systems, process control, environmental systems, intelligent manufacturing systems, transportation systems, and structural systems. This special issue aims to bring together the latest/innovative knowledge and advances in mathematics for handling complex systems. Topics include, but are not limited to the following: control systems theory (behavioural systems, networked control systems, delay systems, distributed systems, infinite-dimensional systems, and positive systems); networked control (channel capacity constraints, control over communication networks, distributed filtering and control, information theory and control, and sensor networks); and stochastic systems (nonlinear filtering, nonparametric methods, particle filtering, partial identification, stochastic control, stochastic realization, system identification)
Recommended from our members
Cluster Synchronization Control for Discrete-Time Complex Dynamical Networks: When Data Transmission Meets Constrained Bit Rate
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.National Natural Science Foundation of China; Local Innovative and Research Teams Project of Guangdong Special Support Program; Alexander von Humboldt Foundation of German
Stochastic performance analysis and staged control system designs for space based interferometers
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2003.Includes bibliographical references (p. 219-224).Space based interferometry missions have the potential to revolutionize astrometry, providing observations of unprecedented accuracy. Realizing the full potential of these interferometers poses several significant technological challenges. One of the most significant challenges is regulating the light pathlength, from the collecting telescopes to the combining instrument, with nanometer accuracy, despite the presence of vibration induced by internal and external disturbance sources. Due to the wide range of disturbances that act on the optical instruments, a single actuator with simultaneously large control authority and high bandwidth would be necessary to meet the stabilization requirements. Unfortunately no single actuator can meet these requirements. Therefore, a suite of actuators with overlapping strokes and bandwidths is employed; such a construction is termed a "staged actuation system." The objective in the thesis is to develop "staging control" strategies that specify how to utilize the individual actuators in a staged system to satisfy the stabilization requirements. The first task in the staging control design process is to evaluate how actuator capabilities and constraints affect the system performance. Two analytical techniques, based on stochastic Lyapunov and stochastic linearization methods, are utilized to predict the steady-state, closed-loop performance in the presence of actuator nonlinearities such as saturation and quantization. These nonlinearities can severely restrict the achievable performance, and careful consideration of their effects is vitally important for staged controller designs.(cont.) Using this performance prediction methodology, a control synthesis framework is developed which extends [Eta]-optimization techniques by incorporating the effects of actuator nonlinearities. The newly developed framework is then proposed as a formal synthesis tool for staging controller designs. The proposed technique estimates and can directly shape the probability of saturation of each actuator, and determines optimal "hand-offs" of control authority between the actuators. Due to the [Eta]-setting, the controller designs arise directly as solutions of the corresponding necessary conditions, allowing system design studies to be performed easily and quickly. The proposed staged controllers have been demonstrated to achieve the nanometer level stabilization requirements under the expected disturbance environments for space interferometers. The new synthesis technique is also used to analytically quantify the achievable performance and the sensitivity of a particular staging configuration to the individual actuator parameters (size and bandwidths).by Kuo-Chia Liu.Ph.D
Hardware implementation aspects of polar decoders and ultra high-speed LDPC decoders
The goal of channel coding is to detect and correct errors that appear during the transmission of information. In the past few decades, channel coding has become an integral part of most communications standards as it improves the energy-efficiency of transceivers manyfold while only requiring a modest investment in terms of the required digital signal processing capabilities. The most commonly used channel codes in modern standards are low-density parity-check (LDPC) codes and Turbo codes, which were the first two types of codes to approach the capacity of several channels while still being practically implementable in hardware. The decoding algorithms for LDPC codes, in particular, are highly parallelizable and suitable for high-throughput applications. A new class of channel codes, called polar codes, was introduced recently. Polar codes have an explicit construction and low-complexity encoding and successive cancellation (SC) decoding algorithms. Moreover, polar codes are provably capacity achieving over a wide range of channels, making them very attractive from a theoretical perspective. Unfortunately, polar codes under standard SC decoding cannot compete with the LDPC and Turbo codes that are used in current standards in terms of their error-correcting performance. For this reason, several improved SC-based decoding algorithms have been introduced. The most prominent SC-based decoding algorithm is the successive cancellation list (SCL) decoding algorithm, which is powerful enough to approach the error-correcting performance of LDPC codes. The original SCL decoding algorithm was described in an arithmetic domain that is not well-suited for hardware implementations and is not clear how an efficient SCL decoder architecture can be implemented. To this end, in this thesis, we re-formulate the SCL decoding algorithm in two distinct arithmetic domains, we describe efficient hardware architectures to implement the resulting SCL decoders, and we compare the decoders with existing LDPC and Turbo decoders in terms of their error-correcting performance and their implementation efficiency. Due to the ongoing technology scaling, the feature sizes of integrated circuits keep shrinking at a remarkable pace. As transistors and memory cells keep shrinking, it becomes increasingly difficult and costly (in terms of both area and power) to ensure that the implemented digital circuits always operate correctly. Thus, manufactured digital signal processing circuits, including channel decoder circuits, may not always operate correctly. Instead of discarding these faulty dies or using costly circuit-level fault mitigation mechanisms, an alternative approach is to try to live with certain malfunctions, provided that the algorithm implemented by the circuit is sufficiently fault-tolerant. In this spirit, in this thesis we examine decoding of polar codes and LDPC codes under the assumption that the memories that are used within the decoders are not fully reliable. We show that, in both cases, there is inherent fault-tolerance and we also propose some methods to reduce the effect of memory faults on the error-correcting performance of the considered decoders
Lunar Module/Abort Guidance System /LM/AGS/ design survey. NASA/ERC design criteria program, guidance and control
Abort guidance system for Apollo lunar modul
Recommended from our members
Networked Dynamical Systems: Privacy, Control, and Cognition
Many natural and man-made systems, ranging from thenervous system to power and transportation grids to societies, exhibitdynamic behaviors that evolve over a sparse and complex network. This networked aspect raises significant challenges and opportunities for the identification, analysis, and control of such dynamic behaviors. While some of these challenges emanate from the networked aspect \emph{per se} (such as the sparsity of connections between system components and the interplay between nodal \emph{communication} and network dynamics), various challenges arise from the specific application areas (such as privacy concerns in cyber-physical systems or the need for \emph{scalable} algorithm designs due to the large size of various biological and engineered networks). On the other hand, networked systems provide significant opportunities and allow for performance and robustness levels that are far beyond reach for centralized systems, with examples ranging from the Internet (of Things) to the smart grid and the brain. This dissertation aims to address several of these challenges and harness these opportunities. The dissertation is divided into three parts. In the first part, we study privacy concerns whose resolution is vital for the utility of networked cyber-physical systems. We study the problems of average consensus and convex optimization as two principal distributed computations occurring over networks and design algorithm with rigorous privacy guarantees that provide a \emph{best achievable} tradeoff between network utility and privacy. In the second part, we analyze networks with resource constraints. More specifically, we study three problems of stabilization under communication (bandwidth and latency) limitations in sensing and actuation, optimal time-varying control scheduling problem under limited number of actuators and control energy, and the structure identification problem of under-sensed networks (i.e., networks with latent nodes). Finally in the last part, we focus on the intersection of networked dynamical systems and neuroscience and draw connections between brain network dynamics and two extensively studied but yet not fully understood neuro-cognitive phenomena: goal-driven selective attention and neural oscillations. Using a novel axiomatic approach, we establish these connections in the form of necessary and/or sufficient conditions on the network structure that match the network output trajectories with experimentally observed brain activity
Structure-Preserving Model Reduction of Physical Network Systems
This paper considers physical network systems where the energy storage is naturally associated to the nodes of the graph, while the edges of the graph correspond to static couplings. The first sections deal with the linear case, covering examples such as mass-damper and hydraulic systems, which have a structure that is similar to symmetric consensus dynamics. The last section is concerned with a specific class of nonlinear physical network systems; namely detailed-balanced chemical reaction networks governed by mass action kinetics. In both cases, linear and nonlinear, the structure of the dynamics is similar, and is based on a weighted Laplacian matrix, together with an energy function capturing the energy storage at the nodes. We discuss two methods for structure-preserving model reduction. The first one is clustering; aggregating the nodes of the underlying graph to obtain a reduced graph. The second approach is based on neglecting the energy storage at some of the nodes, and subsequently eliminating those nodes (called Kron reduction).</p