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

String stability and a delay-based spacing policy for vehicle platoons subject to disturbances

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Besselink, B. Johansson, K.H. Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen Groningen Netherlands ACCESS Linnaeus Centre Department of Automatic Control School of Electrical Engineering KTH Royal Institute of Technology Stockholm Sweden

A novel delay-based spacing policy for the control of vehicle platoons is introduced together with a notion of disturbance string stability. The delay-based spacing policy specifies the desired inter-vehicular distance between vehicles and guarantees that all vehicles track the same spatially varying reference velocity profile, as is for example required for heavy-duty vehicles driving over hilly terrain. Disturbance string stability is a notion of string stability of vehicle platoons subject to external disturbances on all vehicles that guarantees that perturbations do not grow unbounded as they propagate through the platoon. Specifically, a control design approach in the spatial domain is presented that achieves tracking of the desired spacing policy and guarantees disturbance string stability with respect to a spatially varying reference velocity. The results are illustrated by means of simulations. Copyright © 2017, The Authors. All rights reserved.

关键词： Vehicles

Radiation Pattern Synthesis Using Hybrid Fourier-Woodward-Lawson-Neural Networks for Reliable MIMO Antenna Systems

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Ghayoula, Elies Ghayoula, Ridha Fattahi, Jaouhar Pricop, Emil Chouinard, Jean-Yves Bouallegue, Ammar Sys’Com Laboratory National Engineering School of Tunis ENIT Tunis El Manar University Tunisia Department of Electrical and Computer Engineering Laval University Quebec Canada Department of Computer Science and Software Engineering Laval University Quebec Canada Automatic Control Computers and Electronics Department Petroleum-Gas University of Ploiesti Romania

In this paper, we implement hybrid Woodward-Lawson-Neural Networks and weighted Fourier method to synthesize antenna arrays. The neural networks (NN) is applied here to simplify the modeling of MIMO antenna arrays by assessing phases. The main problem is obviously to find optimal weights of the linear antenna array elements giving radiation pattern with minimum sidelobe level (SLL) and hence ameliorating the antenna array performance. To attain this purpose, an antenna array for reliable Multiple-Input Multiple-Output (MIMO) applications with frequency at 2.45 GHz is implemented. To validate the suggested method, many examples of uniformly excited array patterns with the main beam are put in the direction of the useful signal. The Woodward-Lawson-Neural Networks synthesis method permits to find out interesting analytical equations for the synthesis of an antenna array and highlights the flexibility between the system parameters in input and those in output. The performance of this hybrid optimization underlines how well the system is suitable for a wireless communication and how it participates in reducing interference, as well. Copyright © 2017, The Authors. All rights reserved.

关键词： Antenna arrays

Relay-pair selection in buffer-aided successive opportunistic relaying using a multi-antenna source

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Charalambous, Themistoklis Kim, Su Min Nomikos, Nikolaos Bengtsson, Mats Johansson, Mikael Department of Electrical Engineering and Automation Aalto University Espoo Finland Department of Electronics Engineering Korea Polytechnic University Siheung Korea Republic of Department of Information and Communication Systems Engineering University of the Aegean Samos Greece Department of Information Science and Engineering School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Automatic Control School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden

We study a cooperative network with a buffer-aided multi-antenna source, multiple half-duplex (HD) buffer-aided relays and a single destination. Such a setup could represent a cellular downlink scenario, in which the source can be a more powerful wireless device with a buffer and multiple antennas, while a set of intermediate less powerful devices are used as relays to reach the destination. The main target is to recover the multiplexing loss of the network by having the source and a relay to simultaneously transmit their information to another relay and the destination, respectively. Successive transmissions in such a cooperative network, however, cause inter-relay interference (IRI). First, by assuming global channel state information (CSI), we show that the detrimental effect of IRI can be alleviated by precoding at the source, mitigating or even fully cancelling the interference. A cooperative relaying policy is proposed that employs a joint precoding design and relay-pair selection. Note that both fixed rate and adaptive rate transmissions can be considered. For the case when channel state information is only available at the receiver side (CSIR), we propose a relay selection policy that employs a phase alignment technique to reduce the IRI. The performance of the two proposed relay pair selection policies are evaluated and compared with other state-of-the-art relaying schemes in terms of outage and throughput. The results show that the use of a powerful source can provide considerable performance improvements. Copyright © 2017, The Authors. All rights reserved.

