Proceedings of the 48h IEEE Conference on Decision and Control (CDC) Held Jointly With 2009 28th Chinese Control Conference 2009
DOI: 10.1109/cdc.2009.5400233
|View full text |Cite
|
Sign up to set email alerts
|

Gradient methods for iterative distributed control synthesis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
49
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 42 publications
(49 citation statements)
references
References 15 publications
0
49
0
Order By: Relevance
“…In case a negative value is obtained nothing can be said about the suboptimality with this method. Though, as we get closer to the optimal feedback matrix, the adjoint trajectory will approach the optimal (with respect to (12)) and the inequalities in the proof of Theorem 2 will almost be equal implying that we can expect a positive value from (10). When positive, the suboptimality bound is always larger than 1 which is natural.…”
Section: Examplementioning
confidence: 98%
See 2 more Smart Citations
“…In case a negative value is obtained nothing can be said about the suboptimality with this method. Though, as we get closer to the optimal feedback matrix, the adjoint trajectory will approach the optimal (with respect to (12)) and the inequalities in the proof of Theorem 2 will almost be equal implying that we can expect a positive value from (10). When positive, the suboptimality bound is always larger than 1 which is natural.…”
Section: Examplementioning
confidence: 98%
“…A first remark is that in the first iteration we get a negative value of the suboptimality bound. This is due to the fact that the minimization program in (10) is not guaranteed to give a positive value. In case a negative value is obtained nothing can be said about the suboptimality with this method.…”
Section: Examplementioning
confidence: 99%
See 1 more Smart Citation
“…However, because of the specific form of the cost functional, standard LQR methods are not applicable. Hence, we present two iterative algorithms to determine the feedback matrix, inspired by results in [9], [10]. These iterative algorithms are based on the simulation of trajectories of the system state and an adjoint state.…”
Section: Introductionmentioning
confidence: 99%
“…This relaxed rigidity constraint is justified by the use of impedance control, by which minor deviations from the rigidity constraint result in tolerable object stress. Because of the biquadratic term the LQR problem cannot be solved using standard methods, we propose an iterative descent method inspired by [8] and [9]. As an intermediate step in the controller design, we introduce an approximated state-space model for physically cooperating multi-robotteams.…”
Section: Introductionmentioning
confidence: 99%