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

arXiv 2021年

作者： Xiong, Mingliang Liu, Qingwen Wang, Gang Giannakis, Georgios B. Zhang, Sihai Zhu, Jinkang Huang, Chuan College of Electronics and Information Engineering Tongji University Shanghai201804 China State Key Lab of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China Department of Electrical and Computer Engineering University of Minnesota MinneapolisMN55455 United States Key Lab of Wireless-Optical Communications University of Science and Technology of China Hefei Anhui230026 China School of Science and Engineering Chinese University of Hong Kong Shenzhen Guangdong518172 Hong Kong

Resonant beam communications (RBCom) is capable of providing wide bandwidth when using light as the carrier. Besides, the RBCom system possesses the characteristics of mobility, high signal-to-noise ratio (SNR), and multiplexing. Nevertheless, the channel of the RBCom system is distinct from other light communication technologies due to the echo interference issue. In this paper, we reveal the mechanism of the echo interference and propose the method to eliminate the interference. Moreover, we present an exemplary design based on frequency shifting and optical filtering, along with its mathematic model and performance analysis. The numerical evaluation shows that the channel capacity is greater than 15 bit/s/Hz. Copyright © 2021, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Double Deep Q-learning for Anti-saturation Attack Problem of Warship Group

Double Deep Q-learning for Anti-saturation Attack Problem of...

引用

Digital Twins and Parallel Intelligence (DTPI), IEEE International Conference on

作者： Wei Li Gang Xiong Hao Tao Yunjun Han Fang Wang Xisong Dong Zhen Shen State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences School of Artificial Intelligence University of Chinese Academy of Sciences Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences China China Ship Development and Design Center Wuhan China School of Control Science and Engineering (CSE) Shandong University Jinan China Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences Dongguan China

Anti-saturation attack (ASA) strategy is vital for the survival of a warship group, and attracts the focus of many researchers. In this paper, the dynamics of ASA is formulated as a Markov decision Process (MDP) with an enhanced states space since those characters are involved, such as the formation and detection and interception areas of warship group. A reinforcement learning method (Double Deep Q-leaning, DDQN) is developed to solve the problem and deal with the curse of dimensionality whereby the cost-to-go value is calculated by a marine engagement simulation system. A heuristic defense algorithm guided by field expert knowledge is designed for comparison. The experimental results show that the DDQN method performs better in anti-saturation attack scenarios.

关键词： Industries Heuristic algorithms Digital twin Conferences Knowledge based systems Reinforcement learning Markov processes

来源：评论

学校读者我要写书评

暂无评论

Feature Aggregation Attention Network for Single Image Dehazing

Feature Aggregation Attention Network for Single Image Dehaz...

引用

IEEE International Conference on Image Processing

作者： Lan Yan Wenbo Zheng Chao Gou Fei-Yue Wang The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China School of Software Engineering Xi’an Jiaotong University Xi’an China School of Intelligent Systems Engineering Sun Yat-sen University Guangzhou China

ISBN: (数字)9781728163956

ISBN: (纸本)9781728163963

Due to its ill-posed nature, single image dehazing is a challenging problem. In this paper, we propose an end-to-end feature aggregation attention network (FAAN) for single image dehazing. It incorporates the idea of attention mechanism and residual learning and can adaptively aggregate different level features. In particular, in the proposed FANN, we design a novel block structure consisting of feature attention module, smoothed dilated convolution and local residual learning. The local residual learning allows the less useful information to be bypassed through multiple skip connections. The feature attention module is designed to assign more weight to important features. The smoothed dilated convolution is adopted to enlarge the receptive field without the negative influence of gridding artifacts. The experiments on the RESIDE dataset show that the proposed approach acquires state-of-the-art performance in both qualitative and quantitative measures.

关键词： Convolution Atmospheric modeling Kernel Image color analysis Task analysis Training

来源：评论

学校读者我要写书评

暂无评论

A Collision-Free Person-Following Approach Based on Path Planning

A Collision-Free Person-Following Approach Based on Path Pla...

引用

IEEE International Conference on Mechatronics and Automation

作者： Lei Pang Zhiqiang Cao Junzhi Yu Weimin Zhang Xuechao Chen State Key Laboratory of Management and Control for Complex Systems Institute of Automation School of Artificial Intelligence University of Chinese Academy of Sciences BIC-ESAT College of Engineering Peking University Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology

