Yoke Peng Leong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yoke Peng Leong has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- John C. Doyle
California Institute of Technology, Pasadena, CA, USA
3 shared publications Matanya B. Horowitz
3 shared publications- Ania-Ariadna Baetica
University of California, San Francisco
2 shared publications Joel W. Burdick
2 shared publications- Joel W. Burdick
Department of Mechanical and Civil Engineering, California Institute of Technology, Pasadena, CA, USA
2 shared publications - Matanya B. Horowitz
Control and Dynamical Systems California Institute of Technology 91125 Pasadena CA USA
2 shared publications
Latest Publications
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2500, 7683-7689
Optimal Path Planning for ω-regular Objectives with Abstraction-Refinement
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2500, 7683-7689
Optimal Path Planning for ω-regular Objectives with Abstraction-Refinement
- Open Access
Design Guidelines For Sequestration Feedback Networks
Summary: Integral control is commonly used in mechanical and electrical systems to ensure perfect adaptation. A proposed design of integral control for synthetic biological systems employs the sequestration of two biochemical controller species. The unbound amount of controller species captures the integral of the error between the current and the desired state of the system. However, implementing integral control inside bacterial cells using sequestration feedback has been challenging due to the controller molecules being degraded and diluted. Furthermore, integral control can only be achieved under stability conditions that not all sequestration feedback networks fulfill. In this work, we give guidelines for ensuring stability and good performance (small steady-state error) in sequestration feedback networks. Our guidelines provide simple tuning options to obtain a flexible and practical biological implementation of sequestration feedback control. Using tools and metrics from control theory, we pave the path for the systematic design of synthetic biological circuits.
Open AccessDesign Guidelines For Sequestration Feedback Networks
Summary: Integral control is commonly used in mechanical and electrical systems to ensure perfect adaptation. A proposed design of integral control for synthetic biological systems employs the sequestration of two biochemical controller species. The unbound amount of controller species captures the integral of the error between the current and the desired state of the system. However, implementing integral control inside bacterial cells using sequestration feedback has been challenging due to the controller molecules being degraded and diluted. Furthermore, integral control can only be achieved under stability conditions that not all sequestration feedback networks fulfill. In this work, we give guidelines for ensuring stability and good performance (small steady-state error) in sequestration feedback networks. Our guidelines provide simple tuning options to obtain a flexible and practical biological implementation of sequestration feedback control. Using tools and metrics from control theory, we pave the path for the systematic design of synthetic biological circuits.
- Open Access
Hard Limits and Performance Tradeoffs in a Class of Sequestration Feedback Systems
Summary: Feedback regulation is pervasive in biology at both the organismal and cellular level. In this article, we explore the properties of a particular biomolecular feedback mechanism implemented using the sequestration binding of two molecules. Our work develops an analytic framework for understanding the hard limits, performance tradeoffs, and architectural properties of this simple model of biological feedback control. Using tools from control theory, we show that there are simple parametric relationships that determine both the stability and the performance of these systems in terms of speed, robustness, steady-state error, and leakiness. These findings yield a holistic understanding of the behavior of sequestration feedback and contribute to a more general theory of biological control systems.
Open AccessHard Limits and Performance Tradeoffs in a Class of Sequestration Feedback Systems
Summary: Feedback regulation is pervasive in biology at both the organismal and cellular level. In this article, we explore the properties of a particular biomolecular feedback mechanism implemented using the sequestration binding of two molecules. Our work develops an analytic framework for understanding the hard limits, performance tradeoffs, and architectural properties of this simple model of biological feedback control. Using tools from control theory, we show that there are simple parametric relationships that determine both the stability and the performance of these systems in terms of speed, robustness, steady-state error, and leakiness. These findings yield a holistic understanding of the behavior of sequestration feedback and contribute to a more general theory of biological control systems.
- Open Access
Abstraction-Refinement Based Optimal Control with Regular Objectives
This paper presents an abstraction-refinement method to synthesize control inputs for a discrete-time piecewise linear system. The controlled system behavior satisfies a finite-word linear-time temporal objective while incurring minimal cost. An abstract finite state weighted transition system is constructed from finite partitions of the state and input spaces by solving optimization problems. A sequence of suboptimal controllers is obtained by considering a sequence of uniformly refined partitions. The abstract system satisfies the condition that the cost of the optimal control on the abstract system provides an upper bound on the cost of the optimal control for the original system. Furthermore, each suboptimal controller gives trajectories that have the cost upper bounded by the cost of the optimal control on the corresponding abstract system. In fact, the costs achieved by the sequence of suboptimal controllers converge to the optimal cost for the piecewise linear system. The tool OPTCAR implements the abstraction-refinement algorithm. Examples illustrate the feasibility of this approach to synthesize automatically suboptimal controllers with improving optimal costs.
Open AccessAbstraction-Refinement Based Optimal Control with Regular Objectives
This paper presents an abstraction-refinement method to synthesize control inputs for a discrete-time piecewise linear system. The controlled system behavior satisfies a finite-word linear-time temporal objective while incurring minimal cost. An abstract finite state weighted transition system is constructed from finite partitions of the state and input spaces by solving optimization problems. A sequence of suboptimal controllers is obtained by considering a sequence of uniformly refined partitions. The abstract system satisfies the condition that the cost of the optimal control on the abstract system provides an upper bound on the cost of the optimal control for the original system. Furthermore, each suboptimal controller gives trajectories that have the cost upper bounded by the cost of the optimal control on the corresponding abstract system. In fact, the costs achieved by the sequence of suboptimal controllers converge to the optimal cost for the piecewise linear system. The tool OPTCAR implements the abstraction-refinement algorithm. Examples illustrate the feasibility of this approach to synthesize automatically suboptimal controllers with improving optimal costs.
- Open Access
Linearly Solvable Stochastic Control Lyapunov Functions
This paper presents a new method for synthesizing stochastic control Lyapunov functions for a class of nonlinear stochastic control systems. The technique relies on a transformation of the classical nonlinear Hamilton-Jacobi-Bellman partial differential equation to a linear partial differential equation for a class of problems with a particular constraint on the stochastic forcing. This linear partial differential equation can then be relaxed to a linear differential inclusion, allowing for relaxed solutions to be generated using sum of squares programming. The resulting relaxed solutions are in fact viscosity super/subsolutions, and by the maximum principle are pointwise upper and lower bounds to the underlying value function, even for coarse polynomial approximations. Furthermore, the pointwise upper bound is shown to be a stochastic control Lyapunov function, yielding a method for generating nonlinear controllers with pointwise bounded distance from the optimal cost when using the optimal controller. These approximate solutions may be computed with non-increasing error via a hierarchy of semidefinite optimization problems. Finally, this paper develops a-priori bounds on trajectory suboptimality when using these approximate value functions, as well as demonstrates that these methods, and bounds, can be applied to a more general class of nonlinear systems not obeying the constraint on stochastic forcing. Simulated examples illustrate the methodology.
Open AccessLinearly Solvable Stochastic Control Lyapunov Functions
This paper presents a new method for synthesizing stochastic control Lyapunov functions for a class of nonlinear stochastic control systems. The technique relies on a transformation of the classical nonlinear Hamilton-Jacobi-Bellman partial differential equation to a linear partial differential equation for a class of problems with a particular constraint on the stochastic forcing. This linear partial differential equation can then be relaxed to a linear differential inclusion, allowing for relaxed solutions to be generated using sum of squares programming. The resulting relaxed solutions are in fact viscosity super/subsolutions, and by the maximum principle are pointwise upper and lower bounds to the underlying value function, even for coarse polynomial approximations. Furthermore, the pointwise upper bound is shown to be a stochastic control Lyapunov function, yielding a method for generating nonlinear controllers with pointwise bounded distance from the optimal cost when using the optimal controller. These approximate solutions may be computed with non-increasing error via a hierarchy of semidefinite optimization problems. Finally, this paper develops a-priori bounds on trajectory suboptimality when using these approximate value functions, as well as demonstrates that these methods, and bounds, can be applied to a more general class of nonlinear systems not obeying the constraint on stochastic forcing. Simulated examples illustrate the methodology.
- Open Access
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 1 (1) , 122-127
Effects of Delays, Poles, and Zeros on Time Domain Waterbed Tradeoffs and Oscillations
This letter aims for a simple and accessible explanation as to why oscillations naturally arise due to tradeoffs in feedback systems, and how these can be aggravated by delays and unstable poles and zeros. Such results have been standard for decades using frequency domain methods, which yield a rich variety of familiar “waterbed” tradeoffs. While almost trivial for control experts, frequency domain methods are less familiar to many scientists and engineers who could benefit from the insights such tradeoffs can provide. So here we present an entirely time domain model using discrete time dynamics and l 1 norm performance. A simple waterbed effect is that imposing zero steady state response to a step naturally create oscillations that double the response to periodic disturbances. We also show how this tradeoff is further aggravated not only by unstable poles and zeros, but also delays, in a way clearer than in the frequency domain versions.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 1 (1) , 122-127
Open AccessEffects of Delays, Poles, and Zeros on Time Domain Waterbed Tradeoffs and Oscillations
This letter aims for a simple and accessible explanation as to why oscillations naturally arise due to tradeoffs in feedback systems, and how these can be aggravated by delays and unstable poles and zeros. Such results have been standard for decades using frequency domain methods, which yield a rich variety of familiar “waterbed” tradeoffs. While almost trivial for control experts, frequency domain methods are less familiar to many scientists and engineers who could benefit from the insights such tradeoffs can provide. So here we present an entirely time domain model using discrete time dynamics and l 1 norm performance. A simple waterbed effect is that imposing zero steady state response to a step naturally create oscillations that double the response to periodic disturbances. We also show how this tradeoff is further aggravated not only by unstable poles and zeros, but also delays, in a way clearer than in the frequency domain versions.
- 1 July 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5161-5168
Optimal control with regular objectives using an abstraction-refinement approach
This paper presents a method to synthesize a sequence of control inputs for a discrete-time piecewise linear system equipped with a cost function, such that the controlled system behavior satisfies a finite-word linear-time temporal objective with minimal cost. An abstract finite state weighted transition system is constructed, such that the cost of the optimal control on the abstract system provides an upper bound on the cost of the optimal control for the original system. Specifically, the abstract system is constructed from finite partitions of the state and input spaces by solving optimization problems, and a sequence of suboptimal controllers is obtained by considering a sequence of uniformly refined partitions. Furthermore, the costs achieved by the sequence of suboptimal controllers converge to the optimal cost for the piecewise linear system. The abstraction refinement algorithm is implemented in the tool OptCAR. The feasibility of this approach is illustrated on an example, by constructing automatically, sub-optimal controllers with improving optimal costs.
- 1 July 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5161-5168
Optimal control with regular objectives using an abstraction-refinement approach
This paper presents a method to synthesize a sequence of control inputs for a discrete-time piecewise linear system equipped with a cost function, such that the controlled system behavior satisfies a finite-word linear-time temporal objective with minimal cost. An abstract finite state weighted transition system is constructed, such that the cost of the optimal control on the abstract system provides an upper bound on the cost of the optimal control for the original system. Specifically, the abstract system is constructed from finite partitions of the state and input spaces by solving optimization problems, and a sequence of suboptimal controllers is obtained by considering a sequence of uniformly refined partitions. Furthermore, the costs achieved by the sequence of suboptimal controllers converge to the optimal cost for the piecewise linear system. The abstraction refinement algorithm is implemented in the tool OptCAR. The feasibility of this approach is illustrated on an example, by constructing automatically, sub-optimal controllers with improving optimal costs.
- Open Access
Understanding Robust Control Theory Via Stick Balancing
Robust control theory studies the effect of noise, disturbances, and other uncertainty on system performance. Despite growing recognition across science and engineering that robustness and efficiency tradeoffs dominate the evolution and design of complex systems, the use of robust control theory remains limited, partly because the mathematics involved is relatively inaccessible to nonexperts, and the important concepts have been inexplicable without a fairly rich mathematics background. This paper aims to begin changing that by presenting the most essential concepts in robust control using human stick balancing, a simple case study popular in both the sensorimotor control literature and extremely familiar to engineers. With minimal and familiar models and mathematics, we can explore the impact of unstable poles and zeros, delays, and noise, which can then be easily verified with simple experiments using a standard extensible pointer. Despite its simplicity, this case study has extremes of robustness and fragility that are initially counter-intuitive but for which simple mathematics and experiments are clear and compelling. The theory used here has been well-known for many decades, and the cart-pendulum example is a standard in undergrad controls courses, yet a careful reconsidering of both leads to striking new insights that we argue are of great pedagogical value.
Open AccessUnderstanding Robust Control Theory Via Stick Balancing
Robust control theory studies the effect of noise, disturbances, and other uncertainty on system performance. Despite growing recognition across science and engineering that robustness and efficiency tradeoffs dominate the evolution and design of complex systems, the use of robust control theory remains limited, partly because the mathematics involved is relatively inaccessible to nonexperts, and the important concepts have been inexplicable without a fairly rich mathematics background. This paper aims to begin changing that by presenting the most essential concepts in robust control using human stick balancing, a simple case study popular in both the sensorimotor control literature and extremely familiar to engineers. With minimal and familiar models and mathematics, we can explore the impact of unstable poles and zeros, delays, and noise, which can then be easily verified with simple experiments using a standard extensible pointer. Despite its simplicity, this case study has extremes of robustness and fragility that are initially counter-intuitive but for which simple mathematics and experiments are clear and compelling. The theory used here has been well-known for many decades, and the cart-pendulum example is a standard in undergrad controls courses, yet a careful reconsidering of both leads to striking new insights that we argue are of great pedagogical value.
- 1 January 2016
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 54 (6) , 3106-3125
Linearly Solvable Stochastic Control Lyapunov Functions
This paper presents a new method for synthesizing stochastic control Lyapunov functions for a class of nonlinear stochastic control systems. The technique relies on a transformation of the classical nonlinear Hamilton--Jacobi--Bellman partial differential equation to a linear partial differential equation for a class of problems with a particular constraint on the stochastic forcing. This linear partial differential equation can then be relaxed to a linear differential inclusion, allowing for relaxed solutions to be generated using sum of squares programming. The resulting relaxed solutions are in fact viscosity super-/subsolutions, and by the maximum principle are pointwise upper and lower bounds to the underlying value function, even for coarse polynomial approximations. Furthermore, the pointwise upper bound is shown to be a stochastic control Lyapunov function, yielding a method for generating nonlinear controllers with pointwise bounded distance from the optimal cost when using the optimal controller...
- 1 January 2016
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 54 (6) , 3106-3125
Linearly Solvable Stochastic Control Lyapunov Functions
This paper presents a new method for synthesizing stochastic control Lyapunov functions for a class of nonlinear stochastic control systems. The technique relies on a transformation of the classical nonlinear Hamilton--Jacobi--Bellman partial differential equation to a linear partial differential equation for a class of problems with a particular constraint on the stochastic forcing. This linear partial differential equation can then be relaxed to a linear differential inclusion, allowing for relaxed solutions to be generated using sum of squares programming. The resulting relaxed solutions are in fact viscosity super-/subsolutions, and by the maximum principle are pointwise upper and lower bounds to the underlying value function, even for coarse polynomial approximations. Furthermore, the pointwise upper bound is shown to be a stochastic control Lyapunov function, yielding a method for generating nonlinear controllers with pointwise bounded distance from the optimal cost when using the optimal controller...
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7157-7164
Suboptimal stabilizing controllers for linearly solvable system
This paper presents a novel method to synthesize stochastic control Lyapunov functions for a class of nonlinear, stochastic control systems. In this work, the classical nonlinear Hamilton-Jacobi-Bellman partial differential equation is transformed into a linear partial differential equation for a class of systems with a particular constraint on the stochastic disturbance. It is shown that this linear partial differential equation can be relaxed to a linear differential inclusion, allowing for approximating polynomial solutions to be generated using sum of squares programming. It is shown that the resulting solutions are stochastic control Lyapunov functions with a number of compelling properties. In particular, a-priori bounds on trajectory suboptimality are shown for these approximate value functions. The result is a technique whereby approximate solutions may be computed with non-increasing error via a hierarchy of semidefinite optimization problems.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7157-7164
Suboptimal stabilizing controllers for linearly solvable system
This paper presents a novel method to synthesize stochastic control Lyapunov functions for a class of nonlinear, stochastic control systems. In this work, the classical nonlinear Hamilton-Jacobi-Bellman partial differential equation is transformed into a linear partial differential equation for a class of systems with a particular constraint on the stochastic disturbance. It is shown that this linear partial differential equation can be relaxed to a linear differential inclusion, allowing for approximating polynomial solutions to be generated using sum of squares programming. It is shown that the resulting solutions are stochastic control Lyapunov functions with a number of compelling properties. In particular, a-priori bounds on trajectory suboptimality are shown for these approximate value functions. The result is a technique whereby approximate solutions may be computed with non-increasing error via a hierarchy of semidefinite optimization problems.