Searcharxiv⌕ Search

arXiv subjects

Jing Shuang Li

Publications and source records attributed to Jing Shuang Li.

At least 19 recordsLinked to original sources

Firing Rate Neural Network Implementations of Model Predictive Control

Human and animal brains perform planning to enable complex movements and behaviors, a process that can be effectively described using model predictive control (MPC). How could the brain physically implement MPC? In this work, we translate model predictive controllers into firing rate neural networks, offering insights into the nonlinear neural dynamics that underpin planning. We propose a constructive method; no training is required. This is done first applying the projected gradient method to the dual problem to derive a baseline neural network implementation. We then use factorization and contraction analysis to systematically generate alternative network architectures; in other words, we systematically generate hypotheses for how planning is done in the brain via neural dynamics. Finally, we present numerical simulations to study different neural networks performing MPC to balance an inverted pendulum on a cart (i.e., balancing a stick on a hand), including one example in which imposing sparse connectivity (a property observed in brain networks) does not degrade control performance.

eess.SY↗

An Evolutionary Algorithm for Actuator-Sensor-Communication Co-Design in Distributed Control

This paper studies the co-design of actuators, sensors, and communication in the distributed setting, where a networked plant is partitioned into subsystems with sub-controllers interacting with other sub-controllers. The objective is to jointly minimize control cost (i.e., LQ cost) and material cost (i.e., number of actuators, sensors, and communication links used). We approach this using an evolutionary algorithm that selectively prunes a baseline dense LQR controller, and provide convergence and stability analyses. Our approach is validated in simulations; it substantially outperforms naive pruning (over 80% in most cases), and performs similarly as greedy pruning but with much-improved scalability.

eess.SY↗

Realizations of Linear Systems with Prescribed Sparsity Patterns

This paper solves the following problem: given a transfer function and desired sparsity patterns for its state-space realization, how can we find a realization of the function that adheres to them? While sparse controllers are studied in distributed control, their sparsity patterns are generally designed to match those of the plant. In contrast, we are interested in \textit{arbitrary} sparsity patterns, which are relevant to modeling problems in sensorimotor neuroscience. Though this problem is highly nonconvex, we solve it exactly. We first show that the problem reduces to finding an appropriate similarity transform from the modal realization, which in turn reduces to solving a system of multivariate polynomial equations. We then leverage tools from algebraic geometry (Gröbner basis, moment method) to solve the system. Algorithms are provided for both real- and complex-valued realization problems, and their efficacy is demonstrated on several examples.

eess.SY↗

Distributed Continuous-Time Control via System Level Synthesis

This paper designs H2 and H-infinity distributed controllers with local communication and local disturbance rejection. We propose a two-step procedure: first, select closed-loop poles; then, optimize over parameterized controllers. We build on the system level synthesis (SLS) parameterization -- primarily used in the discrete-time setting -- and extend it to the general continuous-time setting. We verify our approach in simulation on a 9-node grid governed by linearized swing equations, where our distributed controllers achieve performance comparable to that of optimal centralized controllers while facilitating local disturbance rejection.

eess.SY↗

Associative Memory System via Threshold Linear Networks

Humans learn and form memories in stochastic environments. Auto-associative memory systems model these processes by storing patterns and later recovering them from corrupted versions. Here, memories are learned by associating each pattern with an attractor in a latent space. After learning, when (possibly corrupted) patterns are presented to the system, latent dynamics facilitate retrieval of the appropriate uncorrupted pattern. In this work, we propose a novel online auto-associative memory system. In contrast to existing works, our system supports sequential memory formation and provides formal guarantees of robust memory retrieval via region-of-attraction analysis. We use a threshold-linear network as latent space dynamics in combination with an encoder, decoder, and controller. We show in simulation that the memory system successfully reconstructs patterns from corrupted inputs.

eess.SY↗

Identifying Network Structure of Nonlinear Dynamical Systems: Contraction and Kuramoto Oscillators

