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

Event-Triggered Fully Distributed control: A Model-Free Adaptive Learning Algorithm

IEEE Transactions on Automatic control 2025年

作者： Ma, Yong-Sheng Che, Wei-Wei Wu, Zheng-Guang Northeastern University College of Information Science and Engineering Shenyang266071 China Zhejiang University State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Hangzhou310027 China

This paper studies the consensus problem in multi-agent systems (MASs) under the challenge of an unknown system model and limited communication resources. A novel model-free adaptive learning algorithm is developed to learn the controller from system data. A model-based event-triggered fully distributed control (ET-FDC) algorithm is proposed to achieve consensus while saving the limited communication resources. Furthermore, a data-driven systematic learning methodology for the ET-FDC algorithm is introduced to eliminate the need for a system model. Compared with existing approaches, the main advantages of the proposed method are that it not only avoids using the system model and global topology information, but also reduces unnecessary communication. Finally, simulations are presented to illustrate the superiority of the theoretical results. © 2025 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Globally Convergent Method for Computing B-stationary Points of Mathematical Programs with Equilibrium Constraints

arXiv

引用

arXiv 2025年

作者： Nurkanovic, Armin Leyffer, Sven Systems Control and Optimization Laboratory Department of Microsystems Engineering University of Freiburg Germany Mathematics and Computer Science Division Argonne National Laboratory United States

This paper introduces a method that globally converges to Bstationary points of mathematical programs with equilibrium constraints (MPECs) in a finite number of iterations. B-stationarity is necessary for optimality and means that no feasible first-order direction improves the objective. Given a feasible point of an MPEC, B-stationarity can be certified by solving a linear program with equilibrium constraints (LPEC) constructed at this point. The proposed method solves a sequence of LPECs, which either certify B-stationarity or provide an active-set estimate for the complementarity constraints, and nonlinear programs (NLPs) - referred to as branch NLPs (BNLPs) - obtained by fixing the active set in the MPEC. A BNLP is more regular than the MPEC, easier to solve, and with the correct active set, its solution coincides with the solution of the MPEC. The method has two phases: the first phase identifies a feasible BNLP or certifies local infeasibility, and the second phase solves a finite sequence of BNLPs until a B-stationary point of the MPECis found. The paper provides a detailed convergence analysis and discusses implementation details. In addition, extensive numerical experiments and an open-source software implementation are provided. The experiments demonstrate that the proposed method is more robust and faster than relaxation-based methods, while also providing a certificate of B-stationarity without requiring the usual too-restrictive *** Codes 90C30, 90C33, 49M37, 65K10, 90C11 © 2025, CC BY.

关键词： Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Boolean matrix compressed sensing

Boolean matrix compressed sensing

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Qiang Soleymani, Mahdi Mahdavifar, Hessam National Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou310027 China Halıcıoğlu Data Science Institute University of California La Jolla San DiegoCA92093 United States Department of Electrical and Computer Engineering Northeastern University BostonMA02115 United States

ISBN: (纸本)9798350368741

In real-world datasets, leveraging the low-rank and sparsity properties enables developing efficient algorithms across a diverse array of data-related tasks, including compression, compressed sensing, matrix completion, etc. Notably, these two properties often coexist in certain real-world datasets, especially in Boolean datasets and quantized real-valued datasets. To harness the advantages of low-rank and sparsity simultaneously, we adopt a technique inspired by compressed sensing and Boolean matrix completion. Our approach entails compressing a low-rank sparse Boolean matrix by performing inner product operations with a randomly generated Boolean matrix. We then propose a decoding algorithms based on message-passing techniques to recover the original matrix. Our experiments demonstrate superior recovery performance of our proposed algorithms compared to Boolean matrix completion, with equal measurement requirements. © 2025 IEEE.

关键词： Belief Propagation Boolean Matrix Compressed Sensing Matrix Completion

来源：评论

学校读者我要写书评

暂无评论

Binary Stochastic Flip Optimization for Training Binary Neural Networks

Binary Stochastic Flip Optimization for Training Binary Neur...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Tatsukichi Shibuya Nakamasa Inoue Rei Kawakami Ikuro Sato Department of Computer Science Institute of Science Tokyo Tokyo Japan Department of Systems and Control Engineering Institute of Science Tokyo Tokyo Japan Denso IT Laboratory Tokyo Japan

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

For deploying deep neural networks on edge devices with limited resources, binary neural networks (BNNs) have attracted significant attention, due to their computational and memory efficiency. However, once a neural network is binarized, finetuning it on edge devices becomes challenging because most conventional training algorithms for BNNs are designed for use on centralized servers and require storing real-valued parameters during training. To address this limitation, this paper introduces binary stochastic flip optimization (BinSFO), a novel training algorithm for BNNs. BinSFO employs a parameter update rule based on Boolean operations, eliminating the need to store real-valued parameters and thereby reducing memory requirements and computational overhead. In experiments, we demonstrated the effectiveness and memory efficiency of BinSFO in fine-tuning scenarios on six image classification datasets. BinSFO performed comparably to conventional training algorithms with a 70.7% smaller memory requirement. Code is released at https://***/TatsukichiShibuya/ICASSP2025_BinSFO

