SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Johansson Karl Henrik 1967 ) "

Sökning: WFRF:(Johansson Karl Henrik 1967 )

  • Resultat 1-10 av 73
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Ahlén, Anders, et al. (författare)
  • Towards Wireless Control in Industrial Process Automation : A Case Study at a Paper Mill
  • 2019
  • Ingår i: IEEE CONTROL SYSTEMS MAGAZINE. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1066-033X .- 1941-000X. ; 39:5, s. 36-57
  • Tidskriftsartikel (refereegranskat)abstract
    • Wireless sensors and networks are used only occasionally in current control loops in the process industry. With rapid developments in embedded and highperformance computing, wireless communication, and cloud technology, drastic changes in the architecture and operation of industrial automation systems seem more likely than ever. These changes are driven by ever-growing demands on production quality and flexibility. However, as discussed in "Summary," there are several research obstacles to overcome. The radio communication environment in the process industry is often troublesome, as the environment is frequently cluttered with large metal objects, moving machines and vehicles, and processes emitting radio disturbances [1], [2]. The successful deployment of a wireless control system in such an environment requires careful design of communication links and network protocols as well as robust and reconfigurable control algorithms.
  •  
2.
  • Briat, C., et al. (författare)
  • The Conservation of Information, Towards an Axiomatized Modular Modeling Approach to Congestion Control
  • 2015
  • Ingår i: IEEE/ACM Transactions on Networking. - 1063-6692 .- 1558-2566. ; 23:3, s. 851-865
  • Tidskriftsartikel (refereegranskat)abstract
    • We derive a modular fluid-flow network congestion control model based on a law of fundamental nature in networks: the conservation of information. Network elements such as queues, users, and transmission channels and network performance indicators like sending/acknowledgment rates and delays are mathematically modeled by applying this law locally. Our contributions are twofold. First, we introduce a modular metamodel that is sufficiently generic to represent any network topology. The proposed model is composed of building blocks that implement mechanisms ignored by the existing ones, which can be recovered from exact reduction or approximation of this new model. Second, we provide a novel classification of previously proposed models in the literature and show that they are often not capable of capturing the transient behavior of the network precisely. Numerical results obtained from packet-level simulations demonstrate the accuracy of the proposed model.
  •  
3.
  • Johansson, Alexander, et al. (författare)
  • Multi-Fleet Platoon Matching : A Game-Theoretic Approach
  • 2018
  • Ingår i: 2018 21ST INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC). - : IEEE. - 9781728103235 ; , s. 2980-2985
  • Konferensbidrag (refereegranskat)abstract
    • We consider the platoon matching problem for a set of trucks with the same origin, but different destinations. It is assumed that the vehicles benefit from traveling in a platoon for instance through reduced fuel consumption. The vehicles belong to different fleet owners and their strategic interaction is modeled as a non-cooperative game where the vehicle actions are their departure times. Each truck has a preferred departure time and its utility function is defined as the difference between its benefit from platooning and the cost of deviating from its preferred departure time. We show that the platoon matching game is an exact potential game. An algorithm based on best response dynamics is proposed for finding a Nash equilibrium of the game. At a Nash equilibrium, vehicles with the same departure time are matched to form a platoon. Finally, the total fuel reduction at the Nash equilibrium is studied and compared with that of a cooperative matching solution where a common utility function for all vehicles is optimized.
  •  
4.
  • Johansson, Alexander, et al. (författare)
  • Optimization of the H∞-norm of Dynamic Flow Networks
  • 2018
  • Ingår i: 2018 Annual American Control Conference (ACC). - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 1280-1285
  • Konferensbidrag (refereegranskat)abstract
    • 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.
  •  
5.
  • Sasahara, Hampei, et al. (författare)
  • Distributed Design of Glocal Controllers via Hierarchical Model Decomposition
  • 2023
  • Ingår i: IEEE Transactions on Automatic Control. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9286 .- 1558-2523. ; 68:10, s. 6146-6159
  • Tidskriftsartikel (refereegranskat)abstract
    • This article proposes a distributed design method of controllers with a glocal (global/local) information structure for large-scale network systems. The glocal controller of interest has a hierarchical structure, wherein a global subcontroller coordinates a set of disjoint local subcontrollers. The global subcontroller regulates interarea oscillations among subsystems, while local subcontrollers individually regulate intraarea oscillations of the respective subsystem. The distributed design of the glocal controller is addressed to enhance the scalability of controller synthesis, where the global subcontroller and all local subcontrollers are designed independently of each other. A design problem is formulated for subcontroller sets such that any combination of subcontrollers each of which belongs to its corresponding set guarantees stability of the closed-loop system. The core idea of the proposed method is to represent the original network system as a hierarchical cascaded system composed of reduced-order models representing the interarea and intraarea dynamics, referred to as hierarchical model decomposition. Distributed design is achieved by virtue of the cascade structure. The primary findings of this study are twofold. First, a tractable solution to the distributed design problem and an existence condition of the hierarchical model decomposition are presented. Second, a clustering method appropriate for the proposed framework and a robust extension are provided. Numerical examples of a power grid highlight the practical relevance of the proposed method.
  •  