关键词： Channel state information

Introduction to learning

学校读者我要写书评

暂无评论

SpringerBriefs in Applied Sciences and Technology

SpringerBriefs in Applied Sciences and Technology 2016年第9783319256658期 1-10页

作者： Sayed-Mouchaweh, Moamar Computer Science and Automatic Control Department High National Engineering School of Mines Douai France

This chapter presents the basic definitions and notation related to the problem of learning from data samples. It shows how a learner (e.g., classifier) is built, and its performance is evaluated using multiple real a...

关键词：

Dynamics over signed networks

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Shi, Guodong Altafini, Claudio Baras, John S. Australian Center for Field Robotics School of Aerospace Mechanical and Mechatronic Engineering University of Sydney NSW Australia Division of Automatic Control Department of Electrical Engineering Linköping University LinköpingSE-58183 Sweden Institute for Systems Research Department of Electrical and Computer Engineering University of Maryland College ParkMD20742 United States

A signed network is a network with each link associated with a positive or negative sign. Models for nodes interacting over such signed networks, where two different types of interactions take place along the positive and negative links, respectively, arise from various biological, social, political, and economic systems. As modifications to the conventional DeGroot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and studied in the literature. This paper reviews a few fundamental convergence results for such dynamics over deterministic or random signed networks under a unified algebraic-graphical method. We show that a systematic tool of studying node state evolution over signed networks can be obtained utilizing generalized Perron-Frobenius theory, graph theory, and elementary algebraic recursions. Copyright © 2017, The Authors. All rights reserved.

关键词： Algebra

Clustering in block Markov chains

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Sanders, Jaron Proutière, Alexandre Yun, Se-Young Kth Royal Institute of Technology School of Electrical Engineering Dept. of Automatic Control Osquldasväg 10 Stockholm10044 Sweden Delft University of Technology Faculty of Electrical Engineering Mathematics and Computer Science Dept. of Quantum and Computer Engineering Mekelweg 4 Delft2628CD Netherlands Korea Advanced Institute of Science and Technology Dept. of Industrial and Systems Engineering 291 Daehak-ro Eoeun-dong Yuseong-gu Korea Republic of

This paper considers cluster detection in Block Markov Chains (BMCs). These Markov chains are characterized by a block structure in their transition matrix. More precisely, the n possible states are divided into a finite number of K groups or clusters, such that states in the same cluster exhibit the same transition rates to other states. One observes a trajectory of the Markov chain, and the objective is to recover, from this observation only, the (initially unknown) clusters. In this paper we devise a clustering procedure that accurately, efficiently, and provably detects the clusters. We first derive a fundamental information-theoretical lower bound on the detection error rate satisfied under any clustering algorithm. This bound identifies the parameters of the BMC, and trajectory lengths, for which it is possible to accurately detect the clusters. We next develop two clustering algorithms that can together accurately recover the cluster structure from the shortest possible trajectories, whenever the parameters allow detection. These algorithms thus reach the fundamental detectability limit, and are optimal in that sense. Copyright © 2017, The Authors. All rights reserved.

关键词： Asymptotic analysis

Decentralized MMSE attacks in electricity grids 19

学校读者我要写书评

暂无评论

Decentralized MMSE attacks in electricity grids

19th IEEE Statistical Signal Processing Workshop, SSP 2016

作者： Esnaola, Inaki Perlaza, Samir M. Poor, H. Vincent Kosut, Oliver Department of Automatic Control and Systems Engineering University of Sheffield Sheffield United Kingdom Lyon France Department of Electrical Engineering Princeton University PrincetonNJ United States School of Electrical Computer and Energy Engineering Arizona State University TempeAZ United States

ISBN: (纸本)9781467378024