In this work, we study the identifiability of network structures (i.e., topologies) for networked nonlinear systems when partial measurements of the nodal dynamics are taken. We explore scenarios where different candidate structures can yield similar measurements, thus limiting identifiability. To do so, we apply the contraction theory framework to facilitate comparisons between different networks. We show that semicontraction in the observable space is a sufficient condition for two systems to become indistinguishable from one another based on partial measurements. We apply this framework to study networks of Kuramoto oscillators, and discuss scenarios in which different network structures (both connected and disconnected) become indistinguishable.

eess.SY↗

Identifying Network Structure of Linear Dynamical Systems: Observability and Edge Misclassification

This work studies the limitations of uniquely identifying the structure (i.e., topology) of a networked linear system from partial measurements of its nodal dynamics. In general, many networks can be consistent with these measurements; this is a consideration often neglected by standard network inference methods. We show that the space of these networks are related through the nullspace of the observability matrix for the true network. We establish relevant metrics to investigate this space, including an analytic characterization of the most structurally dissimilar network that can be inferred, as well as the possibility of mis-inferring presence or absence of edges. In simulations, we find that when observing over 6\% of nodes in random network models (e.g., Erd\H os-R\' enyi and Watts-Strogatz), approximately 99\% of edges are correctly classified. Extending this discussion, we construct a family of networks that keep measurements $ε$-close to each other, and connect the identifiability of these networks to the spectral properties of an augmented observability Gramian.

eess.SY↗

Path Integral Bottleneck: An Algorithm-Agnostic Framework of Computation and Control

Executing a control sequence requires computation. While this is a simple observation, developing a framework that relates a controller's required computation to its ability to successfully control a system (e.g. lower control cost) is challenging, especially when the controller appears on alternative compute platforms (e.g. biological neural networks). More specifically, we want a framework where, given an observed closed-loop trajectory, we can quantify the computation effort needed to produce that trajectory. To enable effective comparisons of closed-loop systems across alternative compute platforms, we present the Path Integral Bottleneck (PI-IB), a method to produce an analytical, algorithm-agnostic description of the compute-control relationship. With the PI-IB framework, we can plot tradeoffs between performance and computation effort for any given plant description and control cost function. Simulations of the cart-pole reveal fundamental control-compute tradeoffs, exposing regions where the task performance-per-compute is higher than others.

eess.SY↗

Toward Neuronal Implementations of Delayed Optimal Control

Animal sensorimotor behavior is frequently modeled using optimal controllers. However, it is unclear how the neural circuits within the animal's nervous system implement optimal controller-like behavior. In this work, we study the question of implementing a delayed linear quadratic regulator with linear dynamical "neurons" on a muscle model. We show that for any second-order controller, there are three minimal neural circuit configurations that implement the same controller. Furthermore, the firing rate characteristics of each circuit can vary drastically, even as the overall controller behavior is preserved. Along the way, we introduce concepts that bridge controller realizations to neural implementations that are compatible with known neuronal delay structures.

eess.SY↗

Human Balancing on a Log: A Switched Multi-Layer Controller

We study the task of balancing a human on a log that is fixed in place. Balancing on a log is substantially more challenging than balancing on a flat surface due to increased instability -- nonetheless, we are able to balance by composing simple (e.g., PID, LQR) controllers in a bio-inspired switched multi-layer configuration. The controller consists of an upper-layer LQR planner (akin to the central nervous system) that coordinates ankle and hip torques, and lower-layer PID trackers (akin to local motor units) that follow this plan subject to nonlinear dynamics. The controller switches between three operational modes depending on the state of the human. The efficacy of the controller is verified in simulation, where our controller is able to stabilize the human for a variety of initial conditions and disturbances. We also introduce a controller that outputs muscle activations to perform the same balancing task.

eess.SY↗

Two-Layer Attention Optimization for Bimanual Coordination

Bimanual tasks performed by human agents present unique optimal control considerations compared to cyberphysical agents. These considerations include minimizing attention, distributing attention across two isolated hands, and coordinating the two hands to reach a broader goal. In this work, we propose a two-layer controller that captures these considerations. The upper layer solves an attention distribution problem, while the two lower layer controllers (one per hand) tracks a trajectory using the solution given by the upper layer. We introduce a formulation of the attention controller where attention is a vector that is bound within a hyperbolic feasible region, which is determined by specifications of the task the lower layer controllers. This two-layer controller is used to optimize a single-player game of pong, where the agent must rally the ball between two paddles for as long as possible. We find that adding an attention layer on top of the lower controllers allows the agent to coordinate the left and right hands, which minimizes attention and control effort over the course of the rallying task.

eess.SY↗

Analyzing Fitts' Law using Offline and Online Optimal Control with Motor Noise

The cause of the speed-accuracy tradeoff (typically quantified via Fitts' Law) is a debated topic of interest in motor neuroscience, and is commonly studied using tools from control theory. Two prominent theories involve the presence of signal dependent motor noise and planning variability -- these factors are generally incorporated separately. In this work, we study how well the simultaneous presence of both factors explains the speed-accuracy tradeoff. A human arm reaching model is developed with bio-realistic signal dependent motor noise, and a Gaussian noise model is used to deterministically approximate the motor noise. Both offline trajectory optimization and online model predictive control are used to simulate the planning and execution of several different reaching tasks with varying target sizes and movement durations. These reaching trajectories are then compared to experimental human reaching data, revealing that both models produce behavior consistent with humans, and the speed-accuracy tradeoff is present in both online and offline control. These results suggest the speed-accuracy tradeoff is likely caused by a combination of these two factors, and also that it plays a role in both offline and online computation.

eess.SY↗

A Low Rank Approach to Minimize Sensor-to-Actuator Communication in Finite Horizon Output Feedback

Many modern controllers are composed of different components that communicate in real-time over some network with limited resources. In this work, we are interested in designing a controller that can be implemented with a minimum number of sensor-to-actuator messages, while satisfying safety constraints over a finite horizon. For finite horizon problems, a linear time-varying controller with memory can be represented as a block-lower-triangular matrix. We show that the rank of this matrix exactly captures the minimum number of messages needed to be sent from the sensors to actuators to implement such a controller. Moreover, we introduce a novel matrix factorization called causal factorization that gives the required implementation. Finally, we show that the rank of the controller is the same as the rank of the Youla parameter, enabling the Youla parametrization (or analogous parametrizations) to be used to design the controller, which reduces the overall design problem into a rank minimization one over a convex set. Finally, convex relaxations for rank are used to demonstrate that our approach leads to 20-50% less messages on a simulation than a benchmark method.

eess.SY↗

Global Performance Guarantees for Localized Model Predictive Control

Recent advances in model predictive control (MPC) leverage local communication constraints to produce localized MPC algorithms whose complexities scale independently of total network size. However, no characterization is available regarding global performance, i.e. whether localized MPC (with communication constraints) performs just as well as global MPC (no communication constraints). In this paper, we provide analysis and guarantees on global performance of localized MPC -- in particular, we derive sufficient conditions for optimal global performance in the presence of local communication constraints. We also present an algorithm to determine the communication structure for a given system that will preserve performance while minimizing computational complexity. The effectiveness of the algorithm is verified in simulations, and additional relationships between network properties and performance-preserving communication constraints are characterized. A striking finding is that in a network of 121 coupled pendula, each node only needs to communicate with its immediate neighbors to preserve optimal global performance. Overall, this work offers theoretical understanding on the effect of local communication on global performance, and provides practitioners with the tools necessary to deploy localized model predictive control by establishing a rigorous method of selecting local communication constraints. This work also demonstrates -- surprisingly -- that the inclusion of severe communication constraints need not compromise global performance.

eess.SY↗

Internal feedback in the cortical perception-action loop enables fast and accurate behavior

Animals move smoothly and reliably in unpredictable environments. Models of sensorimotor control have assumed that sensory information from the environment leads to actions, which then act back on the environment, creating a single, unidirectional perception-action loop. This loop contains internal delays in sensory and motor pathways, which can lead to unstable control. We show here that these delays can be compensated by internal feedback signals that flow backwards, from motor towards sensory areas. Internal feedback is ubiquitous in neural sensorimotor systems and recent advances in control theory show how internal feedback compensates internal delays. This is accomplished by filtering out self-generated and other predictable changes in early sensory areas so that unpredicted, actionable information can be rapidly transmitted toward action by the fastest components. For example, fast, giant neurons are necessarily less accurate than smaller neurons, but they are crucial for fast and accurate behavior. We use a mathematically tractable control model to show that internal feedback has an indispensable role in achieving state estimation, localization of function -- how different parts of cortex control different parts of the body -- and attention, all of which are crucial for effective sensorimotor control. This control model can explain anatomical, physiological and behavioral observations, including motor signals in visual cortex, heterogeneous kinetics of sensory receptors and the presence of giant Betz cells in motor cortex, Meynert cells in visual cortex and giant von Economo cells in the prefrontal cortex of humans as well as internal feedback patterns and unexplained heterogeneity in other neural systems.

q-bio.NC↗

Nonlinear System Level Synthesis for Polynomial Dynamical Systems

This work introduces a controller synthesis method via system level synthesis for nonlinear systems characterized by polynomial dynamics. The resulting framework yields finite impulse response, time-invariant, closed-loop transfer functions with guaranteed disturbance cancellation. Our method generalizes feedback linearization to enable partial feedback linearization, where the cancellation of the nonlinearity is spread across a finite-time horizon. This provides flexibility to use the system dynamics to attenuate disturbances before cancellation via control, reducing the cost of control compared with feedback linearization while maintaining guarantees about disturbance rejection. This approach is illustrated on a benchmark example and on a common model for fluid flow control.

math.OC↗

Distributed Robust Control for Systems with Structured Uncertainties

We present D-Phi iteration: an algorithm for distributed, localized, and scalable robust control of systems with structured uncertainties. This algorithm combines the System Level Synthesis (SLS) parametrization for distributed control with stability criteria from L1, LInf, and nu robust control. We show in simulation that this algorithm achieves good nominal performance while greatly increasing the robust stability margin compared to the LQR controller. To the best of our knowledge, this is the first distributed and localized algorithm for structured robust control; furthermore, algorithm complexity depends only on the size of local neighborhoods and is independent of global system size. We additionally characterize the suitability of different robustness criteria for distributed and localized computation.

math.OC↗

Internal Feedback in Biological Control: Diversity, Delays, and Standard Theory

Neural architectures in organisms support efficient and robust control that is beyond the capability of engineered architectures. Unraveling the function of such architectures is challenging; their components are highly diverse and heterogeneous in their morphology, physiology, and biochemistry, and often obey severe speed-accuracy tradeoffs; they also contain many cryptic internal feedback pathways (IFPs). We claim that IFPs are crucial architectural features that strategically combine highly diverse components to give rise to optimal performance. We demonstrate this in a case study, and additionally describe how sensing and actuation delays in standard control (state feedback, full control, output feedback) give rise to independent and separable sources of IFPs. Our case study is an LQR problem with two types of sensors, one fast but sparse and one dense but slow. Controllers using only one type of sensor perform poorly, often failing even to stabilize; controllers using both types of sensors perform extremely well, demonstrating a strong diversity-enabled sweet spot (DESS). We demonstrate that IFPs are key in enabling this DESS, and additionally that with IFPs removed, controllers with delayed sensing perform poorly. The existence of strong DESS and IFP in this simple example suggest that these are fundamental architectural features in any complex system with diverse components, such as organisms and cyberphysical systems.

eess.SY↗