6.
  • Shi, G., et al. (författare)
  • Emergent Behaviors over Signed Random Dynamical Networks : state-flipping model
  • 2015
  • Ingår i: IEEE Transactions on Control of Network Systems. - : IEEE. - 2325-5870. ; 2:2, s. 142-153
  • Tidskriftsartikel (refereegranskat)abstract
    • Recent studies from social, biological, and engineering network systems have drawn attention to the dynamics over signed networks, where each link is associated with a positive/negative sign indicating trustful/mistrustful, activator/ inhibitor, or secure/malicious interactions. We study asymptotic dynamical patterns that emerge among a set of nodes that interact in a dynamically evolving signed random network. Node interactions take place at random on a sequence of deterministic signed graphs. Each node receives positive or negative recommendations from its neighbors depending on the sign of the interaction arcs, and updates its state accordingly. Recommendations along a positive arc follow the standard consensus update. As in the work by Altafini, negative recommendations use an update where the sign of the neighbor state is flipped. Nodes may weight positive and negative recommendations differently, and random processes are introduced to model the time-varying attention that nodes pay to these recommendations. Conditions for almost sure convergence and divergence of the node states are established. We show that under this so-called state-flipping model, all links contribute to a consensus of the absolute values of the nodes, even under switching sign patterns and dynamically changing environment. A no-survivor property is established, indicating that every node state diverges almost surely if the maximum network state diverges.
  •  
7.
  • Wei, Jieqiang, et al. (författare)
  • Nonlinear Consensus Protocols With Applications to Quantized Communication and Actuation
  • 2019
  • Ingår i: IEEE Transactions on Control of Network Systems. - : Institute of Electrical and Electronics Engineers (IEEE). - 2325-5870. ; 6:2, s. 598-608
  • Tidskriftsartikel (refereegranskat)abstract
    • 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.
  •  
8.
  • Alanwar, Amr, et al. (författare)
  • Data-Driven Set-Based Estimation using Matrix Zonotopes with Set Containment Guarantees
  • 2022
  • Ingår i: 2022 EUROPEAN CONTROL CONFERENCE (ECC). - : IEEE. ; , s. 875-881
  • Konferensbidrag (refereegranskat)abstract
    • We propose a method to perform set-based state estimation of an unknown dynamical linear system using a data-driven set propagation function. Our method comes with set-containment guarantees, making it applicable to safety-critical systems. The method consists of two phases: (1) an offline learning phase where we collect noisy input-output data to determine a function to propagate the state-set ahead in time; and (2) an online estimation phase consisting of a time update and a measurement update. It is assumed that known finite sets bound measurement noise and disturbances, but we assume no knowledge of their statistical properties. These sets are described using zonotopes, allowing efficient propagation and intersection operations. We propose a new approach to compute a set of models consistent with the data and noise-bound, given input-output data in the offline phase. The set of models is utilized in replacing the unknown dynamics in the data-driven set propagation function in the online phase. Then, we propose two approaches to perform the measurement update. Simulations show that the proposed estimator yields state sets comparable in volume to the 3 sigma confidence bounds obtained by a Kalman filter approach, but with the addition of state set-containment guarantees. We observe that using constrained zonotopes yields smaller sets but with higher computational costs than unconstrained ones.
  •  
9.
  • Alanwar, Amr, et al. (författare)
  • Privacy-preserving set-based estimation using partially homomorphic encryption
  • 2023
  • Ingår i: European Journal of Control. - : Elsevier BV. - 0947-3580 .- 1435-5671. ; 71, s. 100786-
  • Tidskriftsartikel (refereegranskat)abstract
    • The set-based estimation has gained a lot of attention due to its ability to guarantee state enclosures for safety-critical systems. However, collecting measurements from distributed sensors often requires out-sourcing the set-based operations to an aggregator node, raising many privacy concerns. To address this problem, we present set-based estimation protocols using partially homomorphic encryption that pre-serve the privacy of the measurements and sets bounding the estimates. We consider a linear discrete-time dynamical system with bounded modeling and measurement uncertainties. Sets are represented by zonotopes and constrained zonotopes as they can compactly represent high-dimensional sets and are closed under linear maps and Minkowski addition. By selectively encrypting parameters of the set repre-sentations, we establish the notion of encrypted sets and intersect sets in the encrypted domain, which enables guaranteed state estimation while ensuring privacy. In particular, we show that our protocols achieve computational privacy using the cryptographic notion of computational indistinguishability. We demonstrate the efficiency of our approach by localizing a real mobile quadcopter using ultra-wideband wireless devices.
  •  
