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

S2KAN-SLAM: Elastic Neural LiDAR SLAM with SDF Submaps and Kolmogorov-Arnold Networks

IEEE Transactions on Circuits and systems for Video Technology 2025年

作者： Wang, Zhong Zhang, Lin Wang, Hesheng Shanghai Jiao Tong University State Key Laboratory of Avionics Integration and Aviation System-of-Systems Synthesis Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai200240 China Tongji University School of Computer Science and Technology National Pilot Software Engineering School with Chinese Characteristics Shanghai201804 China

Traditional LiDAR SLAM approaches prioritize localization over mapping, yet high-precision dense maps are essential for numerous applications involving intelligent agents. Recent advancements have introduced methods leveraging neural fields to enhance mapping capabilities;however, these approaches still face several limitations. Firstly, concerning scene representation, they typically employ neural fields with high-dimensional features and multi-layer perceptron decoders utilizing non-continuous activation functions. This results in low learning efficiency and challenges in capturing high-frequency signals. Secondly, in terms of scene organization, these methods often treat the entire scene as a singular neural field, leading to inefficiencies, inflexibility, and difficulties in rectifying accumulated errors when mapping large-scale environments over extended periods. To tackle the first issue, we propose a lightweight continuous SDF regression approach by encoding the scene in single-valued embeddings and decoding SDF values from a Kolmogorov-Arnold Network. By minimizing discrepancies in measuring range, sampling distance, and decoded SDF values, we facilitate iterative frame-to-model tracking and bundle adjustment neural mapping. To mitigate the second challenge, we propose structuring the whole scene into multiple neural SDF submaps. By establishing node-node, node-submap, and loop closure constraints into a global pose graph, the system can create dense neural maps with global consistency across large-scale scenes. Experimental evaluations in both real-world and simulated settings indicate that our system achieves superior mapping completeness and accuracy, enhanced learning efficiency, reduced memory consumption, and greater flexibility compared to its counterparts. © 2025 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Prototype for the Model-Based Assets and Liabilities Management Support System

Prototype for the Model-Based Assets and Liabilities Managem...

引用

International Conference on control, Decision and Information Technologies (CoDIT)

作者： Aleksandra Zhukova Anna Flerova Maxim Tarasenko Alexey Chernov Ruslan Gabbasov Department of Mathematical Modelling of Economic Systems Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences Moscow Russia Department of Mathematical Modelling of Economic Systems FRC CSC RAS Moscow Russia Laboratory of Numerical Methods of Applied Structural Optimization MIPT Moscow Russia

ISBN: (数字)9798350373974

ISBN: (纸本)9798350373981

This paper presents the prototype of the instrument that supports the control of assets and liabilities by a bank using the mathematical computations. The specifics of the approach lies in the application of the recent advances in the control theory to provide the strategic analysis for various planning horizons and scenarios of external and internal factors.

关键词： Instruments Computational modeling Prototypes Mathematical models Planning control theory Information technology

来源：评论

学校读者我要写书评

暂无评论

Forget less,count better:a domain-incremental self-distillation learning benchmark for lifelong crowd counting

引用

Frontiers of Information Technology & Electronic Engineering 2023年第2期24卷 187-202页

作者： Jiaqi GAO Jingqi LI Hongming SHAN Yanyun QU James ZWANG Fei-Yue WANG Junping ZHANG Shanghai Key Laboratory of Intelligent Information Processing School of Computer ScienceFudan UniversityShanghai 200433China Institute of Science and Technology for Brain-inspired Intelligence Fudan UniversityShanghai 200433China Shanghai Center for Brain Science and Brain-inspired Technology Shanghai 201210China School of Information Science and Technology Xiamen UniversityXiamen 361005China College of Information Sciences and Technology the Pennsylvania State UniversityUniversity ParkPA 16802USA State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China

Crowd counting has important applications in public safety and pandemic control.A robust and practical crowd counting system has to be capable of continuously learning with the newly incoming domain data in real-world scenarios instead of fitting one domain ***-the-shelf methods have some drawbacks when handling multiple domains:(1)the models will achieve limited performance(even drop dramatically)among old domains after training images from new domains due to the discrepancies in intrinsic data distributions from various domains,which is called catastrophic forgetting;(2)the well-trained model in a specific domain achieves imperfect performance among other unseen domains because of domain shift;(3)it leads to linearly increasing storage overhead,either mixing all the data for training or simply training dozens of separate models for different domains when new ones are *** overcome these issues,we investigate a new crowd counting task in incremental domain training setting called lifelong crowd *** goal is to alleviate catastrophic forgetting and improve the generalization ability using a single model updated by the incremental ***,we propose a self-distillation learning framework as a benchmark(forget less,count better,or FLCB)for lifelong crowd counting,which helps the model leverage previous meaningful knowledge in a sustainable manner for better crowd counting to mitigate the forgetting when new data arrive.A new quantitative metric,normalized Backward Transfer(nBwT),is developed to evaluate the forgetting degree of the model in the lifelong learning *** experimental results demonstrate the superiority of our proposed benchmark in achieving a low catastrophic forgetting degree and strong generalization ability.

