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

2023 China Automation Congress, CAC 2023

作者： Chen, Kaile Xue, Mengqi Huang, Jiahao Tang, Yang School of Information Science and Engineering East China University of Science and Technology Shanghai China College of Electronic and Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China The Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology Shanghai200237 China The Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Tongji University Shanghai201210 China

ISBN: (纸本)9798350303759

In this paper, the leader selection problem is studied for impulsive general linear multi-agent systems under switching topologies, which minimizes the number of leaders subject to the consensus tracking performance. First, a consensus criterion for the studied multi-agent systems is derived. Second, leader selection metrics are established via the submodular optimization technique according to the proposed criterion. Third, a leader selection scheme is presented, with a polynomial-time algorithm that returns candidate leader sets. Finally, the effectiveness of the developed leader selection scheme is verified by numerical examples. © 2023 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Improving Robot Safety and Efficiency: Integrating Reachability-Based Trajectory Design with Nonlinear Model Predictive Control

SSRN

引用

SSRN 2024年

作者： Shafikhah, Mahmood Razminia, Abolhassan Department of Electrical Engineering Faculty of Intelligent Systems Engineering and Data Science Persian Gulf University Bushehr Iran Process Control Laboratory Faculty of Natural Sciences and Engineering Åbo Akademi University Turku Finland

In today's high-tech world, robots are increasingly used in industry and human assistance, raising safety concerns. This paper proposes a Reachability-based Trajectory Design (RTD) method to ensure safe robot motion. By computing the robot's Forward Reachable Set (FRS), a safe trajectory is chosen for the robot to follow. This approach enhances robot safety and reliability, making them more applicable across industries. Offline RTD and FRS calculations combined with Nonlinear Model Predictive Control (NMPC) further improve navigation, motion planning, and control precision. This unique combination significantly improves robot operations, ensuring safety and efficiency. © 2024, The Authors. All rights reserved.

关键词： Predictive control systems

来源：评论

学校读者我要写书评

暂无评论

Long‐time target tracking algorithm based on re‐detection multi‐feature fusion

引用

IET Cyber-systems and Robotics 2022年第1期4卷 38-50页

作者： Junsuo Qu Chenxue Tang Yuan Zhang Kai Zhou Abolfazl Razi School of Automation Xi'an Key Laboratory of Advanced Control and Intelligent ProcessXi'an University of Posts and TelecommunicationsXi'anShaanxiChina School of Communication and Information Engineering Xi'an University of Posts and TelecommunicationsXi'anShaanxiChina School of Informatics Computing and Cyber SystemsNorthern Arizona UniversityFlagstaffAZUSA

This paper considers the problem of long-term target tracking in complex scenes when tracking failures are unavoidable due to illumination change,target deformation,scale change,motion blur,and other *** specifically,a target tracking algorithm,called re-detection multi-feature fusion,is proposed based on the fusion of scale-adaptive kernel correlation filtering and *** target tracking algorithm trains three kernel correlation filters based on the histogram of oriented gradients,colour name,and local binary pattern features and then obtains the fusion weight of response graphs corresponding to different features based on average peak correlation energy criterion and uses weighted average to complete the position estimation of the tracked *** order to deal with the problem that the target is occluded and disappears in the tracking process,a random fern classifier is trained to perform re-detection when the target is *** comparing the OTB-50 target tracking dataset,the experimental results show that the proposed tracker can track the target well in the occlusion attribute video sequence in the OTB-100 test dataset and has a certain improvement in tracking accuracy and success rate compared with the traditional correlation filter tracker.

关键词： machine learning pedestrian identification robustness visual surveillance visual tracking

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Small Object Detection Algorithm Based on RPANet and Positional Convolution Attention Mechanism 5

Small Object Detection Algorithm Based on RPANet and Positio...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Tang, Zongbing Yang, Dan Qu, Junsuo School of Communication and Information Engineering Xi'an University of Posts and Telecommunications China School of Automation Xi'an Key Laboratory of Advanced Control and Intelligent Process Xi'an Robertic Intelligent Systems International Science and Technology Cooperation Base Xi'an University of Posts and Telecommunications Shaanxi Xi'an China

ISBN: (纸本)9781450396899

With the development of deep learning, small object detection has a significant role in application fields such as smart factories and remote sensing images. In order to address the problem of difficult and low accuracy detection of small objects due to small pixel scale and little feature information. In this paper, we present a path aggregation network with residual characteristic RPANet on YOLOv3 algorithm, which can twice use the feature information of the backbone network to enhance the small object feature information, and also offer a positional convolution attention mechanism module PCAM to thoroughly learn and extract the small object feature information as well as reduce the unnecessary feature information in the background, so as to further enhance the detection capability of the model for small objects. The experimental results demonstrate that the improved YOLOv3 algorithm is more effective for small object detection. © 2022 ACM.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Edible aquatic robots with Marangoni propulsion

