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

arXiv 2024年

作者： Lupu, Daniela Garrett, Joseph L. Johansen, Tor Arne Orlandic, Milica Necoara, Ion Automatic Control and System Engineering Department National University of Science and Technology Politehnica Bucharest Bucharest060042 Romania Center for Autonomous Marine Operations and Systems Norwegian University of Science and Technology Trondheim Norway Department of Engineering Cybernetics Norway Department of Electronic Systems Norway G. Mihoc-C. Iacob Institute of Mathematical Statistics and Applied Mathematics The Romanian Academy Bucharest050711 Romania

Dimensionality reduction can be applied to hyperspectral images so that the most useful data can be extracted and processed more quickly. This is critical in any situation in which data volume exceeds the capacity of the computational resources, particularly in the case of remote sensing platforms (e.g., drones, satellites), but also in the case of multi-year datasets. Moreover, the computational strategies of unsupervised dimensionality reduction often provide the basis for more complicated supervised techniques. Seven unsupervised dimensionality reduction algorithms are tested on hyperspectral data from the HYPSO-1 earth observation satellite. Each particular algorithm is chosen to be representative of a broader collection. The experiments probe the computational complexity, reconstruction accuracy, signal clarity, sensitivity to artifacts, and effects on target detection and classification of the different algorithms. No algorithm consistently outperformed the others across all tests, but some general trends regarding the characteristics of the algorithms did emerge. With half a million pixels, computational time requirements of the methods varied by 5 orders of magnitude, and the reconstruction error varied by about 3 orders of magnitude. A relationship between mutual information and artifact susceptibility was suggested by the tests. The relative performance of the algorithms differed significantly between the target detection and classification tests. Overall, these experiments both show the power of dimensionality reduction and give guidance regarding how to evaluate a technique prior to incorporating it into a processing pipeline. © 2024, CC BY.

关键词： Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Topology-Guided Perception-Aware Receding Horizon Trajectory Generation for UAVs

Topology-Guided Perception-Aware Receding Horizon Trajectory...

引用

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

作者： Gang Sun Xuetao Zhang Yisha Liu Hanzhang Wang Xuebo Zhang Yan Zhuang Intelligent Robotic Laboratory School of Artificial Intelligence also School of Control Science and Engineering Dalian University of Technology Dalian China School of Information Science and Technology Dalian Maritime University Dalian China Tianjin Key Laboratory of Intelligent Robotics College of Artificial Intelligence the Institute of Robotics and Automatic Information System (lRAIS) Nankai University Tianjin China

The perception-aware motion planning method based on the localization uncertainty has the potential to improve the localization accuracy for robot navigation. How-ever, most of the existing perception-aware methods pre-build a global feature map and can not generate the perception- aware trajectory in real time. This paper proposes a topology- guided perception-aware receding horizon trajectory generation method, which contains a topology-guided position trajectory generation and a perception-aware yaw angle trajectory generation. Specifically, a memorable active map is built by selectively storing the visual landmarks. After that, a library of candidate topological trajectories are generated, which are then evaluated in terms of the perception quality based on the active map, smoothness, collision possibility and feasibility. In addition, the yaw angle trajectory is obtained through a front-end multiple refined path search and a back-end path- guided trajectory optimization. Comparative simulation and real-world experiments are carried out to confirm that the proposed method can keep more visual features in view and reduce the localization error.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MAPPG: Multi-Agent Phasic Policy Gradient

MAPPG: Multi-Agent Phasic Policy Gradient

引用

IEEE Conference on Decision and control

作者： Qi Zhang Xuetao Zhang Yisha Liu Xuebo Zhang Yan Zhuang Intelligent Robotic Laboratory School of Artificial Intelligence School of Control Science and Engineering Dalian University of Technology Dalian China School of Information Science and Technology Dalian Maritime University Dalian China Tianjin Key Laboratory of Intelligent Robotics College of Artificial Intelligence Institute of Robotics and Automatic Information System (IRAIS) Nankai University Tianjin China