关键词： Crowd counting Knowledge distillation Lifelong learning

来源：评论

学校读者我要写书评

暂无评论

GETAE: Graph Information Enhanced Deep Neural Network Ensemble ArchitecturE for Fake News Detection

arXiv

引用

arXiv 2024年

作者： Truica, Ciprian-Octavian Apostol, Elena-Simona Marogel, Marius Paschke, Adrian Computer Science and Engineering Department Faculty of Automatic Control and Computers National University of Science and Technology Politehnica Bucharest Splaiul Independentei 313 Bucharest060042 Romania Academy of Romanian Scientists Ilfov 3 Bucharest050044 Romania Department of Mathematics and Computer Science Freie Universität Berlin Arnimallee 14 Berlin14195 Germany Fraunhofer Institute for Open Communication Systems Kaiserin-Augusta-Allee 31 Berlin10589 Germany

In today’s digital age, fake news has become a major problem that has serious consequences, ranging from social unrest to political upheaval. To address this issue, new methods for detecting and mitigating fake news are required. In this work, we propose to incorporate contextual and network-aware features into the detection process. This involves analyzing not only the content of a news article but also the context in which it was shared and the network of users who shared it, i.e., the information diffusion. Thus, we propose GETAE, Graph Information Enhanced Deep Neural Network Ensemble ArchitecturE for Fake News Detection, a novel ensemble architecture that uses textual content together with the social interactions to improve fake news detection. GETAE contains two Branches: the Text Branch and the Propagation Branch. The Text Branch uses Word and Transformer Embeddings and a Deep Neural Network based on feed-forward and bidirectional Recurrent Neural Networks ([Bi]RNN) for learning novel contextual features and creating a novel Text Content Embedding. The Propagation Branch considers the information propagation within the graph network and proposes a Deep Learning architecture that employs Node Embeddings to create novel Propagation Embedding. GETAE Ensemble combines the two novel embeddings, i.e., Text Content Embedding and Propagation Embedding, to create a novel Propagation-Enhanced Content Embedding which is afterward used for classification. The experimental results obtained on two real-world publicly available datasets, i.e., Twitter15 and Twitter16, prove that using this approach improves fake news detection and outperforms state-of-the-art models. © 2024, CC BY-NC-ND.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Multi-hop reasoning over sparse knowledge graphs with deep reinforcement learning

引用

Expert systems with Applications 2025年 290卷

作者： Liu, Yiyang Fu, Lejun Fu, Yukai Wu, Tianxing Bai, Hongfei State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang110016 China College of Information Engineering Shenyang University of Chemical Technology Shenyang110142 China School of Computer Science and Engineering Southeast University Nanjing211189 China

In recent years, knowledge reasoning has demonstrated substantial progress in inferring missing information, effectively alleviating the limitations caused by the incompleteness of knowledge graphs (KGs). Dealing with entities that have sufficient paths between them, multi-hop reasoning methods have achieved notable success and demonstrated interpretability, but they still exhibit deficiencies when dealing with sparse KGs. To overcome the insufficiency of edges in sparse KGs and the absence of effective guidance in multi-hop reasoning methods, a hybrid multi-hop collaborative Multi-Agent Sparse Knowledge Graph Reasoning model (MASKGR) is proposed. Attention-based dynamic completion (ADC) and variable rule guidance(VRG) are used to enhance the reasoning capability of deep reinforcement learning (RL) in sparse KGs. ADC focuses on high-value relations based on attention weights and combines embedding-based methods to predict the tail entities of these relations, expanding the original action space and improving the exploration capability of agents. Moreover, VRG greatly improves the ability of MASKGR to use rule-guided agent learning by utilizing the variable rule ratio and the variable loss reshaping. ADC can be applied to both single-agent and multi-agent in other models, while VRG is specifically designed for multi-agent. Comprehensive experiments have been conducted on four datasets: FB15K-237-10 %, FB15K-237-50 %, NELL23K, and WD-singer. Specifically, MASKGR achieves relative improvements of 1.3 % in Mean Reciprocal Rank (MRR) and 1.1 % in the proportion of correct tail entity rankings in the top 3 (Hit@3) on the FB15K-237-10 %, 2.4 % in MRR and 1.3 % in Hit@3 on the NELL23K, and 2.7 % in MRR and 3.6 % in Hit@3 on the WD-singer. The results indicate that MASKGR outperforms state-of-the-art multi-hop reasoning models based on reinforcement learning. © 2025

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Guaranteed performances for a learning-based eco-cruise control using robust LPV method

