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

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

筛选
英文 中文
Modeling and Analysis of Urban Traffic System Based on Colored Petri Nets 基于彩色Petri网的城市交通系统建模与分析
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702178
Xin Liang, Yuang Dang, Yifan Hou
{"title":"Modeling and Analysis of Urban Traffic System Based on Colored Petri Nets","authors":"Xin Liang, Yuang Dang, Yifan Hou","doi":"10.1109/ICNSC52481.2021.9702178","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702178","url":null,"abstract":"Colored Petri nets can be employed to model, simulate, and analyze systems with discrete, asynchronous and concurrent characteristics that are commonly featured by road traffic systems. In traffic systems, the vehicle routing problem and traffic lights signal control are essential issues that should be investigated. This work mainly studies the automatic vehicle route planning problems in a small-scale urban traffic system, in which traffic lights signal controls vehicles in a queue to pass through an intersection orderly. Based on the Colored Petri nets, a small-scale urban traffic system model with a 3 × 3 chessboard pattern network is established, which can realize the functions: automatic routes planning that leads the vehicles to the destinations, traffic accidents dealing, and traffic lights control that directs vehicles to queue up at intersections. Owning to the modular and hierarchical methods, the proposed model can be expanded conveniently in scale and functions according to demands, i.e., the model is universalizable and applicative for general traffic systems. Finally, the established model’s theoretical and practical values are demonstrated by system simulation.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"15 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":"115281937","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 Novel Searching Method of Fringe Blocks for AGV Deadlock Avoidance 一种用于AGV避免死锁的条纹块搜索方法
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702207
Xinyu Chen, Tingqi Zhang, Weimin Wu, Ruifen Hu
{"title":"A Novel Searching Method of Fringe Blocks for AGV Deadlock Avoidance","authors":"Xinyu Chen, Tingqi Zhang, Weimin Wu, Ruifen Hu","doi":"10.1109/ICNSC52481.2021.9702207","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702207","url":null,"abstract":"With the increasing development of automated logistics systems, automated guided vehicles (AGVs) have been gradually deployed in various logistics systems. AGVs are mainly used to transport materials and products, which promote the efficiency greatly and provide profound flexibility and safety. The strategy to prevent AGVs from forming deadlocks is one of the fundamental and vital issues in applications. In this paper, a common type of deadlock that usually occurs in warehouses and a typical attribute of map called fringe blocks are studied thoroughly. To solve the deadlock, it’s crucial to identify fringe blocks. We first use traditional depth first search algorithm (DFS) to find out all the fringe blocks in the map. Then, confronted with the huge time complexity, we combine the DFS procedure with a high-efficiency trimming method. Finally, we run a simulation and make a comparison of both methods. The simulation results have shown that the proposed strategy will reduce computational time significantly without making false judgements.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"28 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":"125962112","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 Design of Reserved Lanes for Automated Truck Considering User Equilibrium 考虑用户均衡的自动驾驶货车预留车道优化设计
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702181
Baoqing Yan, Peng Wu, Ling Xu
{"title":"Optimal Design of Reserved Lanes for Automated Truck Considering User Equilibrium","authors":"Baoqing Yan, Peng Wu, Ling Xu","doi":"10.1109/ICNSC52481.2021.9702181","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702181","url":null,"abstract":"This paper studies an automated truck transportation problem via lane reservation strategy. The problem is to decide which road links to be reserved, and plan paths for automated truck transportation tasks on these reserved lanes so that all tasks can be completed within given deadlines. Although a lane reservation strategy can improve the transportation efficiency and safety of automated trucks, it will also reduce the available road capacity for general-purpose vehicles, which will have a negative impact on them. Moreover, general-purpose vehicles may change their route choices according to the changes in the network status caused by dedicated lanes. Therefore, this paper focuses on the optimal design of reserved lanes for automated trucks considering user equilibrium. A new bi-level programming model is first formulated. Then, a differential evolution algorithm is proposed to solve it. A case study is conducted to verify the effectiveness of the proposed model and method.","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":"125539300","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
Dynamic Community Detection via Kalman Filter-Incorporated Non-negative Matrix Factorization 基于卡尔曼滤波的非负矩阵分解动态社区检测
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702228
Xiao Ying Zhang, Ye Yuan
{"title":"Dynamic Community Detection via Kalman Filter-Incorporated Non-negative Matrix Factorization","authors":"Xiao Ying Zhang, Ye Yuan","doi":"10.1109/ICNSC52481.2021.9702228","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702228","url":null,"abstract":"Community detection on dynamic undirected network (DUN) is a vital issue in the area of network representation. Note that most existing studies built a detection model on a static network, which is incompatible with a DUN that is dynamically evolving and contains temporal patterns. Aiming at addressing this issue, this paper proposes a kalman filter-incorporated non-negative matrix factorization -based dynamic community detection (KDCD) model. Its main idea is to precisely track the temporal variations of a DUN with the state-transition function of a kalman filter, as well as accurately fit the numerical characteristics of the target network with an alternating least square solver. Empirical studies on three real-world DUNs demonstrate that the proposed KDCD model outperforms state-of-the-art models in achieving highly-accurate dynamic community detection results.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"34 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":"122421933","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
Stock Price Prediction Based on Conditional Flows Scenario Generation 基于条件流情景生成的股票价格预测
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702208
Xiaoxuan Xu, Bo Wang, Xianhe Wang
{"title":"Stock Price Prediction Based on Conditional Flows Scenario Generation","authors":"Xiaoxuan Xu, Bo Wang, Xianhe Wang","doi":"10.1109/ICNSC52481.2021.9702208","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702208","url":null,"abstract":"Stock price forecasting is an important issue in the financial field. However, most of the existing studies were focused on the prediction of a single stock, ignoring the correlation among different assets. A possible way to solve the above problem is to provide a set of scenarios which include the future returns of several stocks, instead of a single one. The flow-based model is a kind of deep learning model proposed in recent years, which has powerful data generation abilities. In this paper, we use a flow-based conditional generative model to forecast the stock price scenario. We use real stock market data to verify the proposed method. The simulation results show that the model based on the proposed method can capture the complex dependence of the future stock relationship and provide more accurate and diversified forecasting results.","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":"117327706","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 new flexible multi-AGVs scheduling model with pre-waiting time in an intelligent manufacturing system 智能制造系统中具有预等待时间的柔性多agv调度新模型
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702217
Haoyi Niu, Zichao Xing, Xingkai Wang, Weimin Wu, Tao Zhang
{"title":"A new flexible multi-AGVs scheduling model with pre-waiting time in an intelligent manufacturing system","authors":"Haoyi Niu, Zichao Xing, Xingkai Wang, Weimin Wu, Tao Zhang","doi":"10.1109/ICNSC52481.2021.9702217","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702217","url":null,"abstract":"This paper studies a flexible flow-shop scheduling problem with limited resources (FFSP-LR) which is based on an actual air-conditioning production line in an intelligent manufacturing system. It extends the classical flexible flow-shop scheduling problem by considering practical constraints of the number of the AGVs (automated guided vehicles) on the transportation resources. The problem aims to determine the optimal scheduling results that minimizes the idle waiting time and pick-up waiting time of the workstations. To solve this problem, a pre-waiting scheduling model (PWSM) is proposed by taking into account the advance waiting time of AGVs. The experimental results show that the proposed PWSM is able to reduce idle waiting time and pick-up waiting time up to 425.01 and 414.25 comparing to traditional FCFS (First Come First Serve) strategy respectively. Correspondingly, these two types of time could be saved up to 87.01% and 98.57%. Finally, the overall efficiency of the intelligent manufacturing system is improved since the PWSM is able to effectively reduce the idle waiting time and pick-up waiting time of the workstations under the condition of limited transportation resources.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"85 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":"123571051","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 Dynamic Joint Real-time Scheduling Strategy of Truck and Yard Crane in Container Terminals 集装箱码头汽车和堆场起重机动态联合实时调度策略
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702168
X. Jin, Xingkai Wang, Weimin Wu, Zhenrui Rong, Quanling Zhang
{"title":"A Dynamic Joint Real-time Scheduling Strategy of Truck and Yard Crane in Container Terminals","authors":"X. Jin, Xingkai Wang, Weimin Wu, Zhenrui Rong, Quanling Zhang","doi":"10.1109/ICNSC52481.2021.9702168","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702168","url":null,"abstract":"With the continuous growth of port container throughput, it is difficult to meet the port production demand by simply configuring automation equipments to improve the operation efficiency of machinery. The container truck scheduling and yard crane scheduling are the two important scheduling links in container terminals. At the same time, there is a tight coupling between them. Thus, the joint scheduling of container trucks and yard cranes is necessary to improve the operation efficiency of container terminals. In this paper, the joint real-time scheduling of trucks and yard cranes is mathematically modeled, and is solved by the elite genetic algorithm. Finally, a variety of scheduling strategies are compared to verify the effectiveness of the proposed strategy.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"1 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":"130478366","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 Container Slot Planning for Coordinated Operation of Quay Cranes and Yard Cranes 码头起重机与堆场起重机协同作业集装箱槽位规划研究
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702197
Lili Huang, Weimin Wu
{"title":"Research on Container Slot Planning for Coordinated Operation of Quay Cranes and Yard Cranes","authors":"Lili Huang, Weimin Wu","doi":"10.1109/ICNSC52481.2021.9702197","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702197","url":null,"abstract":"Given ship per-stowage plan and yard stacking status, this paper presents a method on container slot planning for coordinated operation of quay cranes (QC) and yard cranes (YC). A multi-objective programming model is established with the goal of maximizing the turnover rate of container terminal. Then, a heuristic construction algorithm is designed to obtain an initial stowage plan. In addition, an annealing genetic algorithm is proposed to optimize this initial solution. A wide variety of numerical experiments demonstrated that stowage plans made by this method are useful and applicable in practice.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"255 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":"134076568","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
Improved PolarMask with Attention for Instance Segmentation 基于注意力的实例分割改进PolarMask
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702211
Yaru Cao, Guanjun Liu
{"title":"Improved PolarMask with Attention for Instance Segmentation","authors":"Yaru Cao, Guanjun Liu","doi":"10.1109/ICNSC52481.2021.9702211","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702211","url":null,"abstract":"As an important field of computer vision, instance segmentation is mainly divided into one-stage segmentation methods and two-stage segmentation methods. PolarMask is a one-stage instance segmentation method, which has the advantages of simple structure and fast speed. However, its accuracy is not good enough. To optimize the accuracy of PolarMask, we firstly propose attention-based polar Intersection over Union (IoU) loss based on PolarMask, and then we replace Feature Pyramid Network (FPN) structure and IoU loss with FPN-involution, PAFPN, and CIoU loss, respectively. Through ablation study, it is proved the effect of the proposed attention-based Polar IoU loss and verified the effect of the replacement module in the model. Further, through combination experiments, we find the most efficient combination method on COCO minival dataset. Finally, we compare our method with others, and an Improved PolarMask method is obtained.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"80 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":"134511260","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
HybridEI: Smartly Face Detection System in Resource Constrained Edge Environment 资源受限边缘环境下的智能人脸检测系统
2021 IEEE International Conference on Networking, Sensing and Control (ICNSC) Pub Date : 2021-12-03 DOI: 10.1109/ICNSC52481.2021.9702180
Fridoon Najafi, Pengwei Wang, DouglasOmwenga Nyabuga
{"title":"HybridEI: Smartly Face Detection System in Resource Constrained Edge Environment","authors":"Fridoon Najafi, Pengwei Wang, DouglasOmwenga Nyabuga","doi":"10.1109/ICNSC52481.2021.9702180","DOIUrl":"https://doi.org/10.1109/ICNSC52481.2021.9702180","url":null,"abstract":"With the digital revolution of the Internet of Things (IoT), data is rapidly emerging at the network’s edge, where it is collected using artificial intelligence (AI) and processed in a variety of applications, including cybersecurity, image recognition, and human tracking. Despite this, facial expression recognition (FER) remains a challenging problem in computer vision. Inconsistencies in the sophistication of FER and variations among expression classes are often ignored in most facial expression detection systems due to the various expressions of emotion and unpredictable environmental influences. An HybridEI (Hybrid Edge Intelligence), a smartly face detection system trained in a more powerful cloud environment and inferenced at the resource-constrained edge environment, is proposed for FER in this study. Face classification complexity, memory minimization, and computational time were all well addressed by our proposed HybridEI approach. With an accuracy of 82.78% and 1.27 frames per second (FPS), the experimental results on FER-2013 dataset demonstrated the effectiveness and superiority over other state-of-the-art (SOTA) methods. Furthermore, both the memory capacity and computational time were significantly decreased.","PeriodicalId":129062,"journal":{"name":"2021 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"65 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":"131131136","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学术官方微信