检索结果-内蒙古大学图书馆

IEEE Transactions on Vehicular Technology 2025年

作者： Luo, Mofan Zhou, Yuchen Yang, Long Lv, Lu Zhang, Zheng Yu, Fei Richard Nallanathan, Arumugam Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Carleton University Department of Systems and Computer Engineering OttawaONK1S 5B6 Canada Queen Mary University of London School of Electronic Engineering and Computer Science London United Kingdom Kyung Hee University Department of Electronic Engineering Gyeonggi-do Yongin-si17104 Korea Republic of

To enhance the physical layer security in semi-grant-free non-orthogonal multiple access systems, this work develops a strategy for simultaneous transmission by grant-free devices (GFDs). The proposed strategy utilizes the interference of active GFDs as coverts to safeguard the legitimate transmision of the grant-based device from the potential eavesdropping of inactive GFDs. By utilizing the centralized teacher with decentralized student framework, we develop a joint power control and receive beamforming scheme employing multi-agent deep reinforcement learning, which requires only the partial observation and implements in a distributed manner. Numerical results show that the proposed strategy surpasses both non-orthogonal multiple access and orthogonal multiple access benchmarks and achieves the secrecy performance close to its global observation counterpart. © 1967-2012 IEEE.

关键词： Beamforming

ISAR Sensing Based on MUSIC Algorithm in Integrated Sensing and Communications

学校读者我要写书评

暂无评论

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Zhang, Ruiyun Wang, Zhaolin Wei, Zhiqing Liu, Yuanwei Xiong, Zehui Feng, Zhiyong Beijing University of Posts and Telecommunications Key Laboratory of Universal Wireless Communications Ministry of Education School of Information and Communication Engineering Beijing100876 China Queen Mary University of London School of Electronic Engineering and Computer Science LondonE1 4NS United Kingdom Singapore University of Technology and Design Information Systems Technology and Design Pillar Singapore

Inverse synthetic aperture radar (ISAR) sensing is poised to become a key technology in integrated sensing and communication (ISAC) systems due to its high cross-range resolution for extended targets. However, existing ISAR-based orthogonal frequency-division multiplexing (OFDM) ISAC works are limited and primarily rely on discrete Fourier transform (DFT) techniques, which suffer from inherent resolution constraints, making them inadequate for resolving closely spaced scatterers. We investigate ISAR sensing within OFDM ISAC systems from a novel perspective. First, we model and derive the frequency domain reconstruction of ISAR OFDM received signals, proving that the main parameters range and cross-range of scatterers are decoupled. Building on this insight, we extend and improve two one-dimensional multiple signal classification (1D-MUSIC) algorithms to independently estimate them. Specifically: 1) We consider all possible scatterer relationships and comprehensively classify scatterers into uncorrelated and correlated by providing clear definition;2) Correlated scatterers cause both range and cross-range steering matrices to be rank-deficient and both affect the rank of autocorrelation matrices. Therefore, we propose a spatial smoothing range estimation (SSR) method and a spatial smoothing cross-range estimation (SSC) method to restore the rank of steering matrixes;3) 1D estimation cannot effectively associate the estimated range and cross-range values, and correlated scatterers cause the number of spectral peaks obtained by SSR and SSC methods to be less than the actual number of scatterers. Therefore, we develop a novel point-matching method to pair the decoupled range and cross-range values for each scatterer, while also accurately estimating the total number of scatterers. Finally, the numerical results demonstrate that: 1) The range and cross-range spatial spectrum peaks achieved by the proposed SSR and SSC methods are 10dB higher than those obtained with the c

关键词： Discrete Fourier transforms

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan The Beijing Key Laboratory of Network System Architecture and Convergence The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing China Singapore The Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Department of Industrial and Systems Engineering University of Miami Coral GablesFL33146 United States The College of Information Science and Electronic Engineering Zhejiang University Zhejiang Hangzhou310027 China The Department of Computer Science North Carolina State University RaleighNC27695 United States The Beijing Key Laboratory of Network System Architecture and Convergence China The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025, CC BY-NC-SA.

关键词： Markov processes

Barrier Offset Varying-Parameter Dynamic Learning Network for Solving Dual-Arms Human-Like Behavior Generation

学校读者我要写书评

暂无评论

IEEE Transactions on Cognitive and Developmental systems 2025年

作者： Zhang, Zhijun Zhang, Mingyang Guo, Jinjia He, Haotian School of Automation Science and Engineering South China University of Technology Guangzhou510640 China Key Library of Autonomous Systems and Network Control Ministry of Education China Jiangxi Thousand Talents Plan Nanchang University Nanchang330031 China Guangzhou510335 China Shaanxi Provincial Key Laboratory of Industrial Automation School of Mechanical Engineering Shanxi University of Technology Hanzhong723001 China School of Information Science and Engineering Changsha Normal University Changsha410100 China School of Automation Science and Engineering Institute of Artificial Intelligence and Automation Guangdong University of Petrochemical Technology Maoming525000 China School of Computer Science and Engineering Jishou University Jishou416000 China