ISBN: (数字)9781728164168

ISBN: (纸本)9781728164175

Person following is a crucial capability for mobile robots in tasks of human assistance and cooperation. In this paper, a person-following approach based on path planning is proposed for mobile robots, which takes person following and obstacle avoidance into account in a unified framework. The proposed approach is comprised of a sensing module and a planning module. The sensing module with a camera and a 3D LiDAR is employed to locate the target person and perceive obstacles. For the planning module, the combination of global planner and local planner effectively outputs collision-free paths and control commands for a mobile robot to keep following the target person. Experiments were conducted to evaluate the performance of the proposed approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization

arXiv

引用

arXiv 2021年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Chai, Tianyou Johansson, Karl H. The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden The Digital Futures Stockholm10044 Sweden The Department of Control Science and Engineering College of Electronics and Information Engineering The Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai 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

This paper considers the distributed online convex optimization problem with time-varying constraints over a network of agents. This is a sequential decision making problem with two sequences of arbitrarily varying convex loss and constraint functions. At each round, each agent selects a decision from the decision set, and then only a portion of the loss function and a coordinate block of the constraint function at this round are privately revealed to this agent. The goal of the network is to minimize the network-wide loss accumulated over time. Two distributed online algorithms with full-information and bandit feedback are proposed. Both dynamic and static network regret bounds are analyzed for the proposed algorithms, and network cumulative constraint violation is used to measure constraint violation, which excludes the situation that strictly feasible constraints can compensate the effects of violated constraints. In particular, we show that the proposed algorithms achieve O(T max{κ,1-κ}) static network regret and O(T 1-κ/2) network cumulative constraint violation, where T is the time horizon and κ ∈ (0, 1) is a user-defined trade-off parameter. Moreover, if the loss functions are strongly convex, then the static network regret bound can be reduced to O(T κ). Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2021, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-based Framework for Collaborative Production in Distributed and Social Manufacturing

A Blockchain-based Framework for Collaborative Production in...

引用

2019 IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2019

作者： Ouyang, Liwei Yuan, Yong Wang, Fei-Yue State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Qingdao Academy of Intelligent Industries Qingdao266109 China

ISBN: (纸本)9781728128535

In recent years, novel collaborative production paradigms, such as (re-)distributed manufacturing and social manufacturing, have attracted intensive attention due to their potential of further changing the existing manufacturing modes and industrial structures. Blockchain, as a new distributed computing architecture, is expected to be successfully used in manufacturing, and help solve issues related to interoperability and collaboration, security and supervision, marketization and protocol, democratic organization and global value chain governance, and so on. In this paper, a blockchain-based framework for collaborative production is proposed, aiming at providing novel ideas for the design, implementation and optimization of collaborative production, and also inspiring the upgrading and transformation of manufacturing industries. © 2019 IEEE.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

An Improved Version of DMOEA-εC for Many-objective Optimization Problems: IDMOEA-εC

An Improved Version of DMOEA-εC for Many-objective Optimiza...

引用

第三十八届中国控制会议

作者： Juan Li Bin Xin School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology

The decomposition strategy and the ε-constraint method are two important strategies in the field of multi-objective optimization. DMOEA-εC first attempts to incorporate the ε-constraint method into the decomposition strategy and solve a multi-objective optimization problem(MOP) via optimizing a series of scalar constrained subproblems collaboratively with the help of information from neighboring subproblems. However, given the inefficiency of applying DMOEA-εC to deal with many-objective optimization problems(MaOPs), a two-stage upper bound vectors generation procedure is proposed to generate widely spread upper bound vectors in a high-dimensional space. Besides, a boundary points maintenance mechanism is put forward to remedy the diversity loss of a population in DMOEA-εC. Based on the above, DMOEA-εC with the two-stage upper bound vectors generation procedure and the boundary points maintenance mechanism, named as IDMOEA-εC, is presented for MaOPs. IDMOEA-εC is compared with four state-of-the-art many-objective evolutionary algorithms, including HypE, NSGA-Ⅲ, MOEADD, and Two Arch2. Experimental studies demonstrate that IDMOEA-εC outperforms or performs competitively against these algorithms on the majority of sixteen DTLZ test instances with up to 10 objectives.

关键词： Many-objective optimization decomposition ε-constraint method two-stage upper bound vectors generation procedure boundary points maintenance mechanism

