2015 54th IEEE Conference on Decision and Control (CDC) 2015
DOI: 10.1109/cdc.2015.7403348
|View full text |Cite
|
Sign up to set email alerts
|

Suboptimal stabilizing controllers for linearly solvable system

Abstract: Abstract-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 approxim… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 26 publications
0
4
0
Order By: Relevance
“…Applying Schur's complement to (20), we see that inequality (13) is satisfied for the closed loop system. Moreover, inequality (19) assures that (12) is also satisfied.…”
Section: Nd-noise-to-state Stabilizing Controller Synthesis Formentioning
confidence: 99%
See 1 more Smart Citation
“…Applying Schur's complement to (20), we see that inequality (13) is satisfied for the closed loop system. Moreover, inequality (19) assures that (12) is also satisfied.…”
Section: Nd-noise-to-state Stabilizing Controller Synthesis Formentioning
confidence: 99%
“…Controller synthesis with performance bounds was also considered in [12] and [17] and controller synthesis for discontinuous dynamical systems was studied in [18]. In the context of stochastic systems, [19] and [20] are the only attempts using SOS programming to synthesize controllers, where the authors use a logarithmic transformation to obtain a linear version of the Hamilton-Jacobi-Bellman (HJB) equation.…”
Section: Introductionmentioning
confidence: 99%
“…Proof. Recall that from the proof of Theorem 23, all conditions in Definition 29 are satisfied by V u except (24). To show that V u satisfies (24), rearrange (4) to yield the following…”
Section: Linearly Solvablementioning
confidence: 99%
“…These previous works focused on path planning, rather than stabilization, and did not include the stability analysis or suboptimality guarantees presented in this paper. A short version of this work appeared in [24] which included less details and did not include the extension in section 5.…”
mentioning
confidence: 99%