Enabling robots to imitate human actions and perform tasks with high precision while avoiding potential obstacles in the environment can effectively enhance the interaction between social robots and humans. In this paper, to achieve higher precision trajectory tracking and obstacle avoidance for dual-arm humanoid robots, the barrier offset varying-parameter dynamic learning neural (BOVDL) network method is proposed and applied to dual-arm humanoid behavior generation scheme. To do so, a dual-arms humanoid robot model is set up, and transformed into a constrained time-varying quadratic programming (TVQP) problem. Secondly, by using lagrangian multiplier method and Karush-Kuhn-Tuchker condition, the inequality constrained TVQP is converted as a time-varying equation with a barrier parameter. Thirdly, a varying-parameter dynamic learning network is presented to solve the time-varying equation with a barrier parameter. computer simulation experiments are conducted to verify the feasibility, accuracy, and safety of the proposed BOVDL network method. Experimental results show that all 14 joints of the humanoid robot's arms are within the motion range of each real human arm's physical constraints. The maximum position error and velocity error between the desired trajectory and the actual trajectory of the end effector are less than 10-6m magnitude and 10-7m magnitude, respectively, representing a reduction of 5 orders of magnitude compared to the traditional varying-parameter convergent-differential neural network. Furthermore, the proposed method also enables the dual-arm humanoid robot to avoid collisions with obstacles while performing tasks, demonstrating the superiority of the proposed BOVDL network scheme. © 2016 IEEE.

关键词： Anthropomorphic robots

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

学校读者我要写书评

暂无评论

IEEE Transactions on Vehicular Technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

学校读者我要写书评

暂无评论

IEEE Transactions on Automatic Control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

Dexterous Manipulation through Imitation Learning: A Survey

学校读者我要写书评

暂无评论

arXiv 2025年

作者： An, Shan Meng, Ziyu Tang, Chao Zhou, Yuning Liu, Tengyu Ding, Fangqiang Zhang, Shufang Mu, Yao Song, Ran Zhang, Wei Hou, Zeng-Guang Zhang, Hong School of Electrical and Information Engineering Tianjin University Tianjin300072 China School of Control Science and Engineering Shandong University Jinan250061 China State Key Laboratory of General Artificial Intelligence Beijing100086 China Department of Mechanical and Process Engineering ETH Zurich Zurich8092 Switzerland Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen518055 China School of Informatics University of Edinburgh EH8 9AB United Kingdom Department of Computer Science University of Hong Kong 999077 Hong Kong State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China CASIA-MUST Joint Laboratory of Intelligence Science and Technology Institute of Systems Engineering Macau University of Science and Technology 999078 China

Dexterous manipulation, which refers to the ability of a robotic hand or multi-fingered end-effector to skillfully control, reorient, and manipulate objects through precise, coordinated finger movements and adaptive force modulation, enables complex interactions similar to human hand dexterity. With recent advances in robotics and machine learning, there is a growing demand for these systems to operate in complex and unstructured environments. Traditional model-based approaches struggle to generalize across tasks and object variations due to the high-dimensionality and complex contact dynamics of dexterous manipulation. Although model-free methods such as reinforcement learning (RL) show promise, they require extensive training, large-scale interaction data, and carefully designed rewards for stability and effectiveness. Imitation learning (IL) offers an alternative by allowing robots to acquire dexterous manipulation skills directly from expert demonstrations, capturing fine-grained coordination and contact dynamics while bypassing the need for explicit modeling and large-scale trial-and-error. This survey provides an overview of dexterous manipulation methods based on imitation learning (IL), details recent advances, and addresses key challenges in the field. Additionally, it explores potential research directions to enhance IL-driven dexterous manipulation. Our goal is to offer researchers and practitioners a comprehensive introduction to this rapidly evolving domain. Copyright © 2025, The Authors. All rights reserved.

关键词： Grippers

Towards AI-Powered Edge Intelligence for Object Detection in Self-Driving Cars: Enhancing IoV Efficiency and Safety

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Ahmed, Imran Ahmad, Misbah Siddiqi, Muftooh Ur Rehman Chehri, Abdellah Jeon, Gwangill Anglia Ruskin University School of Computing and Information Science Cambridge United Kingdom University of West of England Centre for Machine Vision Bristol Robotics Laboratory Bristol United Kingdom Hartpury University Department of Animal and Agriculture Gloucester United Kingdom Aston University College of Engineering and Physical Sciences Birmingham United Kingdom Department of Mathematics and Computer Science Canada Incheon National University Department of Embedded Systems Engineering Incheon Korea Republic of

