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

Binary Channel Fuzzy Self-Adjusted Neural Network for Solving Time-Changing QP Problems

IEEE Transactions on Neural Networks and Learning systems 2025年 PP卷 PP页

作者： Luo, Yamei Ren, Qingyi Zheng, Zihao Chen, Siyuan Ma, Xin Liu, Yu Li, Xiaoli Yu, Junzhi Zhang, Zhijun The Chinese University of Hong Kong Department of Mechanical and Automation Engineering Shatin Hong Kong South China University of Technology School of Automation Science and Engineering Guangzhou510640 China Southern University of Science and Technology Institute for Robotics Shenzhen518055 China Peking University College of Engineering Beijing100871 China South China University of Technology Key Library of Autonomous Systems and Network Control Ministry of Education School of Automation Science and Engineering Guangzhou510640 China Institute for Super Robotics Huangpu Guangzhou510555 China Nanchang University Jiangxi Thousand Talents Plan Nanchang330031 China Jishou University College of Computer Science and Engineering Jishou416000 China Guangdong Artificial Intelligence and Digital Economy Laboratory Pazhou Laboratory Guangzhou510335 China Shaanxi University of Technology Shaanxi Provincial Key Laboratory of Industrial Automation School of Mechanical Engineering Hanzhong 723001 China Changsha Normal University School of Information Science and Engineering Changsha410100 China Guangdong University of Petrochemical Technology School of Automation Science and Engineering Institute of Artificial Intelligence and Automation Maoming525000 China

A novel binary channel fuzzy self-adjusted neural network (BCF-SANN) is proposed and researched for solving time-changing quadratic programming (QP) problems in this article. Unlike the fixed parameters of the typical zeroing neural network, the main parameters of the proposed BCF-SANN are time-changing, and its errors are adaptively quickly convergent. The biggest advantage of the novel neural network is that it combines a fuzzy self-adjusted controller, which takes the errors and derivatives of errors as fuzzy inputs and neural networks, further improving the convergence and robustness of the neural networks. To design the novel neural network, a time-changing QP problem is first established;then, using Lagrange’s law, the time-changing QP problem is transformed into a time-changing matrix equation;and finally, based on the time-changing parameter neural dynamics method, a novel BCF-SANN is proposed. The detailed design process is given in this article, and the convergence and robustness of the proposed BCF-SANN are proved by theoretical analysis. Through comparative experiments, it is demonstrated that the proposed BCF-SANN has a faster convergence rate and stronger robustness than the traditional zeroing neural network and 1-D fuzzy recurrent neural network (RNN). © 2012 IEEE.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Anchor-based spatio-temporal attention 3D convolutional networks for dynamic 3D point cloud sequences

arXiv

引用

arXiv 2020年

作者： Wang, Guangming Chen, Muyao Liu, Hanwen Yang, Yehui Liu, Zhe Wang, Hesheng The Department of Automation Institute of Medical Robotics Key Laboratory of System Control and Information Processing Ministry of Education Key Laboratory of Marine Intelligent Equipment System of Ministry of Education Shanghai Jiao Tong University Shanghai200240 China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology China The Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China The Department of Computer Science and Technology University of Cambridge

With the rapid development of measurwement technology, LiDAR and depth cameras are widely used in the perception of the 3D environment. Recent learning based methods for robot perception most focus on the image or video, but deep learning methods for dynamic 3D point cloud sequences are underexplored. Therefore, developing efficient and accurate perception method compatible with these advanced instruments is pivotal to autonomous driving and service robots. An Anchor-based Spatio-Temporal Attention 3D Convolution operation (ASTA3DConv) is proposed in this paper to process dynamic 3D point cloud sequences. The proposed convolution operation builds a regular receptive field around each point by setting several virtual anchors around each point. The features of neighborhood points are firstly aggregated to each anchor based on the spatio-temporal attention mechanism. Then, anchor-based 3D convolution is adopted to aggregate these anchors' features to the core points. The proposed method makes better use of the structured information within the local region and learns spatio-temporal embedding features from dynamic 3D point cloud sequences. Anchor-based Spatio-Temporal Attention 3D Convolutional Neural Networks (ASTA3DCNNs) are built for classification and segmentation tasks based on the proposed ASTA3DConv and evaluated on action recognition and semantic segmentation tasks. The experiments and ablation studies on MSRAction3D and Synthia datasets demonstrate the superior performance and effectiveness of our method for dynamic 3D point cloud sequences. Our method achieves the state-of-the-art performance among the methods with dynamic 3D point cloud sequences as input on MSRAction3D and Synthia datasets. Copyright © 2020, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

CNN-based Broad Learning with Efficient Incremental Reconstruction Model for Facial Emotion Recognition ⁎

引用

IFAC-PapersOnLine 2020年第2期53卷 10236-10241页

作者： Luefeng Chen Min Li Xuzhi Lai Kaoru Hirota Witold Pedrycz School of Automation China University of Geosciences Wuhan 430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan 430074 China Tokyo Institute of Technology Yokohama 226-8502 Japan Department of Electrical and Computer Engineering University of Alberta Edmonton AB T6R 2G7 Canada

Convolutional neural network-based broad learning with efficient incremental reconstruction model (CNNBL) is proposed to recognize emotions in human-robot interaction. It aims to extract deep and abstract features from facial emotional images, and reduce the influence of the complex structure and slow network updates on facial emotion recognition in deep learning. Feature extraction is carried out by convolution and maximum pooling, and then the ridge regression algorithm is used for emotion recognition. When the network needs to expand, the network is dynamically updated by incremental learning algorithm. We verified the experimental performance through k -fold cross validation. According to the recognition results, the accuracy on JAFFE database of our proposal is greater than that of the state of the art, such as the Local Binary Patterns with Softmax and Deep Attentive Multi-path convolutional neural network.

关键词： Convolution Neural Networks Broad Learning Emotion Recognition Human-Robot Interaction

来源：评论

学校读者我要写书评

暂无评论

Cascade Terminal Sliding Mode control of a Deployable Cable Driven Robot

Cascade Terminal Sliding Mode Control of a Deployable Cable ...

引用

International Conference on control, Instrumentation, and Automation

作者： S. A. Khalilpour R. Khorrambakht M. J. Harandi H. D. Taghirad Philippe Cardou Advanced Robotics and Automated Systems Faculty of Electrical and Computer Engineering K.N. Toosi University of Technology Tehran Iran Department of Mechanical Engineering Robotics Laboratory Laval University Quebec City QC Canada

ISBN: (数字)9781728158150

ISBN: (纸本)9781728158167

Most control systems used for cable-driven parallel manipulators employ a simple inner control loop for controlling the driving force of the actuators. By this means the effects of some nonlinear uncertainties of the actuator and power transmission systems are significantly reduced, and in turn, this helps the outer user-specified position control loop to perform more accurately. However, this positive impact on performance relies on non achievable assumptions that the inner control loop is fast and accurate enough, and its dynamics can be totally ignored. The main contribution of this paper is to analyze the stability of the system as a whole, considering both inner and outer loop controllers. The outer loop controller proposed in here is a finite time robust sliding mode whose stability is analyzed through the Lyapunov direct method. A deployable cable-driven parallel robot, as the case study, is also considered in this paper, which is characterized by several intrinsic kinematic and dynamic uncertainties. Finally, the performance and effectiveness of the proposed robust controller is evaluated through some simulations and experiments in order to verify the effectiveness and the characteristics of the cascade controller structure in practice.

关键词： Robots Mathematical model Actuators Jacobian matrices Force Uncertainty Kinematics

来源：评论

学校读者我要写书评

暂无评论

Optimize Student Learning via Random Forest-Based Adaptive Narrative Game

Optimize Student Learning via Random Forest-Based Adaptive N...

引用

IEEE International Conference on Automation Science and engineering (CASE)

作者： Ryan Hare Ying Tang Wei Cui Joleen Liang Department of Electrical and Computer Engineering Rowan University Glassboro USA State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Institute of Smart Education Qingdao Academy of Intelligent Industries Qingdao China Squirrel AI Learning Shanghai China

ISBN: (数字)9781728169040

ISBN: (纸本)9781728169057

This paper presents an adaptive narrative game system that focuses on sequential logic design. The system adapts a random forest machine learning model to estimate a student's current level of domain knowledge relative to the problem presented to him through his game-playing behavior data, such as time taken to find solutions, errors in solutions, and emotional indicators. Hints, prompts, and/or individualized lessons are then offered to the player to guide their learning in a positive and productive direction. Our preliminary pilot study demonstrates that the model can make accurate classifications, from which proper assistance can then be provided to individual students as they play.

关键词： Games Databases Forestry Education Problem-solving Presses Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Online multi-object tracking and segmentation with GMPHD filter and mask-based affinity fusion

arXiv

引用

arXiv 2020年

