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

Separable Synchronous Multi-Innovation Gradient-Based iterative Signal Modeling From On-Line Measurements

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2022年 71卷

作者： Xu, Ling Ding, Feng Zhu, Quanmin Jiangnan Univ Sch Internet Things Engn Minist Educ Key Lab Adv Proc Control Light Ind Wuxi 214122 Jiangsu Peoples R China Wuxi Vocat Inst Commerce Sch Internet Things Technol Wuxi 214153 Jiangsu Peoples R China Univ West England Dept Engn Design & Math Bristol BS16 1QY Avon England

This article is aimed to study the modeling problems of combinational signals or periodic signals. To overcome the computation complexity of modeling the signals with plenty of characteristic parameters, a parameter separation scheme is developed based on the different characteristic of the signals to be modeled. For the purpose of achieving high-accuracy performance and reducing complexity, two multi-innovation gradient-based iterative (MIGI) subalgorithms are presented by means of gradient search. In terms of the phenomenon that the coupling parameters lead to the inability of algorithms, a separable synchronous (SS) interactive estimation method is proposed to eliminate the coupling parameters and perform the signal modeling algorithm in accordance with the hierarchical principle. By means of simulation experiments, the proposed SS iterative signal modeling algorithm based on the moving batch data is used for estimating a power signal with three sine waves and a periodic square wave signal. The results demonstrate the effectiveness of the proposed method for modeling the combinational signals with multiple frequencies and other periodic signals. Since the proposed method combines real-time data sampling and iterative estimation, it can be used for on-line identification.

关键词： Computational modeling Estimation Data models Technological innovation Frequency estimation Real-time systems iterative algorithms Gradient search hierarchical identification iterative algorithm multi-innovation identification parameter estimation signal modeling

来源：评论

学校读者我要写书评

暂无评论

Shortest Dubins Paths to Intercept a Target Moving on a Circle

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2022年第11期45卷 2107-2120页

作者： Manyam, Satyanarayana Gupta Casbeer, David W. Von Moll, Alexander Fuchs, Zachariah Infoscitex Corp 4027 Col Glenn HwySuite 210 Dayton OH 45431 USA Air Force Res Labs Control Ctr Excellence Wright Patterson AFB OH 45433 USA Univ Cincinnati Dept Elect Engn Cincinnati OH 45221 USA

We present a path planning problem for a pursuing unmanned aerial vehicle (UAV) to intercept a target traveling on a circle. The target is cooperative, and its position, heading, and speed are precisely known. The pursuing UAV has nonholonomic motion constraints, and therefore the path traveled must satisfy the minimum turn radius constraints. We consider the class of Dubins paths as candidate solutions, and analyze the characteristics of the six modes of Dubins paths where the final position is restricted to lie on the target circle with heading in the tangential direction of the circle. For each Dubins mode, we derive the feasibility limits, discontinuities, and local extrema. Using this analysis the intercepting paths are found by a systematic bisection search in the feasible regions of each of the Dubins modes. We prove that the algorithm finds the optimal (shortest length) intercepting path if it is a Dubins path. If the shortest intercepting path is not a Dubins path for any given instance, the algorithm finds a tight lower bound and an upper bound to the optimal solution.

关键词： Autonomous Unmanned Aerial Vehicles Path Planning Fixed Wing Aircraft Optimal Control iterative algorithm Aerial Refueling Ocean Currents Autopilot Python

来源：评论

学校读者我要写书评

暂无评论

iterative synthesis of binary inline Fresnel holograms for high-quality reconstruction in divergent beams with DMD

引用

OPTICS AND LASERS IN ENGINEERING 2022年 150卷

作者： Cheremkhin, Pavel A. Evtikhiev, Nikolay N. Krasnov, Vitaly V. Starikov, Rostislav S. Zlokazov, Evgenii Yu Natl Res Nucl Univ MEPhI Moscow Engn Phys Inst Kashirskoe Shosse 31 Moscow Russia

