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

第40届中国控制会议

作者： Kaixin Zhao Yaping Dai Ye Ji Jiayi Sun School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

Aiming at a large number of ambiguous,imprecise and incomplete data in the real world,fuzzy time series has come into being and developed into an effective forecasting *** the process of modeling and forecasting of fuzzy time series,the prediction performance of fuzzy time series can be effectively improved by partitioning the universe of discourse into different *** this paper,a forecasting approach for fuzzy time series,which introduces the granularity mechanism into interval division and employs differential data for incremental forecasting,is proposed to solve the problem of time series forecasting with high forecasting *** the proposed approach,in order to describe the fuzzy logic relationship and fuzzy trend of historical data,we first do differential processing on the historical ***,Fuzzy C-means(FCM) clustering algorithm is used to generate several partition intervals *** the sequel,we use the principle of justifiable granularity to constantly adjust the width of all the intervals,so that these information granules associated with corresponding intervals become the most"informative" information ***,the boundary of information granules is used as the basis of interval division to complete the forecasting *** illustrative example is provided to demonstrate the essence of the proposed *** comparative experiment with other representative approaches shows that the proposed approach can significantly improve the prediction accuracy of time series.

关键词： Fuzzy Time Series Information Granules Unequal-sized Intervals Forecasting

来源：评论

学校读者我要写书评

暂无评论

Dynamic Resource Scheduling Based on Improved Genetic Algorithm

Dynamic Resource Scheduling Based on Improved Genetic Algori...

引用

第40届中国控制会议

作者： Gui Yuanyuan School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

Aiming at the problem of how to realize the reasonable distribution of goods and the resource scheduling of route planning under dynamic conditions, a phased refresh method is proposed to deal with the requirements in sections. At the same time, the clustering method is introduced to generate the initial population. And the cross and mutation rate is determined by a step-by-step reduction method, which is used to solve the problem of the traditional genetic algorithm falling into the local optimum caused by the uneven distribution of searchable solutions. Finally, the effectiveness of the improved method is verified by simulation experiments.

关键词： resource scheduling phased refresh improved genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Path Tracking control of Tracked Paver Based on Improved Pure Pursuit Algorithm

Path Tracking Control of Tracked Paver Based on Improved Pur...

引用

第40届中国控制会议

作者： Shuai Wang Shanshan Fu Bin Li Shoukun Wang State Key Laboratory of Intelligent Control and Decision of Complex Systems School of AutomationBeijing Institute of Technology

This paper investigates the high-precision path tracking control of tracked paver combined with global satellite navigation *** the paver is performing paving operations,it requires high path tracking accuracy and good vehicle ***,considering the influence of road curvature on path tracking accuracy and vehicle stability,and the situation that the vehicle can not move quickly to the expectation path when the lateral position of the vehicle deviates from the expectation path,this paper proposes a lateral path tracking control method based on improved Pure Pursuit *** control method is verified through *** experimental results show that the maximum lateral tracking error of the improved algorithm is 0.04 m,which is 55.56% lower than that of the original algorithm,and the average lateral tracking error is 0.02 m,which is60% lower than that of the original *** purpose of high-precision path tracking of the paver is realized.

关键词： Tracked paver Path tracking Road curvature Pure Pursuit algorithm

来源：评论

学校读者我要写书评

暂无评论

Tracing Intricate Cues in Dialogue: Joint Graph Structure and Sentiment Dynamics for Multimodal Emotion Recognition

arXiv

引用

arXiv 2024年

作者： Li, Jiang Wang, Xiaoping Zeng, Zhigang The School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Institute of Artificial Intelligence Huazhong University of Science and Technology Wuhan430074 China The Hubei Key Laboratory of Brain-Inspired Intelligent Systems Huazhong University of Science and Technology Wuhan430074 China The Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Wuhan430074 China