引用

Nature Communications 2025年第1期16卷 1-9页

作者： Zhang, Shuhang Kwak, Bokeon Zhu, Ruihao Pankhurst, Markéta Zhang, Lu Boom, Remko M. Floreano, Dario Laboratory of Intelligent Systems School of Engineering École Polytechnique Fédérale de Lausanne STI-IGM-LIS Lausanne Switzerland Laboratory of Food Process Engineering Wageningen University and Research Wageningen Netherlands

Centimeter-scale aquatic robots could be used in environmental monitoring, exploration, and intervention in aquatic environments. However, existing robots rely on artificial polymers and commercial electronic components, which can pollute and disrupt sensitive ecological environments if they are not retrieved. To address these challenges, we describe a fully biodegradable and fully edible self-propelled device that leverages the Marangoni effect for autonomous propulsion. The body of the edible aquatic robot is made of freeze-dried fish food and is powered by a water-triggered pneumatic reaction that produces motion by sustained release of a surfactant that is safe for aquatic fauna. The device’s biodegradable and non-toxic composition allows for safe environmental deployment for environmental sensing, delivery of nutrition or medication in aquatic environments. The proposed method substantially expands the potential benefits of small-scale aquatic robots that could be deployed on a large scale without the need to retrieve them and even provide nutrition to wildlife at the end of their lifetime as animals do. © The Author(s) 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tracking performance limitations of MIMO discrete-time networked control systems with multiple constraints

引用

Science China(Information Sciences) 2023年第8期66卷 267-268页

作者： Xiaowei JIANG Bin ZHANG Xiangyong CHEN Huaicheng YAN School of Automation China University of Geosciences Key Laboratory of Industrial Internet of Things & Networked Control Ministry of Education Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education School of Automation and Electrical Engineering Linyi University Key Laboratory of Smart Manufacturing in Energy Chemical Process of the Ministry of Education

Dear editor,Networked control systems(NCSs) have attracted widespread attention in some fields because they offer the advantages of reduced cabling, greater resource sharing,and ease of installation and maintenance [1]. However, in an unreliable network environment, network constraints can significantly limit the performance of NCSs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints

引用

IEEE Transactions on Control of Network systems 2025年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 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 Shanghai201210 China Southeast University School of Automation Nanjing210096 China University of Groningen Engineering and Technology Institute Groningen Faculty of Science and Engineering GroningenAG 9747 Netherlands KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm10044 Sweden KTH Royal Institute of Technology Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. © 2014 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Optimization of Cloud Manufacturing Service Combination Based on Manufacturing and Logistics Coordinate

Multi-Objective Optimization of Cloud Manufacturing Service ...

引用

Chinese Control and Decision Conference, CCDC

作者： Sining Han Bingfeng Ge Wanying Wei Xiaonong Lu Zeqiang Hou Yuming Huang College of Systems Engineering National University of Defense Technology National University of Defense Technology Changsha China Key Laboratory of Process Optimization and Intelligent Decision-Making Ministry of Education University of Science and Technology of China Hefei China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

With the continuous emergence of new technologies, the manufacturing industry is facing unprecedented challenges. Manufacturing services typically involve various types of production equipment, diverse suppliers, and varied customer demands. Optimization in this context often encompasses multi pie objectives, necessitating timely adjustments in service comb ¡nations to meet customer needs. Traditional manufacturing models evidently fall short in resource allocation within manufacturing supply chains. Cloud manufacturing, proposed as a novel manufacturing model, aims to optimize resource allocation through the combination and configuration of resources, there by enhancing the efficiency of manufacturing supply chains. Logistics, as a crucial component within manufacturing supply chains, underscores the significance of coordinating the optimizad on of manufacturing and logistics services. This research focus es on the multi-objective optimization problem of cloud manufacturing service combinations. Building upon the execution process of manufacturing and logistics services for complex product manufacturing tasks, a novel mathematical model for the optimization of manufacturing resources and logistics resources i s constructed. The model utilizes the NSGA-H algorithm to coordinate the optimization processes of manufacturing and legistics resources. Finally, a case study demonstrates the effectiveness of the proposed model.

关键词： Costs Supply chains Production equipment Pareto optimization Mathematical models Manufacturing Resource management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：