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

2024 China Automation Congress, CAC 2024

作者： Zhu, Jinyang Xu, Zhezhuang Lin, Ye College of Electrical Engineering and Automation Fuzhou University Key Laboratory of Industrial Automation Control Technology and Information Processing Education Department of Fujian Province Fuzhou350000 China

ISBN: (纸本)9798350368604

Using machine vision for meter reading significantly enhances the efficiency of industrial monitoring. However, meters in outdoor environment are often subject to the noise such as rain and fog, which affect the accuracy of meter readings. Additionally, the meter images and labels under noise are hard to obtain. To address these challenges, We propose a method for pointer meter reading under noise based on virtual data generation. Firstly, We utilize Unity to construct an industrial meter scene, which generates the images of meter under noise and theri labels. Secondly, we develop a U-Net network with an ASPP module, which expands the receptive field of network and enhances the ability of segmentation network to capture global semantic information under noise. Finally, the angular method is used to calculate the meter readings. Experimental results show that this method can effectively read meters under noise in outdoor environments. © 2024 IEEE.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised learning with GAN for Semantic Segmentation of Wood Defect image

Semi-supervised learning with GAN for Semantic Segmentation ...

引用

2024 China Automation Congress, CAC 2024

作者： Zheng, Kunxin Zheng, Song Xu, Zhezhuang Lin, Ye Zhu, Yuhang College of Electrical Engineering and Automation Fuzhou University Key Laboratory of Industrial Automation Control Technology and Information Processing Education Department of Fujian Province Fuzhou350000 China

ISBN: (纸本)9798350368604

Automatic defect detection on wood surface is essential for ensuring product quality. Semantic segmentation methods have shown outstanding performance in wood defect detection. However, it is costly to acquire correct pixel-level labels of wood surface defects due to the complicated characteristics. To mitigate the cost of acquiring high-quality datasets, this study proposes a semi-supervised defect detection approach based on generative adversarial networks, which contains a generator and a discriminator. The generator is utilized to generate pixel-level segmentation results of wood defect images. To improve the segmentation performance, the discriminator learns against the generator by judging the goodness of the prediction results and generates supervised signals for the prediction results of unlabeled images. With this learning model, the proposed method can enhance segmentation performance using unlabeled images and alleviate the burden of data annotation. We validate the effectiveness of the proposed approach on a collected dataset of wood defects. Experimental results demonstrate the remarkable performance of our method even when utilizing only a small amount of annotated data. © 2024 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Path Planning for Finite Horizon Tasks with Counting Time Temporal Logics

Multi-Agent Path Planning for Finite Horizon Tasks with Coun...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Peng Lv Shaoyuan Li Xiang Yin Department of Automation and Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350358513

ISBN: (纸本)9798350358520

In this paper, we consider the multi-agent path planning problem for high-level tasks with finite horizons. In many situations, there is the need to count how many times a sub-task is satisfied in order to achieve the overall task. However, existing temporal logic languages, such as linear temporal logic, may not be efficient in describing such requirements. To address this issue, we propose a new temporal logic language called Counting Time Temporal Logic (CTTL) that extends linear temporal logic by explicitly counting the number of times that some tasks are satisfied. To solve the CTTL path planning problem, we use integer linear programming to encode the satisfaction of the task. We demonstrate that our approach is both sound and complete. To validate our results, we present numerical experiments to show the scalability of the proposed approach. Furthermore, we provide a simulation case study of a team of autonomous robots to illustrate the synthesis procedure.

关键词： Computer aided software engineering Automation Scalability Integer linear programming Path planning Planning Delays Logic Standards Autonomous robots

来源：评论

学校读者我要写书评

暂无评论

Design Technology of Multi-AGV Warehouse Intelligent Scheduling Optimization control system 15th

Design Technology of Multi-AGV Warehouse Intelligent Schedul...

引用

15th International Conference on Genetic and Evolutionary Computing, ICGEC 2023

作者： Pan, YanPeng Zhang, XueTing Zhang, FuQuan Tan, LiLi Yang, LiJie Ma, Jun China Academy of Launch Vehicle Technology Beijing100076 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350121 China

ISBN: (纸本)9789819700677

