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

On Enlarging the Domain of Attraction for Linear Systems Subject to Asymmetric Actuator Saturation

学校读者我要写书评

暂无评论

On Enlarging the Domain of Attraction for Linear Systems Sub...

IEEE Conference on Decision and control

作者： Wenxin Lai Yuanlong Li Zongli Lin Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Charlottesville VA U.S.A.

In this paper, we revisit the problem of enlarging the domain of attraction for linear systems with asymmetric actuator saturation. We partition the state space into several regions according to the sign of each input and rewrite the linear system subject to asymmetric actuator saturation as an equivalent switched system, each subsystem of which is associated with one partition of the state space and is a linear system subject to symmetric actuator saturation. Based on this equivalent representation of the system, we present a Lyapunov function, which is composed of a set of quadratic functions associated with matrices that are not required to be positive definite. We establish sufficient conditions for regional stability and, based on them, formulate optimization problems to enlarge the estimate of the domain of attraction. Simulation results illustrate the effectiveness of the proposed approach.

关键词：

Spatial non-locality induced non-markovian EIT in a single giant atom

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhu, Y.T. Wu, R.B. Xue, S. Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China Department of Automation Tsinghua University Beijing100084 China Beijing National Research Center for Information Science and Technology Beijing100084 China

In recent experiments, electromagnetically induced transparency (EIT) were observed with giant atoms, but nothing unconventional were found from the transmission spectra. In this letter, we show that unconventional EIT does exist in giant atoms, and indicate why it has not been observed so far. Different from these existing works, this letter presents a consistent theory including a real space method and a time delayed master equation for observing unconventional EIT. We discover that this phenomenon is a quantum effect which cannot be correctly described in a semi-classical way as those in recent works. Our theory shows that it can be observed when the time delay between two neighboring coupling points is comparable to the relaxation time of the atom, which is crucial for a future experimental observation. This new phenomenon results from inherent non-locality of the giant atom, which physically forces propagating fields to be standing waves in space and the atom exhibiting retardations in time. Our theory establishes a framework for application of nonlocal systems to quantum information processing. Copyright © 2021, The Authors. All rights reserved.

关键词： Atoms

Learning of long-horizon sparse-reward robotic manipulator tasks with base controllers

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Wang, Guangming Xin, Minjian Wu, Wenhua Liu, Zhe Wang, Hesheng Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai200240 China Department of Computer Science and Engineering University of California San Diego La Jolla CA92093 United States Department of Computer Science and Technology University of Cambridge CambridgeCB2 1TN United Kingdom

Deep Reinforcement Learning (DRL) enables robots to perform some intelligent tasks end-to-end. However, there are still many challenges for long-horizon sparse-reward robotic manipulator tasks. On the one hand, a sparse-reward setting causes exploration inefficient. On the other hand, exploration using physical robots is of high cost and unsafe. In this paper, we propose a method of learning long-horizon sparse-reward tasks utilizing one or more existing traditional controllers named base controllers in this paper. Built upon Deep Deterministic Policy Gradients (DDPG), our algorithm incorporates the existing base controllers into stages of exploration, value learning, and policy update. Furthermore, we present a straightforward way of synthesizing different base controllers to integrate their strengths. Through experiments ranging from stacking blocks to cups, it is demonstrated that the learned state-based or image-based policies steadily outperform base controllers. Compared to previous works of learning from demonstrations, our method improves sample efficiency by orders of magnitude and improves the performance. Overall, our method bears the potential of leveraging existing industrial robot manipulation systems to build more flexible and intelligent controllers. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

Recurrent Attentional Reinforcement Learning for Machinery Fault Diagnosis

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Tang, Zhenhui Wang, Jingcheng Wu, Shunyu The Department of Automation The Key Laboratory of System Control and Information Processing Ministry of Education of China The Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University No.800 Dongchuan Road Shanghai200240 China The SJTU Sanya Yazhou Bay Institute of Deepsea Science and Technology Sanya572024 China The Autonomous Systems and Intelligent Control International Joint Research Center Xi’an Technological University Xi’an710021 China

