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

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 Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

arXiv

引用

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Dark channel defogging enhancement algorithm for haze image in complex environment

Dark channel defogging enhancement algorithm for haze image ...

引用

Mechanical, automation and Electrical Engineering (CMAEE), International Conference on

作者： Jianjun Bao Haibo Wang Qiqi Kou Ke Luo Yangyang You Tiandi (Changzhou) Automation Co. Ltd. Changzhou China CCTEG Changzhou Research Institute Changzhou China School of Computer Science and Technology China University of Mining and Technology Xuzhou China School of Information and Control Engineering China University of Mining and Technology Xuzhou China

Under the lighting conditions of artificial light sources, point lighting causes the image to receive uneven light, leading to the characteristics of color distortion and poor dehazing enhancement effect when the existing dark channel dehazing algorithm is used for dehazing enhancement of haze images. Aiming to solve the above problems, this paper proposes a dark channel defogging enhancement algorithm for haze image in complex environment. First, by calculating the intensity histogram of the initial image, the corresponding mean, median and maximum value are obtained, and a novel brightness factor is constructed accordingly. Then, the over-bright areas in the image are extracted through the brightness factor and processed by down-value. Finally, the down-value image is used to estimate the atmospheric light value to enhance the accuracy of the atmospheric light value, so as to solve the problems of color distortion and poor dehazing effect. The experimental results show that the proposed algorithm has good applicability to dust fog images under non-uniform illumination. Compared with other advanced algorithms, the no-reference evaluation index ranks high, and the qualitative results are more realistic and natural.

关键词： Electrical engineering Deep learning Histograms Image color analysis Image edge detection Brightness Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization with Linear Convergence

Quantized Distributed Nonconvex Optimization with Linear Con...

引用

IEEE Conference on Decision and control

作者： Lei Xu Xinlei Yi Jiayue Sun Yang Shi Karl Henrik Johansson Tao Yang State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Mechanical Engineering University of Victoria Victoria Canada

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper considers distributed nonconvex op-timization for minimizing the average of local cost functions, by using local information exchange over undirected communication networks. Since the communication channels often have limited bandwidth or capacity, we first introduce a quantization rule and an encoder/decoder scheme to reduce the transmission bits. By integrating them with a distributed algorithm, we then propose a distributed quantized nonconvex optimization algorithm. Assuming the global cost function satisfies the Polyak– Łojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that the proposed algorithm linearly converges to a global optimal point. Moreover, a low data rate is shown to be sufficient to ensure linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical simulation examples.

关键词： Quantization (signal) Communication channels Bandwidth Cost function Numerical simulation Communication networks Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous Graph Reinforcement Learning for Dependency-aware Multi-task Allocation in Spatial Crowdsourcing

arXiv

引用

arXiv 2024年

作者： Zhao, Yong Zhu, Zhengqiu Gao, Chen Wang, En Huang, Jincai Wang, Fei-Yue College of Systems Engineering National University of Defense Technology Hunan Province Changsha410073 China BNRist Tsinghua University Beijing100084 China College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China

Spatial Crowdsourcing (SC) is gaining traction in both academia and industry, with tasks on SC platforms becoming increasingly complex and requiring collaboration among workers with diverse skills. Recent research works address complex tasks by dividing them into subtasks with dependencies and assigning them to suitable workers. However, the dependencies among subtasks and their heterogeneous skill requirements, as well as the need for efficient utilization of workers’ limited work time in the multi-task allocation mode, pose challenges in achieving an optimal task allocation scheme. Therefore, this paper formally investigates the problem of Dependency-aware Multi-task Allocation (DMA) and presents a well-designed framework to solve it, known as Heterogeneous Graph Reinforcement Learning-based Task Allocation (HGRL-TA). To address the challenges associated with representing and embedding diverse problem instances to ensure robust generalization, we propose a multi-relation graph model and a Compound-path-based Heterogeneous Graph Attention Network (CHANet) for effectively representing and capturing intricate relations among tasks and workers, as well as providing embedding of problem state. The task allocation decision is determined sequentially by a policy network, which undergoes simultaneous training with CHANet using the proximal policy optimization algorithm. Extensive experiment results demonstrate the effectiveness and generality of the proposed HGRL-TA in solving the DMA problem, leading to average profits that is 21.78% higher than those achieved using the metaheuristic methods. © 2024, CC BY-NC-ND.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

The Multi-Blockchain Based Data Trading Markets with Novel Pricing Mechanisms

SSRN

引用

SSRN 2022年

作者： Li, Juanjuan Li, Junqing Wang, Xiao Qin, Rui Yuan, Yong Wang, Fei-Yue The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Qingdao Academy of Intelligent Industries Qingdao266109 China School of Mathematics Renmin University of China Beijing100872 China Macao Institute of Systems Engineering Macau University of Science and Technology 999078 China