作者： Song, Young-Min Yoon, Young-Chul Yoon, Kwangjin Jeon, Moongu Lee, Seong-Whan Pedrycz, Witold The School of Electrical Engineering and Computer Science Gwangju Institute of Technology Gwangju61005 Korea Republic of The Robotics Laboratory Hyundai Motor Company Gyeonggi-do 16082 Korea Republic of SI Analytics Co. Ltd. Daejeon34051 Korea Republic of The Department of Artificial Intelligence Korea University Seoul02841 Korea Republic of The Department of Brain and Cognitive Engineering Korea University Seoul02841 Korea Republic of The Department of Electrical and Computer Engineering University of Alberta EdmontonABT6R 2H5 Canada The Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia The Systems Research Institute Polish Academy of Sciences Warsaw01-447 Poland

In this paper, we propose a highly practical fully online multi-object tracking and segmentation (MOTS) method that uses instance segmentation results as an input. The proposed method is based on the Gaussian mixture probability hypothesis density (GMPHD) filter, a hierarchical data association (HDA), and a mask-based affinity fusion (MAF) model to achieve high-performance online tracking. The HDA consists of two associations: segment-to-track and track-to-track associations. One affinity, for position and motion, is computed by using the GMPHD filter, and the other affinity, for appearance is computed by using the responses from a single object tracker such as a kernalized correlation filter. These two affinities are simply fused by using a score-level fusion method such as min-max normalization referred to as MAF. In addition, to reduce the number of false positive segments, we adopt mask IoU-based merging (mask merging). The proposed MOTS framework with the key modules: HDA, MAF, and mask merging, is easily extensible to simultaneously track multiple types of objects with CPU-only execution in parallel processing. In addition, the developed framework only requires simple parameter tuning unlike many existing MOTS methods that need intensive hyperparameter optimization. In the experiments on the two popular MOTS datasets, the key modules show some improvements. For instance, ID-switch decreases by more than half compared to a baseline method in the training sets. In conclusion, our tracker achieves state-of-the-art MOTS performance in the test sets. Copyright © 2020, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robot Navigation Under MITL Constraints Using Time-Dependent Vector Field Based control

Robot Navigation Under MITL Constraints Using Time-Dependent...

引用

IEEE Annual Conference on Decision and control

作者： Christos N. Mavridis Constantinos Vrohidis John S. Baras Kostas J. Kyriakopoulos Department of Electrical and Computer Engineering and the Institute for Systems Research University of Maryland College Park MD USA Control Systems Laboratory National Technical University of Athens Greece

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

In this work, we consider the problem of robot navigation, under spatial and temporal constraints, modeled as Metric Interval Temporal Logic (MITL) formulas. We introduce appropriate control schemes, driven by time-dependent vector fields, that satisfy both the problems of (a) entering an arbitrary neighborhood of the workspace within a given time interval, and, (b) avoiding collision with any given obstacle. We model the problems (a) and (b) as MITL formulas, defined upon a specific class of atomic propositions, and proceed in building more complex MITL expressions that can be decomposed into a conjunction of the former formulas. Finally, we propose a way to generate a hybrid automaton, whose execution satisfies the given MITL formula, by appropriately composing the control schemes. We validate our methodology via a numerical simulation.

关键词： Navigation Automata Collision avoidance Robot kinematics Trajectory Task analysis

来源：评论

学校读者我要写书评

暂无评论

GardnerNet: An Interpretable Deep Learning Model for Quantitative Human Blastocyst Evaluation - A Retrospective Model Development and Validation Study

SSRN

引用

SSRN 2024年

作者： Liu, Hang Chen, Longbin Shan, Guanqiao Sun, Chen Liao, Hongqing Lu, Changfu Zhang, Shuoping Dong, Shaonan Xu, Xinxin Yan, Qiuyun Gong, Fei Zhang, Zhuoran Dai, Changsheng Chen, Wenyuan Song, Haocong Chen, Lei Sun, Haixiang Wang, Shanshan Lin, Ge Sun, Yu Gu, Yifan Department of Mechanical and Industrial Engineering University of Toronto 5 King’s College Road TorontoONM5S 3G8 Canada Institute of Reproductive and Stem Cell Engineering School of Basic Medical Science Central South University 172 Tongzipo Road Hunan Province Changsha China Hengyang Nanhua-Xinghui Reproductive Health Hospital 30 Jiefang Road Hunan Province Hengyang China The second Affiliated Hospital Hengyang Medical School University of South China 30 Jiefang Road Hunan Province Hengyang City China Reproductive & Genetic Hospital of CITIC-Xiangya 567 Tongzipo Road Hunan Province Changsha China NHC Key Laboratory of Human Stem Cell and Reproductive Engineering School of Basic Medical Science Central South University 172 Tongzipo Road Hunan Province Changsha China Clinical Research Center for Reproduction and Genetics in Hunan Province Reproductive & Genetic Hospital of CITIC-Xiangya 567 Tongzipo Road Hunan Province Changsha China School of Science and Engineering The Chinese University of Hong Kong-Shenzhen 2001 Longxiang Boulevard Longgang District Shenzhen China Institute of Robotics and Intelligent Systems Dalian University of Technolgy 2 Linggong Road Liaoning Province Dalian China Department of Computer Science University of Toronto 40 St George Street TorontoONM5S 2E4 Canada Center for Reproductive Medicine and Obstetrics and Gynecology Nanjing Drum Tower Hospital Nanjing University Medical School 321 Zhongshan Road Jiangsu Province Nanjing China National Engineering and Research Center of Human Stem Cell 8 Luyun Road Jiangsu Province Changsha China Department of Electrical and Computer Engineering 10 King’s College Road TorontoONM5S 3G8 Canada Institute of Biomedical Engineering University of Toronto 164 College Street TorontoONM5S 3G9 Canada

