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

Neighborhood Interval Observer Based Coordination control for Multi-agent Systems with Disturbances ⁎

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2020年第2期53卷 10994-10999页

作者： Xiaoling Wang Guo-Ping Jiang Wen Yang Housheng Su Xiaofan Wang College of Automation Nanjing University of Posts and Telecommunications Nanjing 210023 China and also with Jiangsu Engineering Lab for IOT Intelligent Robots (IOTRobot) Nanjing 210023 China Key Laboratory of Advanced Control and Optimization for Chemical Processes East China University of Science and Technology Shanghai 200237 China School of Artifcial Intelligence and Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Luoyu Road 1037 Wuhan 430074 China Department of Automation Shanghai University Shanghai 200072 China

This paper focuses on multi-agent systems with uncertain disturbances, in which only the bounding functions on the disturbances and the bounds on the initial state of each agent are known. By designing a neighborhood interval observer for this kind of multi-agent system, the estimation of the sum of the relative state of each agent associated with itself and its neighbors is frstly realized. Then, on the basis of these estimated information, local control algorithm is designed to drive the system to achieve bounded consensus.

关键词： Multi-agent system disturbance neighborhood interval observer bounded consensus

Fast and accurate single-image depth estimation on mobile devices, mobile AI 2021 challenge: Report

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ignatov, Andrey Malivenko, Grigory Plowman, David Shukla, Samarth Timofte, Radu Zhang, Ziyu Wang, Yicheng Huang, Zilong Luo, Guozhong Yu, Gang Fu, Bin Wang, Yiran Li, Xingyi Shi, Min Xian, Ke Cao, Zhiguo Du, Jin-Hua Wu, Pei-Lin Ge, Chao Yao, Jiaoyang Tu, Fangwen Li, Bo Yoo, Jung Eun Seo, Kwanggyoon Xu, Jialei Li, Zhenyu Liu, Xianming Jiang, Junjun Chen, Wei-Chi Joya, Shayan Fan, Huanhuan Kang, Zhaobing Li, Ang Feng, Tianpeng Liu, Yang Sheng, Chuannan Yin, Jian Benavides, Fausto T. Computer Vision Lab ETH Zurich Switzerland Ltd AI Witchlabs Switzerland Tencent GY-Lab China Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Nanjing Artificial Intelligence Chip Research Institute of Automation Chinese Academy of Sciences China Black Sesame Technologies Inc. Singapore Singapore Visual Media Lab KAIST Korea Republic of Harbin Institute of Technology China Peng Cheng Laboratory China Multimedia and Computer Vision Laboratory National Cheng Kung University Taiwan Samsung Research UK United Kingdom OPPO Research Institute China ETH Zurich Switzerland

Depth estimation is an important computer vision problem with many practical applications to mobile devices. While many solutions have been proposed for this task, they are usually very computationally expensive and thus are not applicable for on-device inference. To address this problem, we introduce the first Mobile AI challenge, where the target is to develop an end-to-end deep learning-based depth estimation solutions that can demonstrate a nearly real-time performance on smartphones and IoT platforms. For this, the participants were provided with a new large-scale dataset containing RGB-depth image pairs obtained with a dedicated stereo ZED camera producing high-resolution depth maps for objects located at up to 50 meters. The runtime of all models was evaluated on the popular Raspberry Pi 4 platform with a mobile ARM-based Broadcom chipset. The proposed solutions can generate VGA resolution depth maps at up to 10 FPS on the Raspberry Pi 4 while achieving high fidelity results, and are compatible with any Android or Linux-based mobile devices. A detailed description of all models developed in the challenge is provided in this paper. Copyright © 2021, The Authors. All rights reserved.

关键词： Computer operating systems

Development of an MEMS based biomimetic whisker sensor for tactile sensing

学校读者我要写书评

暂无评论

Development of an MEMS based biomimetic whisker sensor for t...

IEEE International Conference on Cyborg and Bionic Systems (CBS)

作者： Zihou Wei Qing Shi Chang Li Shurui Yan Guanglu Jia Zhigang Zeng Qiang Huang Toshio Fukuda Key Laboratory of Biomimetic Robots and Systems Key Laboratory of Biomimetic Robots and Systems (Beijing Institute of Technology) Ministry of Education Beijing China Key Laboratory of Ministry of Education for Image Processing and Intelligent Control the School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728150734

