arXiv subjects

Rong Su

Publications and source records attributed to Rong Su.

At least 37 records · Page 2Linked to original sources

arXiv2024

Multiple noncooperative targets encirclement by relative distance-based positioning and neural antisynchronization control

From prehistoric encirclement for hunting to GPS orbiting the earth for positioning, target encirclement has numerous real world applications. However, encircling multiple non-cooperative targets in GPS-denied environments remains challenging. In this work, multiple targets encirclement by using a minimum of two tasking agents, is considered where the relative distance measurements between the agents and the targets can be obtained by using onboard sensors. Based on the measurements, the center of all the targets is estimated directly by a fuzzy wavelet neural network (FWNN) and the least squares fit method. Then, a new distributed anti-synchronization controller (DASC) is designed so that the two tasking agents are able to encircle all targets while staying opposite to each other. In particular, the radius of the desired encirclement trajectory can be dynamically determined to avoid potential collisions between the two agents and all targets. Based on the Lyapunov stability analysis method, the convergence proofs of the neural network prediction error, the target-center position estimation error, and the controller error are addressed respectively. Finally, both numerical simulations and UAV flight experiments are conducted to demonstrate the validity of the encirclement algorithms. The flight tests recorded video and other simulation results can be found in https://youtu.be/B8uTorBNrl4.

cs.RO↗

arXiv2024

Integrated User Matching and Pricing in Round-Trip Car-Sharing

Traditional round-trip car rental systems mandate users to return vehicles to their point of origin, limiting the system adaptability to meet diverse mobility demands. This constraint often leads to fleet under-utilization and incurs high parking costs for idle vehicles. To address this inefficiency, we propose a N-user matching algorithm which is designed to facilitate one-way trips within the round-trip rental framework. Our algorithm addresses the joint problem of optimal pricing and user matching through a Two-Stage Integer Linear Programming (ILP)-based formulation. In the first stage, optimal rental prices are determined by setting a risk factor that governs the likelihood of matching a set of N-user. The second stage involves maximizing expected profit through a novel ILP-based user-matching formulation. Testing our algorithm on real-world scenarios demonstrates an approximate 35\% increase in demand fulfillment. Additionally, we assess the model robustness under uncertainty by varying factors such as the risk factor (probability of user ride acceptance at the offered price), cost factor (rental cost-to-fare ratio), and maximum chain length.

eess.SY↗

arXiv2024

Why Studying Cut-ins? Comparing Cut-ins and Other Lane Changes Based on Naturalistic Driving Data

Extensive research has been conducted to explore vehicle lane changes, while the study on cut-ins has not received sufficient attention. The existing studies have not addressed the fundamental question of why studying cut-ins is crucial, despite the extensive investigation into lane changes. To tackle this issue, it is important to demonstrate how cut-ins, as a special type of lane change, differ from other lane changes. In this paper, we explore to compare driving characteristics of cut-ins and other lane changes based on naturalistic driving data. The highD dataset is employed to conduct the comparison. We extract all lane-change events from the dataset and exclude events that are not suitable for our comparison. Lane-change events are then categorized into the cut-in events and other lane-change events based on various gap-based rules. Several performance metrics are designed to measure the driving characteristics of the two types of events. We prove the significant differences between the cut-in behavior and other lane-change behavior by using the Wilcoxon rank-sum test. The results suggest the necessity of conducting specialized studies on cut-ins, offering valuable insights for future research in this field.

eess.SY↗

arXiv2023

On Decidability of Existence of Fortified Supervisors Against Covert Actuator Attackers

This work investigates the problem of synthesizing fortified supervisors against covert actuator attackers. For a non-resilient supervisor S, i.e., there exists at least a covert actuator attacker that is capable of inflicting damage w.r.t S, a fortified supervisor S' satisfies two requirements: 1) S' is resilient against any covert actuator attacker, and 2) the original closed-behavior of the closed-loop system under S is preserved, that is, S' is control equivalent to S. By designing a sound and complete procedure, we show the problem of determining the existence of a fortified supervisor against covert actuator attackers is decidable. We also discuss how to extend the decidability result to the case against the worst-case attacker.

eess.SY↗

