| 1. |
- Ba, Qin, et al.
(författare)
-
Distributed optimal equilibrium selection for traffic flow over networks
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - 9781479978861 ; 2016, s. 6942-6947
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we present two distributed algorithms to compute an equilibrium, that is optimal with respect to strictly convex and separable cost functions, for controlled traffic flow dynamics over networks under constant exogenous inflows. The dynamics is modeled in continuous time by the Cell Transmission Model and a non-FIFO Dynamic Network Loading Model, with traffic control. The two algorithms are adaptations of the alternating direct method of multipliers (ADMM) and the accelerated dual descent (ADD) method from network flow optimization literature. When the demand and supply inequality constraints in the uncontrolled dynamics are relaxed to be independent over links, the resulting feasible set is convex if the demand and supply functions are concave, thereby imparting convexity to the optimal equilibrium selection problem. Each point in the feasible set is an equilibrium for the original dynamics under appropriately designed control. For the ADMM method, explicit expressions for the primal update show that no auxiliary variables are necessary. Convergence analysis for the primal variables is also provided. The standard ADD method is extended to also incorporate non-negativity constraints on the density and flow variables, and demand and supply inequality constraints. Illustrative simulation results are also presented.
|
|
| 2. |
- Boskos, Dmitris, et al.
(författare)
-
Decentralized abstractions for feedback interconnected multi-agent systems
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - : IEEE conference proceedings. - 9781479978861 ; , s. 282-287
-
Konferensbidrag (refereegranskat)abstract
- The purpose of this paper is to define abstractions for multi-agent systems under coupled constraints. In the proposed decentralized framework, we specify a finite or countable transition system for each agent which only takes into account the discrete positions of its neighbors. The dynamics of the considered systems consist of two components. An appropriate feedback law which guarantees that certain performance requirements (e.g., connectivity) are preserved and induces the coupled constraints, and additional free inputs which are exploited for the accomplishment of high level tasks. In this work we provide sufficient conditions on the space and time discretization for the abstraction of the system's behaviour which ensure that we can extract a well posed and hence meaningful transition system.
|
|
| 3. |
- Boskos, Dmitris, et al.
(författare)
-
Robust connectivity analysis for multi-agent systems
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - : IEEE conference proceedings. - 9781479978861 ; , s. 6767-6772
-
Konferensbidrag (refereegranskat)abstract
- In this paper we provide a decentralized robust control approach, which guarantees that connectivity of a multi-agent network is maintained when certain bounded input terms are added to the control strategy. Our main motivation for this framework is to determine abstractions for multi-agent systems under coupled constraints which are further exploited for the synthesis of high level plans.
|
|
| 4. |
- Carvalho, Joao Frederico, et al.
(författare)
-
Static output feedback : On essential feasible information patterns
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - : IEEE conference proceedings. - 9781479978861 ; , s. 3989-3994
-
Konferensbidrag (refereegranskat)abstract
- In this paper, for linear time-invariant plants, where a collection of possible inputs and outputs are known a priori, we address the problem of determining the communication between outputs and inputs, i.e., information patterns, such that desired control objectives of the closed-loop system (for instance, stabilizability) through static output feedback may be ensured.
|
|
| 5. |
- Delvenne, J. -C, et al.
(författare)
-
Deriving thermodynamics from linear dissipativity theory
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - : IEEE conference proceedings. - 9781479978861 ; , s. 537-542
-
Konferensbidrag (refereegranskat)abstract
- Complete and rigorous foundations for basic thermodynamic laws from the statistical description of microscopic systems has been a long-standing goal for mathematicians and physicists alike since Boltzmann. In this paper, we show how Willems's dissipativity theory provides a convenient framework to study a physical system at both microscopic and macroscopic level, and suggests a natural storage function different from the usual free energy to derive the theorem of energy equipartition of energy for linear systems. In this setup, we introduce a simple and general definition for temperature defined also out of equilibrium which allows to test the limits of validity of Fourier's law describing the transfer of heat from hot systems to cold systems. In particular under time-scale separation conditions, we derive the Maxwell-Cattaneo law, allowing for instantaneous flow of energy from cold to hot systems, which should be considered instead of Fourier's law for a proper description of energy exchanges between interconnected linear systems.
|
|
| 6. |
- Farokhi, F., et al.
(författare)
-
Quadratic Gaussian privacy games
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - : IEEE conference proceedings. - 9781479978861 ; , s. 4505-4510
-
Konferensbidrag (refereegranskat)abstract
- A game-theoretic model for analysing the effects of privacy on strategic communication between agents is devised. In the model, a sender wishes to provide an accurate measurement of the state to a receiver while also protecting its private information (which is correlated with the state) private from a malicious agent that may eavesdrop on its communications with the receiver. A family of nontrivial equilibria, in which the communicated messages carry information, is constructed and its properties are studied.
|
|
| 7. |
- Feyzmahdavian, Hamid Reza, et al.
(författare)
-
Delay-independent stability of cone-invariant monotone systems
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - : IEEE. - 0743-1546 .- 2576-2370. - 9781479978861 ; 2016-February, s. 6361-6366, s. 6361-6366
-
Konferensbidrag (refereegranskat)abstract
- Recent results in the literature have shown that particular classes of positive systems are insensitive to time-varying delays, giving the impression that the delay-insensitivity property stems from the fact that the system is positive. Nonetheless, it has been lately shown that a linear cone-invariant system is insensitive to time-varying delays, asserting that the property of delay-independence may stem from the fact that the system is cone-invariant rather than positive. In this paper, we provide additional evidence for this claim by analyzing the stability of cone-invariant monotone systems with bounded time-varying delays. We present a set of sufficient conditions for delay independent stability of discrete- and continuous-time cone-invariant monotone systems. For linear cone-invariant systems, we show that the stability conditions we have derived are also necessary.
|
|
| 8. |
- Giselsson, Pontus
(författare)
-
Tight linear convergence rate bounds for Douglas-Rachford splitting and ADMM
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - 9781479978861 ; 2016, s. 3305-3310
-
Konferensbidrag (refereegranskat)abstract
- Douglas-Rachford splitting and the alternating direction method of multipliers (ADMM) can be used to solve convex optimization problems that consist of a sum of two functions. Convergence rate estimates for these algorithms have received much attention lately. In particular, linear convergence rates have been shown by several authors under various assumptions. One such set of assumptions is strong convexity and smoothness of one of the functions in the minimization problem. The authors recently provided a linear convergence rate bound for such problems. In this paper, we show that this rate bound is tight for the class of problems under consideration.
|
|
| 9. |
- Guo, Meng, et al.
(författare)
-
Hybrid control of multi-agent systems under local temporal tasks and relative-distance constraints
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - : IEEE conference proceedings. - 9781479978861 ; , s. 1701-1706
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we propose a distributed hybrid control strategy for multi-agent systems where each agent has a local task specified as a Linear Temporal Logic (LTL) formula and at the same time is subject to relative-distance constraints with its neighboring agents. The local tasks capture the temporal requirements on individual agents' behaviors, while the relative-distance constraints impose requirements on the collective motion of the whole team. The proposed solution relies only on relative-state measurements among the neighboring agents without the need for explicit information exchange. It is guaranteed that the local tasks given as syntactically co-safe or general LTL formulas are fulfilled and the relative-distance constraints are satisfied at all time. The approach is demonstrated with computer simulations.
|
|
| 10. |
- Hajiesmaili, M. H., et al.
(författare)
-
Utility-optimal dynamic rate allocation under average end-to-end delay requirements
- 2016
-
Ingår i: Proceedings of the IEEE Conference on Decision and Control. - : IEEE conference proceedings. - 9781479978861 ; , s. 4842-4847
-
Konferensbidrag (refereegranskat)abstract
- QoS-aware networking applications such as real-time streaming and video surveillance systems require nearly fixed average end-to-end delay over long periods to communicate efficiently, although may tolerate some delay variations in short periods. This variability exhibits complex dynamics that makes rate control of such applications a formidable task. This paper addresses rate allocation for heterogeneous QoS-aware applications that preserves the long-term average end-to-end delay constraint while, similar to Dynamic Network Utility Maximization (DNUM), strives to achieve the maximum network utility aggregated over a fixed time interval. Since capturing temporal dynamics in QoS requirements of sources is allowed in our system model, we incorporate a novel time-coupling constraint in which delay-sensitivity of sources is considered such that a certain end-to-end average delay for each source over a pre-specified time interval is satisfied. We propose DA-DNUM algorithm, as a dual-based solution, which allocates source rates for the next time interval in a distributed fashion, given the knowledge of network parameters in advance. Through numerical experiments, we show that DA-DNUM gains higher average link utilization and a wider range of feasible scenarios in comparison with the best, to our knowledge, rate control schemes that may guarantee such constraints on delay.
|
|
