Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004181
Yuting Ding, Di Wu
Missing data is an inevitable and common problem in data-driven intelligent transportation systems (ITS). In the past decade, scholars have done much research on the recovery of missing traffic data, however, how to make full use of spatio-temporal traffic patterns to improve the recovery performance is still an open problem. Aiming at the spatio-temporal characteristics of traffic speed data, this paper regards the recovery of missing data as a matrix completion problem and proposes a spatio-temporal traffic data completion method based on hidden feature analysis, which discovers spatio-temporal patterns and underlying structures from incomplete data to complete the recovery task. Therefore, we introduce spatial and temporal correlation to capture the main underlying features of each dimension. Finally, these latent features are applied to recover traffic data through latent feature analysis. The experimental and evaluation results show that the evaluation criterion value of the model is small, which indicates that the model has better performance. The results show that the model can accurately estimate the continuous missing data.
{"title":"Spatio-Temporal Traffic Data Recovery Based on Latent Feature Analysis","authors":"Yuting Ding, Di Wu","doi":"10.1109/ICNSC55942.2022.10004181","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004181","url":null,"abstract":"Missing data is an inevitable and common problem in data-driven intelligent transportation systems (ITS). In the past decade, scholars have done much research on the recovery of missing traffic data, however, how to make full use of spatio-temporal traffic patterns to improve the recovery performance is still an open problem. Aiming at the spatio-temporal characteristics of traffic speed data, this paper regards the recovery of missing data as a matrix completion problem and proposes a spatio-temporal traffic data completion method based on hidden feature analysis, which discovers spatio-temporal patterns and underlying structures from incomplete data to complete the recovery task. Therefore, we introduce spatial and temporal correlation to capture the main underlying features of each dimension. Finally, these latent features are applied to recover traffic data through latent feature analysis. The experimental and evaluation results show that the evaluation criterion value of the model is small, which indicates that the model has better performance. The results show that the model can accurately estimate the continuous missing data.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"94 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132708176","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}
Central air-conditioning is a complex system project, and the assessment and forecasting of its performance often involves a very large number of factors. Accurate assessment of a system's energy efficiency is crucial for system energy demand management and performance improvement. Therefore, researchers have done a lot of related work focusing on energy efficiency forecasting by constructing thermodynamic and mech-anistic models of central air conditioning, and recently there have been attempts to combine these models with methods based on data mining and machine learning as well. The problem of predicting energy efficiency in refrigeration systems can be, generally, viewed as a multivariate time-series(MTS) problem following a hidden Markov process. With the development of artificial intelligence techniques, deep neural network-based tem-poral prediction models have made important advances in many application areas. This study aims to achieve higher accuracy for energy efficiency forecasting tasks, using an improved model based on LSTNet. We conducted performance prediction on a dataset collected from a real-world central air-conditioning refrigeration circulation system. As a result, we found significant correlation between the prediction result and ground truth. Our method is compared with several common baseline methods for assessing and predicting the performance of refrigeration systems. Experimental results show that our method generally achieves better performance than those baseline methods.
{"title":"Energy Efficiency Forecasting for Central Air-conditioning Refrigeration Systems Based on Deep Neural Network","authors":"Haitao Song, Yijun Chen, Jiajia Li, Tianyi Wang, Hao Shen, Cheng He","doi":"10.1109/ICNSC55942.2022.10004057","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004057","url":null,"abstract":"Central air-conditioning is a complex system project, and the assessment and forecasting of its performance often involves a very large number of factors. Accurate assessment of a system's energy efficiency is crucial for system energy demand management and performance improvement. Therefore, researchers have done a lot of related work focusing on energy efficiency forecasting by constructing thermodynamic and mech-anistic models of central air conditioning, and recently there have been attempts to combine these models with methods based on data mining and machine learning as well. The problem of predicting energy efficiency in refrigeration systems can be, generally, viewed as a multivariate time-series(MTS) problem following a hidden Markov process. With the development of artificial intelligence techniques, deep neural network-based tem-poral prediction models have made important advances in many application areas. This study aims to achieve higher accuracy for energy efficiency forecasting tasks, using an improved model based on LSTNet. We conducted performance prediction on a dataset collected from a real-world central air-conditioning refrigeration circulation system. As a result, we found significant correlation between the prediction result and ground truth. Our method is compared with several common baseline methods for assessing and predicting the performance of refrigeration systems. Experimental results show that our method generally achieves better performance than those baseline methods.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133332192","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}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004143
Yang Xiu, Dongfang Li, Miaomiao Zhang, Rob Law, E. Wu
This paper reports an anti-sideslip line of sight (LOS) method-based path tracking control method for a multi joint snake robot. In order to effectively eliminate the sideslip influence on direction guidance, a finite-time convergent sideslip observer is designed to compensate the LOS guidance law and improve the steering accuracy of the robot. Additionally, considering the external disturbance and state constraints, a barrier Lyapunov function-based backstepping adaptive controller is proposed to ensure the environmental robustness of the robot. In this work, the sideslip and interference are observed accurately, avoiding the imprecise constraint conditions. Finally, the validity and feasibility of the proposed method are proved by theoretical proof and numerical simulation.
{"title":"Anti-sideslip Line of Sight Method-based Path Tracking Control for a Multi-joint Snake Robot","authors":"Yang Xiu, Dongfang Li, Miaomiao Zhang, Rob Law, E. Wu","doi":"10.1109/ICNSC55942.2022.10004143","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004143","url":null,"abstract":"This paper reports an anti-sideslip line of sight (LOS) method-based path tracking control method for a multi joint snake robot. In order to effectively eliminate the sideslip influence on direction guidance, a finite-time convergent sideslip observer is designed to compensate the LOS guidance law and improve the steering accuracy of the robot. Additionally, considering the external disturbance and state constraints, a barrier Lyapunov function-based backstepping adaptive controller is proposed to ensure the environmental robustness of the robot. In this work, the sideslip and interference are observed accurately, avoiding the imprecise constraint conditions. Finally, the validity and feasibility of the proposed method are proved by theoretical proof and numerical simulation.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134427274","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}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004067
Giacomo Basile, Dario Giuseppe Lui, A. Petrillo, S. Santini
This work addresses the problem of Virtual Coupling (VC) control for uncertain heterogeneous nonlinear autonomous trains convoys sharing information among each other with Radio Block Center (RBC) and via Train-2-Train (T2T) communication network. To solve the problem we propose a novel no-supervised actor-critic Deep Deterministic Policy Gradient-based (DDPG) controller which drives each train within the convoy to track the reference behaviour, as imposed by the RBC, while maintaining a desired inter-train distance w.r.t. the preceding train. The effectiveness of the proposed approach is evaluated via a numerical analysis which is carried out in Python environment. The first step of validation involves the efficiency of the training process and discloses how the agent has learned the correct behaviour to track the train ahead. Then, we numerically prove how the overall closed-loop trains convoy under the action of the DDPG controller reaches the VC formation despite the presence of external disturbances acting on the train dynamics.
{"title":"Deep Deterministic Policy Gradient-based Virtual Coupling Control For High-Speed Train Convoys","authors":"Giacomo Basile, Dario Giuseppe Lui, A. Petrillo, S. Santini","doi":"10.1109/ICNSC55942.2022.10004067","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004067","url":null,"abstract":"This work addresses the problem of Virtual Coupling (VC) control for uncertain heterogeneous nonlinear autonomous trains convoys sharing information among each other with Radio Block Center (RBC) and via Train-2-Train (T2T) communication network. To solve the problem we propose a novel no-supervised actor-critic Deep Deterministic Policy Gradient-based (DDPG) controller which drives each train within the convoy to track the reference behaviour, as imposed by the RBC, while maintaining a desired inter-train distance w.r.t. the preceding train. The effectiveness of the proposed approach is evaluated via a numerical analysis which is carried out in Python environment. The first step of validation involves the efficiency of the training process and discloses how the agent has learned the correct behaviour to track the train ahead. Then, we numerically prove how the overall closed-loop trains convoy under the action of the DDPG controller reaches the VC formation despite the presence of external disturbances acting on the train dynamics.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125012828","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}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004047
Lingpeng Meng, Xudong Wang, Qi Deng, Junling He, Chuanfeng Han
The main challenge of emergency supplies distribution is addressing facility disruption caused by secondary disasters (e.g., aftershocks and landslides) and handling the uncertainty of road conditions, which can result in an increase in transportation cost and a delayed arrival time. Considering the risk of facility disruption and multiple types of vehicles, a stochastic programming model is established with the goal of minimizing the transportation cost and rental cost. Since distribution center disruption occurs frequently in practical problems, the model considers distribution center disruption instead of supplier disruption. In the first stage, the supplier transports the supplies needed to the distribution center; in the second stage, the distribution center conducts delivery according to the requirements of the affected locations. A modified evolutionary algorithm is designed to solve the proposed model for large-scale emergencies. Based on the real-world case of the Ya'an earthquake in China, numerical experiments are presented to study the applicability of the proposed model and demonstrate the effectiveness of the proposed algorithm. The numerical analysis results indicate that the proposed model can improve the robustness of the emergency supplies distribution network effectively.
{"title":"A Stochastic Programming Model for Emergency Supplies Distribution Considering Facility Disruption","authors":"Lingpeng Meng, Xudong Wang, Qi Deng, Junling He, Chuanfeng Han","doi":"10.1109/ICNSC55942.2022.10004047","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004047","url":null,"abstract":"The main challenge of emergency supplies distribution is addressing facility disruption caused by secondary disasters (e.g., aftershocks and landslides) and handling the uncertainty of road conditions, which can result in an increase in transportation cost and a delayed arrival time. Considering the risk of facility disruption and multiple types of vehicles, a stochastic programming model is established with the goal of minimizing the transportation cost and rental cost. Since distribution center disruption occurs frequently in practical problems, the model considers distribution center disruption instead of supplier disruption. In the first stage, the supplier transports the supplies needed to the distribution center; in the second stage, the distribution center conducts delivery according to the requirements of the affected locations. A modified evolutionary algorithm is designed to solve the proposed model for large-scale emergencies. Based on the real-world case of the Ya'an earthquake in China, numerical experiments are presented to study the applicability of the proposed model and demonstrate the effectiveness of the proposed algorithm. The numerical analysis results indicate that the proposed model can improve the robustness of the emergency supplies distribution network effectively.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131964678","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}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004169
Yao Lu, Yufeng Chen, Li Yin, Zhiwu Li
This paper develops a deadlock detection and recovery policy for flexible manufacturing systems (FMSs). Different from traditional deadlock-handling methods, this work adds recovery transitions and related arcs rather than control places. First, the concept of a resource requirement graph is presented. It is obtained directly from the Petri net of an FMS, from which the competition for shared resources by different processes can be well represented. Second, all partial deadlocks can be discribed in linear algebraic terms by analysing the resource requirement graph. Then, we propose an algorithm of designing recovery transitions to realloate resources. The resultant net by adding recovery transitions is deadlock-free with all original reachable markings. The proposed approach is computationally efficient since it does not require to generate a reachability graph. Finally, an example is used to illustrate the presented policy.
{"title":"Optimal Transition-based Supervisors Design for Flexible Manufacturing Systems","authors":"Yao Lu, Yufeng Chen, Li Yin, Zhiwu Li","doi":"10.1109/ICNSC55942.2022.10004169","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004169","url":null,"abstract":"This paper develops a deadlock detection and recovery policy for flexible manufacturing systems (FMSs). Different from traditional deadlock-handling methods, this work adds recovery transitions and related arcs rather than control places. First, the concept of a resource requirement graph is presented. It is obtained directly from the Petri net of an FMS, from which the competition for shared resources by different processes can be well represented. Second, all partial deadlocks can be discribed in linear algebraic terms by analysing the resource requirement graph. Then, we propose an algorithm of designing recovery transitions to realloate resources. The resultant net by adding recovery transitions is deadlock-free with all original reachable markings. The proposed approach is computationally efficient since it does not require to generate a reachability graph. Finally, an example is used to illustrate the presented policy.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132760482","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}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004155
Jian Yu, Xueqi Yang, Xiong Chen
About 90% of machine learning applications are based on supervised machine learning drives, and a relatively important task is how to obtain labels for the data. For data with clear rules and structure, a fairly satisfactory label can be obtained by simple processing and analysis. In contrast, the processing of unstructured data is more tedious and complicated for you to go home, such as text-based data, reports, images, etc. There is no predefined data model for this type of data, and the value density itself is low and ambiguous, making it very difficult to extract high- quality information from it. To this end, this paper proposes a text data annotation model that fuses domain knowledge graphs with Bayesian inference networks. The knowledge graph is used as the extraction of semantic classes and the relationship between upper and lower concept entities, and then mapping inference is performed using plain Bayes, while considering the context of the text, as a way to remove the uncertainty of fuzzy concepts. Compared with the traditional text data annotation model, this model introduces concept probability quantification to eliminate the ambiguity of inference results of knowledge graphs while fully considering the influence of human domain knowledge.
{"title":"A text analysis model based on Probabilistic-KG","authors":"Jian Yu, Xueqi Yang, Xiong Chen","doi":"10.1109/ICNSC55942.2022.10004155","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004155","url":null,"abstract":"About 90% of machine learning applications are based on supervised machine learning drives, and a relatively important task is how to obtain labels for the data. For data with clear rules and structure, a fairly satisfactory label can be obtained by simple processing and analysis. In contrast, the processing of unstructured data is more tedious and complicated for you to go home, such as text-based data, reports, images, etc. There is no predefined data model for this type of data, and the value density itself is low and ambiguous, making it very difficult to extract high- quality information from it. To this end, this paper proposes a text data annotation model that fuses domain knowledge graphs with Bayesian inference networks. The knowledge graph is used as the extraction of semantic classes and the relationship between upper and lower concept entities, and then mapping inference is performed using plain Bayes, while considering the context of the text, as a way to remove the uncertainty of fuzzy concepts. Compared with the traditional text data annotation model, this model introduces concept probability quantification to eliminate the ambiguity of inference results of knowledge graphs while fully considering the influence of human domain knowledge.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116812954","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}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004168
Chen Zhang, Lixin Zheng, Shuwan Pan
Items sorting in warehouse logistics is a labor-intensive and time-consuming work. Combined with computer vision and real-time motion planning technologies, industrial robots have been ideal substitutes for human beings in that cases. But picking and placing a large quantity of object categories including known and novel objects in heavily cluttered environments is really a challenging task. This paper proposes a pipeline to address suction grasping detection for isolated objects. Firstly, a two-dimensional suction configuring is proposed. Secondly, we establish a dataset including depth images, color images and suction labels for logistics warehouse scenario. Thirdly, a lightweight network named Generative Grasp Convolutional Neural Network (GG-CNN) intended for planar antipodal grasp is adapted for predicting spatial suction affordance in pixel. Finally, we get a accuracy of 91.45% on test data sets. Primary contributions of our work are: (1) a practical annotation method and dataset collecting from retail industry, (2) an innovative application of GG-CNN.
{"title":"Suction Grasping Detection for Items Sorting in Warehouse Logistics using Deep Convolutional Neural Networks","authors":"Chen Zhang, Lixin Zheng, Shuwan Pan","doi":"10.1109/ICNSC55942.2022.10004168","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004168","url":null,"abstract":"Items sorting in warehouse logistics is a labor-intensive and time-consuming work. Combined with computer vision and real-time motion planning technologies, industrial robots have been ideal substitutes for human beings in that cases. But picking and placing a large quantity of object categories including known and novel objects in heavily cluttered environments is really a challenging task. This paper proposes a pipeline to address suction grasping detection for isolated objects. Firstly, a two-dimensional suction configuring is proposed. Secondly, we establish a dataset including depth images, color images and suction labels for logistics warehouse scenario. Thirdly, a lightweight network named Generative Grasp Convolutional Neural Network (GG-CNN) intended for planar antipodal grasp is adapted for predicting spatial suction affordance in pixel. Finally, we get a accuracy of 91.45% on test data sets. Primary contributions of our work are: (1) a practical annotation method and dataset collecting from retail industry, (2) an innovative application of GG-CNN.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130188869","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}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004171
Jinglong Zhou, Wen-Feng Li, Shaoyong Jiang
Ultra-wideband(UWB) has achieved excellent application performance in many scenarios such as indoor positioning due to its strong penetration capability, multipath resistance and high positioning accuracy. For the problems such as large ranging errors of UWB in Non-Line-of-Sight(NLOS) environment, this paper firstly performs NLOS identification of UWB based on the position difference between first path(FP) and strongest path, the difference between received signal strength(RSS) and FP signal strength, and the distance residuals. Further, an NLOS error mitigation method with RSS and time of arrival fusion is proposed based on biased Kalman filtering(KF) and maximum likelihood estimation algorithm. Finally, experiments in dynamic and static scenarios are carried out to validate the proposed algorithm. The experimental results show that the identification accuracy of our method for NLOS is 95.42%. Under the static ranging scenario, our method improves 74.82% and 71.73% on average in the ranging accuracy compared with the original data and KF algorithm, respectively. In the dynamic positioning scenario, the average distance error of our method is 0.09 m, and it improves 62.5% in positioning accuracy compared to the original data and KF.
{"title":"NLOS Identification and Ranging Error Mitigation for UWB Signal","authors":"Jinglong Zhou, Wen-Feng Li, Shaoyong Jiang","doi":"10.1109/ICNSC55942.2022.10004171","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004171","url":null,"abstract":"Ultra-wideband(UWB) has achieved excellent application performance in many scenarios such as indoor positioning due to its strong penetration capability, multipath resistance and high positioning accuracy. For the problems such as large ranging errors of UWB in Non-Line-of-Sight(NLOS) environment, this paper firstly performs NLOS identification of UWB based on the position difference between first path(FP) and strongest path, the difference between received signal strength(RSS) and FP signal strength, and the distance residuals. Further, an NLOS error mitigation method with RSS and time of arrival fusion is proposed based on biased Kalman filtering(KF) and maximum likelihood estimation algorithm. Finally, experiments in dynamic and static scenarios are carried out to validate the proposed algorithm. The experimental results show that the identification accuracy of our method for NLOS is 95.42%. Under the static ranging scenario, our method improves 74.82% and 71.73% on average in the ranging accuracy compared with the original data and KF algorithm, respectively. In the dynamic positioning scenario, the average distance error of our method is 0.09 m, and it improves 62.5% in positioning accuracy compared to the original data and KF.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125510202","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}
Pub Date : 2022-12-15DOI: 10.1109/ICNSC55942.2022.10004111
Xin Liang, Yifan Hou, Mi Zhao
Colored Petri nets (CPN) can be used to model and study systems with discrete, asynchronous, and concurrent behaviors. Microgrid systems have these features, that can be modeled and studied by CPN. In this paper, the energy scheduling between various distributed power sources and users in a microgrid system is studied based on the analysis of working characteristics of wind turbines, photovoltaic arrays and flexible loads. A CPN model of a microgrid system including distributed power generations is established, which can realize the functions of scheduling energy generated by distributed power generators in the microgrid system and interacting with the external power grid. Owing to the modular and hierarchical modeling method, the proposed model can be conveniently expanded in the scale and function as required, which has universality and adaptability. Finally, the theoretical significance and practical values of the established model are demonstrated by the system simulation.
{"title":"Modeling and Analysis of Microgrid Energy Scheduling Based on Colored Petri Net","authors":"Xin Liang, Yifan Hou, Mi Zhao","doi":"10.1109/ICNSC55942.2022.10004111","DOIUrl":"https://doi.org/10.1109/ICNSC55942.2022.10004111","url":null,"abstract":"Colored Petri nets (CPN) can be used to model and study systems with discrete, asynchronous, and concurrent behaviors. Microgrid systems have these features, that can be modeled and studied by CPN. In this paper, the energy scheduling between various distributed power sources and users in a microgrid system is studied based on the analysis of working characteristics of wind turbines, photovoltaic arrays and flexible loads. A CPN model of a microgrid system including distributed power generations is established, which can realize the functions of scheduling energy generated by distributed power generators in the microgrid system and interacting with the external power grid. Owing to the modular and hierarchical modeling method, the proposed model can be conveniently expanded in the scale and function as required, which has universality and adaptability. Finally, the theoretical significance and practical values of the established model are demonstrated by the system simulation.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122756925","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：