arXiv2023

Optimal Estimator Design and Properties Analysis for Interconnected Systems with Asymmetric Information Structure

This paper studies the optimal state estimation problem for interconnected systems. Each subsystem can obtain its own measurement in real time, while, the measurements transmitted between the subsystems suffer from random delay. The optimal estimator is analytically designed for minimizing the conditional error covariance. The boundedness of the expected error covariance (EEC) is analyzed. In particular, a new condition that is easy to verify is established for the boundedness of EEC. Further, the properties of EEC with respect to the delay probability are studied. We found that there exists a critical probability such that the EEC is bounded if the delay probability is below the critical probability. Also, a lower and upper bound of the critical probability is derived. Finally, the proposed results are applied to a power system, and the effectiveness of the designed methods is illustrated by simulations.

eess.SY↗

arXiv2023

Nash equilibrium of multi-agent graphical game with a privacy information encrypted learning algorithm

This paper studies the global Nash equilibrium problem of leader-follower multi-agent dynamics, which yields consensus with a privacy information encrypted learning algorithm. With the secure hierarchical structure, the relationship between the secure consensus problem and global Nash equilibrium is discussed under potential packet loss attacks, and the necessary and sufficient condition for the existence of global Nash equilibrium is provided regarding the soft-constrained graphical game. To achieve the optimal policies, the convergence of decentralized learning algorithm is guaranteed with an iteratively updated pair of decoupled gains. By using the developed quantization scheme and additive-multiplicative property, the encryption-decryption is successfully embedded in the data transmission and computation to overcome the potential privacy violation in unreliable networks. A simulation example is provided to verify the effectiveness of the designed algorithm.

eess.SY↗

arXiv2022

STGIN: A Spatial Temporal Graph-Informer Network for Long Sequence Traffic Speed Forecasting

Accurate long series forecasting of traffic information is critical for the development of intelligent traffic systems. We may benefit from the rapid growth of neural network analysis technology to better understand the underlying functioning patterns of traffic networks as a result of this progress. Due to the fact that traffic data and facility utilization circumstances are sequentially dependent on past and present situations, several related neural network techniques based on temporal dependency extraction models have been developed to solve the problem. The complicated topological road structure, on the other hand, amplifies the effect of spatial interdependence, which cannot be captured by pure temporal extraction approaches. Additionally, the typical Deep Recurrent Neural Network (RNN) topology has a constraint on global information extraction, which is required for comprehensive long-term prediction. This study proposes a new spatial-temporal neural network architecture, called Spatial-Temporal Graph-Informer (STGIN), to handle the long-term traffic parameters forecasting issue by merging the Informer and Graph Attention Network (GAT) layers for spatial and temporal relationships extraction. The attention mechanism potentially guarantees long-term prediction performance without significant information loss from distant inputs. On two real-world traffic datasets with varying horizons, experimental findings validate the long sequence prediction abilities, and further interpretation is provided.

cs.LG↗

arXiv2022

Dense-TNT: Efficient Vehicle Type Classification Neural Network Using Satellite Imagery

Accurate vehicle type classification serves a significant role in the intelligent transportation system. It is critical for ruler to understand the road conditions and usually contributive for the traffic light control system to response correspondingly to alleviate traffic congestion. New technologies and comprehensive data sources, such as aerial photos and remote sensing data, provide richer and high-dimensional information. Also, due to the rapid development of deep neural network technology, image based vehicle classification methods can better extract underlying objective features when processing data. Recently, several deep learning models have been proposed to solve the problem. However, traditional pure convolutional based approaches have constraints on global information extraction, and the complex environment, such as bad weather, seriously limits the recognition capability. To improve the vehicle type classification capability under complex environment, this study proposes a novel Densely Connected Convolutional Transformer in Transformer Neural Network (Dense-TNT) framework for the vehicle type classification by stacking Densely Connected Convolutional Network (DenseNet) and Transformer in Transformer (TNT) layers. Three-region vehicle data and four different weather conditions are deployed for recognition capability evaluation. Experimental findings validate the recognition ability of our proposed vehicle classification model with little decay, even under the heavy foggy weather condition.

cs.CV↗

