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

IEEE Conference on Decision and control

作者： Jan H. Hoekstra Bence Cseppento Gerben I. Beintema Maarten Schoukens Zsolt Kollár Roland Tóth Dept. of Electrical Engineering at the Eindhoven Control Systems group University of Technology The Netherlands Dept. of Measurement and Information Systems Budapest University of Technology and Economics Hungary Institute for Computer Science and Control Budapest Hungary

Artificial neural networks (ANN) have been shown to be flexible and effective function estimators for the identification of nonlinear state-space models. However, if the resulting models are used directly for nonlinear model predictive control (NMPC), the resulting nonlinear optimization problem is often overly complex due to the size of the network, requires the use of high-order observers to track the states of the ANN model, and the overall control scheme does not exploit the available autograd tools for these models. In this paper, we propose an efficient approach to auto-convert ANN statespace models to linear parameter-varying (LPV) form and solve predictive control problems by successive solutions of linear model predictive problems, corresponding to quadratic programs (QPs). Furthermore, we show how existing deep-learning methods, such as SUBNET that uses a state encoder, enable efficient implementation of MPCs on identified ANN models. Performance of the proposed approach is demonstrated by a simulation study on an unbalanced disc system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Graph-Based Self-Calibration Technique for Cable-Driven Robots with Sagging Cable

A Graph-Based Self-Calibration Technique for Cable-Driven Ro...

引用

IEEE/RSJ International Conference on Intelligent Robots and systems (IROS)

作者： M. R. Dindarloo A. S. Mirjalili S. A. Khalilpour R. Khorrambakht Stephan Weiss H. D. Taghirad Advanced Robotics and Automated Systems (ARAS) Faculty of Electrical Engineering K. N. Toosi University of Technology Tehran Iran Department of Electrical and Computer Engineering Tandon School of Engineering Control/Robotics Research Laboratory New York University Brooklyn NY Department of Smart Systems Technologies University of Klagenfurt Austria

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

The efficient operation of large-scale Cable-Driven Parallel Robots (CDPRs) relies on precise calibration of kinematic parameters and the simplicity of the calibration process. This paper presents a graph-based self-calibration framework that explicitly addresses cable sag effects and facilitates the calibration procedure for large-scale CDPRs by only relying on internal sensors. A unified factor graph is proposed, incorporating a catenary cable model to capture cable sagging. The factor graph iteratively refines kinematic parameters, including anchor point locations and initial cable length, by considering jointly onboard sensor data and the robot’s kineto-static model. The applicability and accuracy of the proposed technique are demonstrated through Finite Element (FE) simulations, on both large and small-scale CDPRs subjected to significant initialization perturbations.

关键词： Meters Accuracy Perturbation methods Kinematics Robot sensing systems End effectors Software Calibration Sensors Finite element analysis

来源：评论

学校读者我要写书评

暂无评论

Discrete-Time Stress Matrix-Based Formation control of General Linear Multi-Agent systems

arXiv

引用

arXiv 2024年

作者： Onuoha, Okechi Kurawa, Suleiman Tang, Zezhi Dong, Yi School of Computing Engineering and Intelligent Systems Ulster University United Kingdom School of Electrical and Electronic Engineering The University of Manchester United Kingdom Department of Automatic Control and Systems Engineering University of Sheffield United Kingdom School of Electronics & Computer Science University of Southampton United Kingdom

This paper considers the distributed leader-follower stress-matrix-based affine formation control problem of discrete-time linear multi-agent systems with static and dynamic leaders. In leader-follower multi-agent formation control, the aim is to drive a set of agents comprising leaders and followers to form any desired geometric pattern and simultaneously execute any required manoeuvre by controlling only a few agents denoted as leaders. Existing works in literature are mostly limited to the cases where the agents’ inter-agent communications are either in the continuous-time settings or the sampled-data cases where the leaders are constrained to constant (or zero) velocities or accelerations. Here, we relax these constraints and study the discrete-time cases where the leaders can have stationary or time-varying velocities. We propose control laws in the study of different situations and provide some sufficient conditions to guarantee the overall system stability. Simulation study is used to demonstrate the efficacy of our proposed control laws. © 2024, CC BY.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Pointwise-Sparse Actuator Scheduling for Linear systems With controllability Guarantee

arXiv

引用

arXiv 2024年

