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

arXiv 2025年

作者： Du, Kaixin Meng, Min Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai200092 China Department of Control Science and Engineering College of Electronics and Information Engineering National Key Laboratory of Autonomous Intelligent Unmanned System Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai Research Institute for Intelligent Autonomous Systems Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai China

This paper investigates online stochastic aggregative games subject to local set constraints and time-varying coupled inequality constraints, where each player possesses a time-varying expectation-valued cost function relying on not only its own decision variable but also an aggregation of all the players’ variables. Each player can only access its local individual cost function and constraints, necessitating partial information exchanges with neighboring players through time-varying unbalanced networks. Additionally, local cost functions and constraint functions are not prior knowledge and only revealed gradually. To learn generalized Nash equilibria of such games, a novel distributed online stochastic algorithm is devised based on push-sum and primal-dual strategies. Through rigorous analysis, high probability bounds on the regret and constraint violation are provided by appropriately selecting decreasing stepsizes. Moreover, for a time-invariant stochastic strongly monotone game, it is shown that the generated sequence by the designed algorithm converges to its variational generalized Nash equilibrium (GNE) almost surely, and the time-averaged sequence converges sublinearly with high probability. Finally, the derived theoretical results are illustrated by numerical simulations. Copyright © 2025, The Authors. All rights reserved.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Trajectory Tracking of Stratospheric Airships Based on RISE controllers Under External Uncertainties

引用

IEEE Transactions on Aerospace and Electronic systems 2025年

作者： Liu, Can Li, Baoquan Dai, Fengzhi Shi, Wuxi Zhang, Xuebo Tiangong University School of Control Science and Engineering Tianjin Key Laboratory of Autonomous Intelligence Technology and Systems Tianjin300387 China Tianjin University of Science and Technology College of Electronic Information and Automation Tianjin300222 China Nankai University Institute of Robotics and Automatic Information Systems Tianjin Key Laboratory of Intelligent Robotics Tianjin300071 China

For a stratospheric airship under internal and external uncertainties, controller strategies with robust integral sign of the error (RISE) are proposed for asymptotic trajectory tracking control. Specifically, a fully connected neural network (FCNN) is constructed with adaptive weight updating to estimate internal uncertainties of the airship system. Then, a self-tuning RISE controller is designed to track trajectories with compensating external disturbance, which enables gain adjustment in realtime according to system feedback. Based on Lyapunov technique and LaSalle-Yoshizawa corollary extension, system stability is strictly analyzed, and asymptotic convergence performance is obtained for trajectory tracking by the designed controller. Moreover, a RISE controller is designed with fixed gain matrices for the airship based on classic control strategies, and asymptotic tracking is also proved. Finally, numerical simulations are conducted with spiral and hovering control to verify performance of the proposed strategies. © 1965-2011 IEEE.

关键词： Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

Robust Finite-Time Containment of networked Heterogeneous Nonlinear systems with Intermittent Measurement Only

引用

IEEE Transactions on network Science and Engineering 2025年

作者： Tian, Biao Zhang, Hao Cui, Peiyu Wang, Zhuping Yan, Huaicheng Shanghai Key Laboratory of Wearable Robotics and Human-Machine Interaction Tongji University College of Electronic and Information Engineering Department of Control Science and Engineering Shanghai201804 China Ministry of Education Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems China East China University of Science and Technology School of Information Science and Engineering Shanghai200237 China

The robust finite-time containment problem of fully heterogeneous multiagent systems with uncertainties is often challenging, especially when only intermittent output measurement is used. To address the issue posed by the nonidentical system dynamics of multiple leaders, which makes the traditional distributed estimator form for the convex hull inapplicable, a distributed finite-time estimator is constructed for each follower to extract the system matrices and states of leaders. Then, in the output-triggering setting, a finite-time extended state observer driven by intermittent output measurement is developed to reconstruct the uncertainties and unmeasurable states of followers. Meanwhile, the non-continuous output measurement will lead to the differentiation of virtual control laws undefined. To solve this issue, a filtering compensation scheme-based finitetime controller via the backstepping technique is developed for nonlinear followers, ensuring practical finite-time stability (PFTS) of the closed-loop system. It is shown that the proposed algorithm steers each follower into the preset convex combination spanned by the positions of multiple leaders. The capability of the exploited control protocol is verified through simulations and experiments. 2013 IEEE.

关键词： Backstepping

来源：评论

学校读者我要写书评

暂无评论

Worst-Case Integrity Attacks and Resilient State Estimation With Partially Secured Measurements

引用

IEEE Transactions on control of network systems 2025年

作者： Zhou, Jing Shang, Jun Chen, Tongwen University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada Tongji University Department of Control Science and Engineering Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai200092 China

