Ändra sökning
Avgränsa sökresultatet
1 - 12 av 12
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • 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.
    Johansson, Alexander
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Wei, Jieqiang
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Sandberg, Henrik
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Johansson, Karl H.
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Chen, J.
    Optimization of the H∞-norm of Dynamic Flow Networks2018Ingår i: 2018 Annual American Control Conference (ACC), Institute of Electrical and Electronics Engineers (IEEE), 2018, s. 1280-1285Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we study the H∞-norm of linear systems over graphs, which is used to model distribution networks. In particular, we aim to minimize the H∞-norm subject to allocation of the weights on the edges. The optimization problem is formulated with LMI (Linear-Matrix-Inequality) constraints. For distribution networks with one port, i.e., SISO systems, we show that the H∞-norm coincides with the effective resistance between the nodes in the port. Moreover, we derive an upper bound of the H∞-norm, which is in terms of the algebraic connectivity of the graph on which the distribution network is defined.

  • 2.
    Nekouei, Ehsan
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Wei, Jieqiang
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Baras, John S.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik. KTH Royal Inst Technol, Stockholm, Sweden..
    Skoglund, Mikael
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Teknisk informationsvetenskap.
    Johansson, Karl H.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Optimal Decision Fusion Under Order Effects2019Ingår i: IFAC PAPERSONLINE, ELSEVIER SCIENCE BV , 2019, Vol. 51, nr 34, s. 53-60Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper studies an optimal decision fusion problem with a group of human decision makers when an order effect is present. The order effect refers to situations wherein the process of decision making by a human is affected by the order of decisions. In our set-up, all human decision makers, called observers, receive the same data which is generated by a common but unknown hypothesis. Then, each observer independently generates a sequence of decisions which are modeled by employing non-commutative probabilistic models of the data and their relation to the unknown hypothesis. The use of non-commutative probability models is motivated by recent psychological studies which indicate that these non-commutative probability models are more suitable for capturing the order effect in human decision making, compared with the classical probability model. A central decision maker (CDM) receives (possibly a subset of) the observers' decisions and decides on the true hypothesis. The considered problem becomes an optimal decision fusion problem with observations modeled using a non-commutative (Von Neumann) probability model. The structure of the optimal decision rule at the CDM is studied under two scenarios. In the first scenario, the CDM receives the entire history of the observers' decisions whereas in the second scenario, the CDM receives only the last decision of each observer. The perfromance of the optimal fusion rule is numerically evaluated and compared with the optimal fusion rule derived when using a classical probability model.

  • 3. Raghavan, Aneesh
    et al.
    Wei, Jieqiang
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Baras, John S.
    Johansson, Karl H.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Stochastic Control Formulation of The Car Overtake Problem2018Ingår i: IFAC PAPERSONLINE, ISSN 2405-8963, Vol. 51, nr 9, s. 124-129Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we consider the classic car overtake problem. There are three cars, two moving along the same direction in the same lane while the third car moves in the direction opposite to that of the first two cars in the adjacent lane. The objective of the trailing car is to overtake the car in front of it avoiding collision with the other cars in the scenario. The information available to the trailing car is the relative position, relative velocities with respect to other cars and its position and past actions. The relative position and relative velocity information is corrupted by noise. Given this information, the car needs to make a decision as to whether it wants to overtake or not. We present a control algorithm for the car which minimizes the probability of collision with both the cars. We also present the results obtained by simulating the above scenario with the control algorithm. Through simulations, we study the effect of the variance of the measurement noise and the time at which the decision is made on the probability of collision.

  • 4. Wei, Jieqiang
    et al.
    Fridman, Emilia
    Tel Aviv Univ, Sch Elect Engn, Tel Aviv, Israel..
    Johansson, Karl H.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    A PDE approach to deployment of mobile agents under leader relative position measurements2019Ingår i: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 106, s. 47-53Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We study the deployment of a first-order multi-agent system over a desired smooth curve in 2D or 3D space. We assume that the agents have access to the local information of the desired curve and their relative positions with respect to their closest neighbors, whereas in addition a leader is able to measure his relative position with respect to the desired curve. For the case of an open C-2 curve, we consider two boundary leaders that use boundary instantaneous static output-feedback controllers. For the case of a closed C-2 curve we assume that the leader transmits his measurement to other agents through a communication network. The resulting closed-loop system is modeled as a heat equation with a delayed (due to the communication) boundary state, where the state is the relative position of the agents with respect to the desired curve. By choosing appropriate controller gains (the diffusion coefficient and the gain multiplying the leader state), we can achieve any desired decay rate provided the delay is small enough. The advantage of our approach is in the simplicity of the control law and the conditions. Numerical example illustrates the efficiency of the method.

  • 5.
    Wei, Jieqiang
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Fridman, Emilia
    Tel Aviv Univ, Sch Elect Engn, Tel Aviv, Israel..
    Selivanov, Anton
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Johansson, Karl H.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Multi-agent deployment under the leader displacement measurement: a PDE-based approach2019Ingår i: 2019 18TH EUROPEAN CONTROL CONFERENCE (ECC), IEEE , 2019, s. 2424-2429Konferensbidrag (Refereegranskat)
    Abstract [en]

    We study the deployment of a first-order multi-agent system over a desired smooth curve in 3D space. We assume that the agents have access to the local information of the desired curve and their displacements with respect to their closest neighbors, whereas in addition a leader is able to measure his absolute displacement with respect to the desired curve. In this paper we consider the case that the desired curve is a closed C-2 curve and we assume that the leader transmit his measurement to other agents through a communication network. We start the algorithm with displacement-based formation control protocol. Connections from this ODE model to a PDE model (heat equation), which can be seen as a reduced model, are then established. The resulting closed-loop system is modeled as a heat equation with delay (due to the communication). The boundary condition is periodic since the desired curve is closed. By choosing appropriate controller gains (the diffusion coefficient and the gain multiplying the leader state), we can achieve any desired decay rate provided the delay is small enough. The advantage of our approach is in the simplicity of the control law and the conditions. Numerical example illustrates the efficiency of the method.

  • 6.
    Wei, Jieqiang
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Nekouei, Ehsan
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Wu, J.
    Cvetkovic, Vladimir D.
    KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Hållbar utveckling, miljövetenskap och teknik, Resurser, energi och infrastruktur.
    Johansson, Karl H.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Steady-state analysis of a human-social behavior model: A neural-cognition perspective2019Ingår i: Proceedings of the American Control Conference, Institute of Electrical and Electronics Engineers (IEEE), 2019, s. 199-204, artikel-id 8814786Konferensbidrag (Refereegranskat)
    Abstract [en]

    We consider an extension of the Rescorla-Wagner model which bridges the gap between conditioning and learning on a neural-cognitive, individual psychological level, and the social population level. In this model, the interaction among individuals is captured by a Markov process. The resulting human-social behavior model is a recurrent iterated function system which behaves differently from the classical Rescorla-Wagner model due to randomness. A sufficient condition for the convergence of the forward process starting with arbitrary initial distribution is provided. Furthermore, the ergodicity properties of the internal states of agents in the proposed model are studied.

  • 7.
    Wei, Jieqiang
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Verginis, Christos
    KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Wu, J.
    Dimarogonas, Dimos V.
    KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Sandberg, Henrik
    KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Johansson, Karl Henrik
    KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Asymptotic and finite-time almost global attitude tracking: Representations free approach2018Ingår i: 2018 European Control Conference, ECC 2018, Institute of Electrical and Electronics Engineers (IEEE), 2018, s. 3126-3131, artikel-id 8550190Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, the attitude tracking problem is considered using the rotation matrices. Due to the inherent topological restriction, it is impossible to achieve global attractivity with any continuous attitude control system on SO(3). Hence in this work, we propose some control protocols achieving almost global tracking asymptotically and in finite time, respectively. In these protocols, no world frame is needed and only relative state information are requested. For finitetime tracking case, Filippov solutions and non-smooth analysis techniques are adopted to handle the discontinuities. Simulation examples are provided to verify the performances of the control protocols designed in this paper.

  • 8. Wei, Jieqiang
    et al.
    Yi, Xinlei
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Sandberg, Henrik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Johansson, Karl H.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Nonlinear consensus protocols with applications to quantized systems2017Ingår i: IFAC PAPERSONLINE, ELSEVIER SCIENCE BV , 2017, Vol. 50, nr 1, s. 15440-15445Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper studies multi-agent systems with nonlinear consensus protocols, i.e., only nonlinear measurements of the states are available to agents. The solutions of these systems are understood in Filippov sense since the possible discontinuity of the nonlinear controllers. Under the condition that the nonlinear functions are monotonic increasing without any continuous constraints, asymptotic stability is derived for systems defines on both directed and undirected graphs. The results can be applied to quantized consensus which extend some existing results from undirected graphs to directed ones.

  • 9.
    Wei, Jieqiang
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Yi, Xinlei
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Sandberg, Henrik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Johansson, Karl Henrik
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.
    Nonlinear Consensus Protocols With Applications to Quantized Communication and Actuation2019Ingår i: IEEE Transactions on Control of Network Systems, E-ISSN 2372-2533, Vol. 6, nr 2, s. 598-608Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Nonlinearities are present in all real applications. Two types of general nonlinear consensus protocols are considered in this paper, namely, the systems with nonlinear communication and actuator constraints. The solutions of the systems are understood in the sense of Filippov to handle the possible discontinuity of the controllers. For each case, we prove the asymptotic stability of the systems with minimal assumptions on the nonlinearity, for both directed and undirected graphs. These results extend the literature to more general nonlinear dynamics and topologies. As applications of established theorems, we interpret the results on quantized consensus protocols.

  • 10.
    Wei, Jieqiang
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Zhang, Silun
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Adaldo, Antonio
    KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Johansson, Karl Henrik
    KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Finite-time attitude synchronization with a discontinuous protocol2017Ingår i: 13th IEEE International Conference on Control and Automation, ICCA 2017, IEEE Computer Society, 2017, s. 192-197, artikel-id 8003058Konferensbidrag (Refereegranskat)
    Abstract [en]

    A finite-time attitude synchronization problem is considered in this paper where the rotation of each rigid body is expressed using the axis-angle representation. One simple discontinuous and distributed controller using the vectorized signum function is proposed. This controller only involves the sign of the state differences of adjacent neighbors. In order to avoid the singularity introduced by the axis-angular representation, an extra constraint is added to the initial condition. It is proved that for some initial conditions, the control law achieves finite-time attitude synchronization. One simulated example is provided to verify the usage of the control protocol designed in this paper.

  • 11.
    Wei, Jieqiang
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Zhang, Silun
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Adaldo, Antonio
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Johan, Thunberg
    Hu, Xiaoming
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Optimeringslära och systemteori.
    Johansson, Karl H.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
    Finite-time attitude synchronization with distributed discontinuous protocols2018Ingår i: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 63, nr 10, s. 3608-3615Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The finite-time attitude synchronization problem is considered in this paper, where the rotation of each rigid body is expressed using the axis-angle representation. Two discontinuous and distributed controllers using the vectorized signum function are proposed, which guarantee almost global and local convergence, respectively. Filippov solutions and non-smooth analysis techniques are adopted to handle the discontinuities. Sufficient conditions are provided to guarantee finite-time convergence and boundedness of the solutions. Simulation examples are provided to verify the performances of the control protocols designed in this paper.

  • 12.
    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 - 12 av 12
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • 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