Ändra sökning
Avgränsa sökresultatet
1 - 10 av 10
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Li, Yibei
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori. Harbin Inst Technol, Harbin 150001, Heilongjiang, Peoples R China..
    Zhang, Han
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Yao, Yu
    Harbin Inst Technol, Harbin 150001, Heilongjiang, Peoples R China..
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    A Convex Optimization Approach to Inverse Optimal Control2018Ingår i: 2018 37Th Chinese Control Conference, CCC (CCC) / [ed] Chen, X Zhao, QC, IEEE, 2018, Vol. 2018, s. 257-262Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, the problem of inverse optimal control (IOC) is investigated, where the quadratic cost function of a dynamic process is required to be recovered based on the observation of optimal control sequences. In order to guarantee the feasibility of the problem, the IOC is reformulated as an infinite-dimensional convex optimization problem, which is then solved in the primal-dual framework. In addition, the feasibility of the original IOC could be determined from the optimal value of reformulated problem, which also gives out an approximate solution when the original problem is not feasible. In addition, several simplification methods are proposed to facilitate the computation, by which the problem is reduced to a boundary value problem of ordinary differential equations. Finally, numerical simulations are used to demonstrate the effectiveness and feasibility of the proposed methods.

  • 2.
    Zhang, Han
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Optimizing Networked Systems and Inverse Optimal Control2019Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    This thesis is concerned with the problems of optimizing networked systems, including designing a distributed energy optimal consensus controller for homogeneous networked linear systems, maximizing the algebraic connectivity of a network by projected saddle point dynamics. In addition, the inverse optimal control problems for discrete-time finite time-horizon Linear Quadratic Regulators (LQRs) are considered. The goal is to infer the Q matrix in the quadratic cost function using the observations (possibly noisy) either on the optimal state trajectories, optimal control input or the system output.

    In Paper A, an optimal energy cost controller design for identical networked linear systems asymptotic consensus is considered. It is assumed that the topology of the network is given and the controller can only depend on relative information of the agents. Since finding the control gain for such a controller is hard, we focus on finding an optimal controller among a classical family of controllers which is based on the Algebraic Riccati Equation (ARE) and guarantees asymptotic consensus. We find that the energy cost is bounded by an interval and hence we minimize the upper bound. Further, the minimization for the upper bound boils down to optimizing the control gain and the edge weights of the graph separately. A suboptimal control gain is obtained by choosing Q=0 in the ARE. Negative edge weights are allowed, meaning that "competitions" between the agents are allowed. The edge weight optimization problem is formulated as a Semi-Definite Programming (SDP) problem. We show that the lowest control energy cost is reached when the graph is complete and with equal edge weights. Furthermore, two sufficient conditions for the existence of negative optimal edge weights realization are given. In addition, we provide a distributed way of solving the SDP problem when the graph topology is regular.

    In Paper B, a projected primal-dual gradient flow of augmented Lagrangian is presented to solve convex optimization problems that are not necessarily strictly convex. The optimization variables are restricted by a convex set with computable projection operation on its tangent cone as well as equality constraints. We show that the projected dynamical system converges to one of the saddle points and hence finding an optimal solution. Moreover, the problem of distributedly maximizing the algebraic connectivity of an undirected network by optimizing the "port gains" of each nodes is considered. The original SDP problem is relaxed into a nonlinear programming (NP) problem that will be solved by the aforementioned projected dynamical system. Numerical examples show the convergence of the aforementioned algorithm to one of the optimal solutions. The effect of the relaxation is illustrated empirically with numerical examples. A methodology is presented so that the number of iterations needed to converge is reduced. Complexity per iteration of the algorithm is illustrated with numerical examples.

    In Paper C and D, the inverse optimal control problems over finite-time horizon for discrete-time LQRs are considered. The well-posedness of the inverse optimal control problem is first justified. In the noiseless case, when these observations of the optimal state trajectories or the optimal control input are exact, we analyze the identifiability of the problem and provide sufficient conditions for uniqueness of the solution. In the noisy case, when the observations are corrupted by additive zero-mean noise, we formulate the problem as an optimization problem and prove that the solution to this problem is statistically consistent. The following two scenarios are further considered: 1) the distributions of the initial state and the observation noise are unknown, yet the exact observations on the initial states and the noisy observations on the system output are available; 2) the exact observations on the initial states are not available, yet the observation noises are known to be white Gaussian and the distribution of the initial state is also Gaussian (with unknown mean and covariance). For the first scenario, we show statistical consistency for the estimation. For the second scenario, we fit the problem into the framework of maximum-likelihood and Expectation Maximization (EM) algorithm is used to solve this problem. The performance of the proposed method is illustrated through numerical examples.

  • 3.
    Zhang, Han
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Consensus control for linear systems with optimal energy cost2018Ingår i: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 93, s. 83-91Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we design an optimal energy cost controller for linear systems asymptotic consensus given the topology of the graph. The controller depends only on relative information of the agents. Since finding the control gain for such controller is hard, we focus on finding an optimal controller among a classical family of controllers which is based on Algebraic Riccati Equation (ARE) and guarantees asymptotic consensus. Through analysis, we find that the energy cost is bounded by an interval and hence we minimize the upper bound. In order to do that, there are two classes of variables that need to be optimized: the control gain and the edge weights of the graph and are hence designed from two perspectives. A suboptimal control gain is obtained by choosing Q=0 in the ARE. Negative edge weights are allowed, and the problem is formulated as a Semi-definite Programming (SDP) problem. Having negative edge weights means that “competitions” between the agents are allowed. The motivation behind this setting is to have a better system performance. We provide a different proof compared to Thunberg and Hu (2016) from the angle of optimization and show that the lowest control energy cost is reached when the graph is complete and with equal edge weights. Furthermore, two sufficient conditions for the existence of negative optimal edge weights realization are given. In addition, we provide a distributed way of solving the SDP problem when the graph topology is regular.

  • 4.
    Zhang, Han
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Inverse Optimal Control for Finite-Horizon Discrete-time Linear Quadratic Regulator Under Noisy OutputManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    In this paper, the problem of inverse optimal control for finite-horizon discrete-time Linear Quadratic Regulators (LQRs) is considered. The goal of the inverse optimal control problem is to recover the corresponding objective function by the noisy observations. We consider the problem of inverse optimal control in two scenarios: 1) the distributions of the initial state and the observation noise are unknown, yet the exact observations on the initial states and the noisy observations on system output are available; 2) the exact observations on the initial states are not available, yet the observation noises are known white Gaussian and the distribution of the initial state is also Gaussian (with unknown mean and covariance). For the first scenario, we formulate the problem as a risk minimization problem and show that its solution is statistically consistent. For the second scenario, we fit the problem into the framework of maximum-likelihood and Expectation Maximization (EM) algorithm is used to solve this problem. The performance for the estimations are shown by numerical examples.

  • 5.
    Zhang, Han
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Inverse Optimal Control for Finite-Horizon Discrete-time Linear Quadratic Regulator Under Noisy OutputManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    In this paper, the problem of inverse optimal control for finite-horizon discrete-time Linear Quadratic Regulators (LQRs) is considered. The goal of the inverse optimal control problem is to recover the corresponding objective function by the noisy observations. We consider the problem of inverse optimal control in two scenarios: 1) the distributions of the initial state and the observation noise are unknown, yet the exact observations on the initial states and the noisy observations on system output are available; 2) the exact observations on the initial states are not available, yet the observation noises are known white Gaussian and the distribution of the initial state is also Gaussian (with unknown mean and covariance). For the first scenario, we formulate the problem as a risk minimization problem and show that its solution is statistically consistent. For the second scenario, we fit the problem into the framework of maximum-likelihood and Expectation Maximization (EM) algorithm is used to solve this problem. The performance for the estimations are shown by numerical examples.

  • 6.
    Zhang, Han
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Optimal energy consensus control for linear multi-agent systems2017Ingår i: 2017 36th Chinese Control Conference, CCC, IEEE Computer Society, 2017, s. 2663-2668, artikel-id 8027765Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, an optimal energy cost controller for linear multi-agent systems' consensus is proposed. It is assumed that the topology among the agents is fixed and the agents are connected through an edge-weighted graph. The controller only uses relative information between agents. Due to the difficulty of finding the controller gain, we focus on finding the optimal controller among a sub-family whose design is based on Algebraic Riccati Equation (ARE) and guarantee consensus. It is found that the energy cost for such controllers is bounded by an interval and hence we minimize the upper bound. To do that, the control gain and the edge weights are optimized separately. The control gain is optimized by choosing Q = 0 in the ARE; the edge weights are optimized under the assumption that there is limited communication resources in the network. Negative edge weights are allowed, and the problem is formulated as a Semi-definite Programming (SDP) problem. The controller coincides with the optimal control in [8] when the graph is complete. Furthermore, two sufficient conditions for the existence of negative optimal edge weights realization are given.

  • 7.
    Zhang, Han
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Umenberger, J.
    Department of Information Technology, Uppsala University, Uppsala, Sweden.
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori. KTH, Tidigare Institutioner (före 2005), Matematik.
    Inverse optimal control for discrete-time finite-horizon Linear Quadratic Regulators2019Ingår i: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 110, artikel-id 108593Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we consider the inverse optimal control problem for discrete-time Linear Quadratic Regulators (LQR), over finite-time horizons. Given observations of the optimal trajectories, or optimal control inputs, to a linear time-invariant system, the goal is to infer the parameters that define the quadratic cost function. The well-posedness of the inverse optimal control problem is first justified. In the noiseless case, when these observations are exact, we analyze the identifiability of the problem and provide sufficient conditions for uniqueness of the solution. In the noisy case, when the observations are corrupted by additive zero-mean noise, we formulate the problem as an optimization problem and prove that the solution to this problem is statistically consistent. The performance of the proposed method is illustrated through numerical examples.

  • 8.
    Zhang, Han
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Umenberger, Jack
    Department of Information Technology, Division of Systems and Control, Uppsala University.
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Inverse Quadratic Optimal Control for Discrete-Time Linear SystemsManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    In this paper, we consider the inverse optimal control problem for discrete-time Linear Quadratic Regulators (LQRs), over finite-time horizons. Given observations of the optimal trajectories, or optimal control inputs, to a linear time-invariant system, the goal is to infer the parameters that define the quadratic cost function. The well-posedness of the inverse optimal control problem is first justied. In the noiseless case, when these observations are exact, we analyze the identiability of the problem and provide sufficient conditions for uniqueness of the solution. In the noisy case, when the observations are corrupted by additive zero-mean noise, we formulate the problem as an optimization problem and prove that the solution to this problem is statistically consistent. The performance of the proposed method is illustrated through numerical examples.

  • 9.
    Zhang, Han
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Umenberger, Jack
    Department of Information Technology, Division of Systems and Control, Uppsala University.
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Inverse Quadratic Optimal Control for Discrete-Time Linear SystemsManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    In this paper, we consider the inverse optimal control problem for discrete-time Linear Quadratic Regulators (LQRs), over finite-time horizons. Given observations of the optimal trajectories, or optimal control inputs, to a linear time-invariant system, the goal is to infer the parameters that define the quadratic cost function. The well-posedness of the inverse optimal control problem is first justied. In the noiseless case, when these observations are exact, we analyze the identiability of the problem and provide sufficient conditions for uniqueness of the solution. In the noisy case, when the observations are corrupted by additive zero-mean noise, we formulate the problem as an optimization problem and prove that the solution to this problem is statistically consistent. The performance of the proposed method is illustrated through numerical examples.

  • 10.
    Zhang, Han
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Wei, Jieqiang
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Yi, Peng
    Washington Univ, Dept Elect & Syst Engn, St Louis, MO USA..
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Projected primal-dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network2018Ingår i: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 98, s. 34-41Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, a projected primal-dual gradient flow of augmented Lagrangian is presented to solve convex optimization problems that are not necessarily strictly convex. The optimization variables are restricted by a convex set with computable projection operation on its tangent cone as well as equality constraints. As a supplement of the analysis in Niederlander and Cortes (2016), we show that the projected dynamical system converges to one of the saddle points and hence finding an optimal solution. Moreover, the problem of distributedly maximizing the algebraic connectivity of an undirected network by optimizing the port gains of each nodes (base stations) is considered. The original semi-definite programming (SDP) problem is relaxed into a nonlinear programming (NP) problem that will be solved by the aforementioned projected dynamical system. Numerical examples show the convergence of the aforementioned algorithm to one of the optimal solutions. The effect of the relaxation is illustrated empirically with numerical examples. A methodology is presented so that the number of iterations needed to reach the equilibrium is suppressed. Complexity per iteration of the algorithm is illustrated with numerical examples.

1 - 10 av 10
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf