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

$H_{\infty }$ PID control for Discrete-Time Fuzzy systems With Infinite-Distributed Delays Under Round-Robin Communication Protocol

学校读者我要写书评

暂无评论

IEEE Transactions on Fuzzy systems 2021年第6期30卷 1875-1888页

作者： Yezheng Wang Zidong Wang Lei Zou Hongli Dong College of Electrical Engineering and Automation Shandong University of Science and Technology Qingdao China Department of Computer Science Brunel University London Uxbridge U.K. Institute of Complex Systems and Advanced Control and the Heilongjiang Provincial Key Laboratory of Networking and Intelligent Control Northeast Petroleum University Daqing China

This article is concerned with the $H_{\infty }$ proportional–integral–derivative (PID) control problem for class of discrete-time Takagi–Sugeno fuzzy systems subject to infinite-distributed time delays and round-robin (RR) protocol scheduling effects. The information exchange between the sensors and the controller is conducted through a shared communication network. For the purpose of alleviating possible data collision, the well-known RR communication protocol is deployed to schedule the data transmissions. To stabilize the target system with guaranteed $H_{\infty }$ performance index, a novel yet easy-to-implement fuzzy PID controller is developed whose integral term is calculated based on the past measurements defined in a limited time window with hope to improve computational efficiency and reduce accumulation error. Based on the Lyapunov stability theory and the convex optimization technique, sufficient conditions are derived to ensure the exponential stability as well as the $H_{\infty }$ disturbance attenuation/rejection capacity of the underlying system. Furthermore, by utilizing the cone complementarity linearization algorithm, the nonconvex controller design problem is transformed into an iterative optimization one that facilitates the controller implementation. Finally, simulation examples are given to show the effectiveness and correctness of the developed control method.

关键词： PD control Protocols PI control control systems Symmetric matrices Communication networks Optimization

Parallel Planning:A New Motion Planning Framework for Autonomous Driving

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2019年第1期6卷 236-246页

作者： Long Chen Xuemin Hu Wei Tian Hong Wang Dongpu Cao Fei-Yue Wang IEEE School of Data and Computer Science Sun Yat-sen University the School of Computer Science and Information Engineering Hubei University Institute of Measurement and Control Systems Karlsruhe Institute of Technology Department of Mechanical and Mechatronics Engineering University of Waterloo the State Key Laboratory of Management and Control for Complex Systems.Institute of Automation Chinese Academy of Sciences the Research Center for Military Computational Experiments and Parallel Systems Technology National University of Defense Technology

Motion planning is one of the most significant technologies for autonomous driving. To make motion planning models able to learn from the environment and to deal with emergency situations, a new motion planning framework called as"parallel planning" is proposed in this paper. In order to generate sufficient and various training samples, artificial traffic scenes are firstly constructed based on the knowledge from the reality.A deep planning model which combines a convolutional neural network(CNN) with the Long Short-Term Memory module(LSTM) is developed to make planning decisions in an end-toend mode. This model can learn from both real and artificial traffic scenes and imitate the driving style of human ***, a parallel deep reinforcement learning approach is also presented to improve the robustness of planning model and reduce the error rate. To handle emergency situations, a hybrid generative model including a variational auto-encoder(VAE) and a generative adversarial network(GAN) is utilized to learn from virtual emergencies generated in artificial traffic scenes. While an autonomous vehicle is moving, the hybrid generative model generates multiple video clips in parallel, which correspond to different potential emergency scenarios. Simultaneously, the deep planning model makes planning decisions for both virtual and current real scenes. The final planning decision is determined by analysis of real observations. Leveraging the parallel planning approach, the planner is able to make rational decisions without heavy calculation burden when an emergency occurs.

关键词： Autonomous driving artificial traffic scene deep learning emergencies motion planning parallel planning

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

Communication Compression for Distributed Nonconvex Optimization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Chai, Tianyou Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm100 44 Sweden Department of Electrical Engineering University of North Texas DentonTX76203 United States State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

This paper considers distributed nonconvex optimization with the cost functions being distributed over agents. Noting that information compression is a key tool to reduce the heavy communication load for distributed algorithms as agents iteratively communicate with neighbors, we propose three distributed primal–dual algorithms with compressed communication. The first two algorithms are applicable to a general class of compressors with bounded relative compression error and the third algorithm is suitable for two general classes of compressors with bounded absolute compression error. We show that the proposed distributed algorithms with compressed communication have comparable convergence properties as state-of-the-art algorithms with exact communication. Specifically, we show that they can find first-order stationary points with sublinear convergence rate O(1/T) when each local cost function is smooth, where T is the total number of iterations, and find global optima with linear convergence rate under an additional condition that the global cost function satisfies the Polyak–Lojasiewicz condition. Numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2022, The Authors. All rights reserved.

关键词： Iterative methods

Improved WPT system using a conical coil for charging a Smart device that controls patients with Alzheimer's disease

学校读者我要写书评

暂无评论

Improved WPT system using a conical coil for charging a Smar...

IEEE SSD International Multi-Conference on systems, Signals and Devices

作者： Yosra Ben Fadhel Achraf Derbel Hatem Garrab Hadi Trabelsi Mohamed Deriche Nabil Derbel Lab. of Biophysics and Medical Technology High Institute of Medical Technologies University of Tunis El-Manar Tunis Tunisia Departement of Computer Systems Engineering Mediterranean Institute of Technology South Mediterranean University Tunisia University of sousse Institut SupA©rieur des Sciences AppliquA©es et de Technologie de Sousse Tunisia King Fahd University King Fahd University of Petroleum Minerals KFUPM Saudi Arabia Control & Energy Management Laboratory National School of Engineering of Sfax University of Sfax Sfax Tunisia

ISBN: (数字)9798350374131

ISBN: (纸本)9798350374148

controlling patients with Alzheimer's disease is very challenging. This paper presents a novel approach for enhancing the efficiency of wireless power transfer systems in smart devices used for managing patients with Alzheimer's disease. The pro-posed system contains a conical coil as a transmitter instead of the conventional circular coil shape to maximize coupling and ensure reliable power transfer. Through this paper, we have modeled a conical coil for the proposed system to reach its maximum coil quality factor. For certain frequencies, the proper inductance and resistance of the primary coil value are deduced by a mathematical expression from its length expression. This method has the potential to significantly enhance the effectiveness of technological solutions aimed at assisting individuals affected by this disease. This paper demonstrates that the quality factor of the system using a conical coil as a transmitter can be maximized, resulting in improved performance compared to traditional circular coil shapes. The findings suggest that this innovative coil design has promising implications for advancing WPT systems in healthcare applications for Alzheimer's patients.

关键词： Coils Q-factor Inductance Transmitters Shape Wireless power transfer Medical services

Risk Identification Method for Smuggled Frozen Meat in Urban Public Safety Awareness and Early Warning

学校读者我要写书评

暂无评论

Risk Identification Method for Smuggled Frozen Meat in Urban...

Intelligent Communication and Networking (ICN), International Conference on

作者： Xueru Li Yan Zhang Lingjie Liu Ye Tian Yue Zhang College of Computer Science and Technology Harbin Engineering University Harbin China China Industrial Control Systems Cyber Emergency Response Team Beijing China Environment and Food and Drug Crime Investigation Detachment of Hangzhou Public Security Bureau Hangzhou China Hangzhou Institute of Technology Xidian University Hangzhou China Key Laboratory of Peace-Building Big Data of Zhejiang Province Zhejiang China

With the continuous growth in demand for meat and frozen products in the cold chain market, illegally smuggled frozen goods have quickly entered the market due to their low prices, leading to a series of food safety issues. This article proposes a method for identifying the risks of smuggled frozen meat for urban public safety awareness using the YOLOv7 model. The YOLOv7 model is used to detect data captured at various traffic checkpoints, obtaining spatiotemporal information of frozen goods vehicles. This information is then combined with map data to generate vehicle trajectory information. The trajectory similarity between the frozen vehicle trajectories and the specialized database of frozen transportation routes is analyzed using the EDwP distance algorithm. The EDwP algorithm employs a threshold-free approach, dynamically interpolating using the concept of projection, and automatically adapting to non-uniform sampling rates to address the issue of inconsistent trajectory data sampling rates. The experimental results of the YOLOv7-EDwP algorithm were verified by verifying the alerts generated in the recent period through on-site verification by a third-party inspection agency, with a recognition accuracy of 90.77%. This holds significant significance in the detection and warning of smuggled frozen meat.

关键词：

