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

IEEE Conference on decision and control

作者： Gehui Xu Guanpu Chen Baris Fidan Yiguang Hong Hongsheng Qi Thomas Parisini Karl H. Johansson Department of Electrical and Electronic Engineering Imperial College London London UK Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Mechanical and Mechatronics Engineering University of Waterloo Waterloo ON Canada Department of Control Science and Engineering Tongji University shanghai China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China Department of Electronic Systems Aalborg University Denmark Department of Engineering and Architecture University of Trieste Italy

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multiplayer non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies.

关键词： Location awareness Noise Games Position measurement Nash equilibrium Distance measurement Noise measurement

来源：评论

学校读者我要写书评

暂无评论

How are policy gradient methods affected by the limits of control?

How are policy gradient methods affected by the limits of co...

引用

IEEE Conference on decision and control

作者： Ingvar Ziemann Anastasios Tsiamis Henrik Sandberg Nikolai Matni Division of Decision and Control Systems KTH Royal Institute of Technology Automatic Control Laboratory ETH Zurich Department of Electrical and Systems Engineering University of Pennsylvania

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

We study stochastic policy gradient methods from the perspective of control-theoretic limitations. Our main result is that ill-conditioned linear systems in the sense of Doyle inevitably lead to noisy gradient estimates. We also give an example of a class of stable systems in which policy gradient methods suffer from the curse of dimensionality. Finally, we show how our results extend to partially observed systems.

关键词： Linear systems Gradient methods control theory Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Skeleton-based Action Recognition Using Two-stream Graph Convolutional Network with Pose Refinement 41

Skeleton-based Action Recognition Using Two-stream Graph Con...

引用

第41届中国控制会议

作者： Biao Zheng Luefeng Chen Min Wu Witold Pedrycz Kaoru Hirota School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Department of Electrical and Computer Engineering University of Alberta Tokyo Institute of Technology

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

With the development of science and technology,graph convolutional network has made great progress in improving the accuracy of action ***,there still exists some deficiencies in current ***,the human skeleton point coordinates entering into the network are barely refined,which may cause large ***,the second-order information(the length and direction of bones),which can reflect action characteristics discriminatively,is rarely *** solve the above issues,a two stream graph convolutional network with pose refinement for skeleton based action recognition is ***,we use an adaptive block to to help improve the *** test our method on Kinetics dataset and the experiment show it can get better results than some recent methods,which plays a positive role in future research.

关键词： Graph convolutional network Pose refinement Skeleton based action recognition Adaptive block

来源：评论

学校读者我要写书评

暂无评论

A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements

arXiv

引用

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Fidan, Baris Hong, Yiguang Qi, Hongsheng Parisini, Thomas Johansson, Karl H. The Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. We formulate a non-convex SNL problem as a multi-player non-convex potential game and investigate the existence and uniqueness of a Nash equilibrium (NE) in both the ideal setting without measurement noise and the practical setting with measurement noise. We first show that the NE exists and is unique in the noiseless case, and corresponds to the precise network localization. Then, we study the SNL for the case with errors affecting the anchor node position and the inter-node distance measurements. Specifically, we establish that in case these errors are sufficiently small, the NE exists and is unique. It is shown that the NE is an approximate solution to the SNL problem, and that the position errors can be quantified accordingly. Based on these findings, we apply the results to case studies involving only inter-node distance measurement errors and only anchor position information inaccuracies. Copyright © 2024, The Authors. All rights reserved.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Outlier-Robust Training of Machine Learning Models

arXiv

引用

arXiv 2024年

作者： Talak, Rajat Georgiou, Charis Shi, Jingnan Carlone, Luca Laboratory of Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States

Robust training of machine learning models in the presence of outliers has garnered attention across various domains. The use of robust losses is a popular approach and is known to mitigate the impact of outliers. We bring to light two literatures that have diverged in their ways of designing robust losses: one using M-estimation, which is popular in robotics and computer vision, and another using a risk-minimization framework, which is popular in deep learning. We first show that a simple modification of the Black-Rangarajan duality provides a unifying view. The modified duality brings out a definition of a robust loss kernel σ that is satisfied by robust losses in both the literatures. Secondly, using the modified duality, we propose an Adaptive Alternation Algorithm (AAA) for training machine learning models with outliers. The algorithm iteratively trains the model by using a weighted version of the non-robust loss, while updating the weights at each iteration. The algorithm is augmented with a novel parameter update rule by interpreting the weights as inlier probabilities, and obviates the need for complex parameter tuning. Thirdly, we investigate convergence of the adaptive alternation algorithm to outlier-free optima. Considering arbitrary outliers (i.e., with no distributional assumption on the outliers), we show that the use of robust loss kernels σ increases the region of convergence. We experimentally show the efficacy of our algorithm on regression, classification, and neural scene reconstruction problems. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Contrast enhancement of optical videoscope images

