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

IEEE International Conference on Simulation, Modeling, and Programming for Autonomous Robots (SIMPAR)

作者： Xiang Bai Junyi Wang Xiaofeng Xiong Evangelos Boukas Applied Mathematics and Computer Science Technical University of Denmark Copenhagen Denmark Automation and Control Group Electrical and Photonics Engineering Technical University of Denmark Copenhagen Denmark SDU Biorobotics Mærsk Mc-Kinney Møller Institute University of Southern Denmark Odense Denmark

ISBN: (数字)9798331516857

ISBN: (纸本)9798331516864

This paper aims at a deep reinforcement learning (DRL) controller for fast (< 1.5s) manipulation of a flexible tool (i.e., whip) to hit a target in 3D space. The controller consists of a DRL algorithm for optimizing joint motions, and a proportional-derivative (PD) mechanism for tracking the optimized motions. Their objective is to minimize the distance between the whip-end-tip and the target. The proposed controller was validated in a 7-DOF robot arm by comparing four DRL algorithms in the physical simulator MuJoCo. It shows that the proximal policy optimization (PPO) outperforms others by obtaining the maximum average reward. Notably, PPO can still effectively interact with the environment under sparse or even unrewarding conditions, making it a robust choice for complex and dynamic tasks. Our work provides preliminary knowledge of DRL applications to fast robotic arm control in flexible object manipulation.

关键词： Three-dimensional displays Target tracking Heuristic algorithms Programming Aerospace electronics Deep reinforcement learning Manipulators Optimization Autonomous robots

来源：评论

学校读者我要写书评

暂无评论

On Solar Photovoltaic Parameter Estimation: Global Optimality Analysis and a Simple Efficient Differential Evolution Method

On Solar Photovoltaic Parameter Estimation: Global Optimalit...

引用

IEEE Conference on Decision and control

作者： Shuhua Gao Cheng Xiang Ming Yu Kuan Tak Tan Tong Heng Lee School of Control Science and Engineering Shandong University Jinan China Department of Electrical and Computer Engineering National University of Singapore Singapore Power Automation Pte Ltd Singapore Engineering Cluster Singapore Institute of Technology Singapore

The literature presents a vast array of advanced metaheuristic methods for photovoltaic parameter estimation. However, the focus of this study is not to introduce another new method into this already crowded field. Instead, we examine two important but often overlooked questions: (i) are existing results globally optimal, and (ii) can a simpler method achieve comparable performance. We conduct case studies using two widely used I-V curve datasets. To address the first issue, we develop a branch and bound algorithm that, despite its sluggishness, either certifies the global minimum or provides a tight upper bound. These values serve as useful benchmarks for fair metaheuristic evaluation and further development. To answer the second question, our extensive examination and comparison surprisingly reveal that a basic differential evolution (DE) algorithm can achieve the certified global minimum or obtain the best known result. Additionally, the DE algorithm's runtime is much shorter than that of current state-of-the-art metaheuristic methods, making it a great choice for time-sensitive applications. This remarkable finding suggests that using increasingly complex metaheuristics in ordinary PV parameter estimation problems might be unnecessary. Finally, we discuss the implications of these outcomes and propose the simple DE method as the premier choice for industrial applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Model predictive control for tracking using artificial references: Fundamentals, recent results and practical implementation

Model predictive control for tracking using artificial refer...

引用

IEEE Conference on Decision and control

作者： P. Krupa J. Köhler A. Ferramosca I. Alvarado M.N. Zeilinger T. Alamo D. Limon Computer Science Group Gran Sasso Science Institute (GSSI) L’Aquila Italy ETH Zürich Institute for Dynamic Systems and Control Zürich Switzerland Department of Management Information and Production Engineering University of Bergamo Via Marconi 5 Dalmine (BG) Italy Department of Systems Engineering and Automation Universidad de Sevilla Seville Spain

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This paper provides a comprehensive tutorial on a family of Model Predictive control (MPC) formulations, known as MPC for tracking, which are characterized by including an artificial reference as part of the decision variables in the optimization problem. These formulations have several benefits with respect to the classical MPC formulations, including guaranteed recursive feasibility under online reference changes, as well as asymptotic stability and an increased domain of attraction. This tutorial paper introduces the concept of using an artificial reference in MPC, presenting the benefits and theoretical guarantees obtained by its use. We then provide a survey of the main advances and extensions of the original linear MPC for tracking, including its non-linear extension. Additionally, we discuss its application to learning-based MPC, and discuss optimization aspects related to its implementation.

