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

Non-collocated Vibration Suppression using Delay-Based controllers with Multiple Fixed Delays*

IFAC-PapersOnLine 2023年第2期56卷 180-185页

作者： Adrian Saldanha Wim Michiels Tomáš Vyhlídal Department of Computer Science KU Leuven Celestijnenlaan 200A 3001 Leuven Belgium Dept. Instrumentation and Control Engineering Faculty of Mechanical Engineering and Czech Institute of Informatics Robotics and Cybernetics Czech Technical University in Prague Prague 6 Czechia

The problem of non-collocated vibration absorption is targeted utilizing a multiparameter delay-based controller. The combined objective is to achieve closed-loop stability and vibration suppression at a target location, which is different from the position of the absorber. This problem can be translated into an optimization problem of shaping the poles of a closed-loop system with delays subject to zero-location constraints. The solution approach involves remodelling the closed-loop system as a system of delay-differential algebraic equations (DDAEs) which allows to systematically account for delays in the control law, thereby enabling a straightforward technique for computation of controller parameters. Finally, the proposed design method is validated by simulation on a lumped parameter model of a mass-spring-damper system.

关键词： vibration suppression time-delay systems DDAE optimization

来源：评论

学校读者我要写书评

暂无评论

Automation of Technological processes for controlling Grain Moisture in the Flowu

Automation of Technological Processes for Controlling Grain ...

引用

Automatics and Informatics (ICAI), International Conference

作者： Palvan I. Kalandarov Shakhnoza R. Ubaydullayeva Rano T. Gaziyeva Nikola N. Nikolov Mariela I. Alexandrova Department “Automation and control of technology process in production” «Tashkent institute of irrigation and agricultural mechanization engineers» National Research University Tashkent Uzbekistan Department of Automation Faculty of Computer Science and Automation Technical University of Varna Varna Bulgaria

The paper deals with the problems of grain wounding requires large energy costs, requiring a multi-stage process of grain processing, installation and perfect and reliable automation systems for the storage and processing of raw materials, theoretical and experimental studies and the results of the use of the microwave method in measuring the moisture content of grain and grain materials. The method under consideration is based on the principle of selective absorption of microwave radiation energy by water in materials and its derivatives. By the degree of absorption of radiation, the concentration of moisture is judged. The paper investigates the amplitude and phase methods of the passing wave in free space. The influence of the elastic properties of the material under study on the electrical characteristics of the microwave wave, suggesting fundamentally new ways of measuring the attenuation and phase shift of the electromagnetic wave, including discrete conversion of the signal of the primary converter, which does not require rigid metrological support and the use of a phase shift, is substantiated. Information on the values of the thickness of the material is analyzed in order to correct the influence of this value, consisting of two parameters: the signal of the passing wave, the attenuation and phase shift which characterizes the humidity and the additional signal - the phase wave reflected from the front surface of the materials and carrying information about its thickness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research and Analysis of the Method for Measuring the Moisture Content of Cottonmaterials at Ultrahigh Frequencies

Research and Analysis of the Method for Measuring the Moistu...

引用

Automatics and Informatics (ICAI), International Conference

作者： Palvan I. Kalandarov Khasan E. Turkmenov Shakhnoza R. Ubaydullayeva Nikola N. Nikolov Mariela I. Alexandrova Department “Automation and control of technology process in production” «Tashkent institute of irrigation and agricultural mechanization engineers» National Research University Tashkent Uzbekistan Department of Automation Faculty of Computer Science and Automation Technical University of Varna Varna Bulgaria

The article provides a theoretical analysis of the ultrahigh frequency (microwave) method of humidity measurement, discusses the problems of instrumentation of the method in question, and proposes a scheme of an experimental installation. Bulk cotton materials were selected as the objects of research. The electromagnetic wave radiation is analyzed during measurement and the evaluation of electrophysical characteristics requires the study of the functional dependence of the amplitude and phase shift on the mass ratio of humidity, mathematical models for various bulk cotton materials describing the joint effect of humidity, material density on the attenuation and phase shift of the passing wave are obtained.

关键词：

来源：评论

学校读者我要写书评

暂无评论

QUADFormer: Learning-based Detection of Cyber Attacks in Quadrotor UAVs

arXiv

引用

arXiv 2024年

作者： Wang, Pengyu Yang, Zhaohua Yang, Nachuan Wang, Zikai Li, Jialu Zhang, Fan Wang, Chaoqun Wang, Jiankun Meng, Max Q.-H. Shi, Ling Shenzhen Key Laboratory of Robotics Perception and Intelligence The Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong The School of Control Science and Engineering Shandong University Shandong China Jiaxing Research Institute Southern University of Science and Technology Jiaxing China Department of Electronic Engineering The Chinese University of Hong Kong Hong Kong Department of Electrical and Computer Engineering The University of Alberta Canada