arXiv2022

A SUMO Framework for Deep Reinforcement Learning Experiments Solving Electric Vehicle Charging Dispatching Problem

In modern cities, the number of Electric vehicles (EV) is increasing rapidly for their low emission and better dynamic performance, leading to increasing demand for EV charging. However, due to the limited number of EV charging facilities, catering to the huge demand for time-consuming EV charging becomes a critical problem. It is quite a challenge to dispatch EVs in the dynamic traffic environment and coordinate interaction among agents. To better serve further research on various related Deep Reinforcment Learning (DRL) EV dispatching algorithms, an efficient simulation environment is necessary to ensure success. As simulator Simulation Urban Mobility (SUMO) is one of the most widely used open-source simulators, it has great significance in creating an environment that satisfies research requirements on SUMO. We aim to improve the efficiency of EV charging station usage and save time for EV users in further work. As a result, we design an EV navigation system on the basis of the traffic simulator SUMO using Jurong Area, Singapore in this paper. Various state-of-the-art DRL algorithms are deployed on the designed testbed to validate the feasibility of the framework in terms of EV charging dispatching problems. Besides EV dispatching problems, the environment can also serve for other reinforcement learning (RL) traffic control problems

eess.SY↗

arXiv2022

AST-GIN: Attribute-Augmented Spatial-Temporal Graph Informer Network for Electric Vehicle Charging Station Availability Forecasting

Electric Vehicle (EV) charging demand and charging station availability forecasting is one of the challenges in the intelligent transportation system. With the accurate EV station situation prediction, suitable charging behaviors could be scheduled in advance to relieve range anxiety. Many existing deep learning methods are proposed to address this issue, however, due to the complex road network structure and comprehensive external factors, such as point of interests (POIs) and weather effects, many commonly used algorithms could just extract the historical usage information without considering comprehensive influence of external factors. To enhance the prediction accuracy and interpretability, the Attribute-Augmented Spatial-Temporal Graph Informer (AST-GIN) structure is proposed in this study by combining the Graph Convolutional Network (GCN) layer and the Informer layer to extract both external and internal spatial-temporal dependence of relevant transportation data. And the external factors are modeled as dynamic attributes by the attribute-augmented encoder for training. AST-GIN model is tested on the data collected in Dundee City and experimental results show the effectiveness of our model considering external factors influence over various horizon settings compared with other baselines.

cs.LG↗

arXiv2022

Distributed Cooperative Control and Optimization of Connected Automated Vehicles Platoon Against Cut-in Behaviors of Social Drivers

Connected automated vehicles (CAVs) have brought new opportunities to improve traffic throughput and reduce energy consumption. However, the uncertain lane-change behaviors (LCBs) of surrounding vehicles (SVs) as an uncontrollable factor significantly threaten the driving safety and the consistent movement of a group of platoon CAVs. How to ensure safe, efficient, and fuel economic platoon control poses a key challenge faced by researchers in complex traffic environments. This study proposes a dynamic platoon management and cooperative driving framework for a mixed traffic flow consisting of multiple CAVs and possible human-driven vehicles (HDVs) as the SVs on unsignalized roads. In the proposed framework, the leader CAV of the platoon provides a high-level automatic driving decision to the follower CAVs by developing an optimal trajectory estimation of the HDVs while distributed observers and tracking controllers are properly implemented by the follower CAVs. Specifically, the proposed framework consists of three stages. At the observation stage, the cruising information of all the SVs will be collected by the leader CAV through the Cellular-Vehicle-to-X (C-V2X) infrastructure, while an automatic decision-making driving assistance system (ADMDSS) is constructed to determine the driving states of the platoon. When the HDVs approach the communication range of the platoon, in the prediction stage, the trajectories of the HDVs as the target vehicles will be estimated and the reference trajectory planning for the leader CAV and the cooperative controller design for the follower CAVs will be respectively activated by using C-V2X infrastructure. Simulation cases are presented to illustrate the effectiveness of the proposed approaches.

eess.SY↗

arXiv2022

Distributed Observers-based Cooperative Platooning Tracking Control and Intermittent Optimization for Connected Automated Vehicles with Unknown Jerk Dynamics

