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

LDNet-RUL: Lightweight Deformable Neural Network for Remaining Useful Life Prognostics of Lithium-ion Batteries

学校读者我要写书评

暂无评论

IEEE Transactions on Power Electronics 2025年

作者： Wu, Xiankui Li, Penghua Deng, Zhongwei Liu, Zhitao Kurboniyon, Mekhrdod S. Xiang, Sheng Yin, Gang Chongqing University of Posts and Telecommunications School of Computer Science and Technology Chongqing400065 China Chongqing University of Posts and Telecommunications School of Automation Chongqing400065 China Chongqing University of Science and Technology School of Computer Science and Engineering Chongqing401331 China University of Electronic Science and Technology School of Mechanical and Electrical Engineering Chengdu611731 China Zhejiang University Institute of Cyber-Systems and Control Zhejiang 310058 China National Academy of Sciences of Tajikistan Center of Innovative Development of Science and New Technologies Dushanbe734025 Tajikistan Chongqing University College of Resource and Safety Engineering Chongqing400044 China

Deep neural networks (DNNs)-based battery remaining useful life (RUL) prognostics models suffer from high computational costs, long inference times, and a tendency to overfit, posing significant challenges for deployment on memory-constrained edge devices. To address this, LDNet-RUL, a lightweight yet high-performance model, is proposed for lithiumion battery lifetime prognostics. Specifically, a deformable depthwise convolution unit is designed that efficiently adapts to variations in input features with relatively low computational cost, which leverages fewer parameters and an adaptive receptive field to capture battery degradation dynamics. A multi-scale feature extraction method is introduced to extract degradation features from both short-term and long-term data during the battery charging process, which makes the method applicable to various battery charging protocols. To address overfitting and accelerate model inference, an adaptive channel selector, an adaptive residual connector, and a progressive dimensionalitygrouped bottleneck filter are incorporated to refine feature selection and reduce the model's complexity, boosting the model's overall performance. Experiments on vehicle lithium-ion battery datasets demonstrate that LDNet-RUL achieves state-of-the-art (SOTA) performance, with average RMSE of 0.23 and Score of 0.49. The model is lightweight, with only 7.92K parameters, achieves inference times of 3.94ms on GPU and CPU, and 5.39ms on the NVIDIA Jetson TX2. © 1986-2012 IEEE.

关键词： Convolution

Surface Defect Detection Algorithm for Glazed Ceramic Tiles Based on Improved Faster RCNN

学校读者我要写书评

暂无评论

Surface Defect Detection Algorithm for Glazed Ceramic Tiles ...

Image Processing, computer Vision and Machine Learning (ICICML), International Conference on

作者： Yafei Fan Jun Liu Jian Wang Kecheng Zhou Jun Wang School of Computer Science and Technology Shenyang University of Chemical Technology Key Laboratory of Industrial Intelligence Technology on Chemical Process Shenyang China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang China Chinese Academy of Sciences Shenyang Institute of Automation Shenyang China

ISBN: (数字)9798350355413

ISBN: (纸本)9798350355420

In terms of surface defect detection of glazed tiles, there are problems such as false detection and insufficient ability to identify small target defects due to the rich texture on the surface of glazed tiles. In response to these challenges, this article has compiled a dataset of glazed ceramic tiles and proposed an improved algorithm ECANet-FPG based on Faster R-CNN. Due to the similarity in texture and defects on the surface of ceramic tiles, this algorithm introduces the Efficient Channel Attention (ECA) module into the feature extraction network of Faster R-CNN to enhance the ability to extract deep features. At the same time, a Feature Pyramid Grids (FPG) structure is adopted to achieve efficient fusion of multi-scale features, in order to improve the recognition accuracy of small target defects. The experimental results show that the improved algorithm achieves higher detection accuracy and efficiency than the baseline model, demonstrating its effectiveness and practicality in detecting surface defects on glazed ceramic tiles.