ISBN: (纸本)9781728150741

It has been demonstrated that biological whisker sensing system has excellent capacity to achieve the pattern recognition, and whisker sensor based robot tactile perception has caused widespread concern. However, most of current existed whisker sensors are too large in size, and are difficult to be integrated into a small robot. In this paper, we proposed a MEMS based biomimetic whisker sensor inspired by rats, which integrates four sensing units on a square silicon wafer with a side length of 6.8mm and makes it possible to be installed on a small robot with similar size to a real rat. Our sensor measure the bending moment at the root of the whisker based on the piezoresistive effect. We have explored the range of functions that whisker arrays can serve on and it is shown that our whisker sensor can determine obstacle distance, and is also capable of gathering surface information including shape and texture.

关键词：

A layered parallel algorithm for data clustering via fuzzy c-means technique

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Mu, Yashuang Wei, Wei Guo, Hongyue Sun, Lijun Key Laboratory of Grain Information Processing and Control Henan University of Technology Ministry of Education Zhengzhou450001 China School of Artificial Intelligence and Big Data Henan University of Technology Zhengzhou450001 China College of Information Science and Engineering Henan University of Technology Zhengzhou450001 China School of Maritime Economics and Management Dalian Maritime University Dalian116026 China Collaborative Innovation Center for Transport Studies Dalian Maritime University Dalian116026 China

In this study, a layered parallel algorithm via fuzzy c-means (FCM) technique, called LP-FCM, is proposed in the framework of Map-Reduce for data clustering problems. The LP-FCM mainly contains three layers. The first layer follows a parallel data partitioning method which is developed to randomly divide the original dataset into several subdatasets. The second layer uses a parallel cluster centers searching method based on Map-Reduce, where the classic FCM algorithm is applied to search the cluster centers for each subdataset in Map phases, and all the centers are gathered to the Reduce phase for the confirmation of the final cluster centers through FCM technique again. The third layer implements a parallel data clustering method based on the final cluster centers. After comparing with some famous classic random initialization sequential clustering algorithms which include K-means, K-medoids, FCM and MinMaxK-means on 20 benchmark datasets, the feasibility in terms of clustering accuracy is evaluated. Furthermore, the clustering time and the parallel performance are also tested on some generated large-scale datasets for the parallelism. © 2021, CC BY.

关键词： K-means clustering

Re-ID driven localization refinement for person search

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Han, Chuchu Ye, Jiacheng Zhong, Yunshan Tan, Xin Zhang, Chi Gao, Changxin Sang, Nong Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Peking University Shanghai Jiao Tong University Megvii Technology

Person search aims at localizing and identifying a query person from a gallery of uncropped scene images. Different from person re-identification (re-ID), its performance also depends on the localization accuracy of a pedestrian detector. The state-of-the-art methods train the detector individually, and the detected bounding boxes may be suboptimal for the following re-ID task. To alleviate this issue, we propose a re-ID driven localization refinement framework for providing the refined detection boxes for person search. Specifically, we develop a differentiable ROI transform layer to effectively transform the bounding boxes from the original images. Thus, the box coordinates can be supervised by the re-ID training other than the original detection task. With this supervision, the detector can generate more reliable bounding boxes, and the downstream re-ID model can produce more discriminative embeddings based on the refined person localizations. Extensive experimental results on the widely used benchmarks demonstrate that our proposed method performs favorably against the state-of-the-art person search methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

Metric Learning Based Rolling Bearing Faults Diagnosis with Curvelet Transform

学校读者我要写书评

暂无评论

Metric Learning Based Rolling Bearing Faults Diagnosis with ...

2019 3rd International Conference on Machine Vision and Information Technology (CMVIT 2019)

作者： Ziming Lu Jiang-Wen Xiao Zhengyi Huang School of Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control(Huazhong University of Science and Technology) Ministry of Education