Recognizing fault types of machinery system is a fundamental but challenging task in industrial application. Although remarkable progress has been attained by learning fault features and predicting the corresponded fault type with deep neural networks, the existing fault diagnosis pipelines usually learn non-discriminative information. Contextual sequence dependency between the localized time fragments is often ignored. To deal with these problem, a recurrent attention framework with reinforcement learning is proposed to find a series of informative features of local time fragments related to different faults in an iterative manner. Fault labels are further predicted on these time fragments. The proposed framework also explicitly models long-term dependencies among these attentional time fragments to capture historical fault information. Experiments on two typical machinery systems, bearing system and hydraulic system, show that the proposed framework achieves superior diagnosis performance and increases no computation burden on CPU. © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

Native gating behavior of ion channels in neurons with null-deviation modeling

学校读者我要写书评

暂无评论

Native gating behavior of ion channels in neurons with null-...

The 4th International Ion Channel Conference(第四届国际离子通道会议)

作者： Wei Wang Jie Luo Panpan Hou Yimei Yang Feng Xiao Ming Yuchi Anlian Qu Luyang Wang Jiuping Ding Key Laboratory of Molecular Biophysics of the Ministry of Education College of Life Science and Technology Huazhong University of Science and Technology Wuhan China program in Neurosciences and Mental Health SickKids Research Institute & Department of Physiology University of Toronto Toronto Canada Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Department of Biomedical Engineering College of Life Science and Technology Wuhan China

3D Hierarchical Refinement and Augmentation for Unsupervised Learning of Depth and Pose from Monocular Video

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Guangming Zhong, Jiquan Zhao, Shijie Wu, Wenhua Liu, Zhe Wang, Hesheng Department of Automation Institute of Medical Robotics Key Laboratory of System Control and Information Processing Ministry of Education Key Laboratory of Marine Intelligent Equipment and System of Ministry of Education Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai200240 China Department of Engineering Mechanics Shanghai Jiao Tong University Shanghai200240 China Department of Computer Science and Technology University of Cambridge CambridgeCB2 1TN United Kingdom

Depth and ego-motion estimations are essential for the localization and navigation of autonomous robots and autonomous driving. Recent studies make it possible to learn the per-pixel depth and ego-motion from the unlabeled monocular video. A novel unsupervised training framework is proposed with 3D hierarchical refinement and augmentation using explicit 3D geometry. In this framework, the depth and pose estimations are hierarchically and mutually coupled to refine the estimated pose layer by layer. The intermediate view image is proposed and synthesized by warping the pixels in an image with the estimated depth and coarse pose. Then, the residual pose transformation can be estimated from the new view image and the image of the adjacent frame to refine the coarse pose. The iterative refinement is implemented in a differentiable manner in this paper, making the whole framework optimized uniformly. Meanwhile, a new image augmentation method is proposed for the pose estimation by synthesizing a new view image, which creatively augments the pose in 3D space but gets a new augmented 2D image. The experiments on KITTI demonstrate that our depth estimation achieves state-of-the-art performance and even surpasses recent approaches that utilize other auxiliary tasks. Our visual odometry outperforms all recent unsupervised monocular learning-based methods and achieves competitive performance to the geometry-based method, ORB-SLAM2 with back-end optimization. Copyright © 2021, The Authors. All rights reserved.

关键词： Robots

High information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ding, Yi He, Xuan Nguyen, Tuan Thanh Song, Wentu Yakhini, Zohar Yaakobi, Eitan Pan, Linqiang Tang, Xiaohu Cai, Kui Information Coding and Transmission Key Lab of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China Cluster Singapore University of Technology and Design 487372 Singapore Faculty of Computer Science Technion - Israel Institute of Technology Haifa3200003 Israel School of Computer Science RUNI Herzliya4615200 Israel Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional data storage media. Despite the recent advancements in DNA data storage technology, significant challenges remain. In particular, various types of errors can occur during the processes of DNA synthesis, storage, and sequencing, including substitution errors, insertion errors, and deletion errors. Furthermore, the entire oligo may be lost. In this work, we report a DNA-based data storage architecture that incorporates efficient channel coding schemes, including different types of error-correcting codes (ECCs) and constrained codes, for both the inner coding and outer coding for the DNA data storage channel. We also carried out large scale experiments to validate our proposed DNA-based data storage architecture. Specifically, 1.61 and 1.69 MB data were encoded into 30,000 oligos each, with information densities of 1.731 and 1.815, respectively. It has been found that the stored information can be fully recovered without any error at average coverages of 4.5 and 6.0, respectively. This experiment achieved the highest net information density and lowest coverage among existing DNA-based data storage experiments (with standard DNA), with data recovery rates and coverage approaching theoretical optima. Copyright © 2024, The Authors. All rights reserved.