We propose a Multi-Agent Phasic Policy Gradient (MAPPG) algorithm, which can assist agents to further alleviate the non-stationarity of the environment. Different from the existing methods, the auxiliary phase is introduced to train the local policy directly by using the environment state, which can be naturally integrated into other algorithms. Specifically, the hidden layer feature sharing is proposed, which ensures feature sharing between the global value network and the local policy network for the first time. Meanwhile, mirror descent is utilized to iteratively update the policy in the auxiliary stage, which makes the policy update more robust. Through a series of evaluations on multi-agent Particle and multi-agent Mujoco benchmark environments, the experimental results show that our method achieves higher rewards than state-of-the-art benchmarks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Theory for Regularized system Identification Part I: Empirical Bayes Hyper-parameter Estimator

arXiv

引用

arXiv 2022年

作者： Ju, Yue Mu, Biqiang Ljung, Lennart Chen, Tianshi The School of Data Science Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen518172 China Key Laboratory of Systems and Control Institute of Systems Science Academy of Mathematics and System Science Chinese Academy of Sciences Beijing100190 China The Division of Automatic Control Department of Electrical Engineering Linköping University LinköpingSE-58183 Sweden

Regularized techniques, also named as kernel-based techniques, are the major advances in system identification in the last decade. Although many promising results have been achieved, their theoretical analysis is far from complete and there are still many key problems to be solved. One of them is the asymptotic theory, which is about convergence properties of the model estimators as the sample size goes to infinity. The existing related results for regularized system identification are about the almost sure convergence of various hyper-parameter estimators. A common problem of those results is that they do not contain information on the factors that affect the convergence properties of those hyper-parameter estimators, e.g., the regression matrix. In this paper, we tackle problems of this kind for the regularized finite impulse response model estimation with the empirical Bayes (EB) hyper-parameter estimator and filtered white noise input. In order to expose and find those factors, we study the convergence in distribution of the EB hyper-parameter estimator, and the asymptotic distribution of its corresponding model estimator. For illustration, we run Monte Carlo simulations to show the efficacy of our obtained theoretical results. Copyright © 2022, The Authors. All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Model-Based and Data-Driven control of Event- and Self-Triggered Discrete-Time LTI systems

arXiv

引用

arXiv 2022年

作者： Wang, Xin Berberich, Julian Sun, Jian Wang, Gang Allgöwer, Frank Chen, Jie The Key Laboratory of Intelligent Control and Decision of Complex System Beijing Institute of Technology Beijing10081 China The Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China The University of Stuttgart Institute for Systems Theory and Automatic Control Stuttgart70550 Germany The Department of Control Science and Engineering Tongji University Shanghai201804 China The State Key Lab of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China

The present paper considers the model-based and data-driven control of unknown linear time-invariant discretetime systems under event-triggering and self-triggering transmission schemes. To this end, we begin by presenting a dynamic event-triggering scheme (ETS) based on periodic sampling, and a discrete-time looped-functional approach, through which a model-based stability condition is derived. Combining the model-based condition with a recent data-based system representation, a data-driven stability criterion in the form of linear matrix inequalities (LMIs) is established, which also offers a way of co-designing the ETS matrix and the controller. To further alleviate the sampling burden of ETS due to its continuous/periodic detection, a self-triggering scheme (STS) is developed. Leveraging pre-collected input-state data, an algorithm for predicting the next transmission instant is given, while achieving system stability. Finally, numerical simulations showcase the efficacy of ETS and STS in reducing data transmissions as well as of the proposed co-design methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

On inf-convolution-based robust practical stabilization under computational uncertainty

arXiv

引用

arXiv 2021年

作者： Schmidt, Patrick Osinenko, Pavel Streif, Stefan Technische Universität Chemnitz Automatic Control and System Dynamics Lab Chemnitz09126 Germany Computational and Data Science and Engineering Center Skolkovo Institute of Science and Technology Moscow143026 Russia