来源：评论

学校读者我要写书评

暂无评论

Webly Supervised Knowledge Embedding Model for Visual Reasoning

Webly Supervised Knowledge Embedding Model for Visual Reason...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Wenbo Zheng Lan Yan Chao Gou Fei-Yue Wang School of Software Engineering Xi'an Jiaotong University The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences School of Artificial Intelligence University of Chinese Academy of Sciences School of Intelligent Systems Engineering Sun Yat-sen University

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

Visual reasoning between visual image and natural language description is a long-standing challenge in computer vision. While recent approaches offer a great promise by compositionality or relational computing, most of them are oppressed by the challenge of training with datasets containing only a limited number of images with ground-truth texts. Besides, it is extremely time-consuming and difficult to build a larger dataset by annotating millions of images with text descriptions that may very likely lead to a biased model. Inspired by the majority success of webly supervised learning, we utilize readily-available web images with its noisy annotations for learning a robust representation. Our key idea is to presume on web images and corresponding tags along with fully annotated datasets in learning with knowledge embedding. We present a two-stage approach for the task that can augment knowledge through an effective embedding model with weakly supervised web data. This approach learns not only knowledge-based embeddings derived from key-value memory networks to make joint and full use of textual and visual information but also exploits the knowledge to improve the performance with knowledge-based representation learning for applying other general reasoning tasks. Experimental results on two benchmarks show that the proposed approach significantly improves performance compared with the state-of-the-art methods and guarantees the robustness of our model against visual reasoning tasks and other reasoning tasks.

关键词： Visualization Cognition Knowledge based systems Task analysis Knowledge engineering Modulation Robustness

来源：评论

学校读者我要写书评

暂无评论

Graph Optimization Based Long-distance GPS/IMU Integrated Navigation

Graph Optimization Based Long-distance GPS/IMU Integrated Na...

引用

第三十八届中国控制会议

作者： Xiaojie Gu Fengdi Zhang Jian Xu Qing Yuan Hongwei Ma Xiangdong Liu Zhen Li School of Automation and Key Laboratory for Intelligent Control & Decision on Complex Systems Beijing Institute of Technology Beijing Aerospace Automatic Control Institute National Key Laboratory of Science and Technology on Aerospace Intelligence Control Beijing

The accurate position estimation plays an critical role in the autonomous navigation for Micro Aerial Vehicles(MAV).Global positioning System(GPS) and inertial measurement unit(IMU) are two common sensors for navigation widely used on MAVs in the urban environment. Both of them have its distinct disadvantages that the GPS is susceptible to environmental interference and the IMU has accumulative errors. To overcome these problems, a GPS/IMU integrated system based on the factor graph optimization is developed in this paper. Unlike the conventional extended Kalman filter(EKF)-based method, the graph optimization method takes the whole trajectory into consideration so that it can achieve enough accuracy even after a long distance. Furthermore, the IMU preintegration method is used to avoid the repeated computation of high-rate IMU *** with the EKF method, the experimental results on the Zurich urban micro aerial vehicle dataset show the superior accuracy of the proposed factor graph optimization algorithm.

关键词： Global positioning System(GPS) inertial measurement unit(IMU) IMU preintegration graph optimization integrated navigation

来源：评论

学校读者我要写书评

暂无评论

An Efficient Restart-Enhanced Genetic Algorithm for the Coalition Formation Problem 1

引用

13th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2018

作者： Guo, Miao Xin, Bin Chen, Jie Wang, Yipeng School of Automation State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology Beijing100081 China

ISBN: (数字)9789811328268

ISBN: (纸本)9789811328251

In multi-agent system (MAS), the coalition formation (CF) is an important problem focusing on allocating agents to different tasks. In this paper, the single-task single-coalition (STSC) formation problem is considered. The mathematical model of the STSC problem is built with the objective of minimizing the total cost with the ability constraint. Besides, an efficient restart-enhanced genetic algorithm (REGA) is designed to solve the STSC problem. Furthermore, this paper constructs a comparison experiment, employing a random sampling method, an estimation of distribution algorithm and a genetic algorithm without restart strategy as competitors. The results of statistical analysis by the Wilcoxon’s rank-sum test demonstrate that the designed REGA performs better than its competitors in solving the STSC cases of different scales. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：