Aim of this paper is formation of single focused diffraction order using binary amplitude modulation for digital micromirror device (DMD) applications. This can be achieved by using inline binary Fresnel holograms with divergent incident beam. However, extremely low reconstruction quality and diffraction efficiency of such holograms, synthesized by conventional means, prevent it. Here, we present new iterative method of synthesis of binary inline Fresnel holograms with much higher image reconstruction quality and diffraction efficiency compared to standard technique of hologram direct calculation. Synthesis procedure was carried out in two stages. The first stage of the new technique is based on Gerchberg-Saxton algorithm with two principal differences. First one is that synthesized diffractive optical element (DOE) is not a phase one, but an inline binary amplitude hologram. And second difference is that incident wavefront is spherical instead of a plane one. The second stage includes an application of the direct search with random trajectory method which greatly improves hologram characteristics by consequent processing of every pixel in it. The resulting binary inline Fresnel holograms in comparison to ones, synthesized using direct calculation method, have up to 11 times lower reconstruction error and up to 4 times higher diffraction efficiency. Results of optical reconstruction using DMD also demonstrate superiority of the new approach.

关键词： Amplitude DOE Divergent beams DOE synthesis iterative algorithm Digital micromirror device Binarization

来源：评论

学校读者我要写书评

暂无评论

Finding minimal solutions to the system of addition-min fuzzy relational inequalities

引用

FUZZY OPTIMIZATION AND DECISION MAKING 2022年第4期21卷 581-603页

作者： Wu, Yan-Kuen Wen, Ching-Feng Hsu, Yuan-Teng Wang, Ming-Xian Zhejiang Yuexiu Univ Foreign Languages Sch Int Business Shaoxing Key Lab Intelligent Monitoring & Prevent Shaoxing Zhejiang Peoples R China Kaohsiung Med Univ Ctr Fundamental Sci Kaohsiung Taiwan Kaohsiung Med Univ Res Ctr Nonlinear Anal & Optimizat Kaohsiung Taiwan Kaohsiung Med Univ Hosp Dept Med Res Kaohsiung 80708 Taiwan Shanghai Business Sch Res Ctr Finance Shanghai Peoples R China Zhejiang Yuexiu Univ Foreign Languages Sch Int Business Shaoxing 312000 Zhejiang Peoples R China

In the literature, a BitTorrent-like peer-to-peer file-sharing system has been modelled as a system of addition-min fuzzy relational inequalities (FRIs). Finding all minimal solutions of such a system is considered a difficult task because the minimal solutions to addition-min FRIs are usually not unique and are often infinite in number. In this paper, we study the properties of the minimal solutions of such a system and propose an iterative algorithm to find the minimal solutions for any given solution (included the maximum solution). The proposed algorithm not only finds the minimal solutions efficiently, but also finds many minimal solutions in different iterative sequences of variables.

关键词： Minimal solution Addition-min composition Fuzzy relational inequality iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

A tri-level approach for coordinated transmission and distribution system expansion planning considering deployment of energy hubs

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2022年第19期16卷 3966-4006页

作者： Allahvirdizadeh, Yousef Shayanfar, Heidarali Moghaddam, Mohsen Parsa Iran Univ Sci & Technol Sch Elect Engn Ctr Excellence Power Syst Automat & Operat Tehran *** Iran Tarbiat Modares Univ Sch Elect & Comp Engn Tehran Iran

This paper presents a tri-level stochastic coordinated transmission and distribution system expansion (CTDS) planning considering the deployment of energy hubs (EHs) across the distribution systems (DSs). The first level of the proposed optimization approach deals with transmission system expansion planning (TEP), while the second level develops distribution system expansion planning (DEP). Market clearing is done in the third level to update the locational marginal prices (LMPs) for different distribution system operators (DSOs). The EHs include photovoltaic cells (PVs), wind turbines (WTs), combined heating and power units (CHPs), boilers, and electrical and absorption chillers. The proposed tri-level approach is solved with an iterative algorithm based on the diagonalization approach and tested on the modified IEEE 30-bus transmission systems (TS) with several DSOs. Each DSO includes 18-bus electrical, heating, and cooling energy systems. The numerical analysis shows that the total cost of the transmission system operator (TSO) is not changed with implementing the uncoordinated approach. However, the total cost of the whole system is reduced by 6.54% with accommodation of the EHs in the uncoordinated approach. Moreover, the total cost of the TSO as well as the whole system are reduced by 41.11% and 16.96%, respectively, with the proposed (CTDS) planning.