关键词： Surveys Asymptotic stability Costs Tutorials Optimization Predictive control

来源：评论

学校读者我要写书评

暂无评论

Semi-Markov Telecommunication Networks Model

Semi-Markov Telecommunication Networks Model

引用

International Conference on Actual Problems of Electron Devices Engineering, (APEDE)

作者： Mikhail S. Svetlov Alexey A. L’vov Arman M. Martirosyan David M. Martirosyan Igor S. Bagaev Semen T. Khasanov Laboratory of Control and Automation Problems in Mechanical Engineering Institute of Precision Mechanics and Control of RAS Saratov Russian Federation Institute of Institute of Electronic Engineering and Instrumentation Yuri Gagarin State Technical University of Saratov Saratov Russian Federation Institute of Applied Information Technologies and Communications Yuri Gagarin State Technical University of Saratov Saratov Russian Federation Phystech-School of Applied Mathematics and Computer Science Moscow Institute of Physics and Technology Moscow Russian Federation

ISBN: (数字)9798350393316

ISBN: (纸本)9798350393323

This paper proposes a semi-Markov model of telecommunication network (TCN). The variant of dynamic traffic adaptive control of queuing system as a special case of TCN is considered. The main purpose of control is to minimize the average cost per unit of time to service the incoming flow of information (packets). This takes into account the different bandwidth of the channels, the processing speed of information in the channel and the information capacity of the buffers. The approach to the organization of dynamic control taking into account noise immunity (information reliability) and information security is discussed.

关键词： Adaptation models Costs Noise Information security Bandwidth Organizations Communications technology Telecommunication network reliability Adaptive control Electron devices

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Syntax-based data augmentation for Hungarian-English machine translation

arXiv

引用

arXiv 2022年

作者： Nagy, Attila Nanys, Patrick Konrád, Balázs Frey Bial, Bence Ács, Judit Department Of Automation And Applied Informatics Budapest University Of Technology And Economics Hungary Institute For Computer Science And Control Eötvös Loránd Research Network

We train Transformer-based neural machine translation models for Hungarian-English and English-Hungarian using the Hunglish2 corpus. Our best models achieve a BLEU score of 40.0 on Hungarian-English and 33.4 on English-Hungarian. Furthermore, we present results on an ongoing work about syntax-based augmentation for neural machine translation. Both our code and models are publicly available. © 2022, CC BY.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

DSNRNet: A Network of LiDAR Data Denoising by Differential Stability in Underground Mine

DSNRNet: A Network of LiDAR Data Denoising by Differential S...

引用

International Conference on Intelligent Transportation

作者： Dejiang Meng Bin Tian Ziyu Pan Junhui Wang Long Chen The Waytous Inc. Beijing China The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China The School of Data and Computer Science Sun Yat-sen University China

Some sprinklers in underground mines spray water mist to lessen the amount of dust in the air. But water mist causes LiDAR to provide inaccurate point measurements, which are referred to as water mist noise that undermines the effectiveness of LiDAR-based localization and object recognition. Therefore, in order to reduce water mist noise, we have developed a new noise segmentation network that can operate on a CPU in real time-differential stability noise removal network (DSNRNet). This network consists of two sub-networks. The first sub-network is aimed at extracting differential stability features, so we named it the differential stability feature extraction network (sub-network 1). The second sub-network: a fully connected neural network (sub-network 2), is used to segment noise. To evaluate the DSNRNet's performance, we built a LiDAR semantic segmentation dataset of underground mines and run the DSNRNet in an Intel i7-11800H CPU. The experimental results demonstrate that this method is able to strike a better balance between speed (26.3 milliseconds) and accuracy (97.8 % ) compared with the other two most possible methods-DSOR (24.2 milliseconds, 3.2 % ) and WeatherNet (436.8ms, 98.5 % ).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

引用

IFAC-PapersOnLine 2023年第2期56卷 270-275页

作者： Zishuo Li Muhammad Umar B. Niazi Changxin Liu Yilin Mo Karl H. Johansson Department of Automation Tsinghua University Beijing 100084 China Division of Decision and Control Systems Digital Futures School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm SE-100 44 Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology 77 Massachusetts Avenue Cambridge MA 02139 USA