Safety-critical intelligent cyber-physical systems, such as quadrotor unmanned aerial vehicles (UAVs), are vulnerable to different types of cyber attacks, and the absence of timely and accurate attack detection can lead to severe consequences. When UAVs are engaged in large outdoor maneuvering flights, their system constitutes highly nonlinear dynamics that include non-Gaussian noises. Therefore, the commonly employed traditional statistics-based and emerging learning-based attack detection methods do not yield satisfactory results. In response to the above challenges, we propose QUADFormer, a novel Quadrotor UAV Attack Detection framework with transFormer-based architecture. This framework includes a residue generator designed to generate a residue sequence sensitive to anomalies. Subsequently, this sequence is fed into a transformer structure with disparity in correlation to specifically learn its statistical characteristics for the purpose of classification and attack detection. Finally, we design an alert module to ensure the safe execution of tasks by UAVs under attack conditions. We conduct extensive simulations and real-world experiments, and the results show that our method has achieved superior detection performance compared with many state-of-the-art methods. (Video1) Copyright © 2024, The Authors. All rights reserved.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning

arXiv

引用

arXiv 2024年

作者： Guo, Yifan Ren, Zhongqiang Wang, Chen The Flight Dynamics & Control/Hybrid Systems Lab Purdue University West LafayetteIN47907 United States Robotics Institute Carnegie Mellon University PittsburghPA15213 United States Lab Department of Computer Science and Engineering University at Buffalo NY14260 United States

This paper considers a Min-Max Multiple Traveling Salesman Problem (MTSP), where the goal is to find a set of tours, one for each agent, to collectively visit all the cities while minimizing the length of the longest tour. Though MTSP has been widely studied, obtaining near-optimal solutions for large-scale problems is still challenging due to its NP-hardness. Recent efforts in data-driven methods face challenges of the need for hard-to-obtain supervision and issues with high variance in gradient estimations, leading to slow convergence and highly sub-optimal solutions. We address these issues by reformulating MTSP as a bilevel optimization problem, using the concept of imperative learning (IL). This involves introducing an allocation network that decomposes the MTSP into multiple single-agent traveling salesman problems (TSPs). The longest tour from these TSP solutions is then used to self-supervise the allocation network, resulting in a new self-supervised, bilevel, end-to-end learning framework, which we refer to as imperative MTSP (iMTSP). Additionally, to tackle the high-variance gradient issues during the optimization, we introduce a control variate-based gradient estimation algorithm. Our experiments showed that these innovative designs enable our gradient estimator to converge 20× faster than the advanced reinforcement learning baseline, and find up to 80% shorter tour length compared with Google OR-Tools MTSP solver, especially in large-scale problems (e.g. 1000 cities and 15 agents). © 2024, CC BY.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Enhancing Precision Agriculture Through Human-in-the-Loop Planning and control

Enhancing Precision Agriculture Through Human-in-the-Loop Pl...

引用

IEEE International Conference on Automation science and Engineering (CASE)

作者： Shankar A. Deka Sujet Phodapol Andreu Matoses Gimenez Victor Nan Fernandez-Ayala Rufus Wong Pian Yu Xiao Tan Dimos V. Dimarogonas Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University Espoo Finland Division of Decision and Control Systems School of EECS Royal Institute of Technology (KTH) Stockholm Sweden Department of Cognitive Robotics Faculty of Mechanical Engineering TU Delft Delft Netherlands Department of Computer Science University of Oxford Oxford UK

ISBN: (数字)9798350358513

ISBN: (纸本)9798350358520

In this paper, we introduce a ROS based framework designed for the planning and control of robotic systems within the context of precision agriculture, with an emphasis on human-in-the-loop capabilities. Utilizing Linear Temporal Logic to articulate complex task specifications, our algorithm creates high-level robotic plans that are not only correct by design but also adaptable in real time by human operators. This dual-focus approach ensures that while humans have the flexibility to modify the high-level plan on-the-fly or even take over low-level control of the robots, the system inherently safeguards against any human actions that could potentially breach the predefined task specifications. We demonstrate our algorithm within the dynamic and challenging environment of a real vineyard, where the collaboration between human workers and robots is critical for tasks such as harvesting and pruning, and show the practical applicability and robustness of our software. This work marks a pioneering application of formal methods to complex, real-world agricultural environments.

关键词： Precision agriculture Heuristic algorithms Software algorithms Robustness Human in the loop Software Real-time systems Planning Robots Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Research on Target Detection Method Based on Improved YOLOv5 19th

Research on Target Detection Method Based on Improved YOLOv5

引用

19th International Conference on Web Information Systems and Applications, WISA 2022

作者： Wang, Rongzhuang Liu, Jun Zhang, Hualiang School of Computer Science and Technology Shenyang University of Chemical Technology Shenyang110142 China Liaoning Key Laboratory of Intelligent Technology for Chemical Process Industry Shenyang110142 China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang110016 China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China

ISBN: (纸本)9783031203084

At present, various target detection algorithms are used in detection and classification. It is a problem to improve the accuracy and speed of target detection by using deep learning and neural network model to train the parameters of the data set. Aiming at the problems of insufficient detection, inaccurate detection of complex background and loss of small target feature information in yolov5 target detection, an improved method combining hole convolution, moving exponential average and retraining of positive samples is proposed in this paper. This method effectively solves the problems of complex background, occlusion and incomplete feature extraction, reduces the loss rate of target features, and improves the detection accuracy of each category. The improved yolov5 target detection algorithm in this paper can not only use multi feature fusion and accelerate positive sample matching, but also use cavity convolution to increase receptive field, improve the detection effect of small targets and reduce the occurrence of missed detection and false detection. Experiments show that the improved yolov5 algorithm has better detection rate and lower loss rate than many existing target detection algorithms. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further 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 among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：