发布求助
文献互助 智能选刊 最新文献

2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)最新文献

筛选
英文 中文
Nonlinear Disturbance Observer Based Sliding Mode Tracking Control for Robotic Manipulators 基于非线性扰动观测器的机械臂滑模跟踪控制
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702252
Tingting Xie, Weishi Hu, Hui Shao, Weipeng Zeng, Gaoliang Li
{"title":"Nonlinear Disturbance Observer Based Sliding Mode Tracking Control for Robotic Manipulators","authors":"Tingting Xie, Weishi Hu, Hui Shao, Weipeng Zeng, Gaoliang Li","doi":"10.1109/ICNSC52481.2021.9702252","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702252","url":null,"abstract":"Aiming at the problem of low trajectory tracking control accuracy caused by internal uncertainties and external disturbances in the control process of robotic manipulators, a sliding mode control method of robotic manipulators based on nonlinear disturbance observer is proposed. Firstly, a nonlinear disturbance observer is designed to estimate the internal uncertainties and external disturbances of the system. In order to avoid the measurement of acceleration feedback term, an auxiliary function is properly introduced. Secondly, in order to reduce the chattering effect of the system, the control input of the system is compensated in real time. At the same time, in order to improve the convergence rate and tracking accuracy of the system, the sliding mode controller is designed with an improved reaching law. Finally, the simulation is performed and the comparison results show that the proposed control strategy is more convincing.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115538658","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}
引用次数: 1
On the Tardiness Minimization on Single Machine 单机延迟最小化的研究
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702231
Bochra Djahel, I. Kacem, Giorgio Lucarelli
{"title":"On the Tardiness Minimization on Single Machine","authors":"Bochra Djahel, I. Kacem, Giorgio Lucarelli","doi":"10.1109/ICNSC52481.2021.9702231","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702231","url":null,"abstract":"In this paper, we describe a Branch-and-Bound (B&B) approach for the problem of minimizing the total tardiness of a set of jobs on a single machine. This is an important objective in several applications where a payment is required in the case of delayed jobs. A new lower bound has been introduced based on several heuristics for the problem. An experimental campaign has been performed showing that our approach can handle up to 20 jobs in a reasonable time.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128137761","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
Research on Identification Method of Magnetite Ore Based on Convolutional Neural Network 基于卷积神经网络的磁铁矿识别方法研究
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702170
Yankui Ren, Chunrong Pan, Lifa He
{"title":"Research on Identification Method of Magnetite Ore Based on Convolutional Neural Network","authors":"Yankui Ren, Chunrong Pan, Lifa He","doi":"10.1109/ICNSC52481.2021.9702170","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702170","url":null,"abstract":"Aiming at the low effect and intelligence of traditional pre-concentration methods for screening low-grade magnetite ore, a method based on convolutional neural network (CNN) is proposed. According to the simulation result of COMSOL Multiphysics for magnetite ore, the magnetic induction signals acquisition system is built and the signal acquisition method is designed. The magnetic induction signals of 1200 magnetite ores are collected and converted into two-dimensional signals that CNN is good at processing through sample preparation. The network model is constructed, and the parameters of the model is optimized by orthogonal experiment design. The optimized model is trained and tested based on the experimental data. The results show that the CNN model can effectively extract the magnetic induction signal characteristics of magnetite ore, and the recognition accuracy rate is as high as 87.5 %.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126834974","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}
引用次数: 1
Time Series Anomaly Detection Based on CEEMDAN and LSTM 基于CEEMDAN和LSTM的时间序列异常检测
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702161
Yucong Rao, Jiabao Zhao
{"title":"Time Series Anomaly Detection Based on CEEMDAN and LSTM","authors":"Yucong Rao, Jiabao Zhao","doi":"10.1109/ICNSC52481.2021.9702161","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702161","url":null,"abstract":"Time series anomaly detection is getting more and more attention in IT operations. Deep learning is one of the most used technologies in recent years, which realizes automatic anomaly detection on raw data. A novel algorithm combining time series decomposition and Long Short Term Memory (LSTM) is proposed in this paper. This algorithm mainly consists of four steps: 1) we use a density-based clustering algorithm to remove the sharp points in the data, and then use interpolation to complete the data; 2) we use the complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN) algorithm to decompose the raw data into a series of relatively simple components, called intrinsic mode functions (IMFs); 3) we use LSTM to predict the IMFs, and the sum of the results represents the predicted results of the original data; 4) we use a dynamic threshold rule and the error between the original value and the predicted value to determine whether the point is an anomaly. The experimental results on the Yahoo Webscope_S5 dataset prove the effectiveness of the proposed model.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125198670","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}
引用次数: 1
Ant Colony Optimization for Heterogeneous GVRP with Customers Service Restrictions 具有客户服务约束的异构GVRP蚁群优化
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702204
Zi-qiang Li, Xianghu Meng, J. Tang
{"title":"Ant Colony Optimization for Heterogeneous GVRP with Customers Service Restrictions","authors":"Zi-qiang Li, Xianghu Meng, J. Tang","doi":"10.1109/ICNSC52481.2021.9702204","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702204","url":null,"abstract":"Carbon dioxide emission has become a serious issue all over the world. Green vehicle routing problem (GVRP) is scheduling vehicles to optimize both economic and environmental costs during the distribution process. This work presents heterogeneous GVRP with customers service restrictions (HGVRP-CSR), in which each customer is only allowed to be served by the designated vehicles. It aims at scheduling vehicles to minimize the economic cost of fuel consumption and CO2 emission. A rigorous mathematical program is constructed. Then, an enhanced ant colony optimization algorithm is proposed to solve it. The maximum and minimum pheromones are utilized to overcome premature convergence and guarantee population diversity. Furthermore, a variable neighborhood search (VNS) approach is adopted to execute systematic neighborhood search in the local search stage of ACO. Finally, extensive experiments are conducted and the results show that the proposed algorithm is an effective and efficient heuristics to solve HGVRP-CSR.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131731399","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
A Hybrid Algorithm to Solve Periodic Vehicle Dispatching Problem with Heterogeneous Vehicles in Logistics Transportation 求解物流运输中异构车辆周期调度问题的混合算法
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702215
Xingkai Wang, Zichao Xing, Weimin Wu, Xinyu Chen
{"title":"A Hybrid Algorithm to Solve Periodic Vehicle Dispatching Problem with Heterogeneous Vehicles in Logistics Transportation","authors":"Xingkai Wang, Zichao Xing, Weimin Wu, Xinyu Chen","doi":"10.1109/ICNSC52481.2021.9702215","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702215","url":null,"abstract":"The vehicle dispatching problem (VDP) is researching how to arrange vehicles’ transportation, which has been addressed by many scholars. In the field of logistics transportation, the vehicle dispatching problem is presented in a special form, that is, the periodic vehicle dispatching problem (PVDP) with heterogeneous vehicles. In order to solve this problem and improve the efficiency of vehicles, a round recombination algorithm (RRA) with two operators are designed in this paper. And a hybrid algorithm consisting of RRA and simulated annealing algorithm is also proposed to improve RRA. Three groups of experiments are carried out to test the performance of designed algorithms in different scenarios. The results of these experiments prove the effectiveness of RRA. The results also show the superiority of hybrid algorithm to RRA.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"15 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132731261","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}
引用次数: 1
Colored Knowledge Petri Nets and Logical Inference 有色知识Petri网与逻辑推理
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702257
KaiCheng Tan, Jiliang Luo, Hongbin Zhang, Xinjie Lin, E. Zheng
{"title":"Colored Knowledge Petri Nets and Logical Inference","authors":"KaiCheng Tan, Jiliang Luo, Hongbin Zhang, Xinjie Lin, E. Zheng","doi":"10.1109/ICNSC52481.2021.9702257","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702257","url":null,"abstract":"It is difficult to visualize and comprehend a knowledge Petri net since its size polynomially grows with the number of logical symbols. In order to tackle the issue, a colored-Petrinet based approach is proposed to perform the logical inference. First, a correlative symbol set is defined to represent the set of symbols that have relations via sentences in a knowledge base, and the semantic constraints are similarly categorized into several correlative constraint sets. Second, the generalized symbols and generalized semantic constraints are defined according to the coefficient matrix of a semantic constraint set, which have the same constraint on multiple sets of correlative symbols. Third, an algorithm is constructed to design a colored knowledge Petri net based on generalized symbols and generalized semantic constraints. Fourth, an inference engine is proposed based on the newly defined transition-firing rules, and can be used to infer or reveal hidden facts. The wumpus world problem is taken as an example to illustrate and verify the proposed method.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133303786","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}
引用次数: 1
Sliding Mode Control for Nanomanipulation System with Disturbance Compensation Based on Inverse System Decoupling Algorithm 基于系统反解耦算法的扰动补偿纳米操作系统滑模控制
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702218
Nan Peng, Shihua Li, Chen Dai, Qingsong Xu
{"title":"Sliding Mode Control for Nanomanipulation System with Disturbance Compensation Based on Inverse System Decoupling Algorithm","authors":"Nan Peng, Shihua Li, Chen Dai, Qingsong Xu","doi":"10.1109/ICNSC52481.2021.9702218","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702218","url":null,"abstract":"Cross-axis coupling effect and multiple disturbances can cause degradation of the nanomanipulation system performance and bring great challenges to controller design. Most control schemes ignore the coupling effect directly or regard it as a part of lumped disturbances, which cannot fully consider the influence of cross-axis coupling. To obtain better control performance, this paper proposes an inverse system decoupling algorithm to solve the cross-axis coupling effect. In addition, considering that the nanomanipulation system is affected by multiple disturbances, the sliding mode control is introduced to ensure the system’s anti-disturbance capability in this paper. Meanwhile, considering the large chattering phenomenon caused by high switching gain in sliding mode control, a composite method based on generalized proportional integral observer (GPIO) is proposed to reduce chattering. With the disturbance estimation provided by GPIO for feedforward compensation, the sliding mode controller can take a smaller value for the switching gain without sacrificing disturbance rejection performance. Finally, the feasibility and effectiveness of the proposed method are validated by simulation.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129819372","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}
引用次数: 1
A Real Time Vehicle Scheduling Strategy in Container Terminals 集装箱码头车辆实时调度策略研究
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702264
Zhenrui Rong, Weimin Wu, Xingkai Wang, X. Jin
{"title":"A Real Time Vehicle Scheduling Strategy in Container Terminals","authors":"Zhenrui Rong, Weimin Wu, Xingkai Wang, X. Jin","doi":"10.1109/ICNSC52481.2021.9702264","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702264","url":null,"abstract":"With the rapid development of global container business, there are higher requirements for the operation efficiency of container terminals. The vehicle dispatching system is an important link in the operation of container terminal. The yard environment of container terminal is very complex, and the traditional global optimization model based on time estimation is no longer suitable to deal with the vehicle dispatching problem in the scene of dock. This paper proposes a real-time vehicle scheduling strategy for container terminals. Firstly, a buffer vehicle pool is designed to balance the efficiency of each quay crane (QC). Secondly, the wider neighborhood simulated annealing algorithm (WNSA) is presented to find the optimal matching result of each round of calculation. The experimental results show that the proposed strategy in this paper is able to improve the operation efficiency of the QCs and reduce the vehicle cost in the container terminal.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116033059","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
A Two-stage Optimization Method of Manufacturing Service Composition for Personalized Customers 面向个性化客户的制造服务组合两阶段优化方法
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702241
Zhengchao Liu, Chunrong Pan
{"title":"A Two-stage Optimization Method of Manufacturing Service Composition for Personalized Customers","authors":"Zhengchao Liu, Chunrong Pan","doi":"10.1109/ICNSC52481.2021.9702241","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702241","url":null,"abstract":"With the development of manufacturing globalization, service-oriented manufacturing mode promotes customers to configure the manufacturing service composition online to meet personalized manufacturing needs. Personalized manufacturing service composition optimization can greatly enhance customer friendliness and convenience. However, existing researches on manufacturing service composition optimization are difficult to comprehensively weigh customer preferences and the quality of the service (QoS) attributes of the service composition. Therefore, this paper proposes a two-stage optimization model for personalized manufacturing service composition, the two-stage optimization includes customer preference-based optimization for candidate manufacturing services and multi-objective optimization for personalized manufacturing service composition. To solve the model, a hybrid NSGA-II&CF algorithm is proposed. The collaborative filtering (CF) is applied to quantifying the customer preferences of candidate manufacturing services, the NSGA-II is employed for the multi-objective optimization of personalized manufacturing service composition. Finally, comparison experiments are provided to verify the effectiveness of the proposed NSGA-II&CF algorithm.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131846166","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信