This work is concerned with practical stabilization of nonlinear systems by means of inf-convolution-based sample-and-hold control. It is a fairly general stabilization technique based on a generic non-smooth control Lyapunov function (CLF) and robust to actuator uncertainty, measurement noise, etc. The stabilization technique itself involves computation of descent directions of the CLF. It turns out that non-exact realization of this computation leads not just to a quantitative, but also qualitative obstruction in the sense that the result of the computation might fail to be a descent direction altogether and there is also no straightforward way to relate it to a descent direction. Disturbance, primarily measurement noise, complicate the described issue even more. This work suggests a modified inf-convolution-based control that is robust w. r. t. system and measurement noise, as well as computational uncertainty. The assumptions on the CLF are mild, as, e. g., any piece-wise smooth function, which often results from a numerical LF/CLF construction, satisfies them. A computational study with a three-wheel robot with dynamical steering and throttle under various tolerances w. r. t. computational uncertainty demonstrates the relevance of the addressed issue and the necessity of modifying the used stabilization technique. Similar analyses may be extended to other methods which involve optimization, such as Dini aiming or steepest descent. © 2021, CC BY-NC-ND.

关键词： Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

On Asymptotic Distribution of Generalized Cross Validation Hyper-parameter Estimator for Regularized system Identification*

On Asymptotic Distribution of Generalized Cross Validation H...

引用

IEEE Conference on Decision and control

作者： Yue Ju Tianshi Chen Biqiang Mu Lennart Ljung School of Data Science and Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China Key Laboratory of Systems and Control Institute of Systems Science Academy of Mathematics and System Science Chinese Academy of Sciences Beijing China Division of Automatic Control Linköping University Linköping Sweden

ISBN: (纸本)9781665436601

Asymptotic theory is one of the core subjects in system identification theory and often used to assess properties of model estimators. In this paper, we focus on the asymptotic theory for the kernel-based regularized system identification and study the convergence in distribution of the generalized cross validation (GCV) based hyper-parameter estimator. It is shown that the difference between the GCV based hyper-parameter estimator and the optimal hyper-parameter estimator that minimizes the mean square error scaled by $1/\sqrt N$ converges in distribution to a zero mean Gaussian distribution, where N is the sample size and an expression of covariance matrix is obtained. In particular, for the ridge regression case, a closed-form expression of the variance is obtained and shows the influence of the limit of the regression matrix on the asymptotic distribution. For illustration, Monte Carlo numerical simulations are run to test our theoretical results.

关键词： Monte Carlo methods Finite impulse response filters Mean square error methods White noise Gaussian distribution Numerical simulation system identification

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Modelling and Model Predictive control Design of a Nonlinear Auger-Based Pyrolysis Reactor

SSRN

引用

SSRN 2024年

作者： Adiprabowo, Arya Bhaskara Muharto, Bambang Prabowo, Wargiantoro Saputro, Frendy Rian Anggoro, Trisno Masfuri, Imron Sugeng, Dhani Avianto Rosyadi, Erlan Lang, Zi-Qiang KST BJ Habibie Energy Building 620-625 Indonesia Department of Automatic Control and Systems Engineering University of Sheffield SheffieldS1 3JD United Kingdom Department of Electrical Engineering Mathematics and Computer Science University of Twente Enschede7522 NB Netherlands Vehicle System Engineering Malaysia-Japan International Institute of Technology Universiti Teknologi Malaysia Kuala Lumpur54100 Malaysia Department of Chemical and Environmental Engineering Malaysia Japan International Institute of Technology Universiti Teknologi Malaysia Kuala Lumpur54100 Malaysia