引用

Iran Journal of computer Science 2023年第3期6卷 261-275页

作者： Ammar, Reda Aboshosha, Sahar El-Hag, Noha A. Saifeldeen, Reda El-Shafai, Walid El-Banby, Ghada M. Ashiba, Huda I. Khalaf, Ashraf A. M. Elazm, Atef Abou El-Rabaie, El-Sayed M. Abd El-Samie, Fathi E. El-Safrawey, Amir Department of Electronics and Electrical Communications Engineering Faculty of Electronic Engineering Menoufia University Menouf 32952 Egypt Department of Electronics and Electrical Comm. Faculty of Engineering Minia University Minya Egypt Department of Management of Information Systems Higher Institute of Commercial Science El-Mahala El-Kobra Egypt Department of Industrial Electronics and Control Engineering Faculty of Electronic Engineering Menoufia University Menouf 32952 Egypt Department of Electronics and Electrical Communications Engineering Bilbis Higher Institute of Engineering Sharqia Bilbis Egypt Security Engineering Laboratory Computer Science Department Prince Sultan University Riyadh 11586 Saudi Arabia Department of Information Technology College of Computer and Information Sciences Princess Nourah Bint Abdulrahman University P.O. Box 84428 Riyadh 11671 Saudi Arabia

The videoscope (VS) images have poor quality and low contrast. Hence, in this paper, three proposed frameworks to improve the quality of VS images are presented. The first framework depends on contrast-limited adaptive histogram equalization (CLAHE) with adaptive gamma correction. The second framework depends on homomorphic processing. The third framework is based on the homomorphic enhancement with histogram equalization. The first one is superior from the entropy perspective, while the third one is superior from the contrast perspective. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2023.

关键词： Fuzzy enhancement Histogram equalization Homomorphic enhancement Spectral entropy

来源：评论

学校读者我要写书评

暂无评论

Diagnosing and Augmenting Feature Representations in Correctional Inverse Reinforcement Learning

arXiv

引用

arXiv 2023年

作者： Lourenço, Inês Bobu, Andreea Rojas, Cristian R. Wahlberg, Bo The Division of Decision and Control Systems Kth Royal Institute of Technology Stockholm Sweden The Department of Electrical Engineering and Computer Sciences University of California Berkeley BerkeleyCA United States

Robots have been increasingly better at doing tasks for humans by learning from their feedback, but still often suffer from model misalignment due to missing or incorrectly learned features. When the features the robot needs to learn to perform its task are missing or do not generalize well to new settings, the robot will not be able to learn the task the human wants and, even worse, may learn a completely different and undesired behavior. Prior work shows how the robot can detect when its representation is missing some feature and can, thus, ask the human to be taught about the new feature;however, these works do not differentiate between features that are completely missing and those that exist but do not generalize to new environments. In the latter case, the robot would detect misalignment and simply learn a new feature, leading to an arbitrarily growing feature representation that can, in turn, lead to spurious correlations and incorrect learning down the line. In this work, we propose separating the two sources of misalignment: we propose a framework for determining whether a feature the robot needs is incorrectly learned and does not generalize to new environment setups vs. is entirely missing from the robot's representation. Once we detect the source of error, we show how the human can initiate the realignment process for the model: if the feature is missing, we follow prior work for learning new features;however, if the feature exists but does not generalize, we use data augmentation to expand its training and, thus, complete the correction. We demonstrate the proposed approach in experiments with a simulated 7DoF robot manipulator and physical human corrections. Copyright © 2023, The Authors. All rights reserved.

关键词： Manipulators

来源：评论

学校读者我要写书评

暂无评论

Condition Monitoring with Incomplete Data: An Integrated Variational Autoencoder and Distance Metric Framework

Condition Monitoring with Incomplete Data: An Integrated Var...

引用

IEEE International Conference on Automation Science and engineering (CASE)

作者： Maryam Ahang Mostafa Abbasi Todd Charter Homayoun Najjaran Department of Electrical and Computer Engineering University of Victoria Victoria Canada Advanced Control and Intelligent Systems Laboratory (ACIS) University of Victoria Victoria Canada Department of Mechanical Engineering University of Victoria Victoria Canada

ISBN: (数字)9798350358513

ISBN: (纸本)9798350358520

Condition monitoring of industrial systems is crucial for ensuring safety and maintenance planning, yet notable challenges arise in real-world settings due to the limited or non-existent availability of fault samples. This paper introduces an innovative solution to this problem by proposing a new method for fault detection and condition monitoring for unseen data. Adopting an approach inspired by zero-shot learning, our method can identify faults and assign a relative health index to various operational conditions. Typically, we have plenty of data on normal operations, some data on compromised conditions, and very few (if any) samples of severe faults. We use a variational autoencoder to capture the probabilistic distribution of previously seen and new unseen conditions. The health status is determined by comparing each sample’s deviation from a normal operation reference distribution in the latent space. Faults are detected by establishing a threshold for the health indexes, allowing the model to identify severe, unseen faults with high accuracy, even amidst noise. We validate our approach using the run-to-failure IMS-bearing dataset and compare it with other methods. The health indexes generated by our model closely match the established descriptive model of bearing wear, attesting to the robustness and reliability of our method. These findings highlight the potential of our methodology in augmenting fault detection capabilities within industrial domains, thereby contributing to heightened safety protocols and optimized maintenance practices.

关键词： Condition monitoring Fault diagnosis Protocols Fault detection Zero shot learning Probabilistic logic Robustness Safety Maintenance Indexes

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization with Finite Bit Adaptive Quantization for Efficient Communication and Precision Enhancement

arXiv

引用

arXiv 2024年

作者： Rikos, Apostolos I. Jiang, Wei Charalambous, Themistoklis Johansson, Karl H. Guangzhou China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Clear Water Bay Hong Kong Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University Espoo Finland Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia1678 Cyprus Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden

In realistic distributed optimization scenarios, individual nodes possess only partial information and communicate over bandwidth constrained channels. For this reason, the development of efficient distributed algorithms is essential. In our paper we addresses the challenge of unconstrained distributed optimization. In our scenario each node’s local function exhibits strong convexity with Lipschitz continuous gradients. The exchange of information between nodes occurs through 3-bit bandwidth-limited channels (i.e., nodes exchange messages represented by a only 3-bits). Our proposed algorithm respects the network’s bandwidth constraints by leveraging zoom-in and zoom-out operations to adjust quantizer parameters dynamically. We show that during our algorithm’s operation nodes are able to converge to the exact optimal solution. Furthermore, we show that our algorithm achieves a linear convergence rate to the optimal solution. We conclude the paper with simulations that highlight our algorithm’s unique characteristics. © 2024, CC BY.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Attitude Takeover control for Noncooperative Space Targets Based on Gaussian Processes with Online Model Learning

arXiv

引用

arXiv 2023年

作者： Liu, Yuhan Wang, Pengyu Lee, Chang-Hun Tóth, Roland The Control Systems Group Department of Electrical Engineering Eindhoven University of Technology Eindhoven Netherlands The Flight Dynamics and Control Laboratory Department of Aerospace Engineering Korea Advanced Institute of Science and Technology Daejeon Korea Republic of The Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

One major challenge for autonomous attitude takeover control for on-orbit servicing of spacecraft is that an accurate dynamic motion model of the combined vehicles is highly nonlinear, complex and often costly to identify online, which makes traditional model-based control impractical for this task. To address this issue, a recursive online sparse Gaussian Process (GP)-based learning strategy for attitude takeover control of noncooperative targets with maneuverability is proposed, where the unknown dynamics are online compensated based on the learnt GP model in a semi-feedforward manner. The method enables the continuous use of on-orbit data to successively improve the learnt model during online operation and has reduced computational load compared to standard GP regression. Next to the GP-based feedforward, a feedback controller is proposed that varies its gains based on the predicted model confidence, ensuring robustness of the overall scheme. Moreover, rigorous theoretical proofs of Lyapunov stability and boundedness guarantees of the proposed method-driven closed-loop system are provided in the probabilistic sense. A simulation study based on a high-fidelity simulator is used to show the effectiveness of the proposed strategy and demonstrate its high performance. © 2023, CC BY-NC-SA.

关键词： Maneuverability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：