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

On the optimality of uniform velocity-deceleration separation scheme for tethered satellite systems

control Theory and Technology 2024年第4期22卷 503-516页

作者： Peng Yu Ji-Feng Zhang Shuping Tan Jin Guo Yanlong Zhao School of Automation and Electrical Engineering University of Science and Technology BeijingBeijing100083China Key Laboratory of Knowledge Automation for Industrial Processes Ministry of EducationBeijing100083China Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing100190China Beijing Institute of Control Engineering Beijing100094China

For mitigating the libration angle fluctuation of the tethered satellite system,this paper discusses how to make the uniform velocity-deceleration separation scheme achieve the best ***,a judgment condition is established to determine the tether state by comparing the tether length and the relative distance of the sub-satellite and the parent *** on the tethered satellite system dynamics equation and Clohessy-Wiltshire equation,dynamic models are given for four cases of tether ***,the influence of the uniform velocity-deceleration separation scheme on the libration angle is analyzed by taking the libration angle at the separation ending time and the mean absolute value of the libration angle as index ***,the optimality problem of the uniform velocity-deceleration separation scheme is formulated as an optimization problem with constraints,and an approximate solution algorithm is given by combining the back propagation neural network and Newton-Raphson method of multiple initial ***,the effectiveness of the proposed method is verified by a numerical simulation.

关键词： Tethered satellite systems Libration angle Uniform velocity-deceleration separation Neural network

来源：评论

学校读者我要写书评

暂无评论

On control networks over finite lattices

引用

science China(Information sciences) 2025年

作者： Zhengping JI Daizhan CHENG Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences

The modeling and control of networks over finite lattices are studied via the algebraic state space *** the semi-tensor product of matrices, we obtain the algebraic state space representation(ASSR) of the dynamics of(control) networks over finite lattices. Basic properties concerning networks over sublattices and product lattices are investigated, which shows the application of the analysis of lattice structure in the model reduction and control design of networks. Then, algorithms are developed to recover the lattice structure from the structure matrix of a network over a lattice, and to construct comparability graphs over a finite set to verify whether a multiple-valued logical network is defined over a lattice. Finally, numerical examples are presented to illustrate the results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Polynomial-Time key-Recovery Attacks Against NTRURe Encrypt from ASIACCS'15

引用

Journal of systems science & Complexity 2024年第3期37卷 1308-1325页

作者： LIU Zhen PAN Yanbin ZHENG Jinwei School of Cyber Science and Technology Hubei Key Laboratory of Applied MathematicsHubei UniversityWuhan 430062China Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100190China

In ASIACCS 2015, Nu nez, et al. proposed a proxy re-encryption scheme, named NTRURe Encrypt, based on NTRU, which allows a proxy to translate ciphertext under the delegator’s public key into a re-encrypted ciphertext that can be decrypted correctly by delegatee’s private key. Because of the potential resistance to quantum algorithm, high efficiency and various applications in real life,NTRURe Encrypt has drawn lots of attention and its security has been widely discussed and *** PQCrypto2019, Liu, et al. proposed two key recovery attacks against it. However, their first attack heavily relies on a weaken decryption oracle, and the second attack needs to collect about 260ciphertexts from the same message by theoretical analysis, which makes both of the attacks unrealistic. In this paper, inspired by the broadcast attack against NTRU, the authors find out that for NTRURe Encrypt the delegator and the delegatee can efficiently recover each other’s private key in polynomial time without any unrealistic assumptions. In addition, the authors also show how to fix NTRURe Encrypt to resist the proposed attacks. As a by-product, the authors also show how to commit broadcast attacks against NTRU 2001 with even dg, which was thought infeasible before.

关键词： Broadcast attack key recovery NTRU NTRUReEncrypt

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Output Tracking control of a Class of Linear systems by Finite-and-Quantized Output Feedback

引用

无人系统（英文） 2024年第2期12卷 249-260页

作者： Jian Guo Yanjun Zhang Ji-Feng Zhang Key Lab of Systems and Control Institute of Systems ScienceAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematics Sciences University of Chinese Academy of SciencesBejing 100149China School of Automation Beijing Institute of TechnologyBeijing 100081China State Key Lab of Autonomous Intelligent Unmanned Systems Beijing Institute of TechnologyBeijing 100081China

This paper presents a novel finite-and-quantized output feedback asymptotic tracking control method for a general class of continuous-time linear time-invariant ***,we construct a finite quantizer with time-varying thresholds and design a pole placement control law that exclusively utilizes the finite-and-quantized output signal and an external reference ***,we establish the boundedness of all closed-loop signals and prove the asymptotic convergence of the output tracking error to *** proposed method combines the advantages of classical pole placement control technique and finite quantization feedback *** not only reduces the requirement for feedback information compared with existing tracking control methods but also effectively handles unstable poles and zeros in controlled systems,thereby achieving asymptotic output ***,we provide a representative example to validate the effec-tiveness and new features of our proposed method.

关键词： Continuous-time asymptotic output tracking pole placement control quantized-output feedback

来源：评论

学校读者我要写书评

暂无评论

Reducing Hyperexponential Functions over Monomial Extensions

引用

Journal of systems science & Complexity 2025年第3期38卷 1206-1225页

作者： CHEN Shaoshi DU Hao GAO Yiman LI Ziming KLMM Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences School of Sciences Beijing University of Posts and Telecommunications Key Laboratory of Mathematics and Information Networks(BUPT) Ministry of Education

The authors extend the shell and kernel reductions for hyperexponential functions over the field of rational functions to a monomial extension. Both of the reductions are incorporated into one algorithm. As an application, the authors present an additive decomposition in rationally hyperexponential towers. The decomposition yields an alternative algorithm for computing elementary integrals over such towers. The alternative can find some elementary integrals that are unevaluated by the integrators in the latest versions of MAPLE and MATHEMATICA.

关键词： Additive decomposition hyperexponential function reduction symbolic integration

来源：评论

学校读者我要写书评

暂无评论

System identification under saturated precise or set-valued measurements

引用

science China(Information sciences) 2023年第1期66卷 224-243页

作者： Yanlong ZHAO Hang ZHANG Ting WANG Guolian KANG Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences Institute of Artificial Intelligence University of Science and Technology Beijing Department of Biostatistics St.Jude Children's Research Hospital

This paper considers the system identification problem based on saturated precise or set-valued measurements, which is widely used in various fields and has essential difficulties. Since existing methodologies cannot make full use of the mixed data, this paper is aiming to fill the gap and build a unified framework in dealing with such problems rigorously and comprehensively. New algorithms are introduced and their properties are established. Most significantly, the Cramécr-Rao(CR) lower bound based on the measurements is established, which consists of two parts with respect to the precise data and set-valued data, respectively. This prompts the idea of designing an estimation algorithm by grouping and combining the estimations under two classifications of data. As a result, a CR lower bound-based algorithm(CRBA) is constructed. The convergence properties are theoretically analyzed in terms of consistency and asymptotic efficiency under periodic inputs. For general inputs, an algorithm based on the CRBA that combines the expectation maximization(EM) algorithm for set-valued subsystems and the gradient descent algorithm for precise subsystems is proposed. Numerical simulations validate the superiority of the proposed algorithms.

关键词： system identification Cramér-Rao lower bound truncated data precise measurement set-valued measurement

来源：评论

学校读者我要写书评

暂无评论

LS-Based Parameter Estimation of DARMA systems with Uniformly Quantized Observations

引用

Journal of systems science & Complexity 2022年第3期35卷 748-765页

作者： JING Lida ZHANG Ji-Feng Key Laboratory of Systems and Control Institute of Systems ScienceAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China

This paper is concerned with the parameter estimation of deterministic autoregressive moving average(DARMA)systems with quantization *** estimation algorithms adopted here are the least squares(LS)and the forgetting factor LS,and the signal quantizer is of uniform,that is,with uniform quantization *** authors analyse the properties of the LS and the forgetting factor LS,and establish the boundedness of the estimation errors and a relationship of the estimation errors with the size of quantization error,which implies that the smaller the quantization error is,the smaller the estimation error is.A numerical example is given to demonstrate theorems.