10.
  • Alisic, Rijad (författare)
  • Defense of Cyber-Physical Systems Against Learning-based Attackers
  • 2023
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Cyberattacks against critical infrastructures pose a serious threat to society, as they can have devastating consequences on the economy, security, or public health. These infrastructures rely on a large network of cyber components, such as sensors, controllers, computers, and communication devices, to monitor and control their physical processes. An adversary can exploit the vulnerabilities in these cyber components to gain access to the system and manipulate its behavior or functionality.This thesis proposes methods that can be employed as a first line of defense against such attacks for Cyber-Physical Systems. In the first part of the thesis, we consider how uninformed attackers can learn to attack a Cyber-Physical System by eavesdropping through the cyber component. By learning to manipulate the plant, the attacker could figure out how to destroy the physical system before it is too late or completely take it over without raising any alarms. Stopping the attacker at the learning stage would force the attacker to act obliviously, increasing the chances of detecting them.We analyze how homomorphic encryption, a technique that allows computation on encrypted data, hinders an attacker's learning process and reduces its capabilities to attack the system. Specifically, we show that an attacker must solve challenging lattice problems to find attacks that are difficult to detect. Additionally, we show how the detection probability is affected by the attacker's solution to the problems and what parameters of the encryption scheme can be tweaked to increase the detection probability. We also develop a novel method that enables anomaly detection over homomorphically encrypted data without revealing the actual signals to the detector, thereby discouraging attackers from launching attacks on the detector. The detection can be performed using a hypothesis test. However, special care must be taken to ensure that fresh samples are used to detect changes from nominal behavior. We also explore how the adversary can try to evade detection using the same test and how the system can be designed to make detection easier for the defender and more challenging for the attacker.In the second part of the thesis, we study how information leakage about changes in the system depends on the system's dynamics. We use a mathematical tool called the Hammersley-Chapman-Robbins lower bound to measure how much information is leaked and how to minimize it. Specifically, we study how structured input sequences, which we call events, can be obtained through the output of a dynamical system and how this information can be hidden by adding noise or changing the inputs. The system’s speed and sensor locations affect how much information is leaked. We also consider balancing the system’s performance and privacy when using optimal control. Finally, we show how to estimate when the adversary’s knowledge of the event becomes accurate enough to launch an attack and how to change the system before that happens. These results are then used to aid the operator in detecting privacy vulnerabilities when designing a Cyber-Physical System, which increases the overall security when removed.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 73
Typ av publikation
tidskriftsartikel (34)
konferensbidrag (30)
forskningsöversikt (3)
doktorsavhandling (2)
bokkapitel (2)
licentiatavhandling (2)
visa fler...
visa färre...
Typ av innehåll
refereegranskat (67)
övrigt vetenskapligt/konstnärligt (6)
Författare/redaktör
Sandberg, Henrik (52)
Johansson, Karl H., ... (47)
Johansson, Karl Henr ... (21)
Pare, Philip E. (8)
He, Xingkang (5)
Alanwar, Amr (4)
visa fler...
Dimarogonas, Dimos V ... (3)
Sandberg, Henrik, Pr ... (3)
Johansson, Karl H., ... (3)
Kim, Junsoo (3)
Ren, X. (2)
Tanaka, Takashi (2)
Iwaki, Takuya, 1986- (2)
Mårtensson, Jonas, 1 ... (2)
Yang, T. (1)
Chen, J. (1)
Hjalmarsson, Håkan (1)
Teixeira, André, Ass ... (1)
Fodor, Gabor, 1964- (1)
Gross, James, 1975- (1)
Liuzza, Davide (1)
Wu, J (1)
Lindh, Thomas (1)
Hashemi, E. (1)
Ahlén, Anders (1)
Das, Amritam (1)
Quevedo, D. E. (1)
Åkerberg, Johan (1)
Eriksson, Markus (1)
Knorn, Steffi (1)
Isaksson, Alf (1)
Lindström, Martin (1)
Chen, Jie (1)
Chen, Wei (1)
Proutiere, Alexandre (1)
Johansson, Karl, 196 ... (1)
Niazi, Muhammad Umar ... (1)
Berndt, Alexander (1)
Said, Hazem (1)
Althoff, Matthias (1)
Jiang, Frank (1)
Gassmann, Victor (1)
Nilsson, Håkan, 1976 ... (1)
Papadimitratos, Pana ... (1)
Alisic, Rijad (1)
Paré, P. E. (1)
Pajic, Miroslav, Pro ... (1)
Alisic, Rijad, 1994- (1)
Roy, Sandip (1)
Johansson, Mikael (1)
visa färre...
Lärosäte
Kungliga Tekniska Högskolan (73)
Uppsala universitet (5)
Högskolan i Halmstad (1)
Linköpings universitet (1)
Språk
Engelska (73)
Forskningsämne (UKÄ/SCB)
Teknik (65)
Naturvetenskap (9)
Medicin och hälsovetenskap (1)
Samhällsvetenskap (1)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy