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

6th International Conference on Computing and Data Engineering, ICCDE 2020 and 2020 International Conference on Artificial Intelligence in Electronics Engineering, AIEE 2020

作者： Zhao, Bo Hou, Jiaxu Guo, Ping Liu, Derong Xu, Yancai School of Systems Science Beijing Normal University Beijing100875 China School of Automation Guangdong University of Technology Guangzhou510006 China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9781450376730

In this paper, the approximate optimal control problem for nonlinear systems with mismatched perturbations is addressed through asymptotically stable critic neural network (NN). By employing the estimated perturbation via nonlinear perturbation observer, the online updated value function is constructed to reflect the real-time perturbations, regulation and control simultaneously. In order to solve the Hamilton-Jacobi-Bellman equation, an asymptotically stable critic NN is established based on the novel nested update laws. Thus, the approximate optimal control is obtained to guarantee the closed-loop system to be uniformly ultimately bounded based on the Lyapunov's direct method. Simulation results illustrate the effectiveness of the developed control scheme. © 2020 ACM International Conference Proceeding Series. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Joining Edge-Enabled Metaverse Services with Network Externality: A Stackelberg Game Approach

Joining Edge-Enabled Metaverse Services with Network Externa...

引用

2023 IEEE International Conference on Metaverse Computing, Networking and Applications, MetaCom 2023

作者： Jiang, Yuna Kang, Jiawen Niyato, Dusit Ge, Xiaohu Xiong, Zehui Xu, Minrui Deng, Ruilong Huazhong University of Science and Technology School of Electronic Information and Communications Wuhan China Guangdong University of Technology School of Automation Guangzhou China Nanyang Technological University School of Computer Science and Engineering Singapore Singapore University of Technology and Design Pillar of Information Systems Technology and Design Singapore Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou China Shenzhen Huazhong University of Science and Technology Research Institute China

ISBN: (纸本)9798350333336

The metaverse is defined as a three-dimensional virtual-real fusion network focused on social connection. Edge computing can empower the metaverse by providing computing resources to realize real-time motion tracking, visual or auditory rendering and virtual scene dynamic change at the edge of networks. Users enjoy the immersive experience provided by the Metaverse Service Provider (MSP), and interact through digital avatars in the virtual world by requesting metaverse services. In this paper, we formulate the edge computing resources pricing, metaverse service rendering bitrate pricing and request problem in the metaverse. Especially, we model the interactions among edge servers, the MSP and Metaverse Service Users (MSUs) as a hierarchical three-stage Stackelberg game. The problem of joining edge-enabled metaverse services is also studied with the consideration of network externality, including the network effect and congestion effect. Based on the backward induction method, we derive the optimal computing resources pricing of edge servers, rendering bitrate pricing of the MSP, and rendering bitrate requests of MSUs. We also prove the existence and uniqueness of the Stackelberg game equilibrium. Simulation results show that the network effect can bring more positive utilities to entities when the social tie coefficient among MSUs is higher. Besides, all entities in the edge-enabled metaverse are affected negatively by the congestion effect. © 2023 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

InTEn-LOAM: Intensity and Temporal Enhanced LiDAR Odometry and Mapping

arXiv

引用

arXiv 2022年

作者： Li, Shuaixin Tian, Bin Xiaozhou, Zhu Jianjun, Gui Wen, Yao Li, Guangyun The National Innovation Institute of Defence Technology PLA Academy of Military Sciences Beijing100079 China The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Science Beijing100081 China The Department of Geospatial Information PLA Information Engineering University Zhengzhou450001 China

Traditional LiDAR odometry (LO) systems mainly leverage geometric information obtained from the traversed surroundings to register laser scans and estimate LiDAR ego-motion, while it may be unreliable in dynamic or unstructured environments. This paper proposes InTEn-LOAM, a low-drift and robust LiDAR odometry and mapping method that fully exploits implicit information of laser sweeps (i.e., geometric, intensity, and temporal characteristics). Scanned points are projected to cylindrical images, which facilitate the efficient and adaptive extraction of various types of features, i.e., ground, beam, facade, and reflector. We propose a novel intensity-based points registration algorithm and incorporate it into the LiDAR odometry, enabling the LO system to jointly estimate the LiDAR ego-motion using both geometric and intensity feature points. To eliminate the interference of dynamic objects, we propose a temporal-based dynamic object removal approach to filter them out before map update. Moreover, the local map is organized and downsampled using a temporal-related voxel grid filter to maintain the similarity between the current scan and the static local map. Extensive experiments are conducted on both simulated and real-world datasets. The results show that the proposed method achieves similar or better accuracy w.r.t the state-of-the-arts in normal driving scenarios and outperforms geometric-based LO in unstructured environments. © 2022, CC BY.

