首页 > 最新文献

IEEE transactions on neural networks最新文献

英文 中文
Neuro-fuzzy quantification of personal perceptions of facial images based on a limited data set. 基于有限数据集的个人面部图像感知的神经模糊量化。
Pub Date : 2011-12-01 Epub Date: 2011-11-23 DOI: 10.1109/TNN.2011.2176349
Luis Diago, Tetsuko Kitaoka, Ichiro Hagiwara, Toshiki Kambayashi

Artificial neural networks are nonlinear techniques which typically provide one of the most accurate predictive models perceiving faces in terms of the social impressions they make on people. However, they are often not suitable to be used in many practical application domains because of their lack of transparency and comprehensibility. This paper proposes a new neuro-fuzzy method to investigate the characteristics of the facial images perceived as Iyashi by one hundred and fourteen subjects. Iyashi is a Japanese word used to describe a peculiar phenomenon that is mentally soothing, but is yet to be clearly defined. In order to gain a clear insight into the reasoning made by the nonlinear prediction models such as holographic neural networks (HNN) in the classification of Iyashi expressions, the interpretability of the proposed fuzzy-quantized HNN (FQHNN) is improved by reducing the number of input parameters, creating membership functions and extracting fuzzy rules from the responses provided by the subjects about a limited dataset of 20 facial images. The experimental results show that the proposed FQHNN achieves 2-8% increase in the prediction accuracy compared with traditional neuro-fuzzy classifiers while it extracts 35 fuzzy rules explaining what characteristics a facial image should have in order to be classified as Iyashi-stimulus for 87 subjects.

人工神经网络是非线性技术,它通常提供最准确的预测模型之一,根据面孔给人的社会印象来感知面孔。然而,由于缺乏透明度和可理解性,它们往往不适合用于许多实际应用领域。本文提出了一种新的神经模糊方法来研究114个被试感知为Iyashi的面部图像的特征。Iyashi是一个日语单词,用来描述一种特殊的心理安慰现象,但目前还没有明确的定义。为了更好地理解全息神经网络(HNN)等非线性预测模型在Iyashi表达式分类中的推理过程,通过减少输入参数数量、创建隶属函数和从有限的20张人脸图像数据集的受试者反馈中提取模糊规则,提高了模糊量化HNN (FQHNN)的可解释性。实验结果表明,与传统神经模糊分类器相比,FQHNN的预测精度提高了2-8%,同时提取了35条模糊规则,解释了87名受试者的面部图像应该具有哪些特征才能被分类为iyashi刺激。
{"title":"Neuro-fuzzy quantification of personal perceptions of facial images based on a limited data set.","authors":"Luis Diago,&nbsp;Tetsuko Kitaoka,&nbsp;Ichiro Hagiwara,&nbsp;Toshiki Kambayashi","doi":"10.1109/TNN.2011.2176349","DOIUrl":"https://doi.org/10.1109/TNN.2011.2176349","url":null,"abstract":"<p><p>Artificial neural networks are nonlinear techniques which typically provide one of the most accurate predictive models perceiving faces in terms of the social impressions they make on people. However, they are often not suitable to be used in many practical application domains because of their lack of transparency and comprehensibility. This paper proposes a new neuro-fuzzy method to investigate the characteristics of the facial images perceived as Iyashi by one hundred and fourteen subjects. Iyashi is a Japanese word used to describe a peculiar phenomenon that is mentally soothing, but is yet to be clearly defined. In order to gain a clear insight into the reasoning made by the nonlinear prediction models such as holographic neural networks (HNN) in the classification of Iyashi expressions, the interpretability of the proposed fuzzy-quantized HNN (FQHNN) is improved by reducing the number of input parameters, creating membership functions and extracting fuzzy rules from the responses provided by the subjects about a limited dataset of 20 facial images. The experimental results show that the proposed FQHNN achieves 2-8% increase in the prediction accuracy compared with traditional neuro-fuzzy classifiers while it extracts 35 fuzzy rules explaining what characteristics a facial image should have in order to be classified as Iyashi-stimulus for 87 subjects.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2176349","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30290089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Data-based robust multiobjective optimization of interconnected processes: energy efficiency case study in papermaking. 基于数据的互联过程鲁棒多目标优化:造纸能效案例研究。
Pub Date : 2011-12-01 Epub Date: 2011-11-29 DOI: 10.1109/TNN.2011.2174444
Puya Afshar, Martin Brown, Jan Maciejowski, Hong Wang

Reducing energy consumption is a major challenge for "energy-intensive" industries such as papermaking. A commercially viable energy saving solution is to employ data-based optimization techniques to obtain a set of "optimized" operational settings that satisfy certain performance indices. The difficulties of this are: 1) the problems of this type are inherently multicriteria in the sense that improving one performance index might result in compromising the other important measures; 2) practical systems often exhibit unknown complex dynamics and several interconnections which make the modeling task difficult; and 3) as the models are acquired from the existing historical data, they are valid only locally and extrapolations incorporate risk of increasing process variability. To overcome these difficulties, this paper presents a new decision support system for robust multiobjective optimization of interconnected processes. The plant is first divided into serially connected units to model the process, product quality, energy consumption, and corresponding uncertainty measures. Then multiobjective gradient descent algorithm is used to solve the problem in line with user's preference information. Finally, the optimization results are visualized for analysis and decision making. In practice, if further iterations of the optimization algorithm are considered, validity of the local models must be checked prior to proceeding to further iterations. The method is implemented by a MATLAB-based interactive tool DataExplorer supporting a range of data analysis, modeling, and multiobjective optimization techniques. The proposed approach was tested in two U.K.-based commercial paper mills where the aim was reducing steam consumption and increasing productivity while maintaining the product quality by optimization of vacuum pressures in forming and press sections. The experimental results demonstrate the effectiveness of the method.

