Trajectory prediction is a crucial step in the pipeline for autonomous driving because it not only improves the planning of future routes, but also ensures vehicle safety. On the basis of deep neural networks, numerous trajectory prediction models have been proposed and have already achieved high performance on public datasets due to the well-designed model structure and complex optimization procedure. However, the majority of these methods overlook the fact that vehicles’ limited computing resources can be utilized for online real-time inference. We proposed a Lane Transformer to achieve high accuracy and efficiency in trajectory prediction to tackle this problem. On the one hand, inspired by the well-known transformer, we use attention blocks to replace the commonly used Graph Convolution Network (GCN) in trajectory prediction models, thereby drastically reducing the time cost while maintaining the accuracy. In contrast, we construct our prediction model to be compatible with TensorRT, allowing it to be further optimized and easily transformed into a deployment-friendly form of TensorRT. Experiments demonstrate that our model outperforms the baseline LaneGCN model in quantitative prediction accuracy on the Argoverse dataset by a factor of 10× to 25×. Our 7ms inference time is the fastest among all open source methods currently available. Our code is publicly available at: https://github.com/mmdzb/Lane-Transformer.
22 May 2025 in IEEE Transactions on Intelligent Transportation Systems
UAV swarms have attracted much attention due to their high potential to execute complex missions more robustly and effectively. Essential technologies for swarms are the family of algorithms that allow the individual agents to undertake tasks intelligently, localize their relative positions, perceive surroundings, and plan and track collision-free and low-cost trajectories cooperatively so that the swarm’s overall objectives are efficiently achieved. There is still a lack of corresponding surveys that provide a systematic summary covering the control layer to task allocation and guide application-driven researchers in leveraging these capabilities for diverse UAV swarm applications. This survey debates the essential technologies of UAV swarms, including swarm trajectory planning, task assignment, control approaches, localization, perception, and communications. State-of-the-art algorithms and recent technical advancements have been investigated to expose the potential for developing highly autonomous and intelligent swarm systems. It further explores the use cases of UAV swarms in civil applications and critically analyzes existing technologies. The paper concludes by emphasizing the challenges for autonomous and intelligent UAV swarms and outlining potential future research directions. Overall, this paper provides a contemporary and comprehensive review of UAV swarm technologies and investigates their potential to transform civil application fields and support future technology advancement.
14 March 2023 in IEEE Transactions on Intelligent Vehicles
Recently, a chat generative pre-trained transformer (ChatGPT) attracts widespread attention in the academies and industries because of its powerful conversational ability with human and its astonishing emergence ability such as admit mistakes, reject inappropriate problems. However, it is not easy to generalize ChatGPT into the field of intelligent vehicles because of its high computational cost, uncertain answers and decisions, and the difficulty of scenario generation for intelligent vehicles. To address these issues, we propose a novel framework, human-machine-augmented intelligent vehicles with generative pre-trained transformer. Under this framework, we discuss the potential, prospects, limitations and several typical applications of HiVeGPT in the domain of intelligent vehicles.
17 May 2023 in IEEE Transactions on Neural Networks and Learning Systems
Due to the homophily assumption in graph convolution networks (GCNs), a common consensus in the graph node classification task is that graph neural networks (GNNs) perform well on homophilic graphs but may fail on heterophilic graphs with many interclass edges. However, the previous interclass edges’ perspective and related homo-ratio metrics cannot well explain the GNNs’ performance under some heterophilic datasets, which implies that not all the interclass edges are harmful to GNNs. In this work, we propose a new metric based on the von Neumann entropy to reexamine the heterophily problem of GNNs and investigate the feature aggregation of interclass edges from an entire neighbor identifiable perspective. Moreover, we propose a simple yet effective Conv-Agnostic GNN framework (CAGNNs) to enhance the performance of most GNNs on the heterophily datasets by learning the neighbor effect for each node. Specifically, we first decouple the feature of each node into the discriminative feature for downstream tasks and the aggregation feature for graph convolution (GC). Then, we propose a shared mixer module to adaptively evaluate the neighbor effect of each node to incorporate the neighbor information. The proposed framework can be regarded as a plug-in component and is compatible with most GNNs. The experimental results over nine well-known benchmark datasets indicate that our framework can significantly improve performance, especially for the heterophily graphs. The average performance gain is 9.81%, 25.81%, and 20.61% compared with graph isomorphism network (GIN), graph attention network (GAT), and GCN, respectively. Extensive ablation studies and robustness analysis further verify the effectiveness, robustness, and interpretability of our framework. Code is available at https://github.com/JC-202/CAGNN.
12 March 2024 in IEEE Transactions on Intelligent Transportation Systems
Traditional monocular visual simultaneous localization and mapping (SLAM) systems rely on point features or line features to estimate and optimize the camera trajectory and build a map of the surrounding environment. However, in complex scenarios such as underground parking, the performance of traditional point-line SLAM systems tends to degrade due to mirror reflection, illumination change, poor texture, and other interference. This paper proposes VPL-SLAM, a structural vertical line supported point-line monocular SLAM system that works well in complex environments such as underground parking or campus. The proposed system leverages structural vertical lines at all instances of the process. With the assistance of the structural vertical lines and global vertical direction, our system can output a more accurate visual odometry result. Furthermore, the resulting map of our system is a more reasonable structural line feature map than the previous point-line-based monocular SLAM systems. Our system has been tested with the popular autonomous driving dataset Kitti Odometry. In addition, to fully test the proposed SLAM system, we also test our system using a self-collected dataset, including underground parking and campus scenarios. As a result, our proposal reveals a more accurate navigation result and a more reasonable structural resulting map compared to state-of-the-art point-line SLAM systems such as Structure PLP-SLAM.
29 March 2022 in IEEE Transactions on Neural Networks and Learning Systems
Graph neural networks (GNNs) have been ubiquitous in graph node classification tasks. Most GNN methods update the node embedding iteratively by aggregating its neighbors' information. However, they often suffer from negative disturbances, due to edges connecting nodes with different labels. One approach to alleviate this negative disturbance is to use attention to learn the weights of aggregation, but current attention-based GNNs only consider feature similarity and suffer from the lack of supervision. In this article, we consider label dependency of graph nodes and propose a decoupling attention mechanism to learn both hard and soft attention. The hard attention is learned on labels for a refined graph structure with fewer interclass edges so that the aggregation's negative disturbance can be reduced. The soft attention aims to learn the aggregation weights based on features over the refined graph structure to enhance information gains during message passing. Particularly, we formulate our model under the expectation-maximization (EM) framework, and the learned attention is used to guide label propagation in the M-step and feature propagation in the E-step, respectively. Extensive experiments are performed on six well-known benchmark graph datasets to verify the effectiveness of the proposed method.