Aiming to deal with the challenge of data security and data pricing in data trading markets, we propose the novel multi-blockchain-based framework and design the related pricing mechanisms. Specifically, data recording and trading are conducted separately in the Data Blockchain (DChain) and the Value Blockchain (VChain). Based on these blockchains, two-layer data trading markets are established to manage the initial data trading in the primary market and the data resale in the secondary market. Pricing mechanisms are proposed to protect the formulated data trading markets against strategic trading behaviors and balance the payoffs of both suppliers and users. In the regular data trading on VChain-S2D, two auction models are used to deal with users' strategic bidding in terms of the demand scale, where the incentive-compatible Vickrey-Clarke-Groves (VCG) model is dedicated to the low-demand trading scenario, while the nearly incentive-compatible Monopolistic Price (MP) model is for the high-demand trading scenario. In the temporary data trading on VChain-D2S, a reverse auction mechanism named Two-Stage Obscure Selection (TSOS) is designed to regulate both suppliers' quoting and users' valuation strategies. Moreover, experiments are carried out to validate our theoretical analysis. Our work is expected to enhance the data security and improve the trading efficiency. © 2022, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Introduction to MATLAB

Advanced Textbooks in Control and Signal Processing

引用

Advanced Textbooks in control and Signal Processing 2019年 1-27页

作者： Keviczky, László Bars, Ruth Hetthéssy, Jenő Bányász, Csilla Institute for Computer Science and Control Hungarian Academy of Sciences Budapest Hungary Department of Automation and Applied Informatics Budapest University of Technology and Economics Budapest Hungary

MATLAB™ is an interactive environment for scientific and engineering calculations, simulations, and data visualization. MATLAB™ provides a powerful platform to solve mathematical and engineering problems related to matrix algebra, differential equations, etc. MATLAB is especially effective in solving control problems. SIMULINK provides block-oriented simulation. The chapter gives a short introduction to MATLAB and SIMULINK. © Springer Nature Singapore Pte Ltd. 2019.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Audio Deepfake Detection Based on a Combination of F0 Information and Real Plus Imaginary Spectrogram Features

arXiv

引用

arXiv 2022年

作者： Xue, Jun Fan, Cunhang Lv, Zhao Tao, Jianhua Yi, Jiangyan Zheng, Chengshi Wen, Zhengqi Yuan, Minmin Shao, Shegang School of Computer Science and Technology Anhui University Hefei China NLPR Institute of Automation Chinese Academy of Sciences Beijing China Institute of Acoustics Chinese Academy of Sciences Beijing China Qiyuan Laboratory Beijing China National Environmental Protection Engineering and Technology Center Road Traffic Noise Control Research Institute of Highway Ministry of Transport Beijing China

Recently, pioneer research works have proposed a large number of acoustic features (log power spectrogram, linear frequency cepstral coefficients, constant Q cepstral coefficients, etc.) for audio deepfake detection, obtaining good performance, and showing that different subbands have different contributions to audio deepfake detection. However, this lacks an explanation of the specific information in the subband, and these features also lose information such as phase. Inspired by the mechanism of synthetic speech, the fundamental frequency (F0) information is used to improve the quality of synthetic speech, while the F0 of synthetic speech is still too average, which differs significantly from that of real speech. It is expected that F0 can be used as important information to discriminate between bonafide and fake speech, while this information cannot be used directly due to the irregular distribution of F0. Insteadly, the frequency band containing most of F0 is selected as the input feature. Meanwhile, to make full use of the phase and full-band information, we also propose to use real and imaginary spectrogram features as complementary input features and model the disjoint subbands separately. Finally, the results of F0, real and imaginary spectrogram features are fused. Experimental results on the ASVspoof 2019 LA dataset show that our proposed system is very effective for the audio deepfake detection task, achieving an equivalent error rate (EER) of 0.43%, which surpasses almost all systems. Copyright © 2022, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Fusionplanner: A Multi-Task Motion Planner for Mining Trucks Using Multisensor Fusion Method

SSRN

引用

SSRN 2023年

作者： Teng, Siyu Chen, Long Li, Luxi Li, Yuchen Hu, Xuein Li, Lingxi Ai, Yunfeng Department of Computer Science Hong Kong Baptist University Hong Kong The School of Artificial Intelligence Hubei University Wuhan China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences China Waytous Inc. Haidian Distinct Beijing China Indianapolis United States School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China

In recent years, significant achievements have been made in motion planning for intelligent vehicles. However, as a typical unstructured environment, open-pit mining attracts limited attention due to its complex operational conditions and adverse environmental factors. A comprehensive paradigm for unmanned transportation in open-pit mines is proposed in this research, including a simulation platform, a testing benchmark, and a trustworthy and robust motion planner. Firstly, we introduce the Parallel Mining Simulator (PMS), a high-fidelity simulator specifically designed for open-pit mining scenarios. PMS enables to management and control of open-pit mine transportation from both the single-truck control and multi-truck scheduling perspectives. Then, we develop a novel benchmark called MiningNav, which offers three validation approaches suitable for transportation roads. The purpose of MiningNav is to evaluate the trustworthiness and robustness of algorithms in open-pit mines. Finally, we propose the first multi-task motion planning algorithm, called FusionPlanner, for the mining truck by the multisensor fusion method to adapt both lateral and longitudinal control tasks for unmanned transportation. We validate the performance of our planner using MiningNav in PMS, and empirical results demonstrate a significant reduction in the number of collisions and takeovers of FusionPlanner, thereby improving overall trustworthiness and robustness. © 2023, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

The Multi-Blockchain Based Data Trading Markets with Novel Pricing Mechanisms

SSRN

引用

SSRN 2022年

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：