Awareness in robotics: An early perspective from the viewpoint of the EIC Pathfinder Challenge "Awareness Inside"

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Santina, Cosimo Della Corbato, Carlos Hernandez Sisman, Burak Leiva, Luis A. Arapakis, Ioannis Vakalellis, Michalis Vanderdonckt, Jean D’Haro, LuisFernando Manzi, Guido Becchio, Cristina Elamrani, Aïda Alirezaei, Mohsen Castellano, Ginevra Dimarogonas, Dimos V. Ghosh, Arabinda Haesaert, Sofie Soudjani, Sadegh Stroeve, Sybert Verschure, Paul Bacciu, Davide Deroy, Ophelia Bahrami, Bahador Gallicchio, Claudio Hauert, Sabine Sanz, Ricardo Lanillos, Pablo Iacca, Giovanni Sigg, Stephan Gasulla, Manel Steels, Luc Sierra, Carles Department of Cognitive Robotics Delft University of Technology Delft Netherlands Oberpfaffenhofen Germany Department of Computer Science University of Luxembourg Luxembourg 4 Telefónica I+D Spain AEGIS IT Research GmbH Germany Université catholique de Louvain Belgium Speech Technology and Machine Learning Group ETSI de Telecomunicación Universidad Politécnica de Madrid Madrid Spain Alien Venture Studio Alien Technology Transfer Rome Italy Hamburg Germany Institut Jean Nicod École Normale Supérieure Paris France Research Technology and Development Department Digital Industry Software Helmond Netherlands Department of Information Technology Uppsala University Uppsala Sweden Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Max Planck Institute for Software Systems Kaiserslautern Germany Department of Electrical Engineering Control Systems Group Eindhoven University of Technology Eindhoven Netherlands Amsterdam Netherlands Donders Centre for Neuroscience Radboud University Nijmegen Netherlands Computer Science Department University of Pisa Pisa Italy Faculty of Philosophy Philosophy of Science The Study of Religion Ludwig Maximilian University of Munich Munich Germany School of Engineering Mathematics and Technology University of Bristol Bristol United Kingdom Autonomous Systems Laboratory Universidad Politécnica de Madrid Spain Madrid Spain Department of Information Engineering and Computer Science University of Trento Trento Italy Department of Information and Communications Engineering Aalto University Espoo Finland Department of Electronic Engineering Universitat Politècnica de Catalunya Barcelona Spain Studio Stelluti Brussels Belgium Barcelona Spain

Consciousness has been historically a heavily debated topic in engineering, science, and philosophy. On the contrary, awareness had less success in raising the interest of scholars in the past. However, things are changing as more and more researchers are getting interested in answering questions concerning what awareness is and how it can be artificially generated. The landscape is rapidly evolving, with multiple voices and interpretations of the concept being conceived and techniques being developed. The goal of this paper is to summarize and discuss the ones among these voices that are connected with projects funded by the EIC Pathfinder Challenge called "Awareness Inside", a nonrecurring call for proposals within Horizon Europe that was designed specifically for fostering research on natural and synthetic awareness. In this perspective, we dedicate special attention to challenges and promises of applying synthetic awareness in robotics, as the development of mature techniques in this new field is expected to have a special impact on generating more capable and trustworthy embodied systems. © 2024, CC BY.

关键词： Robotics

S4TP: Social-Suitable and Safety-Sensitive Trajectory Planning for Autonomous Vehicles

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Xiao Tang, Ke Dai, Xingyuan Xu, Jintao Du, Quancheng Ai, Rui Wang, Yuxiao Gu, Weihao Engineering Research Center of Autonomous Unmanned System Technology Ministry of Education Anhui University Hefei230031 China Haomo Technology Co. Ltd. Beijing100192 China The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China Qingdao Academy of Intelligent Industries Qingdao266114 China The School of Computer and Communication Engineering University of Science and Technology Beijing Beijing100083 China The School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 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 (S4TP) framework. Specifically, S4TP 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. S4TP employs an optimization-based approach for motion planning, utilizing the predicted HDVs’ trajectories as input. With the integration of SADRF, S4TP 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 S4TP in terms of safety and rationality. S4TP 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%. Copyright © 2024, The Authors. All rights reserved.

关键词： Autonomous vehicles

A Zeroth-Order Momentum Method for Risk-Averse Online Convex Games

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Zifan Shen, Yi Bell, Zachary I. Nivison, Scott Zavlanos, Michael M. Johansson, Karl H. Division of Decision and Control Systems School of Electrical Enginnering and Computer Science KTH Royal Institute of Technology StockholmSE-10044 Sweden The Department of Mechanical Engineering and Materials Science Duke University DurhamNC United States The Air Force Research Laboratory Eglin AFB FL United States

We consider risk-averse learning in repeated unknown games where the goal of the agents is to minimize their individual risk of incurring significantly high cost. Specifically, the agents use the conditional value at risk (CVaR) as a risk measure and rely on bandit feedback in the form of the cost values of the selected actions at every episode to estimate their CVaR values and update their actions. A major challenge in using bandit feedback to estimate CVaR is that the agents can only access their own cost values, which, however, depend on the actions of all agents. To address this challenge, we propose a new risk-averse learning algorithm with momentum that utilizes the full historical information on the cost values. We show that this algorithm achieves sub-linear regret and matches the best known algorithms in the literature. We provide numerical experiments for a Cournot game that show that our method outperforms existing methods. © 2022, CC BY.

关键词： Learning algorithms