关键词： Accuracy Target recognition Tiles Object detection Feature extraction Robustness Ceramics Surface texture Surface treatment Defect detection

A Novel Relocating Recognition Algorithm in Overlapping Region for Multi-UAVs Cluster

学校读者我要写书评

暂无评论

A Novel Relocating Recognition Algorithm in Overlapping Regi...

2022 IEEE International Conference on Unmanned Systems, ICUS 2022

作者： Li, Chen Qi, Xuelei Zhao, Juntao Liao, Xuanhong Lin, Zitian Ma, Hongjun Liang, Xinkai College of Information Science and Engineering Northeastern University Shenyang China Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Hong Kong High School Attached to Northeast Normal University International Curriculum Center Changchun China School of Automation Science and Engineering South China University of Technology Guangzhou China Beijing Electro-Mechanical Engineering Institute Science and Technology on Complex System Control and Intelligent Agent Cooperation Laboratory Beijing China

ISBN: (数字)9781665484565

ISBN: (纸本)9781665484565

How improve the mapping efficiency and location accuracy of the multi-UAV cluster based on the distributed SLAM technology is a significant problem in overlapping regions. Therefore, this paper mainly proposes a novel relocation recognition algorithm for the multi-UAV cluster. First, the autonomous localization algorithm based on visual-inertial fusion is proposed. Then, the algorithm for vocabulary updating and relocating is designed. Finally, practical testing is implemented to verify and improve the efficiency of exploration ability and the accuracy of the autonomous navigation and positioning in the complex overlapping regions. © 2022 IEEE.

关键词： Unmanned aerial vehicles (UAV)

Lightweight Language-driven Grasp Detection using Conditional Consistency Model

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Nguyen, Nghia Vu, Minh Nhat Huang, Baoru Vuong, An Le, Ngan Vo, Thieu Nguyen, Anh FPT Software AI Center Viet Nam Automation & Control Institute TU Wien Vienna Austria GmbH Austria Imperial College London United Kingdom University of Arkansas United States National University of Singapore Singapore Department of Computer Science University of Liverpool United Kingdom

Language-driven grasp detection is a fundamental yet challenging task in robotics with various industrial applications. In this work, we present a new approach for language-driven grasp detection that leverages the concept of lightweight diffusion models to achieve fast inference time. By integrating diffusion processes with grasping prompts in natural language, our method can effectively encode visual and textual information, enabling more accurate and versatile grasp positioning that aligns well with the text query. To overcome the long inference time problem in diffusion models, we leverage the image and text features as the condition in the consistency model to reduce the number of denoising timesteps during inference. The intensive experimental results show that our method outperforms other recent grasp detection methods and lightweight diffusion models by a clear margin. We further validate our method in real-world robotic experiments to demonstrate its fast inference time capability. © 2024, CC BY.

关键词： Robotics

Cross-Domain Label Propagation for Domain Adaptation with Discriminative Graph Self-Learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Tian, Lei Tang, Yongqiang Hu, Liangchen Zhang, Wensheng The Research Center of Precision Sensing and Control Institute of Automation Chinese Academy of Sciences Beijing100190 China The School of Artificial Intelligence University of Chinese Academy of Sciences Beijing101408 China The School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China

Domain adaptation manages to transfer the knowledge of well-labeled source data to unlabeled target data. Many recent efforts focus on improving the prediction accuracy of target pseudo-labels to reduce conditional distribution shift. In this paper, we propose a novel domain adaptation method, which infers target pseudo-labels through cross-domain label propagation, such that the underlying manifold structure of two domain data can be explored. Unlike existing cross-domain label propagation methods that separate domain-invariant feature learning, affinity matrix constructing and target labels inferring into three independent stages, we propose to integrate them into a unified optimization framework. In such way, these three parts can boost each other from an iterative optimization perspective and thus more effective knowledge transfer can be achieved. Furthermore, to construct a high-quality affinity matrix, we propose a discriminative graph self-learning strategy, which can not only adaptively capture the inherent similarity of the data from two domains but also effectively exploit the discriminative information contained in well-labeled source data and pseudo-labeled target data. An efficient iterative optimization algorithm is designed to solve the objective function of our proposal. Notably, the proposed method can be extended to semi-supervised domain adaptation in a simple but effective way and the corresponding optimization problem can be solved with the identical algorithm. Extensive experiments on six standard datasets verify the significant superiority of our proposal in both unsupervised and semi-supervised domain adaptation settings. © 2023, CC BY-SA.