作者： Ballotta, Luca Joseph, Geethu Thete, Irawati Rahul Delft Center for Systems and Control Delft University of Technology Delft Netherlands Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft Netherlands Texas Instruments Bengaluru India

This paper considers the design of sparse actuator schedules for linear time-invariant systems. An actuator schedule selects, for each time instant, which control inputs act on the system in that instant. We address the optimal scheduling of control inputs under a hard constraint on the number of inputs that can be used at each time. For a sparsely controllable system, we characterize sparse actuator schedules that make the system controllable, and then devise a greedy selection algorithm that guarantees controllability while heuristically providing low control effort. We further show how to enhance our greedy algorithm via Markov chain Monte Carlo-based randomized *** Codes 93B51 (Primary) 93B05, 93C35, 93C55 (Secondary) Copyright © 2024, The Authors. All rights reserved.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Anomaly Detection Based on Principle of Justifiable Granularity and Probability Density Estimation

Anomaly Detection Based on Principle of Justifiable Granular...

引用

2023 China Automation Congress, CAC 2023

作者： Du, Sheng Ma, Xian Li, Xiang Wu, Min Cao, Weihua Pedrycz, Witold School of Automation China University of Geosciences Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan430074 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Systems Research Institute Polish Academy of Sciences Warsaw00-901 Poland Istinye University Faculty of Engineering and Natural Sciences Department of Computer Engineering Istanbul Sariyer Turkey

ISBN: (纸本)9798350303759

Anomaly detection is essential to ensure the safety of industrial processes. This paper presents an anomaly detection approach based on the probability density estimation and principle of justifiable granularity. First, time series data are transformed into a two-dimensional information granule by the principle of justifiable granularity. Then, the test statistic is constructed, and the probability density and cumulative distribution functions of the test statistic are calculated. Next, the confidence level determines the test threshold. Finally, the time series data of a key parameter in the sintering process is used as a case study. The experimental result demonstrates that the proposed approach can detect abnormal time series data effectively, providing an accurate and effective solution for detecting time series anomalies in industrial processes. © 2023 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Sora for foundation robots with parallel intelligence:three world models,three robotic systems

引用

Frontiers of Information Technology & Electronic engineering 2024年第7期25卷 917-923页

作者： Lili FAN Chao GUO Yonglin TIAN Hui ZHANG Jun ZHANG Fei-Yue WANG School of Information and Electronics Beijing Institute of TechnologyBeijing 100081China State Key Laboratory for Management and Control of Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China School of Computer and Information Technology Beijing Jiaotong UniversityBeijing 100044China School of Electrical Engineering Wuhan UniversityWuhan 430072China

This paper outlines the initial steps and basic framework for developing foundation/infrastructure robots/robotics based on foundation models and parallel intelligence,as well as the potential applications of new art... 详细信息

关键词： artificial foundation intelligence

来源：评论

学校读者我要写书评

暂无评论

Analog, Programmable Switched Capacitor FIR Filter Based on Rotator Architecture Implemented in CMOS Technology

Analog, Programmable Switched Capacitor FIR Filter Based on ...

引用

Signal Processing Algorithms, Architectures, Arrangements and Applications (SPA)

作者： Paweł Pawłowski Rafał Długosz Marek Radkowski Mateusz Wątły Adam Dąbrowski Faculty of Control Robotics and Electrical Engineering Institute of Automatic Control and Robotics Division of Signal Processing and Electronic Systems Poznań University of Technology Poznań Poland Faculty of Telecommunication Computer Science and Electrical Engineering Bydgoszcz University of Science and Technology Bydgoszcz Poland

The paper presents project and its verification of a prototype integrated circuit containing an analog, programmable finite impulse response (FIR) filter, implemented in CMOS 350 nm technology. The structure of the filter is based on the switched capacitor technique. In circuits of this type, one of main challenges is an efficient implementation of filter coefficients, which result from several factors described in this work. When implementing such filters as programmable circuits, the values of their coefficients have to be limited to a selected range, i.e. a given resolution in bits. In the implemented prototype filter, the filter coefficients are represented by 6 bits in sign-magnitude notation, so they can take 63 different values only. In such filters, it is not possible to directly implement any frequency response of the filter. Each time, it is necessary to properly round the theoretical values of the coefficients so that they fit into the available range of discrete values resulting from the implementation. The authors of the work designed an algorithm that allows such matching. The paper also presents results of measurements of the prototype chip.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Carbon-Aware Computing in a Network of Data Centers: A Hierarchical Game-Theoretic Approach