This paper examines the problem of optimal deception attacks against state estimation with partially secured measurements, where smart sensors transmit innovation sequences to the remote end for information fusion. Due to resource limitations or defensive countermeasures, the adversary can only modify data packets transmitted through unreliable channels. Meanwhile, the attack should be synthesized with sophistication to deceive an anomaly detector. To investigate the vulnerabilities of such estimation systems without feedback links and enhance security performance, the optimal attack policy is derived by formulating and explicitly solving a convex optimization problem, with the goal of maximizing the sum of estimation errors. Subsequently, a novel attack detection and resilient state estimation algorithm is proposed to ensure an acceptable level of estimation accuracy. The theoretical performance metrics, including false alarm rates for the proposed detector, are provided. Finally, the effectiveness of the results is confirmed through numerical examples. © 2014 IEEE.

关键词： Optimal detection

来源：评论

学校读者我要写书评

暂无评论

Explainable Application Intent for Zero-Touch networking: An Incorporation of Hypergraph and Transformer

引用

IEEE Transactions on Communications 2025年

作者： Wu, Bing Zou, Sai Liwang, Minghui Ni, Wei Wang, Xianbin Guizhou University College of Big Data and Information Engineering China National Key Laboratory of Autonomous Intelligent Unmanned Systems Department of Control Science and Engineering China Tongji University Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai China Data61 CSIRO Australia Department of Electrical and Computer Engineering Western University Canada

The autonomous interpretation of application intent (APPI) represents the primary step towards achieving closed-loop autonomy in zero-touch networking (ZTN) and also a prerequisite for intent-based networking (IBN). However, understanding APPIs and invoking the corresponding network resources require network professionals with extensive technical expertise to customize network service requests (NSRs), which presents significant challenges for the large-scale deployment of ZTN. This paper investigates an interesting problem of autonomous interpretation of APPIs for ZTN, where a novel mechanism integrating hypergraph and transformer with completeness assurance (HyperTrans-CA) is proposed. In particular, we first involve the Bayesian theory to model APPIs interpretability as maximizing the correct transition probability, where hypergraph is used to describe the complex relationship between application characteristics (e.g., scenario function, and performance) and NSRs, including network devices, virtual network functions (VNFs), and resources. Then, the hypergraph is integrated into the encoder, decoder, and attention mechanisms of Transformer, and a completeness assurance mechanism is designed to improve the prediction accuracy. The convergence of HyperTrans-CA and the corresponding convergence speed of the hypergraph-boosted Transformer in the graph search process are also analyzed. Comprehensive simulations and empirical measurements regarding industrial internet demonstrate that HyperTrans-CA can effectively explain/understand APPIs. Compared to the state-of-the-art Transformer and ChatGPT3.5 models, HyperTrans-CA improves the prediction accuracy of APPIs mapped to VNFs by 23% and 46%, respectively, while raising the prediction accuracy of VNF locations by 8.6 and 17.3 times. © 2025 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Stealthy Attacks on Sampled-Data control and Encryption-Based Countermeasures

引用

IEEE Transactions on Automatic control 2025年

作者： Shang, Jun Li, Yuzhe Chen, Tongwen Tongji University Department of Control Science and Engineering Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai200092 China Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110004 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada

This paper investigates stealthy attacks on sampled-data control systems, where a continuous process is sampled periodically, and the resultant discrete output and control signals are transmitted through dual channels in wireless communication networks. Acknowledging the vulnerability of these transmitted data to cyber threats, we analyze two types of stealthy attacks that compromise either one or both channels. We explicitly present the necessary and sufficient conditions for the existence of stealthy single-channel attacks. To mitigate these security risks, we implement encryption-based countermeasures, including linear time-invariant and periodic encryption methods. We detail sufficient conditions under which these encryption strategies effectively thwart single- and dual-channel stealthy attacks. The effectiveness of these approaches and the theoretical findings are demonstrated through numerical simulations. © 1963-2012 IEEE.

关键词： Cyber attacks

来源：评论

学校读者我要写书评

暂无评论

Brain-Conditional Multimodal Synthesis: A Survey and Taxonomy

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1080-1099页

作者： Mai, Weijian Zhang, Jian Fang, Pengfei Zhang, Zhijun South China University of Technology School of Automation Science and Engineering Guangzhou510640 China Southeast University School of Computer Science and Engineering Nanjing210096 China South China University of Technology Key Library of Autonomous Systems and Network Control Ministry of Education The School of Automation Science and Engineering Guangzhou510640 China Institute for Super Robotics Huangpu Guangzhou510555 China Nanchang University Jiangxi Thousand Talents Plan Nanchang330031 China Jishou University College of Computer Science and Engineering Jishou416000 China Guangdong Artificial Intelligence and Digital Economy Laboratory Pazhou Lab Guangzhou510335 China Shaanxi University of Technology Shaanxi Provincial Key Laboratory of Industrial Automation School of Mechanical Engineering Hanzhong723001 China Changsha Normal University School of Information Science and Engineering Changsha410100 China Guangdong University of Petrochemical Technology School of Automation Science and Engineering Institute of Artificial Intelligence and Automation Maoming525000 China