引用

IFAC-PapersOnLine 2021年第8期54卷 83-88页

作者： Balázs Németh Péter Gáspár Zoltán Szabó Systems and Control Laboratory Institute for Computer Science and Control Kende u. 13-17 H-1111 Budapest Hungary

In this paper the design of an eco-cruise control system with learning-based agent for automated vehicles is proposed. The control design is based on the robust Linear Parameter-Varying (LPV) framework, in which performance levels of the system can be guaranteed. The motivation of the learning-based agent is to reduce the required on-line computation of the eco-cruise control signal, in which several environmental factors are involved, e.g. the forthcoming terrain characteristics, speed limits. In the proposed method the design of the LPV controller and the selection of scheduling variables are performed in an iterative method. As a result, the proposed system is able to handle the degradation of the learning-based agent, while the performance of the system is guaranteed.

关键词： automated vehicles learning control robust LPV

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Solutions for Digital Interaction of a Resilient Energy Community in a Service-oriented Framework 12

Solutions for Digital Interaction of a Resilient Energy Comm...

引用

12th International Conference and Exposition on Electrical and Power Engineering, EPE 2022

作者： Sanduleac, Mihai Ionescu, Constantin Mandis, Alexandru Gropa, Victor Efremov, Cristina Sanduleac, Vlad Department of Power Systems Faculty of Energy Engineering University Politehnica of Bucharest Bucharest Romania Dep. of Energy Generation and Use Faculty of Energy Engineering University Politehnica of Bucharest Bucharest Romania Faculty of Energetics and Electrical Engineering Technical University of Moldova Chisinau Moldova Department of Computer Science and Engineering Faculty of Automatic Control and Computers University Politehnica of Bucharest Romania

ISBN: (数字)9781665489942

ISBN: (纸本)9781665489942

Energy communities are emerging entities which need their own Information and Communication System. Resilience is a key metric of such communities, and it has to be implemented for both energy supply versus public network outages and for its information system versus cyber-attacks, acting as cyber-citadels which have to resist external malicious attacks while having also digital interactions with external entities. The paper presents solutions for a resilient energy community with appropriate implementations of digital interaction for data exchange, in order to acquire external energy service for specialized companies and to deliver also information and communication-related services for external users. Principles of a Contractual Data Protection Regulation are presented, as an adaptation of data protection tailored for automated energy services and based on secure data exchange. The principles are verified in a demonstration project which has also external entities with digital interaction. © 20XX IEEE.

关键词： Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

Rational Gaussian wavelets and corresponding model driven neural networks

arXiv

引用

arXiv 2025年

作者： Ámon, Attila Miklós Fenech, Kristian Kovács, Péter Dózsa, Tamás Eötvös Loránd University Faculty of Informatics Department of Numerical Analysis Hungary Eötvös Loránd University Faculty of Informatics Department of Artificial Intelligence Hungary HUN-REN Institute for Computer Science and Control Systems and Control Laboratory Hungary University of Győr Hungary

In this paper we consider the continuous wavelet transform using Gaussian wavelets multiplied by an appropriate rational term. The zeros and poles of this rational modifier act as free parameters and their choice highly influences the shape of the mother wavelet. This allows the proposed construction to approximate signals with complex morphology using only a few wavelet coefficients. We show that the proposed rational Gaussian wavelets are admissible and provide numerical approximations of the wavelet coefficients using variable projection operators. In addition, we show how the proposed variable projection based rational Gaussian wavelet transform can be used in neural networks to obtain a highly interpretable feature learning layer. We demonstrate the effectiveness of the proposed scheme through a biomedical application, namely, the detection of ventricular ectopic beats (VEBs) in real ECG *** Codes 65D15 © 2025, CC BY.

关键词： Electrocardiography

来源：评论

学校读者我要写书评

暂无评论

A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements

A Multi-Player Potential Game Approach for Sensor Network Lo...

引用

IEEE Conference on Decision and control

作者： Gehui Xu Guanpu Chen Baris Fidan Yiguang Hong Hongsheng Qi Thomas Parisini Karl H. Johansson Department of Electrical and Electronic Engineering Imperial College London London UK Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Mechanical and Mechatronics Engineering University of Waterloo Waterloo ON Canada Department of Control Science and Engineering Tongji University shanghai China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China Department of Electronic Systems Aalborg University Denmark Department of Engineering and Architecture University of Trieste Italy

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multiplayer non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies.

关键词： Location awareness Noise Games Position measurement Nash equilibrium Distance measurement Noise measurement

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：