减少能源消耗是造纸等“能源密集型”行业面临的主要挑战。商业上可行的节能解决方案是采用基于数据的优化技术来获得一组满足某些性能指标的“优化”操作设置。这样做的困难在于:1)这类问题本质上是多标准的,即改进一项绩效指标可能会损害其他重要措施;2)实际系统往往表现出未知的复杂动力学和多个相互联系,这使得建模任务变得困难;3)由于模型是从现有的历史数据中获得的,它们仅在局部有效,并且外推包含了增加过程可变性的风险。为了克服这些困难,本文提出了一种新的决策支持系统,用于互联过程的鲁棒多目标优化。首先将工厂划分为串联单元,对过程、产品质量、能耗和相应的不确定性措施进行建模。然后根据用户偏好信息,采用多目标梯度下降算法对问题进行求解。最后,将优化结果可视化,便于分析和决策。在实践中,如果考虑优化算法的进一步迭代,则必须在进行进一步迭代之前检查局部模型的有效性。该方法由基于matlab的交互式工具DataExplorer实现,该工具支持一系列数据分析、建模和多目标优化技术。所提出的方法在两家英国商业造纸厂进行了测试,目的是通过优化成型和压制部分的真空压力来减少蒸汽消耗和提高生产率,同时保持产品质量。实验结果证明了该方法的有效性。
{"title":"Data-based robust multiobjective optimization of interconnected processes: energy efficiency case study in papermaking.","authors":"Puya Afshar,&nbsp;Martin Brown,&nbsp;Jan Maciejowski,&nbsp;Hong Wang","doi":"10.1109/TNN.2011.2174444","DOIUrl":"https://doi.org/10.1109/TNN.2011.2174444","url":null,"abstract":"<p><p>Reducing energy consumption is a major challenge for \"energy-intensive\" industries such as papermaking. A commercially viable energy saving solution is to employ data-based optimization techniques to obtain a set of \"optimized\" operational settings that satisfy certain performance indices. The difficulties of this are: 1) the problems of this type are inherently multicriteria in the sense that improving one performance index might result in compromising the other important measures; 2) practical systems often exhibit unknown complex dynamics and several interconnections which make the modeling task difficult; and 3) as the models are acquired from the existing historical data, they are valid only locally and extrapolations incorporate risk of increasing process variability. To overcome these difficulties, this paper presents a new decision support system for robust multiobjective optimization of interconnected processes. The plant is first divided into serially connected units to model the process, product quality, energy consumption, and corresponding uncertainty measures. Then multiobjective gradient descent algorithm is used to solve the problem in line with user's preference information. Finally, the optimization results are visualized for analysis and decision making. In practice, if further iterations of the optimization algorithm are considered, validity of the local models must be checked prior to proceeding to further iterations. The method is implemented by a MATLAB-based interactive tool DataExplorer supporting a range of data analysis, modeling, and multiobjective optimization techniques. The proposed approach was tested in two U.K.-based commercial paper mills where the aim was reducing steam consumption and increasing productivity while maintaining the product quality by optimization of vacuum pressures in forming and press sections. The experimental results demonstrate the effectiveness of the method.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2174444","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30307607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Data-core-based fuzzy min-max neural network for pattern classification. 基于数据核的模糊最小-最大神经网络模式分类。
Pub Date : 2011-12-01 Epub Date: 2011-11-28 DOI: 10.1109/TNN.2011.2175748
Huaguang Zhang, Jinhai Liu, Dazhong Ma, Zhanshan Wang

A fuzzy min-max neural network based on data core (DCFMN) is proposed for pattern classification. A new membership function for classifying the neuron of DCFMN is defined in which the noise, the geometric center of the hyperbox, and the data core are considered. Instead of using the contraction process of the FMNN described by Simpson, a kind of overlapped neuron with new membership function based on the data core is proposed and added to neural network to represent the overlapping area of hyperboxes belonging to different classes. Furthermore, some algorithms of online learning and classification are presented according to the structure of DCFMN. DCFMN has strong robustness and high accuracy in classification taking onto account the effect of data core and noise. The performance of DCFMN is checked by some benchmark datasets and compared with some traditional fuzzy neural networks, such as the fuzzy min-max neural network (FMNN), the general FMNN, and the FMNN with compensatory neuron. Finally the pattern classification of a pipeline is evaluated using DCFMN and other classifiers. All the results indicate that the performance of DCFMN is excellent.

提出了一种基于数据核的模糊最小-最大神经网络(DCFMN)用于模式分类。定义了一种考虑噪声、超框几何中心和数据核的DCFMN神经元分类隶属度函数。代替Simpson描述的FMNN的收缩过程,提出了一种基于数据核的具有新隶属函数的重叠神经元,并将其添加到神经网络中来表示属于不同类别的超盒的重叠区域。在此基础上,根据DCFMN的结构提出了在线学习和分类算法。考虑到数据核和噪声的影响,DCFMN具有较强的鲁棒性和较高的分类准确率。通过一些基准数据集检验了DCFMN的性能,并与传统的模糊神经网络,如模糊最小-最大神经网络(FMNN)、一般模糊神经网络和带有补偿神经元的模糊神经网络进行了比较。最后利用DCFMN和其他分类器对管道的模式分类进行了评估。结果表明,DCFMN具有良好的性能。
{"title":"Data-core-based fuzzy min-max neural network for pattern classification.","authors":"Huaguang Zhang,&nbsp;Jinhai Liu,&nbsp;Dazhong Ma,&nbsp;Zhanshan Wang","doi":"10.1109/TNN.2011.2175748","DOIUrl":"https://doi.org/10.1109/TNN.2011.2175748","url":null,"abstract":"<p><p>A fuzzy min-max neural network based on data core (DCFMN) is proposed for pattern classification. A new membership function for classifying the neuron of DCFMN is defined in which the noise, the geometric center of the hyperbox, and the data core are considered. Instead of using the contraction process of the FMNN described by Simpson, a kind of overlapped neuron with new membership function based on the data core is proposed and added to neural network to represent the overlapping area of hyperboxes belonging to different classes. Furthermore, some algorithms of online learning and classification are presented according to the structure of DCFMN. DCFMN has strong robustness and high accuracy in classification taking onto account the effect of data core and noise. The performance of DCFMN is checked by some benchmark datasets and compared with some traditional fuzzy neural networks, such as the fuzzy min-max neural network (FMNN), the general FMNN, and the FMNN with compensatory neuron. Finally the pattern classification of a pipeline is evaluated using DCFMN and other classifiers. All the results indicate that the performance of DCFMN is excellent.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2175748","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30307608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 134
Neural network-based multiple robot simultaneous localization and mapping. 基于神经网络的多机器人同步定位与映射。
Pub Date : 2011-12-01 Epub Date: 2011-12-05 DOI: 10.1109/TNN.2011.2176541
Sajad Saeedi, Liam Paull, Michael Trentini, Howard Li

In this paper, a decentralized platform for simultaneous localization and mapping (SLAM) with multiple robots is developed. Each robot performs single robot view-based SLAM using an extended Kalman filter to fuse data from two encoders and a laser ranger. To extend this approach to multiple robot SLAM, a novel occupancy grid map fusion algorithm is proposed. Map fusion is achieved through a multistep process that includes image preprocessing, map learning (clustering) using neural networks, relative orientation extraction using norm histogram cross correlation and a Radon transform, relative translation extraction using matching norm vectors, and then verification of the results. The proposed map learning method is a process based on the self-organizing map. In the learning phase, the obstacles of the map are learned by clustering the occupied cells of the map into clusters. The learning is an unsupervised process which can be done on the fly without any need to have output training patterns. The clusters represent the spatial form of the map and make further analyses of the map easier and faster. Also, clusters can be interpreted as features extracted from the occupancy grid map so the map fusion problem becomes a task of matching features. Results of the experiments from tests performed on a real environment with multiple robots prove the effectiveness of the proposed solution.

本文开发了一个多机器人同时定位与地图绘制的分布式平台。每个机器人使用扩展卡尔曼滤波器来融合来自两个编码器和一个激光测距仪的数据,执行基于单个机器人视图的SLAM。为了将该方法扩展到多机器人SLAM中,提出了一种新的占用网格地图融合算法。地图融合是通过一个多步骤的过程来实现的,包括图像预处理,使用神经网络的地图学习(聚类),使用范数直方图相互关联和Radon变换的相对方向提取,使用匹配范数向量的相对平移提取,然后验证结果。提出的地图学习方法是一个基于自组织地图的过程。在学习阶段,通过将地图上已占用的单元聚类成簇来学习地图上的障碍物。学习是一个无监督的过程,可以在不需要输出训练模式的情况下动态完成。集群代表了地图的空间形式,并使地图的进一步分析更容易和更快。此外,聚类可以理解为从占用网格地图中提取的特征,从而使地图融合问题成为一个匹配特征的任务。在多个机器人的真实环境中进行的实验结果证明了所提出的解决方案的有效性。
{"title":"Neural network-based multiple robot simultaneous localization and mapping.","authors":"Sajad Saeedi,&nbsp;Liam Paull,&nbsp;Michael Trentini,&nbsp;Howard Li","doi":"10.1109/TNN.2011.2176541","DOIUrl":"https://doi.org/10.1109/TNN.2011.2176541","url":null,"abstract":"<p><p>In this paper, a decentralized platform for simultaneous localization and mapping (SLAM) with multiple robots is developed. Each robot performs single robot view-based SLAM using an extended Kalman filter to fuse data from two encoders and a laser ranger. To extend this approach to multiple robot SLAM, a novel occupancy grid map fusion algorithm is proposed. Map fusion is achieved through a multistep process that includes image preprocessing, map learning (clustering) using neural networks, relative orientation extraction using norm histogram cross correlation and a Radon transform, relative translation extraction using matching norm vectors, and then verification of the results. The proposed map learning method is a process based on the self-organizing map. In the learning phase, the obstacles of the map are learned by clustering the occupied cells of the map into clusters. The learning is an unsupervised process which can be done on the fly without any need to have output training patterns. The clusters represent the spatial form of the map and make further analyses of the map easier and faster. Also, clusters can be interpreted as features extracted from the occupancy grid map so the map fusion problem becomes a task of matching features. Results of the experiments from tests performed on a real environment with multiple robots prove the effectiveness of the proposed solution.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2176541","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30315366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal tracking control for a class of nonlinear discrete-time systems with time delays based on heuristic dynamic programming. 一类非线性离散时滞系统的启发式动态规划最优跟踪控制。
Pub Date : 2011-12-01 Epub Date: 2011-11-01 DOI: 10.1109/TNN.2011.2172628
Huaguang Zhang, Ruizhuo Song, Qinglai Wei, Tieyan Zhang

In this paper, a novel heuristic dynamic programming (HDP) iteration algorithm is proposed to solve the optimal tracking control problem for a class of nonlinear discrete-time systems with time delays. The novel algorithm contains state updating, control policy iteration, and performance index iteration. To get the optimal states, the states are also updated. Furthermore, the "backward iteration" is applied to state updating. Two neural networks are used to approximate the performance index function and compute the optimal control policy for facilitating the implementation of HDP iteration algorithm. At last, we present two examples to demonstrate the effectiveness of the proposed HDP iteration algorithm.

针对一类非线性离散时滞系统的最优跟踪控制问题,提出了一种新的启发式动态规划(HDP)迭代算法。该算法包含状态更新、控制策略迭代和性能指标迭代。为了获得最佳状态,状态也会被更新。此外,将“向后迭代”应用于状态更新。利用两个神经网络逼近性能指标函数,计算最优控制策略,便于HDP迭代算法的实现。最后,通过两个算例验证了所提出的HDP迭代算法的有效性。
{"title":"Optimal tracking control for a class of nonlinear discrete-time systems with time delays based on heuristic dynamic programming.","authors":"Huaguang Zhang,&nbsp;Ruizhuo Song,&nbsp;Qinglai Wei,&nbsp;Tieyan Zhang","doi":"10.1109/TNN.2011.2172628","DOIUrl":"https://doi.org/10.1109/TNN.2011.2172628","url":null,"abstract":"<p><p>In this paper, a novel heuristic dynamic programming (HDP) iteration algorithm is proposed to solve the optimal tracking control problem for a class of nonlinear discrete-time systems with time delays. The novel algorithm contains state updating, control policy iteration, and performance index iteration. To get the optimal states, the states are also updated. Furthermore, the \"backward iteration\" is applied to state updating. Two neural networks are used to approximate the performance index function and compute the optimal control policy for facilitating the implementation of HDP iteration algorithm. At last, we present two examples to demonstrate the effectiveness of the proposed HDP iteration algorithm.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2172628","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40131705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 172
Delay-slope-dependent stability results of recurrent neural networks. 递归神经网络的时滞斜率相关稳定性结果。
Pub Date : 2011-12-01 Epub Date: 2011-10-06 DOI: 10.1109/TNN.2011.2169425
Tao Li, Wei Xing Zheng, Chong Lin

By using the fact that the neuron activation functions are sector bounded and nondecreasing, this brief presents a new method, named the delay-slope-dependent method, for stability analysis of a class of recurrent neural networks with time-varying delays. This method includes more information on the slope of neuron activation functions and fewer matrix variables in the constructed Lyapunov-Krasovskii functional. Then some improved delay-dependent stability criteria with less computational burden and conservatism are obtained. Numerical examples are given to illustrate the effectiveness and the benefits of the proposed method.

摘要利用神经元激活函数扇区有界和非递减的特性,提出了一类时变时滞递归神经网络稳定性分析的一种新方法——时滞-斜率相关法。该方法在构造的Lyapunov-Krasovskii泛函中包含了更多关于神经元激活函数斜率的信息和更少的矩阵变量。在此基础上,得到了计算量小、保守性好的改进时滞相关稳定性判据。数值算例说明了该方法的有效性和优越性。
{"title":"Delay-slope-dependent stability results of recurrent neural networks.","authors":"Tao Li,&nbsp;Wei Xing Zheng,&nbsp;Chong Lin","doi":"10.1109/TNN.2011.2169425","DOIUrl":"https://doi.org/10.1109/TNN.2011.2169425","url":null,"abstract":"<p><p>By using the fact that the neuron activation functions are sector bounded and nondecreasing, this brief presents a new method, named the delay-slope-dependent method, for stability analysis of a class of recurrent neural networks with time-varying delays. This method includes more information on the slope of neuron activation functions and fewer matrix variables in the constructed Lyapunov-Krasovskii functional. Then some improved delay-dependent stability criteria with less computational burden and conservatism are obtained. Numerical examples are given to illustrate the effectiveness and the benefits of the proposed method.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2169425","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30196887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 124
Design of a data-driven predictive controller for start-up process of AMT vehicles. AMT车辆启动过程数据驱动预测控制器设计。
Pub Date : 2011-12-01 Epub Date: 2011-09-26 DOI: 10.1109/TNN.2011.2167630
Xiaohui Lu, Hong Chen, Ping Wang, Bingzhao Gao

In this paper, a data-driven predictive controller is designed for the start-up process of vehicles with automated manual transmissions (AMTs). It is obtained directly from the input-output data of a driveline simulation model constructed by the commercial software AMESim. In order to obtain offset-free control for the reference input, the predictor equation is gained with incremental inputs and outputs. Because of the physical characteristics, the input and output constraints are considered explicitly in the problem formulation. The contradictory requirements of less friction losses and less driveline shock are included in the objective function. The designed controller is tested under nominal conditions and changed conditions. The simulation results show that, during the start-up process, the AMT clutch with the proposed controller works very well, and the process meets the control objectives: fast clutch lockup time, small friction losses, and the preservation of driver comfort, i.e., smooth acceleration of the vehicle. At the same time, the closed-loop system has the ability to reject uncertainties, such as the vehicle mass and road grade.

针对自动手动变速器车辆的启动过程,设计了一种数据驱动的预测控制器。它直接从商业软件AMESim构建的传动系统仿真模型的输入输出数据中获得。为了获得参考输入的无偏移控制,采用增量输入和增量输出获得预测方程。由于物理特性,在问题表述中明确考虑了输入和输出约束。目标函数中包含了摩擦损失小和传动系冲击小的矛盾要求。所设计的控制器在标称条件和变化条件下进行了测试。仿真结果表明,采用该控制器的AMT离合器在启动过程中工作良好,满足离合器锁紧时间快、摩擦损失小、保持驾驶员舒适性(即车辆加速平稳)的控制目标。同时,闭环系统具有抑制不确定性的能力,如车辆质量和道路坡度。
{"title":"Design of a data-driven predictive controller for start-up process of AMT vehicles.","authors":"Xiaohui Lu,&nbsp;Hong Chen,&nbsp;Ping Wang,&nbsp;Bingzhao Gao","doi":"10.1109/TNN.2011.2167630","DOIUrl":"https://doi.org/10.1109/TNN.2011.2167630","url":null,"abstract":"<p><p>In this paper, a data-driven predictive controller is designed for the start-up process of vehicles with automated manual transmissions (AMTs). It is obtained directly from the input-output data of a driveline simulation model constructed by the commercial software AMESim. In order to obtain offset-free control for the reference input, the predictor equation is gained with incremental inputs and outputs. Because of the physical characteristics, the input and output constraints are considered explicitly in the problem formulation. The contradictory requirements of less friction losses and less driveline shock are included in the objective function. The designed controller is tested under nominal conditions and changed conditions. The simulation results show that, during the start-up process, the AMT clutch with the proposed controller works very well, and the process meets the control objectives: fast clutch lockup time, small friction losses, and the preservation of driver comfort, i.e., smooth acceleration of the vehicle. At the same time, the closed-loop system has the ability to reject uncertainties, such as the vehicle mass and road grade.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2167630","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30026909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 34
Parallel programmable asynchronous neighborhood mechanism for Kohonen SOM implemented in CMOS technology. 基于CMOS技术的Kohonen SOM并行可编程异步邻域机制实现。
Pub Date : 2011-12-01 Epub Date: 2011-10-28 DOI: 10.1109/TNN.2011.2169809
Rafał Długosz, Marta Kolasa, Witold Pedrycz, Michał Szulc

We present a new programmable neighborhood mechanism for hardware implemented Kohonen self-organizing maps (SOMs) with three different map topologies realized on a single chip. The proposed circuit comes as a fully parallel and asynchronous architecture. The mechanism is very fast. In a medium sized map with several hundreds neurons implemented in the complementary metal-oxide semiconductor 0.18 μm technology, all neurons start adapting the weights after no more than 11 ns. The adaptation is then carried out in parallel. This is an evident advantage in comparison with the commonly used software-realized SOMs. The circuit is robust against the process, supply voltage and environment temperature variations. Due to a simple structure, it features low energy consumption of a few pJ per neuron per a single learning pattern. In this paper, we discuss different aspects of hardware realization, such as a suitable selection of the map topology and the initial neighborhood range, as the optimization of these parameters is essential when looking from the circuit complexity point of view. For the optimal values of these parameters, the chip area and the power dissipation can be reduced even by 60% and 80%, respectively, without affecting the quality of learning.

我们提出了一种新的可编程邻域机制,用于硬件实现Kohonen自组织地图(SOMs),在单个芯片上实现了三种不同的地图拓扑。所提出的电路是一个完全并行和异步的架构。这个机制非常快。在采用互补金属氧化物半导体0.18 μm技术实现的具有数百个神经元的中等大小地图中,所有神经元在不超过11 ns后开始适应权重。然后并行地进行适应。与常用的软件实现的som相比,这是一个明显的优势。该电路对工艺、电源电压和环境温度变化具有鲁棒性。由于结构简单,它具有低能量消耗的特点,每个神经元每一个单一的学习模式几个pJ。在本文中,我们讨论了硬件实现的不同方面,例如合适的地图拓扑和初始邻域范围的选择,因为从电路复杂性的角度来看,这些参数的优化是必不可少的。对于这些参数的最优值,在不影响学习质量的情况下,芯片面积和功耗可以分别减少60%和80%。
{"title":"Parallel programmable asynchronous neighborhood mechanism for Kohonen SOM implemented in CMOS technology.","authors":"Rafał Długosz,&nbsp;Marta Kolasa,&nbsp;Witold Pedrycz,&nbsp;Michał Szulc","doi":"10.1109/TNN.2011.2169809","DOIUrl":"https://doi.org/10.1109/TNN.2011.2169809","url":null,"abstract":"<p><p>We present a new programmable neighborhood mechanism for hardware implemented Kohonen self-organizing maps (SOMs) with three different map topologies realized on a single chip. The proposed circuit comes as a fully parallel and asynchronous architecture. The mechanism is very fast. In a medium sized map with several hundreds neurons implemented in the complementary metal-oxide semiconductor 0.18 μm technology, all neurons start adapting the weights after no more than 11 ns. The adaptation is then carried out in parallel. This is an evident advantage in comparison with the commonly used software-realized SOMs. The circuit is robust against the process, supply voltage and environment temperature variations. Due to a simple structure, it features low energy consumption of a few pJ per neuron per a single learning pattern. In this paper, we discuss different aspects of hardware realization, such as a suitable selection of the map topology and the initial neighborhood range, as the optimization of these parameters is essential when looking from the circuit complexity point of view. For the optimal values of these parameters, the chip area and the power dissipation can be reduced even by 60% and 80%, respectively, without affecting the quality of learning.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2169809","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40123923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 39
Improved GART neural network model for pattern classification and rule extraction with application to power systems. 改进的GART神经网络模式分类和规则提取模型及其在电力系统中的应用。
Pub Date : 2011-12-01 Epub Date: 2011-11-04 DOI: 10.1109/TNN.2011.2173502
Keem Siah Yap, Chee Peng Lim, Mau Teng Au

Generalized adaptive resonance theory (GART) is a neural network model that is capable of online learning and is effective in tackling pattern classification tasks. In this paper, we propose an improved GART model (IGART), and demonstrate its applicability to power systems. IGART enhances the dynamics of GART in several aspects, which include the use of the Laplacian likelihood function, a new vigilance function, a new match-tracking mechanism, an ordering algorithm for determining the sequence of training data, and a rule extraction capability to elicit if-then rules from the network. To assess the effectiveness of IGART and to compare its performances with those from other methods, three datasets that are related to power systems are employed. The experimental results demonstrate the usefulness of IGART with the rule extraction capability in undertaking classification problems in power systems engineering.

广义自适应共振理论(GART)是一种能够在线学习的神经网络模型,能够有效地解决模式分类问题。本文提出了一种改进的GART模型(IGART),并对其在电力系统中的适用性进行了验证。IGART在几个方面增强了GART的动态性,包括使用拉普拉斯似然函数、新的警戒函数、新的匹配跟踪机制、确定训练数据序列的排序算法以及从网络中提取if-then规则的规则提取能力。为了评估IGART的有效性并将其与其他方法的性能进行比较,我们使用了三个与电力系统相关的数据集。实验结果表明,IGART具有规则提取能力,可用于解决电力系统工程中的分类问题。
{"title":"Improved GART neural network model for pattern classification and rule extraction with application to power systems.","authors":"Keem Siah Yap,&nbsp;Chee Peng Lim,&nbsp;Mau Teng Au","doi":"10.1109/TNN.2011.2173502","DOIUrl":"https://doi.org/10.1109/TNN.2011.2173502","url":null,"abstract":"<p><p>Generalized adaptive resonance theory (GART) is a neural network model that is capable of online learning and is effective in tackling pattern classification tasks. In this paper, we propose an improved GART model (IGART), and demonstrate its applicability to power systems. IGART enhances the dynamics of GART in several aspects, which include the use of the Laplacian likelihood function, a new vigilance function, a new match-tracking mechanism, an ordering algorithm for determining the sequence of training data, and a rule extraction capability to elicit if-then rules from the network. To assess the effectiveness of IGART and to compare its performances with those from other methods, three datasets that are related to power systems are employed. The experimental results demonstrate the usefulness of IGART with the rule extraction capability in undertaking classification problems in power systems engineering.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2173502","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40139885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
Extracting rules from neural networks as decision diagrams. 从神经网络中提取规则作为决策图。
Pub Date : 2011-12-01 Epub Date: 2011-02-17 DOI: 10.1109/TNN.2011.2106163
Jan Chorowski, Jacek M Zurada

Rule extraction from neural networks (NNs) solves two fundamental problems: it gives insight into the logic behind the network and in many cases, it improves the network's ability to generalize the acquired knowledge. This paper presents a novel eclectic approach to rule extraction from NNs, named LOcal Rule Extraction (LORE), suited for multilayer perceptron networks with discrete (logical or categorical) inputs. The extracted rules mimic network behavior on the training set and relax this condition on the remaining input space. First, a multilayer perceptron network is trained under standard regime. It is then transformed into an equivalent form, returning the same numerical result as the original network, yet being able to produce rules generalizing the network output for cases similar to a given input. The partial rules extracted for every training set sample are then merged to form a decision diagram (DD) from which logic rules can be extracted. A rule format explicitly separating subsets of inputs for which an answer is known from those with an undetermined answer is presented. A special data structure, the decision diagram, allowing efficient partial rule merging is introduced. With regard to rules' complexity and generalization abilities, LORE gives results comparable to those reported previously. An algorithm transforming DDs into interpretable boolean expressions is described. Experimental running times of rule extraction are proportional to the network's training time.

从神经网络(nn)中提取规则解决了两个基本问题:它提供了对网络背后逻辑的洞察,在许多情况下,它提高了网络对所获得知识的泛化能力。本文提出了一种新的从神经网络中提取规则的折衷方法,称为局部规则提取(LORE),适用于具有离散(逻辑或分类)输入的多层感知器网络。提取的规则在训练集上模拟网络行为,并在剩余的输入空间上放宽这一条件。首先,在标准状态下训练多层感知器网络。然后将其转换为等效形式,返回与原始网络相同的数值结果,同时能够为类似于给定输入的情况生成一般化网络输出的规则。然后将每个训练集样本提取的部分规则合并形成决策图(DD),从中提取逻辑规则。提出了一种规则格式,显式地将已知答案的输入子集与未确定答案的输入子集分开。介绍了一种特殊的数据结构——决策图,它允许有效的部分规则合并。在规则的复杂性和泛化能力方面,LORE给出的结果与之前报道的结果相当。描述了一种将dd转换为可解释布尔表达式的算法。规则提取的实验运行时间与网络的训练时间成正比。
{"title":"Extracting rules from neural networks as decision diagrams.","authors":"Jan Chorowski,&nbsp;Jacek M Zurada","doi":"10.1109/TNN.2011.2106163","DOIUrl":"https://doi.org/10.1109/TNN.2011.2106163","url":null,"abstract":"<p><p>Rule extraction from neural networks (NNs) solves two fundamental problems: it gives insight into the logic behind the network and in many cases, it improves the network's ability to generalize the acquired knowledge. This paper presents a novel eclectic approach to rule extraction from NNs, named LOcal Rule Extraction (LORE), suited for multilayer perceptron networks with discrete (logical or categorical) inputs. The extracted rules mimic network behavior on the training set and relax this condition on the remaining input space. First, a multilayer perceptron network is trained under standard regime. It is then transformed into an equivalent form, returning the same numerical result as the original network, yet being able to produce rules generalizing the network output for cases similar to a given input. The partial rules extracted for every training set sample are then merged to form a decision diagram (DD) from which logic rules can be extracted. A rule format explicitly separating subsets of inputs for which an answer is known from those with an undetermined answer is presented. A special data structure, the decision diagram, allowing efficient partial rule merging is introduced. With regard to rules' complexity and generalization abilities, LORE gives results comparable to those reported previously. An algorithm transforming DDs into interpretable boolean expressions is described. Experimental running times of rule extraction are proportional to the network's training time.</p>","PeriodicalId":13434,"journal":{"name":"IEEE transactions on neural networks","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TNN.2011.2106163","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"29684469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 52
期刊
IEEE transactions on neural networks
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1