In the era of artificial intelligence generated content (AIGC), conditional multimodal synthesis technologies (e.g., text-to-image) are dynamically reshaping the natural content. Brain signals, serving as potential reflections of how the brain interprets external information, exhibit a distinctive one-to-many correspondence with various external modalities. This correspondence makes brain signals emerge as a promising guiding condition for multimodal synthesis (e.g., image, text, and audio), which is crucial for developing practical brain–computer interface systems and unraveling complex mechanisms underlying human perception. This survey comprehensively examines the emerging field of brain-conditional multimodal synthesis, termed AIGC-brain, to delineate the current landscape and future directions. To begin, related neuroimaging datasets and generative models are introduced as the foundation of AIGC-brain decoding and analysis. Next, we present a comprehensive taxonomy according to AIGC-brain methodologies, followed by task-specific representative work and implementation details to facilitate in-depth comparison and analysis. Quality assessments are then introduced for both qualitative and quantitative evaluation. Finally, this survey explores insights gained, outlining current challenges and prospects of AIGC-brain. As a pioneering survey, this article paves the way for future advances in AIGC-brain research. © 2020 IEEE.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Mobile Robot Navigation Using ORB-SLAM3: A Multi-Modal autonomous System

Mobile Robot Navigation Using ORB-SLAM3: A Multi-Modal Auton...

引用

2025 International Conference on Electrical Automation and Artificial Intelligence, ICEAAI 2025

作者： Da Conceicao, Ariano Tian, Lianfang Du, Qiliang Yuan, Ling School of Automation Science and Engineering South China University of Technology Guangzhou510641 China Research Institute of Modern Industrial Innovation South China University of Technology Guangzhou China Guangdong Engineering Research Center of Cloud-Edge-End Collaboration Technology for Smart City Guangzhou China Key Laboratory of Autonomous Systems and Network Control of Ministry of Education Guangzhou China Guangzhou China Sino-Singapore International Joint Research Institute Guangzhou511363 China

ISBN: (纸本)9798331506797

Indoor mobile robots require reliable solutions for mapping, localization, and navigation tasks. This paper presents a mobile robot system that implements the ability to realize mapping using visual SLAM with ORB-SLAM3 and LiDAR-based mapping with Gmapping for indoor perception and navigation through a modular ROS architecture. The framework also implements autonomous navigation and an autonomous Rapidly-exploring Random Trees (RRT) exploration module with adaptive reset mechanisms. The system operates on a ROS-based platform equipped with an Intel RealSense D435i RGB-D camera and LDS-02 LiDAR scanner. Experimental validation in simulated indoor environments demonstrates the system's capabilities and the presented architecture achieves computational efficiency through selective utilization of mapping modules while maintaining mapping accuracy through complementary sensor modalities. © 2025 IEEE.

关键词： LiDAR SLAM Mapping Navigation ORBSLAM 3 ROS RRT

来源：评论

学校读者我要写书评

暂无评论

Environment-Driven Online LiDAR-Camera Extrinsic Calibration

arXiv

引用

arXiv 2025年

作者： Huang, Zhiwei Li, Jiaqi Zhong, Ping Fan, Rui The Department of Control Science & Engineering The College of Electronics & Information Engineering Tongji University Shanghai201804 China The School of Computer Science and Engineering Central South University Hunan Changsha410083 China The National Key Laboratory of Science and Technology on Automatic Target Recognition National University of Defense Technology Hunan Changsha410073 China The Department of Control Science & Engineering The College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China The National Key Laboratory of Human-Machine Hybrid Augmented Intelligence Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Shaanxi Xi’an710049 China

LiDAR-camera extrinsic calibration (LCEC) is the core for data fusion in computer vision. Existing methods typically rely on customized calibration targets or fixed scene types, lacking the flexibility to handle variations in sensor data and environmental contexts. This paper introduces EdO-LCEC, the first environment-driven, online calibration approach that achieves human-like adaptability. Inspired by the human perceptual system, EdO-LCEC incorporates a generalizable scene discriminator to actively interpret environmental conditions, creating multiple virtual cameras that capture detailed spatial and textural information. To overcome cross-modal feature matching challenges between LiDAR and camera, we propose dual-path correspondence matching (DPCM), which leverages both structural and textural consistency to achieve reliable 3D-2D correspondences. Our approach formulates the calibration process as a spatial-temporal joint optimization problem, utilizing global constraints from multiple views and scenes to improve accuracy, particularly in sparse or partially overlapping sensor views. Extensive experiments on real-world datasets demonstrate that EdO-LCEC achieves state-of-the-art performance, providing reliable and precise calibration across diverse, challenging environments. Copyright © 2025, The Authors. All rights reserved.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：