arXiv

引用

arXiv 2024年

作者： Breukelman, Enno Hall, Sophie Belgioioso, Giuseppe Dörfler, Florian The KTH Royal Institute of Technology School of Electrical Engineering and Computer Science Division of Decision and Control Systems Malvinas väg 10 StockholmSE-100 44 Sweden The Automatic Control Laboratory Department of Electrical Engineering and Information Technology ETH Zurich Physikstrasse 3 Zürich8092 Switzerland

Over the past decade, the continuous surge in cloud computing demand has intensified data center workloads, leading to significant carbon emissions and driving the need for improving their efficiency and sustainability. This paper focuses on the optimal allocation problem of batch compute loads with temporal and spatial flexibility across a global network of data centers. We propose a bilevel game-theoretic solution approach that captures the inherent hierarchical relationship between supervisory control objectives, such as carbon reduction and peak shaving, and operational objectives, such as priority-aware scheduling. Numerical simulations with real carbon intensity data demonstrate that the proposed approach successfully reduces carbon emissions while simultaneously ensuring operational reliability and priority-aware scheduling. © 2024, CC BY-NC-ND.

关键词： Carbon

来源：评论

学校读者我要写书评

暂无评论

Non-euclidean monotone operator theory and applications

引用

The Journal of Machine Learning Research 2024年第1期25卷 14872-14904页

作者： Alexander Davydov Saber Jafarpour Anton V. Proskurnikov Francesco Bullo Center for Control Dynamical Systems and Computation University of California Santa Barbara Santa Barbara CA Department of Electrical Computer and Energy Engineering University of Colorado Boulder Boulder CO Department of Electronics and Telecommunications Politecnico di Torino Turin Italy

While monotone operator theory is often studied on Hilbert spaces, many interesting problems in machine learning and optimization arise naturally in finite-dimensional vector spaces endowed with non-Euclidean norms, such as diagonally-weighted ℓ1 or ℓ1 norms. This paper provides a natural generalization of monotone operator theory to finitedimensional non-Euclidean spaces. The key tools are weak pairings and logarithmic norms. We show that the resolvent and reected resolvent operators of non-Euclidean monotone mappings exhibit similar properties to their counterparts in Hilbert spaces. Furthermore, classical iterative methods and splitting methods for finding zeros of monotone operators are shown to converge in the non-Euclidean case. We apply our theory to equilibrium computation and Lipschitz constant estimation of recurrent neural networks, obtaining novel iterations and tighter upper bounds via forward-backward splitting.

关键词： non-Euclidean norms monotone operator theory fixed point equations nonexpansive maps

来源：评论

学校读者我要写书评

暂无评论

Optimal Sensor Placement for Full-Set TDOA Localization Accounting for Sensor Location Errors

引用

IEEE Transactions on Aerospace and Electronic systems 2025年

作者： Zhang, Chengjie Han, Xinyang Kong, He Ho, K.C. Southern University of Science and Technology Shenzhen Key Laboratory of Control Theory and Intelligent Systems Guangdong Provincial Key Laboratory of Fully Actuated System Control Theory and Technology Shenzhen518055 China University of Missouri Electrical Engineering and Computer Science Department ColumbiaMO65211 United States

The positioning accuracy of a signal source is influenced by where the sensors are deployed. Studies in the literature for the optimal sensor placement (OSP) of localization often ignore the presence of sensor position errors. In practice, however, it is impossible to place the sensors precisely at the desired locations. This work designs OSP by accounting for the presence of Gaussian sensor position errors that are independent and identically distributed (IID), with the full set of Time Difference of Arrival measurements corrupted by Gaussian IID noise. The criterion is the A-optimality equal to the trace of the source position Cramer-Rao Bound (CRB). We show that the presence of sensor position errors introduces a multiplication factor to the same criterion for the case without sensor position errors. The latter factor is dependent on the ratio of the sensor position error power to the range difference noise power but independent of the sensor positions, implying that the A-optimality OSP in the presence of sensor position errors is the same as in the absence. To our knowledge, this is the first time such results have been derived. Simulation studies validate the derived OSP, show the minimal OSP performance gap with sensor positioning error and without, and illustrate the better source localization accuracy by OSP. © 1965-2011 IEEE.

关键词： Cramer-Rao bounds

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：