Rolling bearing faults are among the primary causes of breakdown in mechanical equipment. Aiming at the vibration signals of rolling bearing which are non-stationary and easy to be disturbed by noise, a novel fault diagnosis method based on curvelet transform and metric learning is proposed. This method consists of 3 parts. The first one is feature engineering which includes reshaping the original timing features of rolling bearings, employing curvelet transform to transform reshaped features and making its coefficients as the new features. Curvelet transform can analyse the original signal from many angles. The second one is employing metric learning to map these new features into special embedding space. The last one is applying KNN classifier to detect the rolling bearing faults. Metric learning can effectively improve the performance of KNN by learning a mapping matrix to modify the distribution of samples. The proposed method overcomes the problems such as the subjectivity and blindness of manual feature extraction, poor coupling in each stage and sensitive to the effect of noise. Extensive simulations based on several data-sets show that the our method has better performance on bearing fault diagnosis than traditional methods.

关键词：

Predefined-time terminal sliding mode control of robot manipulators

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liang, Chang-Duo Ge, Ming-Feng Liu, Zhi-Wei Wang, Yan-Wu Karimi, Hamid Reza School of Mechanical Engineering and Electronic Information China University of Geosciences Wuhan430074 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan430074 China Department of Mechanical Engineering Politecnico di Milano Milan20156 Italy

In this paper, we present a new terminal sliding mode control to achieve predefined-time stability of robot manipulators. The proposed control is developed based on a novel predefined-time terminal sliding mode (PTSM) surface, on which the states are forced to reach the origin in a predefined time, i.e., the settling time is independent to the initial condition and can be explicitly user-defined via adjusting some specific parameters called the predefined-time parameters. It is also demonstrated that the proposed control can provide satisfactory steady-state performance in the case of both external disturbances and parametric uncertainties. Besides, we present a formal systemic analysis method to derive the sufficient conditions for guaranteeing the predefined-time convergence of the closed-loop system. Finally, the effectiveness and performance of the presented control scheme are illustrated through both theoretical comparisons and numerical simulations. Copyright © 2020, The Authors. All rights reserved.

关键词： Sliding mode control

Finite-size scaling of geometric renormalization flows in complex networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Chen, Dan Su, Housheng Wang, Xiaofan Pan, Gui-Jun Chen, Guanrong School of Artificial Intelligence and Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Wuhan430074 China Department of Automation Shanghai University Shanghai200072 China Faculty of Physics and Electronic Science Hubei University Wuhan430062 China Department of Electrical Engineering City University of Hong Kong Hong Kong Hong Kong

Recently, the concept of geometric renormalization group provides a good approach for studying the structural symmetry and functional invariance of complex networks. Along this line, we systematically investigate the finite-size scaling of structural and dynamical observables in geometric renormalization flows of synthetic and real evolutionary networks. Our results show that these observables can be well characterized by a certain scaling function. Specifically, we show that the critical exponent implied by the scaling function is independent of these observables but only depends on the small-world properties of the network, namely, all networks located in the small-world phase have a uniform scaling exponent, while those located in the non-small-world phase and in their critical regions have another uniform scaling. More importantly, we perform extensive experiments on real evolutionary networks with small-world characteristics, and our results show that these observables also have uniform scaling in their geometric renormalization flows. Therefore, in a sense this exponent can be used as an effective measure for classifying universal small-world and non-small-world network models. © 2020, CC BY-SA.

关键词： Geometry

Reaching Non-Negative Edge Consensus of Networked Dynamical Systems

学校读者我要写书评

暂无评论

IEEE TRANSACTIONS ON CYBERNETICS 2018年第9期48卷 2712-2722页

作者： Wang, Xiao Ling Su, Housheng Chen, Michael Z. Q. Wang, Xiao Fan Chen, Guanrong College of Automation Nanjing University of Posts and Telecommunications Nanjing China School of Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Wuhan China School of Automation Nanjing University of Science and Technology Nanjing China Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Department of Electronic Engineering City University of Hong Kong Hong Kong

In this paper, the problem of non-negative edge consensus of undirected networked linear time-invariant systems is addressed by associating each edge of the network with a state variable, for which a distributed algorithm is constructed. Sufficient conditions referring only to the number of edges are derived for non-negative edge consensus of the networked systems. Subsequently, the linear programming method and a low-gain feedback technique are introduced to simplify the design of the feedback gain matrix for achieving the non-negative edge consensus. It is found that the low-gain feedback technique has a good effect on the non-negative edge consensus of the networked systems subject to input saturation. Numerical simulations are presented to verify the effectiveness of the theoretical results.

关键词： Distributed algorithm line graph low-gain feedback networked system non-negative edge consensus