Pyrolysis is a prominent technique to harvest energy while addressing the global waste problem. Product yield relies heavily on precise reactor temperature control in a pyrolysis process;thus, a representative mathematical model is necessary to design and evaluate the control system. Hence, this research aims to create a data-driven model of a 1 kg/h Auger-based pyrolysis (APR) plant and design a robust controller accordingly. The system is excited by using a pseudo-random binary signal (PRBS) to trigger process response and is recorded for 2 hours. Various models with different orders, such as Auto Regressive Exogeneous (ARX), Auto Regressive Moving Average Exogeneous (ARMAX), Box-Jenkins (BJ), and Output Error (OE) were created from the obtained data. The models were examined using best-fit percentage, final prediction error (FPE) and mean square error (MSE) criteria and validated using cross-correlation and auto-correlation functions. Two widely used and purpose-fit controllers, Proportional-Integral-Derivate (PID) and Model Predictive control (MPC), with output constraints, were designed and tuned for this application. Several operational scenarios were investigated, such as setpoint tracking and disturbance rejection. The best-fit models were selected and validated for TIC-3, TIC-4 and TIC-5, with 96.22%, 97.4% and 84.83% fitness criteria, respectively. Both controllers successfully satisfied all the tests with less than 2% steady-state error. However, MPC surpassed PID controllers in all aspects, such as 5-7 times faster settling time, negligible overshoot, and reduced integral absolute error (IAE) and integral square error (ISE) up to 44.75% and 5.45%, respectively. Nevertheless, MPC with input and output constraints performance pales compared to other controllers despite some adjustments with massive ISE and settling time above 3000 seconds. As a result, a recommendation to change the input actuator will be beneficial to unleash the benefit of MPC fully. © 2

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Tutorial on Asymptotic Properties of Regularized Least Squares Estimator for Finite Impulse Response Model

arXiv

引用

arXiv 2021年

作者： Ju, Yue Chen, Tianshi Mu, Biqiang Ljung, Lennart The School of Data Science Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen518172 China Key Laboratory of Systems and Control Institute of Systems Science Academy of Mathematics and System Science Chinese Academy of Sciences Beijing100190 China The Division of Automatic Control Department of Electrical Engineering Linköping University LinköpingSE-58183 Sweden

In this paper, we give a tutorial on asymptotic properties of the Least Square (LS) and Regularized Least Squares (RLS) estimators for the finite impulse response model with filtered white noise inputs. We provide three perspectives: the almost sure convergence, the convergence in distribution and the boundedness in probability. On one hand, these properties deepen our understanding of the LS and RLS estimators. On the other hand, we can use them as tools to investigate asymptotic properties of other estimators, such as various hyper-parameter estimators. © 2021, CC BY.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Weighted Transfer Learning of Dynamic Time Warped Data for Motor Imagery based Brain Computer Interfaces

Weighted Transfer Learning of Dynamic Time Warped Data for M...

引用

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Joshua Giles Kai Keng Ang Lyudmila Mihaylova Mahnaz Arvaneh Automatic control and System Engineering Department University of Sheffield Sheffield UK Institute for Infocomm Research Agency for Science Technology and Research (A*STAR) Singapore

ISBN: (数字)9781728119908

ISBN: (纸本)9781728119915

A large amount of calibration data is typically needed to train an electroencephalogram (EEG)-based brain-computer interfaces (BCI) due to the non-stationary nature of EEG data. This paper proposes a novel weighted transfer learning algorithm using a dynamic time warping (DTW) based alignment method to alleviate this need by using data from other subjects. DTW-based alignment is first applied to reduce the temporal variations between a specific subject data and the transfer learning data from other subjects. Next, similarity is measured using Kullback Leibler divergence (KL) between the DTW aligned data and the specific subject data. The other subjects' data are then weighted based on their KL similarity to each trials of the specific subject data. This weighted data from other subjects are then used to train the BCI model of the specific subject. An experiment was performed on publicly available BCI Competition IV dataset 2a. The proposed algorithm yielded an average improvement of 9% compared to a subject-specific BCI model trained with 4 trials, and the results yielded an average improvement of 10% compared to naive transfer learning. Overall, the proposed DTW-aligned KL weighted transfer learning algorithm show promise to alleviate the need of large amount of calibration data by using only a short calibration data.

关键词： Calibration Electroencephalography Heuristic algorithms Brain modeling Data models Training Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：