Theoretical Development and Numerical Validation of an Asymmetric Linear Bilateral Control Model- Case Study for an Automated Truck Platoon
In this paper, we theoretically develop and numerically validate an asymmetric linear bilateral control model (LBCM). The novelty of the asymmetric LBCM is that using this model all the follower vehicles in a platoon can adjust their acceleration and deceleration to closely follow a constant desired time gap to improve platoon operational efficiency while maintaining local and string stability. We theoretically analyze the local stability of the asymmetric LBCM using the condition for asymptotic stability of a linear time-invariant system and prove the string stability of the asymmetric LBCM using a space gap error attenuation approach. Then, we evaluate the efficacy of the asymmetric LBCM by simulating a closely coupled cooperative adaptive cruise control (CACC) platoon of fully automated trucks in various non-linear acceleration and deceleration states. We choose automated truck platooning as a case study since heavy-duty trucks experience higher delays and lags in the powertrain system, and limited acceleration and deceleration capabilities than passenger cars. To evaluate the platoon operational efficiency of the asymmetric LBCM, we compare the performance of the asymmetric LBCM to a baseline model, i.e., the symmetric LBCM, for different powertrain delays and lags. Our analyses found that the asymmetric LBCM can handle any combined powertrain delays and lags up to 0.6 sec while maintaining a constant desired time gap during a stable platoon operation, whereas the symmetric LBCM fails to ensure stable platoon operation as well as maintain a constant desired time gap for any combined powertrain delays and lags over 0.2 sec. These findings demonstrate the potential of the asymmetric LBCM in improving platoon operational efficiency and stability of an automated truck platoon.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
In this paper, we focus on a matrix factorization-based approach to recover low-rank {\it asymmetric} matrices from corrupted measurements. We propose an {\it Overparameterized Preconditioned Subgradient Algorithm (OPSA)…
Learning Distributed Equilibria in Linear-Quadratic Stochastic Differential Games: An $α$-Potential Approach
We analyze independent policy-gradient (PG) learning in $N$-player linear-quadratic (LQ) stochastic differential games. Each player employs a distributed policy that depends only on its own state and updates the policy i…
Resilient Model-Free Asymmetric Bipartite Consensus for Nonlinear Multi-Agent Systems against DoS Attacks
In this letter, we study an unified resilient asymmetric bipartite consensus (URABC) problem for nonlinear multi-agent systems with both cooperative and antagonistic interactions under denial-of-service (DoS) attacks. We…
A Theoretical Justification for Asymmetric Actor-Critic Algorithms
In reinforcement learning for partially observable environments, many successful algorithms were developed within the asymmetric learning paradigm. This paradigm leverages additional state information available at traini…
Global Convergence Analysis of Vanilla Gradient Descent for Asymmetric Matrix Completion
This paper investigates the asymmetric low-rank matrix completion problem, which can be formulated as an unconstrained non-convex optimization problem with a nonlinear least-squares objective function, and is solved via …