关键词： Channel coding

Understanding the Robustness of 3D Object Detection with Bird’s-Eye-View Representations in Autonomous Driving

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhu, Zijian Zhang, Yichi Chen, Hai Dong, Yinpeng Zhao, Shu Ding, Wenbo Zhong, Jiachen Zheng, Shibao Institute of Image Communication and Network Engineering Shanghai Jiao Tong University China Dept. of Comp. Sci. and Tech. Institute for AI THBI Lab BNRist Center Tsinghua University China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Computer Science and Technology Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province China SAIC Motor AI Lab China Zhongguancun Laboratory China

3D object detection is an essential perception task in autonomous driving to understand the environments. The Bird’s-Eye-View (BEV) representations have significantly improved the performance of 3D detectors with camera inputs on popular benchmarks. However, there still lacks a systematic understanding of the robustness of these vision-dependent BEV models, which is closely related to the safety of autonomous driving systems. In this paper, we evaluate the natural and adversarial robustness of various representative models under extensive settings, to fully understand their behaviors influenced by explicit BEV features compared with those without BEV. In addition to the classic settings, we propose a 3D consistent patch attack by applying adversarial patches in the 3D space to guarantee the spatiotemporal consistency, which is more realistic for the scenario of autonomous driving. With substantial experiments, we draw several findings: 1) BEV models tend to be more stable than previous methods under different natural conditions and common corruptions due to the expressive spatial representations;2) BEV models are more vulnerable to adversarial noises, mainly caused by the redundant BEV features;3) Camera-LiDAR fusion models have superior performance under different settings with multi-modal inputs, but BEV fusion model is still vulnerable to adversarial noises of both point cloud and image. These findings alert the safety issue in the applications of BEV detectors and could facilitate the development of more robust models. Code available at https: //***/zzj403/BEV_Robust. Copyright © 2023, The Authors. All rights reserved.

关键词： Birds

S2DA-Net: Spatial and spectral-learning double-branch aggregation network for liver tumor segmentation in CT images

学校读者我要写书评

暂无评论

Computers in Biology and Medicine 2024年 174卷 108400-108400页

作者： Liu, Huaxiang Yang, Jie Jiang, Chao He, Sailing Fu, Youyao Zhang, Shiqing Hu, Xudong Fang, Jiangxiong Ji, Wenbin Department Radiology of Taizhou Hospital Zhejiang University Zhejiang Taizhou318000 China Institute of Intelligent Information Processing Taizhou University Zhejiang Taizhou318000 China Key Laboratory of Evidence-based Radiology of Taizhou Zhejiang Taizhou317000 China School of Geophysics and Measurement and Control Technology East China University of Technology Nanchang330013 China

Accurate liver tumor segmentation is crucial for aiding radiologists in hepatocellular carcinoma evaluation and surgical planning. While convolutional neural networks (CNNs) have been successful in medical image segmentation, they face challenges in capturing long-term dependencies among pixels. On the other hand, Transformer-based models demand a high number of parameters and involve significant computational costs. To address these issues, we propose the Spatial and Spectral-learning Double-branched Aggregation Network (S2DA-Net) for liver tumor segmentation. S2DA-Net consists of a double-branched encoder and a decoder with a Group Multi-Head Cross-Attention Aggregation (GMCA) module, Two branches in the encoder consist of a Fourier Spectral-learning Multi-scale Fusion (FSMF) branch and a Multi-axis Aggregation Hadamard Attention (MAHA) branch. The FSMF branch employs a Fourier-based network to learn amplitude and phase information, capturing richer features and detailed information without introducing an excessive number of parameters. The FSMF branch utilizes a Fourier-based network to capture amplitude and phase information, enriching features without introducing excessive parameters. The MAHA branch incorporates spatial information, enhancing discriminative features while minimizing computational costs. In the decoding path, a GMCA module extracts local information and establishes long-term dependencies, improving localization capabilities by amalgamating features from diverse branches. Experimental results on the public LiTS2017 liver tumor datasets show that the proposed segmentation model achieves significant improvements compared to the state-of-the-art methods, obtaining dice per case (DPC) 69.4 % and global dice (DG) 80.0 % for liver tumor segmentation on the LiTS2017 dataset. Meanwhile, the pre-trained model based on the LiTS2017 datasets obtain, DPC 73.4 % and an DG 82.2 % on the 3DIRCADb dataset. © 2024

关键词： Convolution