The unknown sharp changes of vehicle acceleration rates, also called the unknown jerk dynamics, may significantly affect the driving performance of the leader vehicle in a platoon, resulting in more drastic car-following movements in platooning tracking control, which could cause safety and traffic capacity concerns. To address these issues, in this paper, we investigate cooperative platooning tracking control and intermittent optimization problems for connected automated vehicles (CAVs) with a nonlinear car-following model. We assume that the external inputs of the leader CAV contain unknown but bounded jerk parameters, and the acceleration signals of the leader CAV are known only to a few neighboring follower CAVs in a free-design but directed communication network. To solve these problems, a distributed observer law is developed to provide a reference signal expressed as an estimated unknown jerk dynamic of the leader CAV and implemented by each follower CAV. Then, a novel distributed platooning tracking control protocol is proposed to construct the cooperative tracking controllers under identical inter-vehicle constraints, which can ensure a desired safety distance among the CAVs and allow each follower CAV to track their leader CAV by using only local information interaction. We also present a novel intermittent sampling condition and a robust intermittent optimization design that can ensure optimally scheduled feedback gains for the cooperative platooning tracking controllers to minimize the control cost under nonidentical inter-vehicle constraints and unknown jerk dynamics. Simulation case studies are carried out to illustrate the effectiveness of the proposed approaches

eess.SY↗

arXiv2022

Distributed Dynamic Platoons Control and Junction Crossing Optimization for Mixed Traffic Flows in Smart Cities- Part I. Fundamentals, Theoretical and Automatic Decision Framework

This article studies the problems of distributed dynamic platoons control and smart junction crossing optimization for a mixed traffic flow with connected automated vehicles(CAVs) and social human-driven vehicles(HDVs) in a smart city. The goal of this two-part article is to provide an automatic decision framework to ensure the safe and efficient cruising and crossing junctions with multiple dynamic and resilient platoons CAVs, while against the social driving behaviors(SDBs) of the HDVs considered as surrounding vehicles(SVs) and unknown traffic lights connected by Cellular-Vehicle-to-X (C-V2X) infrastructure. We shall show that despite the nonlinearity, non-smoothness, and uncertainty of mixed traffic flows in smart cities, the solutions of safe, efficient, and fuel economic platoon CAVs control for the above problems can be solved by our proposed automatic decision and smart crossing assistant system(ADSCAS) that includes four decision stages and six cruising states characterized within this article. More precisely, in part I, we provide a dynamic platoon management strategy to determine the platoon size with respect to the SDBs of the preceding HDVs and upcoming traffic lights, where the dynamic platoon size is composed of minimizing safe distances and nonlinear functions of the platoon's cruising velocity. We also present the decision and switching scheme for a finite state machine of platoons in the ADSCAS, the design of the reference trajectory planning, and the solution of the fuel economic optimization problem.

eess.SY↗

arXiv2022

Distributed Dynamic Platoons Control and Junction Crossing Optimization for Mixed Traffic Flow in Smart Cities- Part II. Stability, Optimization, and Performance Analysis

In part II, we present a fully distributed nonlinear variable time headway space strategy to ensure the subsequent safe cruising and junction crossing, where the cooperative perception of multiple neighbors stimuli and the cooperative tracking of the follower connected automated vehicles(CAVs) to the leader CAV are developed, which will result in a heterogeneous traffic flow dynamic. Once the proper length of the platoon determined by the ADSCAS characterized in part I is formed, we propose a cooperative observer design to estimate the leader CAV's acceleration adjustment which is affected by the unknown traffic lights. We shall show that the distributed and resilient nonlinear platoons control and junction crossing problem will be solved by a robust cooperative trajectory tracking optimization algorithm to ensure the fast formation and split of the platoons and safe junction cruising within the finite time horizons, taking into account the social driving behaviors(SDBs) of the surrounding vehicles(SVs), the dynamics of the follower CAVs, and an upcoming traffic signal schedule while minimizing the overall platoons fuel consumption. Performance analysis and case studies are presented to illustrate the effectiveness of the proposed approaches for multiple platoon dynamic management, which also show that the cooperation between CAVs and human-driven vehicles(HDVs) can further smooth out the driving trajectory, reduce the fuel consumption, and enhance the safety of the mixed traffic flow