关键词： Optical radar

来源：评论

学校读者我要写书评

暂无评论

A non-interactive verifiable computation model of perceptual layer data based on CP-ABE 2

A non-interactive verifiable computation model of perceptual...

引用

2nd International Conference on Consumer Electronics and Computer Engineering, ICCECE 2022

作者： Zhao, Jianming Miao, Weiwei Zeng, Zeng Chinese Academy of Sciences Key Laboratory of Networked Control Systems Shenyang China Chinese Academy of Sciences Shenyang Institute of Automation Shenyang China Chinese Academy of Sciences Institutes for Robotics and Intelligent Manufacturing Shenyang China State Grid Jiangsu Electric Power Co. Ltd. Information Telecommunication Branch Nanjing China

ISBN: (纸本)9781665408868

The computing of smart devices at the perception layer of the power Internet of Things is often insufficient, and complex computing can be outsourced to server resources such as the cloud computing, but the allocation process is not safe and controllable. Under special constraints of the power Internet of Things such as multi-users and heterogeneous terminals, we propose a CP-ABE-based non-interactive verifiable computation model of perceptual layer data. This model is based on CP-ABE, NPOT, FHE and other relevant safety and verifiable theories, and designs a new multi-user non-interactive secure verifiable computing scheme to ensure that only users with the decryption key can participate in the execution of NPOT Scheme. In terms of the calculation process design of the model, we gave a detailed description of the system model, security model, plan. Based on the definition given, the correctness and safety of the non-interactive safety verifiable model design in the power Internet of Things environment are proved, and the interaction cost of the model is analyzed. Finally, it proves that the CP-ABE-based non-interactive verifiable computation model for the perceptual layer proposed in this paper has greatly improved security, applicability, and verifiability, and is able to meet the security outsourcing of computing in the power Internet of Things environment. © 2022 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Research on cloud-side collaborative task migration strategy based on simulated annealing-Bee Colony Algorithm in Power IoT 2

Research on cloud-side collaborative task migration strategy...

引用

2nd International Conference on Consumer Electronics and Computer Engineering, ICCECE 2022

作者： Zhang, Bowen Zeng, Zeng Miao, Weiwei Chinese Academy of Sciences Key Laboratory of Networked Control Systems Shenyang China Chinese Academy of Sciences Shenyang Institute of Automation Shenyang China Chinese Academy of Sciences Institutes for Robotics and Intelligent Manufacturing Shenyang China State Grid Jiangsu Electric Power Co. Ltd. Information Telecommunication Branch Nanjing China

ISBN: (纸本)9781665408868

In the power IoT, in order to make up for the shortcomings of insufficient computing capabilities of edge-side devices, cloud-side collaboration technology has attracted more and more attention. The cloud-side collaboration technology relies on the selection of task migration strategies. However, when the existing migration strategies face the complex edge-side terminal devices in the power IoT, the energy consumption and delay performance are not good enough, which greatly affects the user's power experience. Therefore, it is very valuable to study a cloud-side collaborative task migration strategy under the power IoT environment. This paper proposes a task migration strategy based on simulated annealing-Bee Colony Algorithm in the environment of power IoT, which can solve the problem of task migration. Experimental results show that compared with the existing popular methods, this method has advantages in terms of energy consumption and time delay. This research can meet the real-time requirements of the power IoT, while reducing energy consumption and improving the user's power experience, thereby promoting the further development of the power IoT. © 2022 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

GotFlow3D: Recurrent Graph Optimal Transport for Learning 3D Flow Motion in Particle Tracking

arXiv

引用

arXiv 2022年

作者： Liang, Jiaming Xu, Chao Cai, Shengze Hangzhou310027 China The State Key Laboratory of Industrial Control Technology The National Engineering Center for Industrial Automation The Institute of Cyber-Systems & Control at ZJU ZJU Huzhou Institute China The Institute of Cyber-Systems & Control College of Control Science & Engineering Zhejiang University Hangzhou310027 China