Different from the traditional warehousing system, in the multi-AGV warehouse scheduling control system, the constraints of poor connectivity of the conveying track have led to the emergence of urgent problems such as vehicle conflicts in the task, low efficiency of multitasking concurrency, difficulty of delineating the conditions for entering the transporting area and so on. This paper proposes a design of multi-AGV warehouse intelligent scheduling optimized control system, which takes multitask scheduling research as an entry point, designs the warehouse layout and vehicle operation rules assumptions and modeling, studies the scheduling solution of Monorail Vehicles in multiple tasks, designs a scheduling optimization method based on the algorithm of Time Window, solves conflicts between key process and operation task process and optimize the scheduling, so as to effectively enhance the efficient scheduling capability of multi-AGV warehouse intelligent scheduling optimized control system. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Warehouses

来源：评论

学校读者我要写书评

暂无评论

Hybrid Traffic Scheduling Based on Adaptive Time Slot Slicing in Time-Sensitive Networking

Hybrid Traffic Scheduling Based on Adaptive Time Slot Slicin...

引用

2022 IEEE International Conference on Industrial Technology, ICIT 2022

作者： Wang, Shouliang Xu, Qimin Zhang, Yanzhou Xu, Lei Chen, Cailian Shanghai Jiao Tong University Department of Automation Shanghai China 200240 Key Laboratory of System Control and Information Processing Ministry of Education of China

ISBN: (纸本)9781728119489

The development of the Industrial Internet of Things (IIoT) is increasingly relying on the low-latency and low-jitter information exchange. Time-Sensitive Networking (TSN) guarantees the deterministic transmission by a set of mechanisms, such as Time-Aware Shaper (TAS) and Cyclic Queuing and Forwarding (CQF). However, the deterministic scheduling of hybrid traffic with different Quality of Service (QoS) is still unresolved since traffic performance is hard to meet by a single mechanism or an integrated mechanism with fixed time slot. In this paper, to realize the low-latency and low-jitter hybrid traffic scheduling, an adaptive time slot slicing (ATSS) method is proposed integrating TAS and CQF. With dynamically slicing the time slot to centralize time-triggered (TT) traffic, ATSS eliminates the irregular distribution of TT flow to support multi-hop networks. A resource calculation method based on slot occupancy judgment is devised to reduce the scheduling complexity, which raises the analysis objects into flows instead of frames. To reduce the complexity further, an incremental algorithm with the search boundary of resources is designed. The evaluation results show that ATSS reduces the jitter by 12 times and time cost by 200 times when handling over 125 mixed flows in different network topologies compared to previous work. © 2022 IEEE.

关键词： Jitter

来源：评论

学校读者我要写书评

暂无评论

Collision-Free Path Planning with Kinematic Constraints in Urban Scenarios

引用

Journal of Shanghai Jiaotong university(Science) 2021年第5期26卷 731-738页

作者： WANG Liang WANG Bing WANG Chunxiang Department of Automation Key Laboratory of System Control and Information Processing of Ministry of EducationShanghai Jiao Tong UniversityShanghai 200240China

In urban driving scenarios,owing to the presence of multiple static obstacles such as parked cars and roadblocks,planning a collision-free and smooth path remains a challenging *** addition,the path-planning problem is mostly non-convex,and contains multiple local ***,a method for combining a sampling-based method and an optimization-based method is proposed in this paper to generate a collision-free path with kinematic constraints for urban *** sampling-based method constructs a search graph to search for a seeding path for exploring a safe driving corridor,and the optimization-based method constructs a quadratic programming problem considering the desired state constraints,continuity constraints,driving corridor constraints,and kinematic constraints to perform path *** experimental results show that the proposed method is able to plan a collision-free and smooth path in real time when managing typical urban scenarios.

关键词： autonomous vehicle path planning dynamic searching quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Jointly Learning Time-Structure-History Graph Embedding for Temporal Knowledge Graph Reasoning 19

Jointly Learning Time-Structure-History Graph Embedding for ...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Duan, Hao Jin, Haoyu Chen, Kang Du, Shaochong Fang, Tao Huo, Hong Shanghai Jiao Tong University Department of Automation Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai China

ISBN: (纸本)9798350346558

The Temporal Knowledge Graph(TKG) reasoning is an imperative task for various applications of TKG. However, reasoning over TKGs which aims to predict future facts has been less explored. Intuitively, entities and relations in TKG change differently over time, and the variations are different. It also can be observed that what happens in the past may affect the future. Apart from these, structure information that exists in the neighborhood of a given entity in a KG has been proven to be important. Inspired by these, a novel graph embedding method for TKG reasoning, called time-structure-history graph embedding (TSHGE), is proposed in this paper. TSHGE consists of three progressive learning units. The first time information learning unit employs a novel time-aware mechanism to encode the time influence on entities and relations. Then a relation-aware GAT (Graph Attention Network) is used in the structure information learning unit to model the 1-hop neighborhoods of all entities in a KG at each timestamp in TKG. Finally, the history information learning unit utilizes GRU (Gated Recurrent Unit) to learn history information from various facts. Then the ultimate embedding representations of entities and relations can be obtained for the prediction of future facts. The evaluations on three public TKG datasets have demonstrated the effectiveness and superiority of TSHGE for predicting future facts. © 2022 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

