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

arXiv 2021年

作者： Zhang, Han Ringh, Axel Department of Automation School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China Department of Mathematical Sciences Chalmers University of Technology University of Gothenburg Gothenburg41296 Sweden

The inverse linear-quadratic optimal control problem is a system identification problem whose aim is to recover the quadratic cost function and hence the closed-loop system matrices based on observations of optimal trajectories. In this paper, the discrete-time, finite-horizon case is considered, where the agents are also assumed to be homogeneous and indistinguishable. The latter means that the agents all have the same dynamics and objective functions and the observations are in terms of "snap shots" of all agents at different time instants, but what is not known is "which agent moved where" for consecutive observations. This absence of linked optimal trajectories makes the problem challenging. We first show that this problem is globally identifiable. Then, for the case of noiseless observations, we show that the true cost matrix, and hence the closed-loop system matrices, can be recovered as the unique global optimal solution to a convex optimization problem. Next, for the case of noisy observations, we formulate an estimator as the unique global optimal solution to a modified convex optimization problem. Moreover, the statistical consistency of this estimator is shown. Finally, the performance of the proposed method is demonstrated by a number of numerical examples. Copyright © 2021, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

SUNet: Scale-aware Unified Network for Panoptic Segmentation

arXiv

引用

arXiv 2022年

作者： Yan, Weihao Qian, Yeqiang Wang, Chunxiang Yang, Ming The Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai200240 China

Panoptic segmentation combines the advantages of semantic and instance segmentation, which can provide both pixel-level and instance-level environmental perception information for intelligent vehicles. However, it is challenged with segmenting objects of various scales, especially on extremely large and small ones. In this work, we propose two lightweight modules to mitigate this problem. First, Pixel-relation Block is designed to model global context information for large-scale things, which is based on a query-independent formulation and brings small parameter increments. Then, Convectional Network is constructed to collect extra high-resolution information for small-scale stuff, supplying more appropriate semantic features for the downstream segmentation branches. Based on these two modules, we present an end-to-end Scale-aware Unified Network (SUNet), which is more adaptable to multi-scale objects. Extensive experiments on Cityscapes and COCO demonstrate the effectiveness of the proposed methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Optimizing Neural Network image Classification with Fractional Order Gradient Methods

SSRN

引用

SSRN 2023年

作者： Zhao, Haiming Chen, Jiejie Jiang, Ping Zeng, Zhigang Fan, Rui Yang, Honggang School of Computer and Information Engineering Hubei Normal University Huangshi435000 China School of Automation Wuhan University of Technology Wuhan430000 China School of Computer Hubei PolyTechnic University Huangshi435000 China Faculty of Artificial Intelligence Education Central China Normal University Wuhan430000 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430000 China Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan430000 China

As deep learning technology increasingly permeates various fields, the significance of optimization algorithms in neural network training has become more prominent. Typically, the training of deep learning networks relies on gradient descent optimizers based on calculus computations. Traditional integer-order calculus optimizers often fall short when dealing with complex and subtle data. To overcome these limitations, we innovatively utilized the Grünwald-Letnikov and Caputo definitions of fractional calculus to develop two new optimization algorithms: Fractional Order Adagrad (FAdagrad) and Fractional Order Adam (FAdam). These algorithms have been proven to converge to extremal points.A key advantage of our methods is their capability in handling complex, high-dimensional tasks, such as artistic painting image classification, where they exhibit exceptional performance in recognizing and processing subtle differences. The robustness and adaptability of these algorithms were further validated through experiments on the CIFAR-100 dataset. The results demonstrate the efficacy of fractional order optimizers in enhancing training efficiency and accuracy. © 2023, The Authors. All rights reserved.

关键词： image classification

来源：评论

学校读者我要写书评

暂无评论

Optimization of Crane Scheduling Time for Steel Plate Outbound Operations Based on Backtracking Algorithm

Optimization of Crane Scheduling Time for Steel Plate Outbou...

引用

Chinese Automation Congress (CAC)

作者： Jiang Xiang Zhezhuang Xu Jinlong Wang Boyu Chen Qingdong Zhang Xiuren Wu Yuxiong Xia College of Electrical Engineering and Automation Fuzhou University Fuzhou China Education Department of Fujian Province Key Laboratory of Industrial Automation Control Technology and Information Processing Fuzhou China Sansteel Minguang Co. Ltd. Sanming China Fujian Huading Intelligent Manufacturing Technology Co. Ltd. Fuzhou China

ISBN: (数字)9798350368604

ISBN: (纸本)9798350368611

