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

TechRxiv 2023年

作者： Yang, Songnan Zhang, Xiaohui Liu, Ding Bai, Wenqi Liu, Fan The School of Automation and Information Engineering Xi’an University of Technology Shaanxi 710048 China The Institute of Advanced Navigation and Electromagnetics Xi’an University of Technology Shaanxi 710048 China The State Key Laboratory of Eco-Hydraulics in the Northwest Arid Region of China Xi’an University of Technology Shaanxi 710048 China The Shaanxi Key Laboratory of Complex System Control with the Intelligent Information Processing Xi’an University of Technology Shaanxi 710048 China

Numerous studies have demonstrated that numerous animal species are capable of goal-directed navigation using environmental information for dead reckoning. The stable magnetic field of the earth provides important information for the migration of animals over long distances. Inspired by the goal-directed navigation of animals, a novel Geomagnetic Navigation with Temporal Attention-based Data-Driven Dead Reckoning (Attention-DR) method for Autonomous Underwater Vehicles (AUV) is presented in this article, which only utilizes the inclination angle (I) and the declination angle (D) of the Geomagnetic Field (GF) for underwater navigation without any prior knowledge of the geographical location or geographic map. This article proposes a Temporal Attention-based Long Short-Term Memory (TA-LSTM) neural network by combining history, GF information, and location in time series to achieve the optimization heading angle of underwater dead reckoning. Due to its ability to adjust the utilization weights of local and global temporal information in the path, TA-LSTM possesses the capability to continually update neural network model parameters through a data-driven process during the navigation process. This enables the Attention-DR to achieve efficient navigation in regions without prior magnetic maps and overcome navigation failures caused by magnetic field anomalies. The simulation outcomes confirm the efficiency, precision, and practicability of the proposed algorithm. © 2023, CC BY.

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

Deducing Complete Selection Rule Set for Driver Nodes to Guarantee Network’s Structural controllability

引用

IEEE/CAA Journal of Automatica Sinica 2019年第5期6卷 1152-1165页

作者： Xichen Wang Yugeng Xi Wenzhen Huang Shuai Jia the Department of Automation Shanghai Jiao Tong UniversityKey Laboratory of System Control and Information ProcessingMinistry of Education of ChinaShanghai200240

Structural controllability is critical for operating and controlling large-scale complex networks. In real applications, for a given network, it is always desirable to have more selections for driver nodes which make the network structurally controllable. Different from the works in complex network field where structural controllability is often used to explore the emergence properties of complex networks at a macro level,in this paper, we investigate it for control design purpose at the application level and focus on describing and obtaining the solution space for all selections of driver nodes to guarantee structural controllability. In accord with practical applications,we define the complete selection rule set as the solution space which is composed of a series of selection rules expressed by intuitive algebraic forms. It explicitly indicates which nodes must be controlled and how many nodes need to be controlled in a node set and thus is particularly helpful for freely selecting driver nodes. Based on two algebraic criteria of structural controllability, we separately develop an input-connectivity algorithm and a relevancy algorithm to deduce selection rules for driver nodes. In order to reduce the computational complexity,we propose a pretreatment algorithm to reduce the scale of network's structural matrix efficiently, and a rearrangement algorithm to partition the matrix into several smaller ones. A general procedure is proposed to get the complete selection rule set for driver nodes which guarantee network's structural controllability. Simulation tests with efficiency analysis of the proposed algorithms are given and the result of applying the proposed procedure to some real networks is also shown, and these all indicate the validity of the proposed procedure.

关键词： Algebraic criteria complete selection rule set structural controllability driver nodes

来源：评论

学校读者我要写书评

暂无评论

Sensor-based Multi-agent Coverage control with Spatial Separation in Unstructured Environments

arXiv

引用

arXiv 2024年

作者： Wang, Xinyi Xu, Jiwen Gao, Chuanxiang Chen, Yizhou Zhang, Jihan Wang, Chenggang Ding, Yulong Chen, Ben M. Department of Mechanical and Automation Engineering The Chinese University of Hong Kong N.T. Shatin Hong Kong Department of Automation Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Jiao Tong University Shanghai200240 China Department of Control Science and Engineering Tongji University Shanghai China Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education China