Flow visualization technologies such as particle tracking velocimetry (PTV) are broadly used in understanding the all-pervasiveness three-dimensional (3D) turbulent flow from nature and industrial processes. Despite the advances in 3D acquisition techniques, the developed motion estimation algorithms in particle tracking remain great challenges of large particle displacements, dense particle distributions and high computational cost. By introducing a novel deep neural network based on recurrent Graph Optimal Transport, called GotFlow3D, we present an end-to-end solution to learn the 3D fluid flow motion from double-frame particle sets. The proposed network constructs two graphs in the geometric and feature space and further enriches the original particle representations with the fused intrinsic and extrinsic features learnt from a graph neural network. The extracted deep features are subsequently utilized to make optimal transport plans indicating the correspondences of particle pairs, which are then iteratively and adaptively retrieved to guide the recurrent flow learning. Experimental evaluations, including assessments on numerical experiments and validations on real-world experiments, demonstrate that the proposed GotFlow3D achieves state-of-the-art performance against both recently-developed scene flow learners and particle tracking algorithms, with impressive accuracy, robustness and generalization ability, which can provide deeper insight into the complex dynamics of broad physical and biological systems. © 2022, CC BY.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

GSLB: The Graph Structure Learning Benchmark 37

GSLB: The Graph Structure Learning Benchmark

引用

37th Conference on Neural Information Processing systems, NeurIPS 2023

作者： Li, Zhixun Wang, Liang Sun, Xin Luo, Yifan Zhu, Yanqiao Chen, Dingshuo Luo, Yingtao Zhou, Xiangxin Liu, Qiang Wu, Shu Yu, Jeffrey Xu Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong Center for Research on Intelligent Perception and Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Department of Automation University of Science and Technology of China China School of Cyberspace Security Beijing University of Posts and Telecommunications China Department of Computer Science University of California Los Angeles United States Heinz College of Information Systems and Public Policy Machine Learning Department School of Computer Science Carnegie Mellon University United States

ISBN: (纸本)9781713899921

Graph Structure Learning (GSL) has recently garnered considerable attention due to its ability to optimize both the parameters of Graph Neural Networks (GNNs) and the computation graph structure simultaneously. Despite the proliferation of GSL methods developed in recent years, there is no standard experimental setting or fair comparison for performance evaluation, which creates a great obstacle to understanding the progress in this field. To fill this gap, we systematically analyze the performance of GSL in different scenarios and develop a comprehensive Graph Structure Learning Benchmark (GSLB) curated from 20 diverse graph datasets and 16 distinct GSL algorithms. Specifically, GSLB systematically investigates the characteristics of GSL in terms of three dimensions: effectiveness, robustness, and complexity. We comprehensively evaluate state-of-the-art GSL algorithms in node- and graph-level tasks, and analyze their performance in robust learning and model complexity. Further, to facilitate reproducible research, we have developed an easy-to-use library for training, evaluating, and visualizing different GSL methods. Empirical results of our extensive experiments demonstrate the ability of GSL and reveal its potential benefits on various downstream tasks, offering insights and opportunities for future research. The code of GSLB is available at: https://***/GSL-Benchmark/GSLB. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

S$^{\text{4}}$TP: Social-Suitable and Safety-Sensitive Trajectory Planning for Autonomous Vehicles

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on Intelligent Vehicles 2023年第2期9卷 3220-3231页

作者： Xiao Wang Ke Tang Xingyuan Dai Jintao Xu Quancheng Du Rui Ai Yuxiao Wang Weihao Gu Engineering Research Center of Autonomous Unmanned System Technology Ministry of Education Anhui University Hefei China Haomo Technology Company Ltd. Beijing China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Qingdao Academy of Intelligent Industries Qingdao China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China