Steel plate is a highly customized product, and steel plates from the same order may be stored in different stacks. However, during the outbound process, the steel plates of the next order can only be dispatched from the warehouse once all plates from the preceding order have been fully completed. In this case, the outbound scheduling of steel plates is a challenging problem since its efficiency and complexity are affected by the shuffling of steel plates. In order to address the challenge, this paper formulates the steel plate outbound scheduling as a dynamic programming model with the aim of minimizing the crane operation time. To solve the problem, an decision tree-based backtracking search algorithm (DTBSA) is developed, in which the search tree is pruned through lower bound functions and dominance rules, so as to reduce the search range of the solution space. Experimental results prove that the proposed method can obtain optimal scheduling results within a reasonable time range.

关键词： Backtracking Lower bound Cranes Heuristic algorithms Optimal scheduling Search problems Dynamic scheduling Dynamic programming Steel Decision trees

来源：评论

学校读者我要写书评

暂无评论

Pneumatically Actuated MR-Safe Parallel Robot for Deep Brain Stimulation Electrode Implantation

Pneumatically Actuated MR-Safe Parallel Robot for Deep Brain...

引用

IEEE International Conference on Robotics and Biomimetics

作者： Weihang Huang Shenghao Dai Anze Xu Xianyi He Shaoping Huang Anzhu Gao School of Mechanical Engineering Shanghai Jiao Tong University Shanghai Jiao Tong University Institute of Medical Robotics and School of Biomedical Engineering Shanghai Jiao Tong University Shanghai China the Key Laboratory of System Control and Information Processing Ministry of Education Shanghai Jiao Tong University Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China

ISBN: (纸本)9781665405362

Deep brain stimulation (DBS) has been widely used in clinical practice as an effective therapy for neurological disorders. MR-conditional robot-assisted electrode implantation has attracted more attention for DBS because of its great accuracy and high-quality guiding images by using MRI. This paper develops a pneumatically actuated MR-safe parallel robot for deep brain electrode implantation. Its fully plastic components and MR-safe pneumatic actuators enable the robotic system to be MR-safe, posing no known hazards in MR environment. A 6-DOF parallel robot is developed using six slider-crank mechanisms for prismatic motions. Inverse kinematics is built to investigate its workspace and achieve the precise control. Experiments are carried out to validate the feasibility, and results shows that the average error of the motion is 0.11 mm. The developed parallel robot shows the potential advantages in the automatic and precise robot-assisted neurosurgical surgery in future.

关键词： Electrodes Pneumatic actuators Neurological diseases Parallel robots Magnetic resonance imaging Satellite broadcasting Deep brain stimulation

来源：评论

学校读者我要写书评

暂无评论

Direction-Constrained control for Efficient Physical Human-Robot Interaction under Hierarchical Tasks

arXiv

引用

arXiv 2024年

作者： Xu, Mengxin Wan, Weiwei Wang, Hesheng Harada, Kensuke Department of Automation Shanghai Jiao Tong University Shanghai200240 China Department of System Innovation Graduate School of Engineering Science Osaka University Toyonaka Osaka560-0043 Japan Department of Automation the Key Laboratory of System Control and Information Processing of Ministry of Education the Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai200240 China

This paper proposes a control method to address the physical Human-Robot Interaction (pHRI) challenge in the context of hierarchical tasks. A common approach to managing hierarchical tasks is Hierarchical Quadratic Programming (HQP), which, however, cannot be directly applied to human interaction due to its allowance of arbitrary velocity direction adjustments. To resolve this limitation, we introduce the concept of directional constraints and develop a direction-constrained optimization algorithm to handle the nonlinearities induced by these constraints. The algorithm solves two sub-problems, minimizing the error and minimizing the deviation angle, in parallel, and combines the results of the two sub-problems to produce a final optimal outcome. The mutual influence between these two sub-problems is analyzed to determine the best parameter for combination. Additionally, the velocity objective in our control framework is computed using a variable admittance controller. Traditional admittance control does not account for constraints. To address this issue, we propose a variable admittance control method to adjust control objectives dynamically. The method helps reduce the deviation between robot velocity and human intention at the constraint boundaries, thereby enhancing interaction efficiency. We evaluate the proposed method in scenarios where a human operator physically interacts with a 7-degree-of-freedom robotic arm. The results highlight the importance of incorporating directional constraints in pHRI for hierarchical tasks. Compared to existing methods, our approach generates smoother robotic trajectories during interaction while avoiding interaction delays at the constraint boundaries. Copyright © 2024, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Metric Learning Based Rolling Bearing Faults Diagnosis with Curvelet Transform

引用

Journal of Physics: Conference Series 2019年第1期1229卷

作者： Ziming Lu Jiang-Wen Xiao Zhengyi Huang School of Automation Huazhong University of Science and Technology Wuhan 430074 China Key Laboratory of Image Processing and Intelligent Control (Huazhong University of Science and Technology) Ministry of Education China