Multi-robot systems have increasingly become instrumental in tackling coverage problems. However, the challenge of optimizing task efficiency without compromising task success still persists, particularly in expansive, unstructured scenarios with dense obstacles. This paper presents an innovative, decentralized Voronoi-based coverage control approach to reactively navigate these complexities while guaranteeing safety. This approach leverages the active sensing capabilities of multi-robot systems to supplement GIS (Geographic information system), offering a more comprehensive and real-time understanding of environments like post-disaster. Based on point cloud data, which is inherently non-convex and unstructured, this method efficiently generates collision-free Voronoi regions using only local sensing information through spatial decomposition and spherical mirroring techniques. Then, deadlock-aware guided map integrated with a gradient-optimized, centroid Voronoi-based coverage control policy, is constructed to improve efficiency by avoiding exhaustive searches and local sensing pitfalls. The effectiveness of our algorithm has been validated through extensive numerical simulations in high-fidelity environments, demonstrating significant improvements in task success rate, coverage ratio, and task execution time compared with others. Copyright © 2024, The Authors. All rights reserved.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

End-to-end Flow Scheduling Optimization for Industrial 5G and TSN Integrated Networks

End-to-end Flow Scheduling Optimization for Industrial 5G an...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Houling Liu Mingyan Li Fuqiang Gu Qihao Li Weiting Zhang Songtao Guo College of Computer Science Chongqing University P. R. China Key Laboratory of System Control and Information Processing Ministry of Education of China P. R. China College of Communication Engineering Jilin University Changchun P. R. China School of Electronic and Information Engineering Beijing Jiaotong University Beijing P. R. China

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

The integrated of the fifth generation (5G) and time-sensitive networking (TSN) is a promising approach to meet the requirements of deterministic forwarding with extremely low latency and high flexibility for the Industrial Internet of Things (IIoT). However, due to the large dissimilarity of protocol stacks, the 5G system normally serves as a logical bridge for TSN, performing hold-and-forward operations in Base Stations (BSs) under the current 5G-TSN frameworks. To provide ubiquitous and seamless connectivity for IIoT devices, this paper focuses on the integrated enhancement of 5G and TSN by optimizing the scheduling of time-sensitive flows with end-to-end latency of 5G-TSN transmission taken into consideration. Specifically, we propose a novel architecture named GF-CQF, which combines 5G Grant-free (GF) access with TSN Cyclic Queuing and Forwarding (CQF). Subsequently, the distributed flow scheduling problem based on GF-CQF architecture is established due to the high timeliness demands. To alleviate the impact of the uncertainty inherent in 5G channels on end-to-end deterministic transmission, a feature-aware decentralized real-time scheduling (FDRS) policy based on Multi-agent Reinforcement Learning is proposed. FDRS allows each agent at BS to adaptively allocate TSN injection slots for flows mainly based on dynamic 5G transmission performance and TSN network resource state so that TSN queue overflow can be avoided and flow delay constraints can be guaranteed. Simulations show that FDRS offers superior scheduling capabilities under the limited TSN queue resources.

关键词： Wireless communication Training Job shop scheduling Uncertainty Protocols 5G mobile communication Reinforcement learning Real-time systems Resource management Industrial Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Autoregressive GNN-ODE GRU Model for Network Dynamics

arXiv

引用

arXiv 2022年

作者： Liang, Bo Wang, Lin Wang, Xiaofan Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Key Laboratory of Power Station Automation Technology School of Mechatronic Engineering and Automation Shanghai University Shanghai China