RBP-Former: Joint Prediction of RNA-protein Binding Sites on Full-length RNA Transcripts for Multiple RBPs

RBP-Former: Joint Prediction of RNA-protein Binding Sites on...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Li, Yichong Liu, Xiaojian Cheng, Fan Pan, Xiaoyong Yang, Yang Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China Shanghai Jiao Tong University Institute of Image Processing and Pattern Recognition Shanghai200240 China Ministry of Education of China Key Laboratory of System Control and Information Processing Shanghai200240 China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai200240 China

ISBN: (纸本)9798350386226

RNA-binding proteins (RBPs) are essential for gene expression, and the complex RNA-protein interaction mechanisms require analysis of global RNA information. Therefore, accurate prediction of RBP binding sites on full-length RNA transcripts is crucial for understanding these mechanisms and their roles in diseases. While machine learning methods can predict RBP binding to RNA fragments, extending this to full-length transcripts presents challenges due to sequence length and data imbalance. In this paper, we introduce RBP-Former, a binding site joint prediction model designed specifically for full-length RNA transcripts that can be used for multiple RBPs. This model processes information at both coarse and fine-grained levels to fully exploit sequence data and its interactions with multiple RBPs. We develop multi-level imbalance learning strategies, achieving favorable results on imbalanced data. Our method outperforms existing methods in predicting binding sites on full-length RNA transcripts for multiple RBPs, demonstrating its effectiveness in handling imbalanced label and sample distributions. © 2024 IEEE.

关键词： Binding sites

来源：评论

学校读者我要写书评

暂无评论

Distributed Identification With Input Design for Network systems

引用

IEEE Transactions on control of Network systems 2025年

作者： Mao, Xiangyu He, Jianping Fang, Chongrong Shanghai Jiao Tong University The Dept. of Automation China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

The distributed identification of network systems under local observation has recently become one of the research hot spots. Due to the unobservable influence of other subsystems and the noise, it is difficult for local subsystems to achieve convergent identification under local observations. This paper proposes a distributed identification algorithm for local subsystems to identify their parameter matrices under local observation with a guarantee of convergence. We obtain the necessary and sufficient conditions for the convergence of local identification. We prove that by injecting an independent random signal to the local subsystem, which is easy to implement, using a simple least-squares method to identify local systems can achieve convergent identification for a certain probability. Meanwhile, we give the minimal level of variance of the injected signal that can still guarantee the convergence of the identification. Next, we add the designed input as a vector of Gaussian noises with decreasing variance to a known controller, proving that it can converge to the original controller. Simulations demonstrate the effectiveness of the proposed algorithms. © 2025 IEEE.

关键词： Least squares approximations

来源：评论

学校读者我要写书评

暂无评论

Curvature Adaptive control Based Path Following for Automatic Driving Vehicles in Private Area

引用

Journal of Shanghai Jiaotong university(Science) 2021年第5期26卷 690-698页

作者： SHI Qiang ZHANG Jianlin YANG Ming Department of Automation Key Laboratory of System Control and Information Processing of Ministry of EducationShanghai Jiao Tong UniversityShanghai 200240China

Path following refers to traveling along the desired path with automatic steering control,which is a crucial technology for automatic driving *** in private areas are highly irregular,resulting in a large curvature variation,which reduces the control accuracy of the path following.A curvature adaptive control(CAC)based path-following method was proposed to solve the problem mentioned ***,CAC takes advantage of the complementary characteristics in response to the path curvature fluctuation of pure pursuit and front-wheel feedback and by combining the two methods further enhances the immunity of the control accuracy in response to a curvature *** CAC,the quantitative indices of the path curvature fluctuation and control accuracy were *** model between the path curvature fluctuation and a dynamic parameter was identified using the quantitative index of the control accuracy as the optimization *** experimental results of a real vehicle indicate that the control accuracy of path following is further enhanced by its immunity in response to curvature fluctuation improved by the *** addition,CAC is easy to deploy and requires low demand for hardware resources.

关键词： automatic driving vehicles path following adaptive control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：