SwePub
Sök i SwePub databas

  Utökad sökning

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

Sökning: WFRF:(Johansson Karl H. 1967 )

  • Resultat 1-10 av 368
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Bai, Ting, et al. (författare)
  • A Pricing Rule for Third-Party Platoon Coordination Service Provider
  • 2022
  • Ingår i: ASCC 2022 - 2022 13th Asian Control Conference, Proceedings. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 2344-2349
  • Konferensbidrag (refereegranskat)abstract
    • We model a platooning system including trucks and a third-party service provider that performs platoon coordination, distributes the platooning profit within platoons, and charges the trucks in exchange for its services. This paper studies one class of pricing rules, where the third-party service provider keeps part of the platooning profit each time a platoon is formed. Furthermore, we propose a platoon coordination solution based on distributed model predictive control in which the pricing rule is integrated. To evaluate the effect of the pricing on the platooning system, we perform a simulation over the Swedish road network. The simulation shows that the platooning rate and profit highly depend on the pricing. This suggests that pricing needs to be set carefully to obtain a satisfactory platooning system in the future.
  •  
2.
  • Bai, Ting, et al. (författare)
  • Approximate Dynamic Programming for Platoon Coordination under Hours-of-Service Regulations
  • 2022
  • Ingår i: 2022 IEEE 61ST CONFERENCE ON DECISION AND CONTROL (CDC). - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 7663-7669
  • Konferensbidrag (refereegranskat)abstract
    • Truck drivers are required to stop and rest with a certain regularity according to the driving and rest time regulations, also called Hours-of-Service (HoS) regulations. This paper studies the problem of optimally forming platoons when considering realistic HoS regulations. In our problem, trucks have fixed routes in a transportation network and can wait at hubs along their routes to form platoons with others while fulfilling the driving and rest time constraints. We propose a distributed decision-making scheme where each truck controls its waiting times at hubs based on the predicted schedules of others. The decoupling of trucks' decision-makings contributes to an approximate dynamic programming approach for platoon coordination under HoS regulations. Finally, we perform a simulation over the Swedish road network with one thousand trucks to evaluate the achieved platooning benefits under the HoS regulations in the European Union (EU). The simulation results show that, on average, trucks drive in platoons for 37 % of their routes if each truck is allowed to be delayed for 5 % of its total travel time. If trucks are not allowed to be delayed, they drive in platoons for 12 % of their routes.
  •  
3.
  • Bai, Ting, et al. (författare)
  • Event-Triggered Distributed Model Predictive Control for Platoon Coordination at Hubs in a Transport System
  • 2021
  • Ingår i: 2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC). - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 1198-1204
  • Konferensbidrag (refereegranskat)abstract
    • This paper considers the problem of hub-based platoon coordination for a large-scale transport system, where trucks have individual utility functions to optimize. An event-triggered distributed model predictive control method is proposed to solve the optimal scheduling of waiting times at hubs for individual trucks. In this distributed framework, trucks are allowed to decide their waiting times independently and only limited information is shared between trucks. Both the predicted reward gained from platooning and the predicted cost for waiting at hubs are included in each truck's utility function. The performance of the coordination method is demonstrated in a simulation with one hundred trucks over the Swedish road network.
  •  