关键词： Iterative methods

Multi-kernel Correntropy-based Orientation Estimation of IMUs: Gradient Descent Methods

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Shilei Li, Lijing Shi, Dawei Lou, Yunjiang Shi, Ling The Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Hong Kong The School of Information and Control Engineering China University of Mining and Technology China The School of Automation Beijing Institute of Technology China The State Key Laboratory of Robotics and System School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen Shenzhen518055 China

This paper presents two computationally efficient algorithms for the orientation estimation of inertial measurement units (IMUs): the multi-kernel correntropy-based gradient descent (CGD) and the multi-kernel correntropy-based decoupled orientation estimation (CDOE). Traditional methods, such as gradient descent (GD) and decoupled orientation estimation (DOE), rely on the least square (LS) criterion in algorithm derivation, making them vulnerable to external acceleration and magnetic interference. To address this issue, we first demonstrate that the multi-kernel correntropy loss (MKCL) is an optimal objective function under the maximum likelihood estimation (MLE) framework when the noise follows a specific type of heavy-tailed distribution. Then, we provide some important properties of the MKCL as a cost function. By replacing the LS cost with the MKCL, we develop the CGD and CDOE algorithms. We evaluate the effectiveness of our proposed methods by comparing them with existing algorithms in various situations. Experimental results indicate that our proposed methods (CGD and CDOE) outperform their conventional counterparts (GD and DOE), especially when faced with external acceleration and magnetic disturbances. Furthermore, the new algorithms demonstrate significantly lower computational complexity than Kalman filter-based approaches, making them suitable for applications with low-cost microprocessors. Copyright © 2023, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

Parallel governance for decentralized autonomous organizations enabled by blockchain and smart contracts 1

学校读者我要写书评

暂无评论

Parallel governance for decentralized autonomous organizatio...

1st IEEE International Conference on Digital Twins and Parallel Intelligence, DTPI 2021

作者： Ding, Wen Wen Liang, Xiaolong Hou, Jiachen Wang, Ge Yuan, Yong Li, Junqing Wang, Fei-Yue Institute of Systems Engineering Macau University of Science and Technology China School of Mathematics Renmin University of China Beijing China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China Institute of Automation Chinese Academy of Sciences State Key Laboratory for Management and Control of Complex Systems Beijing China

ISBN: (纸本)9781665433372

Decentralized autonomous organizations(DAOs) enabled by blockchain and smart contracts is regarded as an effective tool to solve corporate governance problems. It can minimize the contract risks, principal-agent dilemmas, and other issues in corporate governance. However, DAOs also face a variety of governance issues, such as internal governance issues and external governance issues caused by the technical attributes of blockchain and smart contracts. DAO is a typical complex system with the characteristics of both social and engineering complexity. It is difficult for existing governance theories to solve governance problems in DAOs. The parallel intelligence theory based on the artificial systems + computational experiments + parallel execution (ACP) method is a suitable research and practical approach to solve management and control problems for complex systems. Therefore, we propose a parallel governance framework for DAO based on the parallel intelligence theory and discuss its key research issues. Finally, we construct a parallel governance system for GnosisDAO, and conduct computational experiments on its voting mechanism. The results show the defects of GnosisDAO governance mechanism and we thus propose further research directions. We consider that parallel governance represents the future trend of DAO research and practice. This paper is aimed at stimulating further effort and providing helpful guidance and reference for future research works. © 2021 IEEE.