In the rapidly advancing field of intelligent transportation systems, integrating Artificial Intelligence (AI) with edge computing presents a promising way to enhance the safety and efficiency of the Internet of Vehicles (IoV). This study explores and presents a deep learning based object detection model within an edge computing framework which aims to facilitate real time object detection in self driving cars. Using an urban traffic scenarios based dataset, our research shows the ability of the model to accurately detect and classify various objects important for autonomous driving. The YOLOv8 model is used in this work due to its optimal balance between accuracy and computational efficiency. This model has also demonstrated its worth by achieving good performance results, including an average precision of 0.79, a recall of 0.62, and an F1-score of 0.69. The results are demonstrated by a detailed confusion matrix, highlighting the model's effectiveness in complex driving environments and underscoring its reliability for in-vehicle deployment. By implementing AI directly on edge devices within vehicles, our approach might be helpful in significantly reducing latency, boosting decision-making speed, and enhancing data privacy by minimising dependence on cloud processing. The findings not only support the model's capabilities but also illustrate the practical benefits of edge intelligence in autonomous vehicles. These benefits, such as faster decision-making and improved data privacy, contribute effectively to the IoV infrastructure. This study marks a substantial step towards recognising the possibility of AI-enhanced edge computing in driving the next generation of autonomous vehicle technology. © 2025 IEEE.

关键词： Artificial Intelligence Autonomous Vehicles Deep leaning Edge Computing Internet of Vehicles

Exploring Token-Level Augmentation in Vision Transformer for Semi-Supervised Semantic Segmentation

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Dengke Tang, Quan Liu, Fagui Mei, Haiqing Chen, C.L. Philip The School of Computer Science and Engineering South China University of Technology Guangzhou510006 China The Department of New Network Pengcheng Laboratory Shenzhen518000 China The China Tobacco Guangdong Industrial Corporation Guangzhou510385 China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100080 China

Semi-supervised semantic segmentation has witnessed remarkable advancements in recent years. However, existing algorithms are based on convolutional neural networks and directly applying them to Vision Transformers poses certain limitations due to conceptual disparities. To this end, we propose TokenMix, a data augmentation technique specifically designed for semi-supervised semantic segmentation with Vision Transformers. TokenMix aligns well with the global attention mechanism by mixing images at the token level, enhancing learning capability for contextual information among image patches. We further incorporate image augmentation and feature augmentation to promote the diversity of augmentation. Moreover, to enhance consistency regularization, we propose a dual-branch framework where each branch applies image and feature augmentation to the input image. We conduct extensive experiments across multiple benchmark datasets, including Pascal VOC 2012, Cityscapes, and COCO. Results suggest that the proposed method outperforms state-of-the-art algorithms with notably observed accuracy improvement, especially under limited fine annotations. Copyright © 2025, The Authors. All rights reserved.

关键词：

UGNA-VPR: A Novel Training Paradigm for Visual Place Recognition Based on Uncertainty-Guided NeRF Augmentation

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Shen, Yehui Zhang, Lei Li, Qingqiu Zhao, Xiongwei Wang, Yue Lu, Huimin Chen, Xieyuanli College of Intelligence Science and Technology National University of Defense Technology China Faculty of Robot Science and Engineering Northeastern University China School of Electronic and Information Engineering Harbin Institute of Technology Shenzhen China State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University China SIASUN Robot& Automation Co. Ltd China School of Computer Science Fudan University China

Visual place recognition (VPR) is crucial for robots to identify previously visited locations, playing an important role in autonomous navigation in both indoor and outdoor environments. However, most existing VPR datasets are limited to single-viewpoint scenarios, leading to reduced recognition accuracy, particularly in multi-directional driving or feature-sparse scenes. Moreover, obtaining additional data to mitigate these limitations is often expensive. This paper introduces a novel training paradigm to improve the performance of existing VPR networks by enhancing multi-view diversity within current datasets through uncertainty estimation and NeRF-based data augmentation. Specifically, we initially train NeRF using the existing VPR dataset. Then, our devised self-supervised uncertainty estimation network identifies places with high uncertainty. The poses of these uncertain places are input into NeRF to generate new synthetic observations for further training of VPR networks. Additionally, we propose an improved storage method for efficient organization of augmented and original training data. We conducted extensive experiments on three datasets and tested three different VPR backbone networks. The results demonstrate that our proposed training paradigm significantly improves VPR performance by fully utilizing existing data, outperforming other training approaches. We further validated the effectiveness of our approach on self-recorded indoor and outdoor datasets, consistently demonstrating superior results. Our dataset and code have been released at https://***/nubot-nudt/UGNA-VPR. Copyright © 2025, The Authors. All rights reserved.

关键词：