eess.SY↗

arXiv2022

Supervisor Obfuscation Against Covert Actuator Attackers

This work investigates the problem of synthesizing obfuscated supervisors against covert actuator attackers. For a non-resilient supervisor S, for which there exist some covert actuator attackers that are capable of inflicting damage, we propose an algorithm to compute all the obfuscated supervisors, with the requirements that: 1) any obfuscated supervisor S' is resilient against any covert actuator attacker, and 2) the original closed-behavior of the closed-loop system under S is preserved, that is, any obfuscated supervisor S' is control equivalent to the original non-resilient supervisor S. We prove that the designed algorithm to synthesize obfuscated supervisors against covert actuator attack is sound and complete.

eess.SY↗

arXiv2022

Interpretable Fault Diagnosis of Rolling Element Bearings with Temporal Logic Neural Network

Machine learning-based methods have achieved successful applications in machinery fault diagnosis. However, the main limitation that exists for these methods is that they operate as a black box and are generally not interpretable. This paper proposes a novel neural network structure, called temporal logic neural network (TLNN), in which the neurons of the network are logic propositions. More importantly, the network can be described and interpreted as a weighted signal temporal logic. TLNN not only keeps the nice properties of traditional neuron networks but also provides a formal interpretation of itself with formal language. Experiments with real datasets show the proposed neural network can obtain highly accurate fault diagnosis results with good computation efficiency. Additionally, the embedded formal language of the neuron network can provide explanations about the decision process, thus achieve interpretable fault diagnosis.

cs.LG↗

arXiv2022

On Decidability of Existence of Nonblocking Supervisors Resilient to Smart Sensor Attacks

Cybersecurity of discrete event systems (DES) has been gaining more and more attention recently, due to its high relevance to the so-called 4th industrial revolution that heavily relies on data communication among networked systems. One key challenge is how to ensure system resilience to sensor and/or actuator attacks, which may tamper data integrity and service availability. In this paper we focus on some key decidability issues related to smart sensor attacks. We first present a sufficient and necessary condition that ensures the existence of a smart sensor attack, which reveals a novel demand-supply relationship between an attacker and a controlled plant, represented as a set of risky pairs. Each risky pair consists of a damage string desired by the attacker and an observable sequence feasible in the supervisor such that the latter induces a sequence of control patterns, which allows the damage string to happen. It turns out that each risky pair can induce a smart weak sensor attack. Next, we show that, when the plant, supervisor and damage language are regular, it is computationally feasible to remove all such risky pairs from the plant behaviour, via a genuine encoding scheme, upon which we are able to establish our key result that the existence of a nonblocking supervisor resilient to smart sensor attacks is decidable. To the best of our knowledge, this is the first result of its kind in the DES literature on cyber attacks. The proposed decision process renders a specific synthesis procedure that guarantees to compute a resilient supervisor whenever it exists, which so far has not been achieved in the literature.

cs.CR↗

arXiv2022

Synthesis of the Supremal Covert Attacker Against Unknown Supervisors by Using Observations

In this paper, we consider the problem of synthesizing the supremal covert damage-reachable attacker, in the setup where the model of the supervisor is unknown to the adversary but the adversary has recorded a (prefix-closed) finite set of observations of the runs of the closed-loop system. The synthesized attacker needs to ensure both the damage-reachability and the covertness against all the supervisors which are consistent with the given set of observations. There is a gap between the de facto supremality, assuming the model of the supervisor is known, and the supremality that can be attained with a limited knowledge of the model of the supervisor, from the adversary's point of view. We consider the setup where the attacker can exercise sensor replacement/deletion attacks and actuator enablement/disablement attacks. The solution methodology proposed in this work is to reduce the synthesis of the supremal covert damage-reachable attacker, given the model of the plant and the finite set of observations, to the synthesis of the supremal safe supervisor for certain transformed plant, which shows the decidability of the observation-assisted covert attacker synthesis problem. The effectiveness of our approach is illustrated on a water tank example adapted from the literature.

eess.SY↗