| 1. |
- Theorin, Alfred, et al.
(författare)
-
An Event-Driven Manufacturing Information System Architecture
- 2015
-
Ingår i: 15th IFAC Symposium onInformation Control Problems inManufacturing - INCOM 2015. - : Elsevier BV. ; 48:3, s. 547-554
-
Konferensbidrag (refereegranskat)abstract
- Future manufacturing systems need to be more flexible, to embrace tougher and constantly changing market demands. They also need to make better use of plant data, ideally utilizing all data from the entire plant. Low-level data should be refined to real-time information for decision making, to facilitate competitiveness through informed and timely decisions. The Line Information System Architecture, LISA, is designed to enable flexible factory integration and data utilization. In LISA, international standards and established off-the-shelf technologies have been combined with the main objective to be industrially applicable. LISA is an event-driven architecture with a prototype-oriented information model and formalized transformation services. It features loose coupling, flexibility, and ease of retrofitting legacy devices. The architecture has been evaluated on both real industrial data and industrial demonstrators and is also being installed at a large automotive company.
|
|
| 2. |
- Hamon, Camille, et al.
(författare)
-
A Stochastic Optimal Power Flow Problem With Stability Constraints-Part I : Approximating the Stability Boundary
- 2013
-
Ingår i: IEEE Transactions on Power Systems. - 0885-8950 .- 1558-0679. ; 28:2, s. 1839-1848
-
Tidskriftsartikel (refereegranskat)abstract
- Stochastic optimal power flow can provide the system operator with adequate strategies for controlling the power flow to maintain secure operation under stochastic parameter variations. One limitation of stochastic optimal power flow has been that only line flows have been used as security constraints. In many systems voltage stability and small-signal stability also play an important role in constraining the operation. In this paper we aim to extend the stochastic optimal power flow problem to include constraints for voltage stability as well as small-signal stability. This is done by approximating the voltage stability and small-signal stability constraint boundaries with second-order approximations in parameter space. Then we refine methods from mathematical finance to be able to estimate the probability of violating the constraints. In this first part of the paper, we derive second-order approximations of stability boundaries in parameter space. In the second part, the approximations will be used to solve a stochastic optimal power flow problem.
|
|
| 3. |
- Ivanenko, Yevhen, et al.
(författare)
-
Quasi-Herglotz functions and convex optimization
- 2020
-
Ingår i: Royal Society Open Science. - : The Royal Society Publishing. - 2054-5703. ; 7:1, s. 1-15
-
Tidskriftsartikel (refereegranskat)abstract
- We introduce the set of quasi-Herglotz functions and demonstrate that it has properties useful in the modelling of non-passive systems. The linear space of quasi-Herglotz functions constitutes a natural extension of the convex cone of Herglotz functions. It consists of differences of Herglotz functions and we show that several of the important properties and modelling perspectives are inherited by the new set of quasi-Herglotz functions. In particular, this applies to their integral representations, the associated integral identities or sum rules (with adequate additional assumptions), their boundary values on the real axis and the associated approximation theory. Numerical examples are included to demonstrate the modelling of a non-passive gain medium formulated as a convex optimization problem, where the generating measure is modelled by using a finite expansion of B-splines and point masses.
|
|
| 4. |
- Nedic, Mitja, et al.
(författare)
-
Herglotz functions and applications in electromagnetics
- 2020
-
Ingår i: Advances in Mathematical Methods for Electromagnetics. - : Institution of Engineering and Technology. - 9781785613845 - 9781785613852 ; , s. 491-514
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- Herglotz functions inevitably appear in pure mathematics, mathematical physics, and engineering with a wide range of applications. In particular, they are the pertinent functions to model passive systems, and thus appear in modeling of electromagnetic phenomena in circuits, antennas, materials, and scattering. In this chapter, we review the basic theory of Herglotz functions and its applications to determine sum rules and physical bounds for passive systems.
|
|
| 5. |
- Perninge, Magnus, et al.
(författare)
-
A Stochastic Optimal Power Flow Problem With Stability Constraints-Part II : The Optimization Problem
- 2013
-
Ingår i: IEEE Transactions on Power Systems. - 0885-8950 .- 1558-0679. ; 28:2, s. 1849-1857
-
Tidskriftsartikel (refereegranskat)abstract
- Stochastic optimal power flow can provide the system operator with adequate strategies for controlling the power flow to maintain secure operation under stochastic parameter variations. One limitation of stochastic optimal power flow has been that only limits on line flows have been used as stability constraints. In many systems voltage stability and small-signal stability also play an important role in constraining the operation. In this paper we aim to extend the stochastic optimal power flow problem to include constraints for voltage stability as well as small-signal stability. This is done by approximating the voltage stability and small-signal stability constraint surfaces with second-order approximations in parameter space. Then we refine methods from mathematical finance to be able to estimate the probability of violating the constraints. In this, the second part of the paper, we look at how Cornish-Fisher expansion combined with a method of excluding sets that are counted twice, can be used to estimate the probability of violating the stability constraints. We then show in a numerical example how this leads to an efficient solution method for the stochastic optimal power flow problem.
|
|
| 6. |
- Perninge, Magnus, 1980-, et al.
(författare)
-
Approximating a post-contingency stable operation region in parameter space through time-domain simulation
- 2013
-
Ingår i: Proceedings of IREP Symposium. - : IEEE. - 9781479901999
-
Konferensbidrag (refereegranskat)abstract
- Operating criteria for power systems, such as the (N - 1)-criterion, are often based on evaluating whether the system is vulnerable to a specific set of contingencies. Therefore, a major part of power system security is concerned with establishing regions in parameter space where the system is vulnerable to specific contingencies. In this article we exploit the possibility of using Monte Carlo simulations to build an approximation of the region, in parameter space, where the power system will remain stable following a given contingency.
|
|
| 7. |
- Perninge, Magnus
(författare)
-
Approximating the loadability surface in the presence of SNB-SLL corner points
- 2013
-
Ingår i: Electric power systems research. - : Elsevier BV. - 0378-7796 .- 1873-2046. ; 96, s. 64-74
-
Tidskriftsartikel (refereegranskat)abstract
- Power system voltage security assessment is generally applied by considering the power system loadability surface. For a large power system, the loadability surface is a complicated hyper-surface in parameter space, and local approximations are a necessity for any analysis. Unfortunately, inequality constraints due to for example generator overexitation limiters, and higher codimension bifurcations, make the loadability surface non-smooth. One situation that is particularly difficult to handle is when a saddle-node bifurcation surface intersects a switching loadability limit surface. In this article we intend to investigate how several local approximations can be combined to obtain an adequate approximation of the loadability surface near such intersections.
|
|
| 8. |
- Åmand, Linda, et al.
(författare)
-
Aeration control - a review
- 2013
-
Ingår i: Water Science and Technology. - : IWA Publishing. - 0273-1223 .- 1996-9732. ; 67:11, s. 2374-2398
-
Tidskriftsartikel (refereegranskat)abstract
- This review covers automatic control of continuous aeration systems in municipal wastewater treatment plants. The review focuses on published research in the 21st century and describes research into various methods to decide and control the dissolved oxygen (DO) concentration and to control the aerobic volume with special focus on plants with nitrogen removal. Important aspects of control system implementation and success are discussed, together with a critical review of published research on the topic. With respect to DO control and determination, the strategies used for control span from modifications and developments of conventional control methods which have been explored since the 1970s, to advanced control such as model-based predictive and optimal controllers. The review is supplemented with a summary of comparisons between control strategies evaluated in full-scale, pilot-scale and in simulations.
|
|
| 9. |
- Millnert, Victor
(författare)
-
A Timely Journey Through the Cloud
- 2019
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis treats the intersection between two of the largest transformations we are seeing within our society today; the cloud and the Internet-of-Things (IoT). The aim of this thesis is to investigate different ways to model and control a network of cloud services so that timing-critical IoT applications can make use of them. Examples of such applications can be autonomous and mobile robots, smart production plants, or massive multi-player augmented-reality games. The main motivational use-case, however, comes from the industrial side, and their digitalization, the drive towards industrial IoT (IIoT). We wish to enable smart robots to offload some of their computations to the cloud in order to allow for better and smarter control and collaboration. For instance, using the cloud, it would become possible for them to collaborate and make use of smarter analytics, artificial intelligence, and machine learning, in order to improve efficiency and safety. To address this problem the thesis combines concepts and theory from different fields, most notably from control theory, real-time systems, and network calculus. Examples are: modeling of dynamic systems and the use of feedback and feedforward control from control theory, the goal of ensuring that end-to-end deadlines are met, from real-time systems, and finally the principles of modeling traffic from network calculus. The thesis begins with an introduction to provide some background on cloud, IIoT, and to set the scope of the thesis. Following this, we begin by treating the problem of controlling a single cloud service with the goal of ensuring that the traffic flowing through the node is guaranteed to meet a deadline. Following this, we study a chain of connected cloud nodes, investigating how to provide end-to-end deadline guarantees for the traffic flowing through the chain. The chain is finally generalized to a network of cloud nodes, with multiple flows traversing it. For this problem we study how to ensure that the end-to-end deadline of every single flow in the network is guaranteed. We also provide a set of protocols controlling how cloud nodes and flows are allowed to dynamically join and leave the network, such that no end-to-end deadline is violated.
|
|
| 10. |
- Pioro, Michal, et al.
(författare)
-
On efficient max-min fair routing algorithms
- 2003
-
Ingår i: Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003. - Antalya : IEEE conference proceedings. - 076951961X ; , s. 365-372
-
Konferensbidrag (refereegranskat)abstract
- In the paper, we consider the problem of routing and bandwidth allocation in networks that support elastic traffic. We assume that the bandwidth demand between each source-destination (S-D) pair is specified in terms of a minimum and maximum value, and a set of flows between each S-D pair is allowed to realize these demands. (We say that a set of flows realizes the demand associated with an S-D pair, if the sum of the bandwidths allocated to these flows is greater than the minimum value assumed for the demand of that S-D pair). In this setting, we show that routing and bandwidth allocation can be formulated as an optimization problem, where network utilization is to be maximized under capacity and the widely used max-min fairness constraints. We describe three different algorithms to solve variants of this problem. The most important one, an efficient, original algorithm assuming multipath routing is studied in detail and illustrated with a numerical example
|
|