Revealing the continuous dynamics on the networks is essential for understanding, predicting, and even controlling complex systems, but it is hard to learn and model the continuous network dynamics because of complex and unknown governing equations, high dimensions of complex systems, and unsatisfactory observations. Moreover, in real cases, observed time-series data are usually non-uniform and sparse, which also causes serious challenges. In this paper, we propose an Autoregressive GNN-ODE GRU Model (AGOG) to learn and capture the continuous network dynamics and realize predictions of node states at an arbitrary time in a data-driven manner. The GNN module is used to model complicated and nonlinear network dynamics. The hidden state of node states is specified by the ODE system, and the augmented ODE system is utilized to map the GNN into the continuous time domain. The hidden state is updated through GRUCell by observations. As prior knowledge, the true observations at the same timestamp are combined with the hidden states for the next prediction. We use the autoregressive model to make a one-step ahead prediction based on observation history. The prediction is achieved by solving an initial-value problem for ODE. To verify the performance of our model, we visualize the learned dynamics and test them in three tasks: interpolation reconstruction, extrapolation prediction, and regular sequences prediction. The results demonstrate that our model can capture the continuous dynamic process of complex systems accurately and make precise predictions of node states with minimal error. Our model can consistently outperform other baselines or achieve comparable performance. Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

3d Surface Detection and Segmentation from Point Clouds Via Quadric Fits Based on Dbscan Clustering

SSRN

引用

SSRN 2024年

作者： Xie, Tingting Chen, Hui Liu, Wanquan Zhou, Rongyu Li, Qilin College of Automation Engineering Shanghai University of Electric Power Shanghai200090 China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China School of Intelligent Systems Engineering Sun Yat-sen University Guangzhou510275 China School of Electrical Engineering Computing and Mathematical Sciences Curtin University BentleyWA Australia

Extracting surfaces from 3D point clouds is significant in reconstructing and transforming these discrete points into their corresponding models. Scannedpoint clouds are often accompanied by noise, and the existing methods mainly rely on local feature similarities for surface extractions. Errors in estimatingthe feature information may lead to incorrect surface detection. In this paper we propose a surface extraction and boundary detection method based onclustering technique. The method can be described in three steps: In the first step, a normal correction is carried out using the information from theneighbourhood of points with sharp features. The second step is to cluster the points that meet the coplanar condition of the local quadric surface (LQS).In the third step, surface merger is performed by merging the local surfaces satisfying the merging conditions. Experimental validation is carried outto determine the effectiveness of the proposed method. The experimental results show improved surface extraction accuracy of the proposed methodin comparison to RANSAC, RG, LCCP, C2NO and HT methods. © 2024, The Authors. All rights reserved.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

GOGICP: A Real-time Gaussian Octree-based GICP Method for Faster Point Cloud Registration

GOGICP: A Real-time Gaussian Octree-based GICP Method for Fa...

引用

IEEE International Conference on Real-time Computing and Robotics (RCAR)

作者： Zhitao Yu Wei Yuan Hengwang Zhao Hanyang Zhuang Ming Yang Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Global Institute of Future Technology Shanghai Jiao Tong University Shanghai China University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350372601

ISBN: (纸本)9798350372618

Point cloud registration algorithms are crucial for robot localization based on prior maps. Classical methods often struggle to achieve both high accuracy and real-time performance simultaneously, as these two goals can conflict. This limitation impedes the application of point cloud registration in high-speed scenarios, such as the LiDAR localization of fast-moving robots, where both precision and real-time capabilities are essential. This paper proposes a real-time Gaussian Octree-based Generalized Iterative Closest Point (GICP) method, which leverages the censoring properties of the Gaussian Octree to expedite the nearest neighbor search and incorporates an incremental calculation of the Gaussian distribution to hasten the tree-building process. Experimental results show that the proposed method can achieve a 61.8% improvement in speed over GICP while maintaining accuracy comparable to that of GICP. The average registration accuracy is up to 5 cm, with an angular error of less than 0.2°, and the average registration time for a single frame is 77 ms, which satisfies the demands of practical application scenarios.

关键词： Point cloud compression Location awareness Accuracy Laser radar Octrees Semantics Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Size-invariance matters: rethinking metrics and losses for imbalanced multi-object salient object detection 24