关键词： Smart contract

Multi-kernel Correntropy Regression: Robustness, Optimality, and Application on Magnetometer Calibration

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Shilei Chen, Yihan Lou, Yunjiang Shi, Dawei Li, Lijing Shi, Ling The Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Hong Kong The State Key Laboratory of Robotics and System School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen Shenzhen518055 China The School of Automation Beijing Institute of Technology China The School of Information and Control Engineering China University of Mining and Technology China

This paper investigates the robustness and optimality of the multi-kernel correntropy (MKC) on linear regression. We first derive an upper error bound for a scalar regression problem in the presence of arbitrarily large outliers and state that the kernel bandwidth plays an important role in minimizing the lowest upper error bound. Then, we find that the proposed MKC is related to a specific heavy-tail distribution, where its head shape is consistent with the Gaussian distribution but its tail shape is heavy-tailed, and the extent of heavy-tail is controlled by the kernel bandwidth. It becomes a Gaussian distribution when the bandwidth is infinite, which allows one to tackle both Gaussian and non-Gaussian problems without explicitly investigating the noise distributions. To explore the optimal underlying distribution parameters, an expectation-maximization-like (EM) algorithm is developed to estimate the parameter vectors and the distribution parameters in an alternating manner. The results show that our algorithm can achieve equivalent performance compared with the traditional linear regression under Gaussian noise, and it significantly outperforms the conventional method under heavy-tailed noise. Both numerical simulations and experiments on a magnetometer calibration application verify the effectiveness of the proposed method. Note to Practitioners-The goal of this paper is to enhance the accuracy of conventional linear regression in handling outliers while maintaining its optimality under Gaussian assumptions. Our algorithm is formulated under the maximum likelihood estimation (MLE) framework, assuming the regression residuals follow a type of heavy-tailed noise distribution with an extreme case of Gaussian. The degree of the heavy tail is explored alternatingly using an Expectation-Maximization (EM) algorithm which converges very quickly. The robustness and optimality of the proposed approach are investigated and compared with the traditional approaches. Both th

关键词： Linear regression

Consistent and Asymptotically Efficient Localization from Range-Difference Measurements

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zeng, Guangyang Mu, Biqiang Shi, Ling Chen, Jiming Wu, Junfeng The School of Data Science Chinese University of Hong Kong Shenzhen Shenzhen China The Department of Automation University of Science and Technology of China Hefei China Key Laboratory of Systems and Control Institute of Systems Science Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong The College of Control Science and Engineering The State Key Laboratory of Industrial Control Technology Zhejiang University Hangzhou310027 China

We consider signal source localization from range-difference measurements. First, we give some readily-checked conditions on measurement noises and sensor deployment to guarantee the asymptotic identifiability of the model and show the consistency and asymptotic normality of the maximum likelihood (ML) estimator. Then, we devise an estimator that owns the same asymptotic property as the ML one. Specifically, we prove that the negative log-likelihood function converges to a function, which has a unique minimum and positive definite Hessian at the true source's position. Hence, it is promising to execute local iterations, e.g., the Gauss-Newton (GN) algorithm, following a consistent estimate. The main issue involved is obtaining a preliminary consistent estimate. To this aim, we construct a linear least-squares problem via algebraic operation and constraint relaxation and obtain a closed-form solution. We then focus on deriving and eliminating the bias of the linear least-squares estimator, which yields an asymptotically unbiased (thus consistent) estimate. Noting that the bias is a function of the noise variance, we further devise a consistent noise variance estimator that involves 3-order polynomial rooting. Based on the preliminary consistent location estimate, a one-step GN iteration suffices to achieve the same asymptotic property as the ML estimator. Simulation results demonstrate the superiority of our proposed algorithm in the large sample case. Copyright © 2023, The Authors. All rights reserved.

关键词： Iterative methods