4.
  • Bai, Ting, et al. (författare)
  • Large-Scale Multi-Fleet Platoon Coordination : A Dynamic Programming Approach
  • 2023
  • Ingår i: IEEE transactions on intelligent transportation systems (Print). - : Institute of Electrical and Electronics Engineers (IEEE). - 1524-9050 .- 1558-0016. ; 24:12, s. 14427-14442
  • Tidskriftsartikel (refereegranskat)abstract
    • Truck platooning is a promising technology that enables trucks to travel in formations with small inter-vehicle distances for improved aerodynamics and fuel economy. The real-world transportation system includes a vast number of trucks owned by different fleet owners, for example, carriers. To fully exploit the benefits of platooning, efficient dispatching strategies that facilitate the platoon formations across fleets are required. This paper presents a distributed framework for addressing multi-fleet platoon coordination in large transportation networks, where each truck has a fixed route and aims to maximize its own fleet's platooning profit by scheduling its waiting times at hubs. The waiting time scheduling problem of individual trucks is formulated as a distributed optimal control problem with continuous decision space and a reward function that takes non-zero values only at discrete points. By suitably discretizing the decision and state spaces, we show that the problem can be solved exactly by dynamic programming, without loss of optimality. Finally, a realistic simulation study is conducted over the Swedish road network with 5,000 trucks to evaluate the profit and efficiency of the approach. The simulation study shows that, compared to single-fleet platooning, multi-fleet platooning provided by our method achieves around 15 times higher monetary profit and increases the CO2 emission reductions from 0.4% to 5.5%. In addition, it shows that the developed approach can be carried out in real-time and thus is suitable for platoon coordination in large transportation systems.
  •  
5.
  • Björk, Joakim, 1989- (författare)
  • Fundamental Control Performance Limitations for Interarea Oscillation Damping and Frequency Stability
  • 2021
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • With the transition towards renewable energy and the deregulation of the electricity markets, the power system is changing. Growing electricity demand and more intermittent power production increase the need for transfer capacity. Lower inertia levels due to a higher share of renewables increase the need for fast frequency reserves (FFR). In this thesis, we study fundamental control limitations for improving the damping of interarea oscillations and frequency stability.The first part of the thesis considers the damping of oscillatory interarea modes. These system-wide modes involve power oscillating between groups of generators and are sometimes hard to control due to their scale and complexity. We consider limitations of decentralized control schemes based on local measurements, as well as centralized control schemes with limitations associated to actuator dynamics and network topology. It is shown that the stability of asynchronous grids can be improved by modulating the active power of a single interconnecting high-voltage direct current (HVDC) link. One challenge with modulating HVDC active power is that the interaction between interarea modes of the two grids may have a negative impact on system stability. By studying the controllability Gramian, we show that it is possible to improve the damping in both grids as long as the frequencies of their interarea modes are not too close. It is demonstrated how the controllability, and therefore the achievable damping, deteriorates as the frequency difference becomes small. With a modal frequency difference of 5%, the damping can be improved by around 2 percentage points whereas a modal frequency difference of 20% allows for around 8 percentage points damping improvement. The results are validated by simulating two HVDC-interconnected 32-bus power system models. We also consider the coordinated control of two and more HVDC links. For some network configurations, it is shown that the interaction between troublesome interarea modes can be avoided. The second part considers the coordination of frequency containment reserves (FCR) in low-inertia power systems. A case study is performed in a 5-machine model of the Nordic synchronous grid. We consider a low-inertia test case where FCR are provided by hydro power. The non-minimum phase characteristic of the waterways limits the achievable bandwidth of the FCR control. It is shown that a consequence of this is that hydro-FCR fails at keeping the frequency nadir above the 49.0 Hz safety limit following the loss of a HVDC link that imports 1400 MW. To improve the dynamic frequency stability, FFR from wind power is considered. For this, a new wind turbine model is developed. The turbine is controlled at variable-speed, enabling FFR by temporarily borrowing energy from the rotating turbine. The nonlinear wind turbine dynamics are linearized to facilitate a control design that coordinate FFR from the wind with slow FCR from hydropower. Complementary wind resources with a total rating of 2000 MW, operating at 70–90% rated wind speeds, is shown to be more than enough to fulfill the frequency stability requirements. The nadir is kept above 49.0 Hz without the need to install battery storage or to waste wind energy by curtailing the wind turbines.
  •  