Background: Selecting the blastocyst with the highest potential for live birth from a cohort is crucial for the success of in vitro fertilization (IVF). While the Gardner and Schoolcraft morphological grading system, commonly known as the Gardner grading system, is widely used by embryologists worldwide, blastocysts having similar or the same inner cell mass (ICM) and trophectoderm (TE) grades cause challenges for embryologists in decision-making. Furthermore, human assessment is subjective and inconsistent in predicting which blastocysts have higher potential to result in live birth. This study aims to develop an interpretable, quantitative method aligned with the Gardner grading system, providing continuous scores that correlate with live birth outcomes, thereby assisting embryologists in improving blastocyst selection. Methods: In this retrospective study, we developed GardnerNet, an interpretable deep learning model that outputs expansion degree grade and continuous scores quantifying a blastocyst's ICM morphology and TE morphology, based on the Gardner grading system. The continuous ICM and TE scores were calculated by weighting each base grade's predicted probability and summing the predicted probabilities. To represent each blastocyst's overall potential for live birth, we combined the ICM and TE scores using their odds ratios (ORs) for live birth. We further assessed the correlation between the ICM score, TE score, and the OR-combined score (adjusted for expansion degree) with live birth rates by applying GardnerNet to blastocysts with known live birth outcomes. To test its generalizability, we also applied GardnerNet to an external IVF institution, accounting for variations in imaging conditions, live birth rates, and embryologists' experience levels. Findings: GardnerNet was developed using data from 2760 blastocysts with majority-voted grades for expansion degree, ICM, and TE. The model achieved mean area under the receiver operating characteristic curve

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Delays in Model Reduction of Chemical Reaction Networks

引用

IFAC-PapersOnLine 2018年第14期51卷 100-105页

作者： Lipták, György Hangos, Katalin M. Process Control Research Group Systems and Control Laboratory Computer and Automation Research Institute Hungarian Academy of Sciences P.O. Box 63 BudapestH-1518 Hungary Department of Electrical Engineering and Information Systems University of Pannonia Veszprém Hungary

A novel engineering model reduction method is proposed in this paper that can be applied to a chemical reaction network (CRN) with chains of linear reactions. The reduced model is a delayed CRN with possibly different delays but with less state variables than the original model. As the first step of the model reduction, a decomposition method is also developed to transform chains with joint reactions into independent chains of linear reactions. The well known example of McKeithan's network is used as a case study to illustrate the basic concepts and the design method. © 2018

关键词： Reduction

来源：评论

学校读者我要写书评

暂无评论

Distributed delay model of the McKeithan’s network

引用

IFAC-PapersOnLine 2019年第7期52卷 33-38页

作者： György Lipták Katalin M. Hangos Process Control Research Group Systems and Control Laboratory Computer and Automation Research Institute Hungarian Academy of Sciences P.O. Box 63 H-1518 Budapest Hungary Department of Electrical Engineering and Information Systems University of Pannonia Veszprém Hungary

In this paper CRNs containing linear reaction chains with multiple joint complexes were considered in order to obtain an equivalent reduced order delayed CRN model with distributed time delays. For this purpose, our earlier method (Lipták and Hangos (2018)) for decomposing the chains of linear reactions with multiple joint complexes was used together with the "linear chain trick". An analytical expression for the kernel function of the distributed delay was also derived from the reaction rate coefficients of the linear reaction chains. Our approach was demonstrated using the example of the well known McKeithan’s network model of kinetic proofreading.

关键词： Process control Delay Chemical Reaction Networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：