This paper studies the problem of secure state estimation of a linear time-invariant (LTI) system with bounded noise in the presence of sparse attacks on an unknown, time-varying set of sensors. At each time, the attacker has the freedom to choose an arbitrary set of no more than p sensors and manipulate their measurements without restraint. To this end, we propose a secure state estimation scheme and guarantee a bounded estimation error irrespective of the attack signals subject to 2p-sparse observability and a mild, technical assumption that the system matrix has no degenerate eigenvalues. The proposed scheme comprises a design of decentralized observers for each sensor based on the local observable subspace decomposition. At each time step, the local estimates of sensors are fused by a median operator to obtain a secure estimation, which is then followed by a local detection-and-resetting process of the decentralized observers. The estimation error is shown to be upper-bounded by a constant which is determined only by the system parameters and noise magnitudes. Moreover, we design the detector threshold to ensure that the benign sensors never trigger the detector. The efficacy of the proposed algorithm is demonstrated by its application on a benchmark example of IEEE 14-bus system. We show that our proposed scheme can effectively tolerate sparse attacks on an unknown set of sensors, ensuring a bounded estimation error and effectively detecting and resetting the attacked sensors.

关键词： Estimation and filtering Design of fault tolerant/reliable systems Estimation and fault detection

来源：评论

学校读者我要写书评

暂无评论

Point Gated Attention

Point Gated Attention

引用

2022 Chinese automation Congress, CAC 2022

作者： Wang, Haibin Wang, Tian Zhang, Mengyi Zhang, Baochang Shi, Peng Snoussi, Hichem Beihang University School of Automation Science and Electrical Engineering Beijing China Nanjing University of Science and Technology Jiangsu Key Laboratory of Image and Video Understandingof Scoial Safety Nanjing China Institute of Artificial Intellgence Beihang University Beijing China Nanjing Tech University College of Electrical Engineering and Control Science Nanjing China Fujian Normal University School of Mathematics and Computer Science Fujian China University of Technology of Troyes Institute Charles Delaunay-LM2S Troyes France

ISBN: (纸本)9781665465335

Self-attention networks have achieved great success in traditional language processing, and have also made great progress in image classification and object detection. When analyzing the previous work, it is found that some point cloud information is lost in their feature extraction work, so we design a network to reduce the loss when extracting features. And through the feature extraction network - Gated Attention Unit instead of Transformer, to make the extraction of point cloud features more efficient. Based on Point Transformer, a new network structure named Point Gated Attention is used to classify point clouds. The overallacc on the dataset ModelNet40 can reach 91.4%, and the average accuracy can reach 93.9%. © 2022 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Learning from Human Uncertainty by Choquet Integral for Optic Disc Segmentation 21

Learning from Human Uncertainty by Choquet Integral for Opti...

引用

4th International Conference on control and computer Vision, ICCCV 2021

作者： Qiu, Hao Su, Pan Jiang, Shanshan Yue, Xingyu Zhao, Yitian Liu, Jiang Cixi Institute of Biomedical Engineering Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences China School of Control and Computer Engineering North China Electric Power University China School of Mechatronic Engineering and Automation Shanghai University Shanghai China Department of Computer Science and Engineering Southern University of Science and Technology China

ISBN: (纸本)9781450390477

Modern deep neural networks are able to beat human annotators in several medical image processing tasks. In practical manual annotation for medical image segmentation tasks, the labels of annotators often show inter-observer variability (IOV) which is mainly caused by annotators' different understandings of expertise. In order to build a trustworthy segmentation system, robust models should consider how to capture uncertainty in samples and labels. Different from the conventional way of handling IOV with label fusion such as majority voting, a fuzzy integral based ensemble framework of multiple deep learning models for optic disc segmentation is proposed. Each component segmentation model is trained with respect to an annotator. Then, a powerful nonlinear aggregation function, the Choquet integral, is employed in form of a neural network to integrate the segmentation results of multiple annotators. The proposed method is validated on the public RIM-ONE dataset consisting of 169 fundus images and each image is annotated by 5 experts. Compared with conventional segmentation ensemble methods, the proposed methods achieves a higher Dice score (98.69%). © 2021 ACM.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：