关键词： Training Speech coding Memory management Signal processing algorithms Signal processing Classification algorithms Servers Speech processing Optimization Image classification

来源：评论

学校读者我要写书评

暂无评论

Moving-Window Integrated Physics-Data-Based Modeling of Four-Wheel Vehicle Lateral Dynamics

引用

Automotive Innovation 2025年 1-11页

作者： Wei, Wenpeng Wang, Jinxiang Pi, Dawei Zhuang, Weichao He, Tianyi Yin, Guodong School of Mechanical Engineering Southeast University JiangSu Nanjing 211189 China Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Southeast University JiangSu Nanjing 211189 China Safety and Intelligence of Vehicle Equipment Research Center Nanjing University of Science and Technology JiangSu Nanjing 210094 China Department of Mechanical and Aerospace Engineering Utah State University Logan 84322 UT United States

This paper presents an Integrated physics-data-based (IPDB) modeling of lateral vehicle dynamics with moving-window data snapshots. The IPDB model encodes the fundamental physical principle of four-wheel vehicle motions and simultaneously carries out the adaptiveness of the data-driven approach. Specifically, the traditional physics-based lateral dynamics considering four-wheel interaction are first derived into an affine linear-parameter-varying model, in which the vehicle-related parameters and motion variables are separated. Then, by using the Kronecker product, the IPDB model, directly formulated by the data snapshots in the moving-window fashion, is obtained for system representation. As a result, the IPDB technique rendered model is physically interpretable. The impacts of moving window length on modeling performance are numerically studied. The IPDB model accuracy is validated with data from CarSim simulations and experiments with passenger vehicles under various scenarios. It is further demonstrated that the proposed IPDB model is more data-efficient than other data-driven methods since it only uses the data snapshot in the moving window to update the model recursively. This characteristic enables the IPDB method with online modeling capability to adapt to varying driving scenarios. © The Author(s) 2025.

关键词： Autonomous vehicles Four-wheel vehicle dynamics Integrated physics-data-based modeling Linear parameter varying system

来源：评论

学校读者我要写书评

暂无评论

Unraveling tensor structures in correct-by-design controller synthesis

arXiv

引用

arXiv 2025年

作者： Wang, Ruohan Sun, Zhiyong Haesaert, Sofie Department of Electrical Engineering Control Systems Group Eindhoven University of Technology Netherlands Department of Mechanics and Engineering Science State Key Laboratory for Turbulence and Complex Systems Peking University Beijing China

Formal safety guarantees on the synthesis of controllers for stochastic systems can be obtained using correct-by-design approaches. These approaches often use abstractions as finite-state Markov Decision Processes (MDPs). As the state space of these MDPs grows, the curse of dimensionality makes the computational and memory cost of the probabilistic guarantees, quantified with dynamic programming, scale exponentially. In this work, we leverage decoupled dynamics and unravel, via dynamic programming operations, a tree structure in the Canonical Polyadic Decomposition (CPD) of the value functions. For discrete-time stochastic systems with syntactically co-safe linear temporal logic (scLTL) specifications, we provide provable probabilistic safety guarantees and significantly alleviate the computational burden. We provide numerical studies and validations of the theoretical results on several typical case studies and showcase that the uncovered tree structure enables efficient reductions in the computational burden. Copyright © 2025, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

In Memory of Wolter J. Fabrycky: A Pioneer of systems engineering and US-Sino Academic Exchange

引用

IEEE/CAA Journal of Automatica Sinica 2025年第5期12卷 839-840页

作者： Fei-Yue Wang State Key Laboratory for Management and Control of Complex Systems Chinese Academy of Sciences Beijing China Faculty of Innovation Engineering Macau University of Science and Technology Macao China

The passing of Professor Wolter “Wolt” Fabrycky, an outstanding member and great leader, is a big loss to our international systems engineering professional community. “Wolt was a legend in the systems engineering community with his teaching, advising, and dissemination of knowledge through the books he authored.”, as stated by Professor Eileen Aken, a former student of Wolt and the head of the Virginia Tech's Grado Department of Industrial and systems Engineeirng where Wolt had served and led for 30 years and retired as John L. Lawrence Professor emeritus.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HTEC foot:A novel foot structure for humanoid robots combining static stability and dynamic adaptability

引用

Defence Technology(防务技术) 2025年第2期44卷 30-51页

作者： Jintao Zhang Xuechao Chen Zhangguo Yu Lianqiang Han Zhifa Gao Qingrui Zhao Gao Huang Ke Li Qiang Huang School of Mechatronical Engineering Beijing Institute of TechnologyNo.5South StreetZhongguancunHaidian DistrictBeijing100081China Key Laboratory of Biomimetic Robots and Systems Ministry of EducationNo.5South StreetZhongguancunHaidian DistrictBeijing100081China School of Information Science and Technology Beijing University of TechnologyNo.100PingleyuanChaoyang DistrictBeijing100124China Innovation Center for Control Actuators Beijing Institute of Precision Mechatronics and ControlsDonggaodiFengtai DistrictBeijing100076China