关键词： Discrete-time linear time-invariant systems parameter estimation quantized output

来源：评论

学校读者我要写书评

暂无评论

Consensus of High-Order Multi-Agent systems with Binary-Valued Communications and Switching Topologies

引用

IEEE Transactions on control of Network systems 2024年第2期12卷 1369-1380页

作者： An, Ru Wang, Ying Zhao, Yanlong Zhang, Ji-Feng Chinese Academy of Sciences Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China KTH Royal Institute of Technology Division of Decision and Control Systems Stockholm Sweden Zhongyuan University of Technology School of Automation and Electrical Engineering Henan Province Zhengzhou450007 China

This paper studies the consensus problem of high-order multi-agent systems (MASs) with binary-valued communications and switching topologies. To tackle the challenge of unknown states caused by binary-valued communications, this paper constructs an estimation-based consensus algorithm. First, a recursive projection identification algorithm is presented to estimate the neighbors' states dynamically. Then, based on these estimates, a consensus law is designed. By constructing and analyzing two combined Lyapunov functions about estimation error and state error, this paper establishes their relation, to overcome the difficulty resulting from the coupling of the estimation and control and less information due to switching topologies. Under the condition of jointly connected topologies, it is proven that by properly selecting the step coefficient, the estimates of states can converge to the true states with a convergence rate as the reciprocal of the recursion times. Besides, the MAS is proved to achieve weak consensus and the consensus rate is also established as the reciprocal of the recursion times. Finally, a simulation example is given to validate the algorithm. © 2024 IEEE.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Equalizer Zero-Determinant Strategy in Discounted Repeated Stackelberg Asymmetric Game

引用

Journal of systems science & Complexity 2024年第1期37卷 184-203页

作者： CHENG Zhaoyang CHEN Guanpu HONG Yiguang Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China School of Electrical Engineering and Computer Science KTH Royal Institute of Technology10044 StockholmSweden. Department of Control Science and Engineering Tongji UniversityShanghai 201804China Shanghai Research Institute for Intelligent Autonomous Systems Tongji UniversityShanghai 210201China

This paper focuses on the performance of equalizer zero-determinant(ZD)strategies in discounted repeated Stackelberg asymmetric *** the leader-follower adversarial scenario,the strong Stackelberg equilibrium(SSE)deriving from the opponents’best response(BR),is technically the optimal strategy for the ***,computing an SSE strategy may be difficult since it needs to solve a mixed-integer program and has exponential complexity in the number of *** this end,the authors propose an equalizer ZD strategy,which can unilaterally restrict the opponent’s expected *** authors first study the existence of an equalizer ZD strategy with one-to-one situations,and analyze an upper bound of its performance with the baseline SSE *** the authors turn to multi-player models,where there exists one player adopting an equalizer ZD *** authors give bounds of the weighted sum of opponents’s utilities,and compare it with the SSE ***,the authors give simulations on unmanned aerial vehicles(UAVs)and the moving target defense(MTD)to verify the effectiveness of the proposed approach.

关键词： Discounted repeated Stackelberg asymmetric game equalizer zero-determinant strategy strong Stackelberg equilibrium strategy

来源：评论

学校读者我要写书评

暂无评论

On distributed Kalman filter based state estimation algorithm over a bearings-only sensor network

引用

science China(Technological sciences) 2023年第11期66卷 3174-3185页

作者： LIANG ChenXu XUE WenChao FANG HaiTao ZHANG Ran The Key Laboratory of Systems and Control National Center for Mathematics and Interdisciplinary SciencesAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China School of Astronautics Beihang UniversityBeijing 100083China

This paper studies the distributed state estimation problem for a class of discrete-time linear time-varying systems over a bearingsonly sensor network.A novel fusion estimation algorithm of the distance between the target and each sensor is constructed with the mean square error matrix of corresponding estimation being timely ***,the refined estimation of distance is presented by minimizing the mean square error ***,the distributed Kalman filter based state estimation algorithm is proposed based on the refined distance *** is rigorously proven that the proposed method has the consistency and ***,numerical simulation results show the effectiveness of our methods.

关键词： bearings-only measurements sensor network Kalman filter distributed filter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：