Multimodal emotion recognition in conversation (MERC) has garnered substantial research attention recently. Existing MERC methods face several challenges: (1) they fail to fully harness direct inter-modal cues, possibly leading to less-than-thorough cross-modal modeling;(2) they concurrently extract information from the same and different modalities at each network layer, potentially triggering conflicts from the fusion of multi-source data;(3) they lack the agility required to detect dynamic sentimental changes, perhaps resulting in inaccurate classification of utterances with abrupt sentiment shifts. To address these issues, a novel approach named GraphSmile is proposed for tracking intricate emotional cues in multimodal dialogues. GraphSmile comprises two key components, i.e., GSF and SDP modules. GSF ingeniously leverages graph structures to alternately assimilate inter-modal and intra-modal emotional dependencies layer by layer, adequately capturing cross-modal cues while effectively circumventing fusion conflicts. SDP is an auxiliary task to explicitly delineate the sentiment dynamics between utterances, promoting the model’s ability to distinguish sentimental discrepancies. Furthermore, GraphSmile is effortlessly applied to multimodal sentiment analysis in conversation (MSAC), forging a unified multimodal affective model capable of executing MERC and MSAC tasks. Empirical results on multiple benchmarks demonstrate that GraphSmile can handle complex emotional and sentimental patterns, significantly outperforming baseline models. Copyright © 2024, The Authors. All rights reserved.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Dynamic Programming Algorithm Based on ITF-OELM for Discrete-Time systems

An Adaptive Dynamic Programming Algorithm Based on ITF-OELM ...

引用

第33届中国控制与决策会议

作者： Xiaofei Zhang Hongbin Ma Junyong Chen Weixue Li School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

Adaptive dynamic programming(ADP) is a kind of intelligent control method,and it is a non-model-based method that can directly approximate the optimal control policy via online *** gradient algorithm is usually used to update weights of action networks and critic networks,however it is clear that gradient descent-based learning methods are generally very slow due to improper learning steps or may easily converge to local *** this paper,in order to overcome those disadvantages of gradient descent-based learning methods,a novel ADP algorithm based on initial-training-free online extreme learning machine(ITF-OELM),in which the critic network link weights of hidden nodes to output nodes can be obtained by least squares instead of gradient algorithm,is ***,the ADP algorithm based on ITF-OELM is tested on a discrete time torsional pendulum system,and simulation results indicate that this algorithm makes the system converge in a shorter time compared with the ADP based on gradient algorithm.

关键词： Adaptive Dynamic Programming Extreme Learning Machine Discrete-time systems

来源：评论

学校读者我要写书评

暂无评论

Multi-Batch Production Scheduling for Distributed Serial Lines with Unreliable Machines and Finite Buffers

Multi-Batch Production Scheduling for Distributed Serial Lin...

引用

第40届中国控制会议

作者： Longzhu Huang Zhiyang Jia Xiaohan Wang Jingchuan Chen School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

In the modern manufacturing environment, the production systems develop towards a flexible direction due to the market demands of multiple varieties and small batch-based customized products. To make better use of the existing resources and to improve production efficiency, distributed manufacturing mode begins to appear. This paper concentrates on a multi-type production scheduling problem for distributed serial lines. Specifically, unreliable machines and finite buffers are considered,which are more realistic in the practical production. The mathematical model for the production system with two Bernoulli machines is formulated first. Then, under the hypothetical model mentioned above, the main work of this article is to propose the exact and approximate analyses to calculate the performance indicators. Based on the analysis of the model, the genetic algorithm is applied to optimize the maximum completion time on the distributed serial lines for multi-batch-based production tasks. Finally, the feasibility and effectiveness of the mathematical model and the proposed algorithm are verified through numerical experiments.

关键词： Bernoulli machine intelligent manufacturing Production scheduling Transient analysis

来源：评论

学校读者我要写书评

暂无评论

Parallel systems Framework: A Safe and Efficient Testbed for Unmanned Ships

Parallel Systems Framework: A Safe and Efficient Testbed for...

引用

Digital Twins and Parallel Intelligence (DTPI), IEEE International Conference on

作者： Long Fu Zhen Shen Xisong Dong Yunjun Han Shuguang Yang Gang Xiong Fei-Yue Wang School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China State Key Laboratory of Multimodal Artificial Intelligence Systems Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation Chinese Academy of Sciences Beijing China Guangdong Engineering Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences Dongguan China Schoool of Rail Transportation Shandong Jiaotong University Jinan China State Key Laboratory for Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China

ISBN: (数字)9798350349252

ISBN: (纸本)9798350349269

In this study, unmanned ships test platform based on the parallel systems framework is proposed to improve the test efficiency and accuracy of unmanned ships in complex ocean environment. The parallel intelligence theory and ACP approach, the efficient interaction between virtual and real environment is achieved, which provides more comprehensive and accurate data for unmanned ships testing. Future research will further expand the scope of virtual environment simulation and improve systems accuracy and response speed to a wider range of unmanned ships test requirements.

关键词： Accuracy Oceans Virtual environments Digital twins Marine vehicles Testing