6.
  • Champati, Jaya Prakash, et al. (författare)
  • Performance Characterization Using AoI in a Single-loop Networked Control System
  • 2019
  • Ingår i: IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2019. - : IEEE. - 9781728118789 ; , s. 197-203
  • Konferensbidrag (refereegranskat)abstract
    • The joint design of control and communication scheduling in a Networked Control System (NCS) is known to be a hard problem. Several research works have successfully designed optimal sampling and/or control strategies under simplified communication models, where transmission delays/times are negligible or fixed. However, considering sophisticated communication models, with random transmission times, result in highly coupled and difficult-to-solve optimal design problems due to the parameter inter-dependencies between estimation/control and communication layers. To tackle this problem, in this work, we investigate the applicability of Age-of-Information (AoI) for solving control/estimation problems in an NCS under i.i.d. transmission times. Our motivation for this investigation stems from the following facts: 1) recent results indicate that AoI can be tackled under relatively sophisticated communication models, and 2) a lower AoI in an NCS may result in a lower estimation/control cost. We study a joint optimization of sampling and scheduling for a single-loop stochastic LTI networked system with the objective of minimizing the time-average squared norm of the estimation error. We first show that, under mild assumptions on information structure the optimal control policy can be designed independently from the sampling and scheduling policies. We then derive a key result that minimizing the estimation error is equivalent to minimizing a non-negative and non-decreasing function of AoI. The parameters of this function include the LTI matrix and the covariance of exogenous noise in the LTI system. Noting that the formulated problem is a stochastic combinatorial optimization problem and is hard to solve, we resort to heuristic algorithms by extending existing algorithms in the AoI literature. We also identify a class of LTI system dynamics for which minimizing the estimation error is equivalent to minimizing the expected AoI.
  •  
7.
  • Di Benedetto, Maria Domenica, et al. (författare)
  • Industrial control over wireless networks
  • 2010
  • Ingår i: International Journal of Robust and Nonlinear Control. - : JOHN WILEY & SONS LTD. - 1049-8923 .- 1099-1239. ; 20:2, s. 119-122
  • Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
  •  
8.
  • Fang, Song, et al. (författare)
  • Generic Variance Bounds on Estimation and Prediction Errors in Time Series Analysis : An Entropy Perspective
  • 2019
  • Ingår i: 2019 IEEE Information Theory Workshop, ITW 2019. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781538669006
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, we obtain generic bounds on the variances of estimation and prediction errors in time series analysis via an information-theoretic approach. It is seen in general that the error bounds are determined by the conditional entropy of the data point to be estimated or predicted given the side information or past observations. Additionally, we discover that in order to achieve the prediction error bounds asymptotically, the necessary and sufficient condition is that the 'innovation' is asymptotically white Gaussian. When restricted to Gaussian processes and 1-step prediction, our bounds are shown to reduce to the Kolmogorov-Szegö formula and Wiener-Masani formula known from linear prediction theory.
  •  
9.
  • Jafarian, Matin, et al. (författare)
  • Stochastic phase-cohesiveness of discrete-time Kuramoto oscillators in a frequency-dependent tree network
  • 2019
  • Ingår i: Proceedings 2019 18th European Control Conference (ECC). - : IEEE. - 9783907144008 ; , s. 1987-1992
  • Konferensbidrag (refereegranskat)abstract
    • This paper presents the notion of stochastic phase-cohesiveness based on the concept of recurrent Markov chains and studies the conditions under which a discrete-time stochastic Kuramoto model is phase-cohesive. It is assumed that the exogenous frequencies of the oscillators are combined with random variables representing uncertainties. A bidirectional tree network is considered such that each oscillator is coupled to its neighbors with a coupling law which depends on its own noisy exogenous frequency. In addition, an undirected tree network is studied. For both cases, a sufficient condition for the common coupling strength (kappa) and a necessary condition for the sampling-period are derived such that the stochastic phase-cohesiveness is achieved. The analysis is performed within the stochastic systems framework and validated by means of numerical simulations.
  •  