Size-invariance matters: rethinking metrics and losses for i...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Feiran Li Qianqian Xu Shilong Bao Zhiyong Yang Runmin Cong Xiaochun Cao Qingming Huang Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China and School of Control Science and Engineering Shandong University Jinan China and Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Shenzhen Campus Sun Yat-sen University School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Submodularity-based False Data Injection Attack Scheme in Multi-agent Dynamical systems

arXiv

引用

arXiv 2022年

作者： Luo, Xiaoyu Zhao, Chengcheng Fang, Chongrong He, Jianping The Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China The State Key Laboratory of Industrial Control Technology Institute of Cyberspace Research Zhejiang University China The Department of Electrical and Computer Engineering University of Victoria BC Canada

Consensus in multi-agent dynamical systems is prone to be sabotaged by the adversary, which has attracted much attention due to its key role in broad applications. In this paper, we study a new false data injection (FDI) attack design problem, where the adversary with limited capability aims to select a subset of agents and manipulate their local multi-dimensional states to maximize the consensus convergence error. We first formulate the FDI attack design problem as a combinatorial optimization problem and prove it is NP-hard. Then, based on the submodularity optimization theory, we show the convergence error is a submodular function of the set of the compromised agents, which satisfies the property of diminishing marginal returns. In other words, the benefit of adding an extra agent to the compromised set decreases as that set becomes larger. With this property, we exploit the greedy scheme to find the optimal compromised agent set that can produce the maximum convergence error when adding one extra agent to that set each time. Thus, the FDI attack set selection algorithms are developed to obtain the near-optimal subset of the compromised agents. Furthermore, we derive the analytical suboptimality bounds and the worst-case running time under the proposed algorithms. Extensive simulation results are conducted to show the effectiveness of the proposed algorithm. Copyright © 2022, The Authors. All rights reserved.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

A Real-time Framework of Multi-Camera Vehicle Tracking system

A Real-time Framework of Multi-Camera Vehicle Tracking Syste...

引用

2024 IEEE International Conference on Real-Time Computing and Robotics, RCAR 2024

作者： Zhuang, Hanyang Chen, Xingyuan Lan, Jianglin Wang, Ying Lu, Zhaoxuan Wang, Chunxiang Yang, Ming University of Michigan Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai200240 China University of Glasgow James Watt School of Engineering GlasgowG12 8QQ United Kingdom Shanghai Jiao Tong University School of Mechanical Engineering Shanghai200040 China Shanghai Intelligent and Connected Vehicle R and D Center Co. LTD Shanghai201400 China Shanghai Jiao Tong University Department of Automation Shanghai200240 China Ministry of Education of China Key Laboratory of System Control and Information Processing Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China

ISBN: (纸本)9798350372601

Multi-camera vehicle tracking (MCVT) system is a key technology to build an intelligent city and intelligent transportation system. The MCVT system utilizes roadside monitoring devices and computing platforms to achieve city-level road traffic perception at a finer scale by tracking each vehicle on the road to obtain the trajectory. The existing MCVT system mainly focuses on dealing with the algorithm modules separately, without studying the real-time performance and system architecture of the entire pipeline. However, in real-world applications, many of the tricks in improving evaluation metrics are not applicable since there is endless traffic flow running all the time. Therefore, this paper proposes a real-time framework of the MCVT system to streamline all the algorithm modules with proper data flow. Firstly, a multi-threaded multi-vehicle tracking (MVT) module is developed to detect vehicles in each camera. Re-identification is implemented during MVT to provide the feature for tracking in the same camera and across different cameras. Then, after the vehicle leaves the camera field of view, the feature of vehicle trajectory is calculated by averaging the feature at each frame. Meanwhile, a background thread runs continuously to match the incoming feature of vehicle trajectory with past features by conducting a topology searching method. In the end, the vehicle trajectories with well-matched features are considered to be the same vehicle. The entire pipeline has been validated on two different datasets, the precision is 0.64 in the CityFlow dataset which uses 6 cameras simultaneously. In the customized dataset, the same method can still reach real-time when using 16 cameras at the same time with smaller network modules. © 2024 IEEE.

关键词： Vehicle locating systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：