Decentralized data-injection attack construction with minimum mean-square-error state estimation is studied in a game-theoretic setting. Within this framework, the interaction between the network operator and the set of attackers, as well as the interactions among the attackers, are modeled by a game in normal form. A novel utility function that captures the trade-off between the maximum distortion that an attack can introduce and the probability of the attack being detected by the network operator is proposed. Under the assumption that the state variables can be modeled as a multivariate Gaussian random process, it is shown that the resulting game is a potential game. The cardinality of the corresponding set of Nash Equilibria (NEs) of the game is analyzed. It is shown that attackers can agree on a data-injection vector construction that achieves the best trade-off between distortion and detection probability by sharing only a limited number of bits offline. Interestingly, this vector construction is also shown to be an NE of the resulting game. © 2016 IEEE.

关键词： State estimation

GPI-based secrecy rate maximization beamforming scheme for wireless transmission with an-aided directional modulation

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Yu, Hai Wan, Simin Cai, Wenlong Xu, Ling Zhou, Xiaobo Wang, Jin Wu, Yongpeng Shu, Feng Wang, Jiangzhou Wang, Jianxin School of Electronic and Optical Engineering Nanjing University of Science and Technology Nanjing210094 China faculty of National Key Laboratory of Science and Technology on Aerospace Intelligence Control Beijing Aerospace Automatic Control Institute Beijing China Shanghai Key Laboratory of Navigation and Location-Based Services Shanghai Jiao Tong University Minhang200240 China College of Computer and Information Sciences Fujian Agriculture and Forestry University Fuzhou350002 China School of Engineering and Digital Arts University of Kent CanterburyCT2 7NT United Kingdom

In a directional modulation network, a general power iterative (GPI) based beamforming scheme is proposed to maximize the secrecy rate (SR), where there are two optimization variables required to be optimized. The first one is the useful precoding vector of transmitting confidential messages to the desired user while the second one is the artificial noise (AN) projection matrix of forcing more AN to eavesdroppers. In such a secure network, the paramount problem is how to design or optimize the two optimization variables by different criteria. To maximize the SR (Max-SR), an alternatively iterative structure (AIS) is established between the AN projection matrix and the precoding vector for confidential messages. To choose a good initial value of iteration process of GPI, the proposed Max-SR method can readily double its convergence speed compared to the random choice of initial value. With only four iterations, it may rapidly converge to its rate ceil. From simulation results, it follows that the SR performance of the proposed AIS of GPI-based Max-SR is much better than those of conventional leakage-based and null-space projection methods in the medium and large signal-to-noise ratio (SNR) regions, and its achievable SR performance gain gradually increases as SNR increases. Copyright © 2017, The Authors. All rights reserved.

关键词： Modulation

A Random and Coverage-based Approach for Fault Localization Prioritization

学校读者我要写书评

暂无评论

A Random and Coverage-based Approach for Fault Localization ...

第28届中国控制与决策会议

作者： Xiao-Yi Zhang Dave Towey Tsong Yueh Chen Zheng Zheng Kai-Yuan Cai Department of Automatic Control Beihang University School of Computer Science The University of Nottingham Department of Computer Science and Software Engineering Swinburne University of Technology

ISBN: (纸本)9781467397155

Fault Localization Prioritization(FLP) aims to order the execution sequence of test cases so that faulty statements in a faulty program can be localized *** is an important part of the automation of testing and fault localization in software *** key issue is to identify which test cases can provide most useful information to help locate the faulty *** the well-known technique of Spectra-Based Fault Localization(SBFL) is applied,this paper evaluates the quality of a test case based on the characteristics of its statement coverage *** propose the COverage-based Random(COR) approach to address the FLP *** statement coverage characteristics,the diversity characteristic and the failure-like characteristic,are analyzed and identified as having significant impacts on the effectiveness of fault *** using the COR approach,each test case is examined and the degree of each characteristic is measured,with test cases showing high degrees of the characteristics being assigned higher priority for *** of the power of random strategies to improve the robustness of the approach,some random factors in the selection of test cases are *** studies show that,compared with existing approaches,the COR approach results in a faster localization of faulty statements,reducing the number of necessary test case executions.

关键词： software fault localization COverage-based approaches test case prioritization