来源：评论

学校读者我要写书评

暂无评论

Discretizing Continuous Action Space with Unimodal Probability Distributions for On-Policy Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Zhu, Yuanyang Wang, Zhi Zhu, Yuanheng Chen, Chunlin Zhao, Dongbin The Department of Control Science and Intelligent Engineering School of Management and Engineering Nanjing University Nanjing210093 China The Research Center for Novel Technology of Intelligent Equipment Nanjing University Nanjing210093 China The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China

For on-policy reinforcement learning, discretizing action space for continuous control can easily express multiple modes and is straightforward to optimize. However, without considering the inherent ordering between the discrete atomic actions, the explosion in the number of discrete actions can possess undesired properties and induce a higher variance for the policy gradient estimator. In this paper, we introduce a straightforward architecture that addresses this issue by constraining the discrete policy to be unimodal using Poisson probability distributions. This unimodal architecture can better leverage the continuity in the underlying continuous action space using explicit unimodal probability distributions. We conduct extensive experiments to show that the discrete policy with the unimodal probability distribution provides significantly faster convergence and higher performance for on-policy reinforcement learning algorithms in challenging control tasks, especially in highly complex tasks such as Humanoid. We provide theoretical analysis on the variance of the policy gradient estimator, which suggests that our attentively designed unimodal discrete policy can retain a lower variance and yield a stable learning process. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Partially Occluded Face Expression Recognition with CBAM-Based Residual Network for Teaching Scene

Partially Occluded Face Expression Recognition with CBAM-Bas...

引用

Chinese automation Congress (CAC)

作者： Yanxing Bai Luefeng Chen Min Li Min Wu Witold Pedrycz Kaoru Hirota School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration School of Automation Ministry of Education China University of Geosciences Wuhan China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland Department of Computer Engineering Istinye University Sariyer/Istanbul Turkey Tokyo Institute of Technology Yokohama Japan

In this paper, a deep residual network based on convolutional block attention module (CBAM) is proposed, which is utilized for feature extraction of partially occluded face expression data. The proposed method overcomes the problem of localized occlusion face feature extraction by focusing on the regions and channels containing important information in the occluded face data through CBAM. Multi-task cascaded convolutional networks (MTCNN) are firstly utilized to localize the key regions of face emotion, and then deep emotion features are extracted by CBAM-ResNet network. The final emotion labels are generated. The effectiveness of this paper's method is verified on the RAF-DB dataset and the occluded CK+ dataset. The experimental accuracy in the RAF-DB dataset is 76.3%, which is 3.74% and 1.64% higher than the accuracy produced by the method of RGBT, and the WLS-RF, respectively. Application experiments are carried out in the real teaching scenario, which verifies the applicability of the algorithm in the real teaching scene.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A-STC: auction-based spanning tree coverage algorithm for motion planning of cooperative robots

引用

Frontiers of Information Technology & Electronic Engineering 2019年第1期20卷 18-31页

作者： Guan-qiang GAO Bin XIN School of Automation Beijing Institute of Technology Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Advanced Innovation Center for Intelligent Robots and Systems

The multi-robot coverage motion planning(MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line algorithm, named the "auction-based spanning tree coverage(A-STC)" algorithm. First, the configuration space is divided into mega cells whose size is twice the minimum coverage range of a robot. Based on connection relationships among mega cells, a graph structure can be obtained. A robot that circumnavigates a spanning tree of the graph can generate a coverage trajectory. Then, the proposed algorithm adopts an auction mechanism to construct one spanning tree for each robot. In this mechanism, an auctioneer robot chooses a suitable vertex of the graph as an auction item from neighboring vertexes of its spanning tree by heuristic rules. A bidder robot submits a proper bid to the auctioneer according to the auction vertexes' relationships with the spanning tree of the robot and the estimated length of its trajectory. The estimated length is calculated based on vertexes and edges in the spanning tree. The bidder with the highest bid is selected as a winner to reduce the makespan of the coverage task. After auction processes, acceptable coverage trajectories can be planned rapidly. Computational experiments validate the effectiveness of the proposed MCMP algorithm and the method for estimating trajectory lengths. The proposed algorithm is also compared with the state-of-the-art algorithms. The comparative results show that the A-STC algorithm has apparent advantages in terms of the running time and the makespan for large crowded configuration spaces.

关键词： Coverage motion planning Multi-robot system Auction algorithm Spanning tree coverage algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：