关键词： photovoltaic cells transmission system expansion planning cooling energy systems optimisation distribution system operators absorption chillers energy hubs cogeneration wind turbines power transmission planning optimization approach boilers diagonalization approach modified IEEE 30-bus transmission systems power distribution planning distribution system expansion planning combined heating and power units iterative algorithm tri-level stochastic coordinated transmission transmission system operator

来源：评论

学校读者我要写书评

暂无评论

On the Performance of Channel Occupancy Rate Estimation With iterative Threshold Setting in Cognitive Radios

引用

IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING 2022年第4期8卷 1716-1729页

作者： He, Ming Jin, Ming Guo, Qinghua Lopez-Benitez, Miguel Zhang, Wei Ningbo Univ Fac Elect Engn & Comp Sci Ningbo 315211 Peoples R China Univ Wollongong Sch Elect Comp & Telecommun Engn Wollongong NSW 2522 Australia Univ Liverpool Dept Elect Engn & Elect Liverpool L69 3GJ Merseyside England Antonio de Nebrija Univ ARIES Res Ctr Madrid 28040 Spain Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia

With the knowledge of channel occupancy rate (COR), cognitive radios can significantly improve their performance in exploring and exploiting spectrum holes. However, most existing COR estimators suffer from overestimation or underestimation even at high signal-to-noise ratios (SNRs). The iterative threshold-setting algorithm (ITA) is promising to address this issue. In this work, we revisit ITA and provide a thorough theoretical analysis of ITA. First, we prove that ITA converges to the true COR with a sufficiently large number of traffic samples. Then, we investigate its convergence when the number of traffic samples is small, and show that ITA deviates from the true COR especially at low SNRs. To address this issue, we analyze the upper bound of the number of traffic samples required to achieve a certain estimation error, and further propose an improved ITA (iITA). The proposed iITA enables us to achieve a prespecified estimation accuracy by adaptively adjusting the number of traffic samples. Extensive simulation results are provided, which validate our analyses and demonstrate the superior performance of ITA and iITA compared to state-of-the-art COR estimators.

关键词： Cognitive radio channel occupancy rate convergence mechanism iterative algorithm primary user traffic

来源：评论

学校读者我要写书评

暂无评论

iterative METHODS FOR OBTAINING AN INFINITE FAMILY OF STRICT PSEUDO-CONTRACTIONS IN BANACH SPACES

引用

Acta Mathematica Scientia 2022年第5期42卷 1765-1778页

作者： Meng WEN Haiyang LI Changsong HU Jigen PENG School of Mathematics and Information Science Guangzhou UniversityGuangzhou 510006China School of Science Xi'an Polytechnic UniversityXi'an 710048China Department of Mathematics Hubei Normal UniversityHuangshi 435002China

In this paper,we introduce a general hybrid iterative method to find an infinite family of strict pseudo-contractions in a q-uniformly smooth and strictly convex Banach ***,we show that the sequence defined by the iterative method converges strongly to a common element of the set of fixed points,which is the unique solution of the variational inequality<(λφ−νF)z,jq(z−z)>≤0,for z∈⋂_(i=1)^(∞)Γ(S_(i)).The results introduced in our work extend to some corresponding theorems.

关键词： MKC iterative algorithm strict pseudo-contraction β-Lipschitzian d-strongly monotone Banach spaces

来源：评论

学校读者我要写书评

暂无评论

On the Solution of Generalized Lyapunov Equations for a Class of Continuous Bilinear Time-Varying Systems

引用

AUTOMATION AND REMOTE CONTROL 2022年第5期83卷 677-691页

作者： Yadykin, I. B. Galyaev, I. A. Vershinin, Yu A. Russian Acad Sci Trapeznikov Inst Control Sci Moscow 117997 Russia

We have developed a method and algorithms for solving the generalized Lyapunov equation for a wide class of continuous time-varying bilinear systems based on the Gramian method and an iterative solution construction method proposed earlier for such equations. The approach consists in diagonalizing the original system, obtaining a separable spectral decomposition of the Gramian of the time-invariant linear part in terms of the combination spectrum of the dynamics matrix of the linear part, applying the spectral decomposition of the kernel matrix of the solution obtained at the previous step at each iteration step, and then aggregating the matrix entries. A spectral decomposition of the Gramians of controllability and observability of a time-varying bilinear system is obtained as the sum of sub-Gramian matrices corresponding to pair combinations of the eigenvalues of the dynamics matrix of the linear part. A new method and algorithm for entry-by-entry calculation of matrices for solving the generalized Lyapunov equation for bilinear systems has been developed. The fundamental novelty of the approach lies in the transfer of calculations from the solution matrix to the calculation of the sequence of its entries at each iteration step.