Rolling bearing faults are among the primary causes of breakdown in mechanical equipment. Aiming at the vibration signals of rolling bearing which are non-stationary and easy to be disturbed by noise, a novel fault diagnosis method based on curvelet transform and metric learning is proposed. This method consists of 3 parts. The first one is feature engineering which includes reshaping the original timing features of rolling bearings, employing curvelet transform to transform reshaped features and making its coefficients as the new features. Curvelet transform can analyse the original signal from many angles. The second one is employing metric learning to map these new features into special embedding space. The last one is applying KNN classifier to detect the rolling bearing faults. Metric learning can effectively improve the performance of KNN by learning a mapping matrix to modify the distribution of samples. The proposed method overcomes the problems such as the subjectivity and blindness of manual feature extraction, poor coupling in each stage and sensitive to the effect of noise. Extensive simulations based on several data-sets show that the our method has better performance on bearing fault diagnosis than traditional methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recurrent Attentional Reinforcement Learning for Fault Diagnosis of Hydraulic System

Recurrent Attentional Reinforcement Learning for Fault Diagn...

引用

International Conference on control, Decision and Information Technologies (CoDIT)

作者： Zhenhui Tang Ru Liu Kang Lou Chaojian Gao Jingcheng Wang SJTU Sanya Yazhou Bay Institute of Deepsea Science and Technology Sanya China Department of Automation Shanghai Jiao Tong University Shanghai China Shanghai Marine Equipment Research Institute Shanghai China Department of Automation the Key Laboratory of System Control and Information Processing Ministry of Education of China and the Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China Autonomous Systems and Intelligent Control International Joint Research Center Xi'an Technological University Xi'an China

ISBN: (数字)9798350373974

ISBN: (纸本)9798350373981

Recognizing fault types of machinery system is a fundamental but challenging task in industrial application. Although data-driven fault diagnosis method attains remarkable progress by learning fault features automatically, the existing data-driven fault diagnosis pipelines learn non-discriminative feature. To deal with these problems, a new data-driven fault diagnosis method with recurrent attentional module is proposed to find a sequence of informative features by localizing distinguishing time fragments about each individual faults iteratively. The contextual sequence dependency between the localized time fragments is enhanced. Then, the fault types are further predicted on localized time fragments. The proposed framework also explicitly models long-term dependencies among these attentional time fragments to capture historical fault information. Experiments on hydraulic system show that the proposed framework achieves superior diagnosis performance and computation efficiency.

关键词： Fault diagnosis Location awareness Accuracy Computational modeling Pipelines Reinforcement learning Hydraulic systems Computational efficiency Information technology

来源：评论

学校读者我要写书评

暂无评论

Novel way achieving 3D reconstruction of actual human face using multi images

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2008年第4期36卷 661-666页

作者： Hou, Wen-Guang Chan, Tai-Wai Ding, Ming-Yue Image Processing and Intelligent Control Key Laboratory Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China Industrial Centre Hong Kong Polytechnic University Hong Kong Hong Kong

A novel way achieving geometrical reconstruction of actual human face through projecting two types of texture on face in short time is advanced. The first type texture is stripe which is used to establish parallax grid between images. Taking into account of its results, the second type projecting texture is used to match by virtue of its abundant traits. After realizing geometrical reconstruction, the paper provides a general way about achieving actual texture reconstruction by the outer spherical surface surrounding object. In order to uniform color, it deals with parts of images in conjunct region and makes the color change meeting a certain function on condition of keeping their original information mostly. Results show this way can improve reconstruction quality and decrease complicacy of algorithm.

关键词： image reconstruction

来源：评论

学校读者我要写书评

暂无评论

High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes

arXiv

引用

arXiv 2024年

作者： Ding, Yi He, Xuan Nguyen, Tuan Thanh Song, Wentu Yakhini, Zohar Yaakobi, Eitan Pan, Linqiang Tang, Xiaohu Cai, Kui Information Coding and Transmission Key Lab of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China Cluster Singapore University of Technology and Design 487372 Singapore Faculty of Computer Science Technion - Israel Institute of Technology Haifa3200003 Israel School of Computer Science RUNI Herzliya4615200 Israel Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional data storage media. Despite the recent advancements in DNA data storage technology, significant challenges remain. In particular, various types of errors can occur during the processes of DNA synthesis, storage, and sequencing, including substitution errors, insertion errors, and deletion errors. Furthermore, the entire oligo may be lost. In this work, we report a DNA-based data storage architecture that incorporates efficient channel coding schemes, including different types of error-correcting codes (ECCs) and constrained codes, for both the inner coding and outer coding for the DNA data storage channel. We also carried out large scale experiments to validate our proposed DNA-based data storage architecture. Specifically, 1.61 and 1.69 MB data were encoded into 30,000 oligos each, with information densities of 1.731 and 1.815, respectively. It has been found that the stored information can be fully recovered without any error at average coverages of 4.5 and 6.0, respectively. This experiment achieved the highest net information density and lowest coverage among existing DNA-based data storage experiments (with standard DNA), with data recovery rates and coverage approaching theoretical optima. Copyright © 2024, The Authors. All rights reserved.

关键词： Channel coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：