10.
  • Jafarian, Matin, et al. (författare)
  • Stochastic Stability of Discrete-Time Phase-Coupled Oscillators over Uncertain and Random Networks
  • 2024
  • Ingår i: IEEE Transactions on Automatic Control. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9286 .- 1558-2523. ; 69:5, s. 2915-2930
  • Tidskriftsartikel (refereegranskat)abstract
    • This article studies stochastic relative phase stability, i.e., stochastic phase-cohesiveness, of discrete-time phase-coupled oscillators. The stochastic phase-cohesiveness in two types of networks is studied. First, we consider oscillators coupled with 2π-periodic odd functions over underlying undirected graphs subject to both multiplicative and additive stochastic uncertainties. We prove stochastic phase-cohesiveness of the network with respect to two specific, namely, in-phase and antiphase, sets by deriving sufficient coupling conditions. We show the dependency of these conditions on the size of the mean values of additive and multiplicative uncertainties, as well as the sign of the mean values of multiplicative uncertainties. Furthermore, we discuss the results under a relaxation of the odd property of the coupling function. Second, we study an uncertain network in which the multiplicative uncertainties are governed by the Bernoulli process representing the well-known Erdös-Rényi network. We assume constant exogenous frequencies and derive sufficient conditions for achieving both stochastic phase-cohesive and phase-locked solutions, i.e., stochastic phase-cohesiveness with respect to the origin. For the latter case, where identical exogenous frequencies are assumed, we prove that any positive probability of connectivity leads to phase-locking. Thorough analyses are provided, and insights obtained from stochastic analysis are discussed, along with numerical simulations to validate the analytical results.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 368
Typ av publikation
konferensbidrag (185)
tidskriftsartikel (138)
bokkapitel (20)
doktorsavhandling (12)
licentiatavhandling (6)
forskningsöversikt (5)
visa fler...
proceedings (redaktörskap) (1)
annan publikation (1)
visa färre...
Typ av innehåll
refereegranskat (341)
övrigt vetenskapligt/konstnärligt (27)
Författare/redaktör
Johansson, Karl H., ... (355)
Sandberg, Henrik (47)
Yi, Xinlei (24)
Mårtensson, Jonas, 1 ... (23)
Yang, Tao (23)
He, Xingkang (21)
visa fler...
Xie, Lihua (20)
Alanwar, Amr (17)
Gao, Yulong (16)
Dimarogonas, Dimos V ... (15)
Čičić, Mladen, 1991- (15)
Nekouei, Ehsan (14)
Jiang, Frank (13)
Wei, Jieqiang (13)
Johansson, Karl H., ... (12)
Yang, T. (11)
Meng, Ziyang (11)
Pare, Philip E. (10)
Johansson, Alexander (10)
Mamduhi, Mohammad H. (10)
Skoglund, Mikael, 19 ... (10)
Rikos, Apostolos (10)
Xing, Yu (10)
Li, Yuchao (9)
Meng, Z. (8)
Pirani, Mohammad (8)
Gracy, Sebin (8)
Adaldo, Antonio (7)
Iwaki, Takuya, 1986- (7)
Niazi, Muhammad Umar ... (7)
Hadjicostis, Christo ... (7)
Ren, Xiaoqiang (7)
Jafarian, Matin (7)
Hashemi, Ehsan (7)
Yoo, Jaehyun (7)
Molinari, Marco (6)
Bai, Ting (6)
Mo, Yilin (6)
Shi, Ling (6)
Liu, Changxin (6)
Fonseca, Joana (6)
Li, Xiuxian (6)
Xie, L. (5)
Aguiar, Miguel (5)
Tanaka, Takashi (5)
Charalambous, Themis ... (5)
Shi, Yang (5)
Ishii, Hideaki (5)
Stefansson, Elis (5)
Wu, Junfeng (5)
visa färre...
Lärosäte
Kungliga Tekniska Högskolan (368)
Uppsala universitet (5)
Luleå tekniska universitet (3)
Högskolan i Halmstad (2)
Stockholms universitet (1)
Linköpings universitet (1)
Språk
Engelska (368)
Forskningsämne (UKÄ/SCB)
Teknik (324)
Naturvetenskap (57)
Medicin och hälsovetenskap (3)
Samhällsvetenskap (3)
Lantbruksvetenskap (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