Passive bionic feet,known for their human-like compliance,have garnered attention for their potential to achieve notable environmental *** this paper,a method was proposed to unifying passive bionic feet static supporting stability and dynamic terrain adaptability through the utilization of the Rigid-Elastic Hybrid(REH)dynamics ***,a bionic foot model,named the Hinge Tension Elastic Complex(HTEC)model,was developed by extracting key features from human ***,the kinematics and REH dynamics of the HTEC model were *** on the foot dynamics,a nonlinear optimization method for stiffness matching(NOSM)was ***,the HTEC-based foot was constructed and applied onto BHR-B2 humanoid *** foot static stability is *** enhanced adaptability is observed as the robot traverses square steel,lawn,and cobblestone *** proposed design method and structure,the mobility of the humanoid robot is improved.

关键词： Humanoid robot Bionic structure Passive foot structure Rigid-elastic hybrid dynamics model Optimal stiffness matching

来源：评论

学校读者我要写书评

暂无评论

CASI: Context-aware Automatic Semantic Inference by fusing video and network traffic information in industrial control systems

引用

Information Fusion 2025年 122卷

作者： Hetu, Zheqiu Zhang, Zhenyong Wang, Mufeng Xv, Zidong Meng, Jie State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China China Industrial Control Systems Cyber Emergency Response Team Beijing100040 China State Key Laboratory of Industrial Control Technology and College of Control Science and Engineering Zhejiang University Hangzhou310027 China

The increasing adoption of Internet of Things devices in Industrial control systems (ICS) has provided both attackers and security professionals with new perspectives on these traditionally safety-critical systems. Our observations reveal that video captured by field-deployed cameras contains process variables (PVs) essential for both ICS attack and defense. Based on this insight, we propose a Context-Aware Semantic Inference (CASI) method. CASI integrates video information from cameras with network traffic to infer the physical semantics of PVs in network packets, serving as a tactical tool for attackers or security professionals. A key advantage of CASI is its non-intrusive nature, deriving PVs location in the packets and semantics solely from video and network traffic without interacting with the runtime ICS, which is both covert and ensures the uninterrupted operation of the system. We constructed an ICS testbed using real devices to replicate a simplified industrial process, collecting traffic from 2 industrial protocols and creating 4 datasets. We evaluated CASI's precision and recall in detecting PVs within this context, comparing it with similar tools. Experimental results demonstrate that CASI achieves a recall rate of 1.00 in PV semantic extraction, significantly outperforming other tools. Furthermore, leveraging CASI-derived semantic information for data tampering attacks successfully disrupted monitoring and data acquisition programs, posing a severe security threat to the ICS. © 2025 Elsevier B.V.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Collaborative Marine Targets Search Algorithm for USVs and AAVs Under Energy Constraint

引用

IEEE Internet of Things Journal 2025年第9期12卷 12137-12152页

作者： Xue, Mingyao Huang, Haibin Zhuang, Yufei Si, Jinshuai Lü, Tengping Sharma, Sanjay Zhang, Lei School of Information Science and Engineering Harbin Institute of Technology at Weihai Weihai264209 China Weihai Skysailing Technology Company Ltd. Research and Development Department Weihai264200 China Weihai Key Laboratory of Autonomous Control and Cooperation Technology for Unmanned Marine Systems Weihai264200 China Wuhan 2nd Ship Design and Research Institute Information Research Office Wuhan430205 China

The collaborative search of unmanned surface vessel (USV) and autonomous aerial vehicle (AAV) for tasks with high timeliness or a large number of target points is a current research focus in the field of Marine Internet of Things technology, such as counter-mine search and data collection of ocean sensor nodes. However, the slower navigation speed of USVs cannot meet the timeliness requirements of search tasks. Moreover, AAVs have a short endurance, making it unsuitable for large-area target search missions. Combining the characteristics of long endurance of USVs and the high speed of AAVs, this article propose a heterogeneous collaborative search algorithm based on time sequence constraints (TimeSeries). Initially, a time-sliding window is designed to control the trigger time for each agent to select the next search target point. Only when the current search time of the agent is in the time-sliding window, the conditions for the next search will be satisfied, ensuring the fairness of the search. Second, considering the constraint of limited energy for USVs and AAVs, a mathematical model of energy consumption under the constraint of sea wind and ocean current environment is established, then an objective function based on energy constraint and target weight is designed. Finally, the discretized isomorphic agent collision avoidance constraint strategy and the communication radius constraint strategy among agents based on network topology are added to enhance the robustness of the cooperative system. Finally, several simulation experiments are designed and compared with other algorithms to show the effectiveness of the proposed algorithm. © 2014 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：