In public roads, autonomous vehicles (AVs) face the challenge of frequent interactions with human-driven vehicles (HDVs), which render uncertain driving behavior due to varying social characteristics among humans. To effectively assess the risks prevailing in the vicinity of AVs in social interactive traffic scenarios and achieve safe autonomous driving, this article proposes a social-suitable and safety-sensitive trajectory planning (S $^{\text{4}}$ TP) framework. Specifically, S $^{\text{4}}$ TP integrates the Social-Aware Trajectory Prediction (SATP) and Social-Aware Driving Risk Field (SADRF) modules. SATP utilizes Transformers to effectively encode the driving scene and incorporates an AV's planned trajectory during the prediction decoding process. SADRF assesses the expected surrounding risk degrees during AVs-HDVs interactions, each with different social characteristics, visualized as two-dimensional heat maps centered on the AV. SADRF models the driving intentions of the surrounding HDVs and predicts trajectories based on the representation of vehicular interactions. S $^{\text{4}}$ TP employs an optimization-based approach for motion planning, utilizing the predicted HDVs' trajectories as input. With the integration of SADRF, S $^{\text{4}}$ TP executes real-time online optimization of the planned trajectory of AV within low-risk regions, thus improving the safety and the interpretability of the planned trajectory. We have conducted comprehensive tests of the proposed method using the SMARTS simulator. Experimental results in complex social scenarios, such as unprotected left-turn intersections, merging, cruising, and overtaking, validate the superiority of our proposed S $^{\text{4}}$ TP in terms of safety and rationality. S $^{\text{4}}$ TP achieves a pass rate of 100% across all scenarios, surpassing the current state-of-the-art methods Fanta of 98.25% and Predictive-Decision of 94.75%.

关键词： Trajectory Safety Vehicles Trajectory planning Autonomous vehicles Risk management Behavioral sciences

来源：评论

学校读者我要写书评

暂无评论

Distributed stochastic projection-free solver for constrained optimization

arXiv

引用

arXiv 2022年

作者： Jiang, Xia Zeng, Xianlin Xie, Lihua Sun, Jian Chen, Jie Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China The Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China The School of Electrical and Electronic Engineering Nanyang Technological University Singapore639798 Singapore The School of Electronic and Information Engineering Tongji University Shanghai200082 China

This paper proposes a distributed stochastic projection-free algorithm for large-scale constrained finite-sum optimization whose constraint set is complicated such that the projection onto the constraint set can be expensive. The global cost function is allocated to multiple agents, each of which computes its local stochastic gradients and communicates with its neighbors to solve the global problem. Stochastic gradient methods enable low computational cost, while they are hard and slow to converge due to the variance caused by random sampling. To construct a convergent distributed stochastic projection-free algorithm, this paper incorporates a variance reduction technique and gradient tracking technique in the Frank-Wolfe update. We develop a sampling rule for the variance reduction technique to reduce the variance introduced by stochastic gradients. Complete and rigorous proofs show that the proposed distributed projection-free algorithm converges with a sublinear convergence rate and enjoys superior complexity guarantees for both convex and non-convex objective functions. By comparative simulations, we demonstrate the convergence and computational efficiency of the proposed algorithm. © 2022, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive fuzzy event-triggered and precision trajectory tracking control for underwater tracked robot

引用

Ocean Engineering 2025年 334卷

作者： Yao, Xiaolong Feng, Kelin Li, Kewen Li, Yongming Wang, Yu Sun, Wenxing Fan, Yazhou Wang, Zheng Lin, Guohai College of Electrical Engineering Liaoning University of Technology Liaoning Jinzhou121001 China College of Science Liaoning University of Technology Liaoning Jinzhou121001 China Key Laboratory of Man agement and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China Electric Power Research Institute Guangdong power grid Corporation Guangdong Guangzhou510080 China

This article investigates the robust adaptive fuzzy event-triggered precision trajectory tracking control issue for an underwater tracked robot (UTR) with modeling uncertainties. Firstly, considering the mechanical characteristics of the robot's underwater trenching and movement process, the UTR model is constructed. Meanwhile, the fuzzy logic systems (FLSs) are adopted to approximate the unknown UTR nonlinearities. The time-varying constraint conditions inserting the predefined performance functions are skillfully constructed to ensure that the UTR evades the possible singularity issue. Moreover, the designed predefined performance functions can achieve trajectory tracking of the UTR with the predefined settling time and accuracy, straightforward. By constructing the disturbance observer, the compacts caused by seabed current disturbance and the fuzzy approximation errors can be estimated. In the control design, to reduce the update frequency of the control signals from the controller to the actuator for the UTR, a novel robust adaptive fuzzy event-triggered trajectory tracking constraint control scheme is developed via designing the logarithmic barrier functions (LBFs), which cannot only minimize communication resource consumption in the tracking process and possess strong robustness against disturbances, but also ensure that all control signals are bounded. Finally, to demonstrate the effectiveness of the proposed control algorithm, the simulation results are provided. © 2025

关键词： control nonlinearities

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：