关键词： spectral decomposition generalized Lyapunov equation bilinear system time-varying system iterative algorithm Volterra matrix equation

来源：评论

学校读者我要写书评

暂无评论

Incentive Stackelberg game for H∞$H_\infty$-constrained multi-hierarchy systems under observation information

引用

IET CONTROL THEORY AND APPLICATIONS 2022年第18期16卷 1821-1833页

作者： Li, Xiaoqian Bai, Mengyu Zhang, Huanshui Jing, Zonglei Ju, Peijun Guo, Zhongjin Taishan Univ Sch Math & Stat Dongyue Rd 525 Tai An 271000 Shandong Peoples R China Shandong Univ Sci & Technol Sch Elect Engn & Automat Qingdao Peoples R China Beihang Univ Coll Software Beijing Peoples R China

This paper considers the incentive feedback Stackelberg game with multi-hierarchy players under a H infinity$H_\infty$ constraint, with the proposed solution involving nested hierarchies A and B. In hierarchy A, P-0 represents the leader (the leader's control input corresponding to i-th follower, i=1,2, horizontal ellipsis ,n$i=1,2,\ldots ,n$), and P1, horizontal ellipsis ,Pn$P_1,\ldots ,P_n$ are the followers, with non-cooperative followers induced to virtually cooperate in achieving team-optimal solution and the Nash equilibrium. In hierarchy B, the external disturbance represents the follower, and hierarchy A represents the leader. The main contributions of this work are three-fold. First, an incentive Stackelberg strategy set under the H infinity$H_\infty$ constraint through observation information is obtained for the first time. Second, a novel iterative algorithm to solve the coupled backward and forward Riccati equations is introduced and thus obtaining an explicit expression of a team-optimal feedback Stackelberg strategy set with an H infinity$H_\infty$ constraint. Finally, the necessary and sufficient conditions for the existence and uniqueness of the hierarchical game's optimal solutions using the Lyapunov equation and the induction algorithm are presented.

关键词： sufficient conditions multihierarchy players nested hierarchies constrained multihierarchy systems Riccati equations team-optimal feedback Stackelberg strategy hierarchical game forward Riccati equations external disturbance coupled backward Riccati equations necessary conditions iterative algorithm incentive feedback Stackelberg game iterative methods feedback Nash equilibrium leader control input Lyapunov equation observation information game theory

来源：评论

学校读者我要写书评

暂无评论

A User Centric Blockage Model for Wireless Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2022年第10期21卷 8431-8440页

作者： Baccelli, Francois Liu, Bin Decreusefond, Laurent Song, Rongfang Telecom Paris INRIA ENS F-91120 Paris France Telecom Paris LTCI F-91120 Paris France Nanjing Univ Posts & Telecommun Coll Telecommun & Informat Engn Nanjing 210023 Peoples R China

This paper proposes a cascade blockage model for analyzing the vision that a user has of a wireless network. This model, inspired by the classical multiplicative cascade models, has a radial structure meant to analyze blockages seen by the receiver at the origin in different angular sectors. The main novelty is that it is based on the geometry of obstacles and takes the joint blockage phenomenon into account. We show on a couple of simple instances that the Laplace transforms of total interference satisfies a functional equation that can be solved efficiently by an iterative scheme. This is used to analyze the coverage probability of the receiver and the effect of blockage correlation and penetration loss in both dense and sparse blockage environments. Furthermore, this model is used to investigate the effect of blockage correlation on user beamforming techniques. Another functional equation and its associated iterative algorithm are proposed to derive the coverage performance of the best beam selection in this context. In addition, the conditional coverage probability is also derived to evaluate the effect of beam switching. The results not only show that beam selection is quite efficient for multi-beam terminals, but also show how the correlation brought by blockages can be leveraged to accelerate beam sweeping and pairing.

关键词： Mathematical models Interference Array signal processing Correlation Switches Shadow mapping Analytical models Stochastic geometry multiplicative cascade blockage beamforming best beam selection iterative algorithm coverage probability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：