期刊文献+
共找到2,404篇文章
< 1 2 121 >
每页显示 20 50 100
New regularization method and iteratively reweighted algorithm for sparse vector recovery 被引量:1
1
作者 Wei ZHU Hui ZHANG Lizhi CHENG 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI CSCD 2020年第1期157-172,共16页
Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design... Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm. 展开更多
关键词 regularization method iteratively reweighted algorithm(IR-algorithm) sparse vector recovery
下载PDF
A PARALLEL COMPUTATION SCHEME FOR IMPLICIT RUNGE-KUTTA METHODS AND THE ITERATIVELY B-CONVERGENCE OF ITS NEWTON ITERATIVE PROCESS
2
作者 赵双锁 王昌银 《Numerical Mathematics A Journal of Chinese Universities(English Series)》 SCIE 1994年第1期54-66,共13页
In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and di... In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large. 展开更多
关键词 IMPLICIT Range-Kutta methods NEWTON ITERATIVE process parallel COMPUTATION iteratively B-CONVERGENCE
下载PDF
Continuous Iteratively Reweighted Least Squares Algorithm for Solving Linear Models by Convex Relaxation
3
作者 Xian Luo Wanzhou Ye 《Advances in Pure Mathematics》 2019年第6期523-533,共11页
In this paper, we present continuous iteratively reweighted least squares algorithm (CIRLS) for solving the linear models problem by convex relaxation, and prove the convergence of this algorithm. Under some condition... In this paper, we present continuous iteratively reweighted least squares algorithm (CIRLS) for solving the linear models problem by convex relaxation, and prove the convergence of this algorithm. Under some conditions, we give an error bound for the algorithm. In addition, the numerical result shows the efficiency of the algorithm. 展开更多
关键词 Linear Models CONTINUOUS iteratively Reweighted Least SQUARES CONVEX RELAXATION Principal COMPONENT Analysis
下载PDF
The Behavior of Normality when Iteratively Finding the Normal to a Line in an <sub>lp</sub>Geometry
4
作者 Joshua M. Fitzhugh David L. Farnsworth 《Advances in Pure Mathematics》 2013年第8期647-652,共6页
The normal direction to the normal direction to a line in Minkowski geometries generally does not give the original line. We show that in lp geometries with p>1?repeatedly finding the normal line through the origin... The normal direction to the normal direction to a line in Minkowski geometries generally does not give the original line. We show that in lp geometries with p>1?repeatedly finding the normal line through the origin gives sequences of lines that monotonically approach specific lines of symmetry of the unit circle. Which lines of symmetry that are approached depends upon the value of p and the slope of the initial line. 展开更多
关键词 MINKOWSKI GEOMETRY Geometric Construction Iteration NORMALITY LP GEOMETRY Radon Curve
下载PDF
An improved particle filter indoor fusion positioning approach based on Wi-Fi/PDR/geomagnetic field
5
作者 Tianfa Wang Litao Han +5 位作者 Qiaoli Kong Zeyu Li Changsong Li Jingwei Han Qi Bai Yanfei Chen 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第2期443-458,共16页
The existing indoor fusion positioning methods based on Pedestrian Dead Reckoning(PDR)and geomagnetic technology have the problems of large initial position error,low sensor accuracy,and geomagnetic mismatch.In this s... The existing indoor fusion positioning methods based on Pedestrian Dead Reckoning(PDR)and geomagnetic technology have the problems of large initial position error,low sensor accuracy,and geomagnetic mismatch.In this study,a novel indoor fusion positioning approach based on the improved particle filter algorithm by geomagnetic iterative matching is proposed,where Wi-Fi,PDR,and geomagnetic signals are integrated to improve indoor positioning performances.One important contribution is that geomagnetic iterative matching is firstly proposed based on the particle filter algorithm.During the positioning process,an iterative window and a constraint window are introduced to limit the particle generation range and the geomagnetic matching range respectively.The position is corrected several times based on geomagnetic iterative matching in the location correction stage when the pedestrian movement is detected,which made up for the shortage of only one time of geomagnetic correction in the existing particle filter algorithm.In addition,this study also proposes a real-time step detection algorithm based on multi-threshold constraints to judge whether pedestrians are moving,which satisfies the real-time requirement of our fusion positioning approach.Through experimental verification,the average positioning accuracy of the proposed approach reaches 1.59 m,which improves 33.2%compared with the existing particle filter fusion positioning algorithms. 展开更多
关键词 Fusion positioning Particle filter Geomagnetic iterative matching Iterative window Constraint window
下载PDF
西物院ITER项目强矩阵管理模式探索与成效
6
作者 周晓璐 《管理学家》 2024年第7期16-18,共3页
ITER计划是目前全球规模最大、影响最深远的国际大科学工程,由欧盟、中国、美国、日本、俄罗斯、韩国、印度等七方共35个国家参与,也是我国参与的最大的国际合作项目,我国承担任务在所有七方中完成最好,多次受到ITER总干事的表扬。文章... ITER计划是目前全球规模最大、影响最深远的国际大科学工程,由欧盟、中国、美国、日本、俄罗斯、韩国、印度等七方共35个国家参与,也是我国参与的最大的国际合作项目,我国承担任务在所有七方中完成最好,多次受到ITER总干事的表扬。文章主要针对西物院ITER项目强矩阵管理模式探索进行了总结,希望为未来参与大科学工程项目提供借鉴。 展开更多
关键词 ITER计划 项目管理 管理模式
下载PDF
Adaptive Optimal Discrete-Time Output-Feedback Using an Internal Model Principle and Adaptive Dynamic Programming
7
作者 Zhongyang Wang Youqing Wang Zdzisław Kowalczuk 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第1期131-140,共10页
In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed metho... In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed method, termed as IMP-ADP, does not require complete state feedback-merely the measurement of input and output data. More specifically, based on the IMP, the output control problem can first be converted into a stabilization problem. We then design an observer to reproduce the full state of the system by measuring the inputs and outputs. Moreover, this technique includes both a policy iteration algorithm and a value iteration algorithm to determine the optimal feedback gain without using a dynamic system model. It is important that with this concept one does not need to solve the regulator equation. Finally, this control method was tested on an inverter system of grid-connected LCLs to demonstrate that the proposed method provides the desired performance in terms of both tracking and disturbance rejection. 展开更多
关键词 Adaptive dynamic programming(ADP) internal model principle(IMP) output feedback problem policy iteration(PI) value iteration(VI)
下载PDF
MAUN:Memory-Augmented Deep Unfolding Network for Hyperspectral Image Reconstruction
8
作者 Qian Hu Jiayi Ma +2 位作者 Yuan Gao Junjun Jiang Yixuan Yuan 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第5期1139-1150,共12页
Spectral compressive imaging has emerged as a powerful technique to collect the 3D spectral information as 2D measurements.The algorithm for restoring the original 3D hyperspectral images(HSIs)from compressive measure... Spectral compressive imaging has emerged as a powerful technique to collect the 3D spectral information as 2D measurements.The algorithm for restoring the original 3D hyperspectral images(HSIs)from compressive measurements is pivotal in the imaging process.Early approaches painstakingly designed networks to directly map compressive measurements to HSIs,resulting in the lack of interpretability without exploiting the imaging priors.While some recent works have introduced the deep unfolding framework for explainable reconstruction,the performance of these methods is still limited by the weak information transmission between iterative stages.In this paper,we propose a Memory-Augmented deep Unfolding Network,termed MAUN,for explainable and accurate HSI reconstruction.Specifically,MAUN implements a novel CNN scheme to facilitate a better extrapolation step of the fast iterative shrinkage-thresholding algorithm,introducing an extra momentum incorporation step for each iteration to alleviate the information loss.Moreover,to exploit the high correlation of intermediate images from neighboring iterations,we customize a cross-stage transformer(CSFormer)as the deep denoiser to simultaneously capture self-similarity from both in-stage and cross-stage features,which is the first attempt to model the long-distance dependencies between iteration stages.Extensive experiments demonstrate that the proposed MAUN is superior to other state-of-the-art methods both visually and metrically.Our code is publicly available at https://github.com/HuQ1an/MAUN. 展开更多
关键词 DEEP FOLDING ITERATION
下载PDF
Data-Driven Learning Control Algorithms for Unachievable Tracking Problems
9
作者 Zeyi Zhang Hao Jiang +1 位作者 Dong Shen Samer S.Saab 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第1期205-218,共14页
For unachievable tracking problems, where the system output cannot precisely track a given reference, achieving the best possible approximation for the reference trajectory becomes the objective. This study aims to in... For unachievable tracking problems, where the system output cannot precisely track a given reference, achieving the best possible approximation for the reference trajectory becomes the objective. This study aims to investigate solutions using the Ptype learning control scheme. Initially, we demonstrate the necessity of gradient information for achieving the best approximation.Subsequently, we propose an input-output-driven learning gain design to handle the imprecise gradients of a class of uncertain systems. However, it is discovered that the desired performance may not be attainable when faced with incomplete information.To address this issue, an extended iterative learning control scheme is introduced. In this scheme, the tracking errors are modified through output data sampling, which incorporates lowmemory footprints and offers flexibility in learning gain design.The input sequence is shown to converge towards the desired input, resulting in an output that is closest to the given reference in the least square sense. Numerical simulations are provided to validate the theoretical findings. 展开更多
关键词 Data-driven algorithms incomplete information iterative learning control gradient information unachievable problems
下载PDF
Fault Estimation for a Class of Markov Jump Piecewise-Affine Systems: Current Feedback Based Iterative Learning Approach
10
作者 Yanzheng Zhu Nuo Xu +2 位作者 Fen Wu Xinkai Chen Donghua Zhou 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第2期418-429,共12页
In this paper, the issues of stochastic stability analysis and fault estimation are investigated for a class of continuoustime Markov jump piecewise-affine(PWA) systems against actuator and sensor faults. Firstly, a n... In this paper, the issues of stochastic stability analysis and fault estimation are investigated for a class of continuoustime Markov jump piecewise-affine(PWA) systems against actuator and sensor faults. Firstly, a novel mode-dependent PWA iterative learning observer with current feedback is designed to estimate the system states and faults, simultaneously, which contains both the previous iteration information and the current feedback mechanism. The auxiliary feedback channel optimizes the response speed of the observer, therefore the estimation error would converge to zero rapidly. Then, sufficient conditions for stochastic stability with guaranteed performance are demonstrated for the estimation error system, and the equivalence relations between the system information and the estimated information can be established via iterative accumulating representation.Finally, two illustrative examples containing a class of tunnel diode circuit systems are presented to fully demonstrate the effectiveness and superiority of the proposed iterative learning observer with current feedback. 展开更多
关键词 Current feedback fault estimation iterative learning observer Markov jump piecewise-affine system
下载PDF
Fast and Accurate Predictor-Corrector Methods Using Feedback-Accelerated Picard Iteration for Strongly Nonlinear Problems
11
作者 Xuechuan Wang Wei He +1 位作者 Haoyang Feng Satya N.Atluri 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第5期1263-1294,共32页
Although predictor-corrector methods have been extensively applied,they might not meet the requirements of practical applications and engineering tasks,particularly when high accuracy and efficiency are necessary.A no... Although predictor-corrector methods have been extensively applied,they might not meet the requirements of practical applications and engineering tasks,particularly when high accuracy and efficiency are necessary.A novel class of correctors based on feedback-accelerated Picard iteration(FAPI)is proposed to further enhance computational performance.With optimal feedback terms that do not require inversion of matrices,significantly faster convergence speed and higher numerical accuracy are achieved by these correctors compared with their counterparts;however,the computational complexities are comparably low.These advantages enable nonlinear engineering problems to be solved quickly and accurately,even with rough initial guesses from elementary predictors.The proposed method offers flexibility,enabling the use of the generated correctors for either bulk processing of collocation nodes in a domain or successive corrections of a single node in a finite difference approach.In our method,the functional formulas of FAPI are discretized into numerical forms using the collocation approach.These collocated iteration formulas can directly solve nonlinear problems,but they may require significant computational resources because of the manipulation of high-dimensionalmatrices.To address this,the collocated iteration formulas are further converted into finite difference forms,enabling the design of lightweight predictor-corrector algorithms for real-time computation.The generality of the proposed method is illustrated by deriving new correctors for three commonly employed finite-difference approaches:the modified Euler approach,the Adams-Bashforth-Moulton approach,and the implicit Runge-Kutta approach.Subsequently,the updated approaches are tested in solving strongly nonlinear problems,including the Matthieu equation,the Duffing equation,and the low-earth-orbit tracking problem.The numerical findings confirm the computational accuracy and efficiency of the derived predictor-corrector algorithms. 展开更多
关键词 Predictor-corrector method feedback-accelerated Picard iteration nonlinear dynamical system real-time computation
下载PDF
On traceable iterated line graph and hamiltonian path index
12
作者 NIU Zhao-hong XIONG Li-ming YANG Wei-hua 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2024年第2期239-252,共14页
Xiong and Liu[21]gave a characterization of the graphs G for which the n-iterated line graph L^(n)(G)is hamiltonian,for n≥2.In this paper,we study the existence of a hamiltonian path in L^(n)(G),and give a characteri... Xiong and Liu[21]gave a characterization of the graphs G for which the n-iterated line graph L^(n)(G)is hamiltonian,for n≥2.In this paper,we study the existence of a hamiltonian path in L^(n)(G),and give a characterization of G for which L^(n)(G)has a hamiltonian path.As applications,we use this characterization to give several upper bounds on the hamiltonian path index of a graph. 展开更多
关键词 iterated line graph TRACEABLE hamiltonian index hamiltonian path index
下载PDF
Value Iteration-Based Cooperative Adaptive Optimal Control for Multi-Player Differential Games With Incomplete Information
13
作者 Yun Zhang Lulu Zhang Yunze Cai 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第3期690-697,共8页
This paper presents a novel cooperative value iteration(VI)-based adaptive dynamic programming method for multi-player differential game models with a convergence proof.The players are divided into two groups in the l... This paper presents a novel cooperative value iteration(VI)-based adaptive dynamic programming method for multi-player differential game models with a convergence proof.The players are divided into two groups in the learning process and adapt their policies sequentially.Our method removes the dependence of admissible initial policies,which is one of the main drawbacks of the PI-based frameworks.Furthermore,this algorithm enables the players to adapt their control policies without full knowledge of others’ system parameters or control laws.The efficacy of our method is illustrated by three examples. 展开更多
关键词 Adaptive dynamic programming incomplete information multi-player differential game value iteration
下载PDF
A novel algorithm for evaluating cement azimuthal density based on perturbation theory in horizontal well
14
作者 Ji-Lin Fan Feng Zhang +3 位作者 Qian Chen Hao-Chen Song Lu-Yu Zhong Yue-Xiang Dai 《Petroleum Science》 SCIE EI CAS CSCD 2024年第1期244-251,共8页
Cement density monitoring plays a vital role in evaluating the quality of cementing projects,which is of great significance to the development of oil and gas.However,the presence of inhomogeneous cement distribution a... Cement density monitoring plays a vital role in evaluating the quality of cementing projects,which is of great significance to the development of oil and gas.However,the presence of inhomogeneous cement distribution and casing eccentricity in horizontal wells often complicates the accurate evaluation of cement azimuthal density.In this regard,this paper proposes an algorithm to calculate the cement azimuthal density in horizontal wells using a multi-detector gamma-ray detection system.The spatial dynamic response functions are simulated to obtain the influence of cement density on gamma-ray counts by the perturbation theory,and the contribution of cement density in six sectors to the gamma-ray recorded by different detectors is obtained by integrating the spatial dynamic response functions.Combined with the relationship between gamma-ray counts and cement density,a multi-parameter calculation equation system is established,and the regularized Newton iteration method is employed to invert casing eccentricity and cement azimuthal density.This approach ensures the stability of the inversion process while simultaneously achieving an accuracy of 0.05 g/cm^(3) for the cement azimuthal density.This accuracy level is ten times higher compared to density accuracy calculated using calibration equations.Overall,this algorithm enhances the accuracy of cement azimuthal density evaluation,provides valuable technical support for the monitoring of cement azimuthal density in the oil and gas industry. 展开更多
关键词 Cement azimuthal density Perturbation theory Casing eccentricity Spatial dynamic response function Regularized Newton iteration
下载PDF
Calculation of Mass Concrete Temperature Containing Cooling Water Pipe Based on Substructure and Iteration Algorithm
15
作者 Heng Zhang Chao Su +2 位作者 Zhizhong Song Zhenzhong Shen Huiguang Lei 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第1期813-826,共14页
Mathematical physics equations are often utilized to describe physical phenomena in various fields of science and engineering.One such equation is the Fourier equation,which is a commonly used and effective method for... Mathematical physics equations are often utilized to describe physical phenomena in various fields of science and engineering.One such equation is the Fourier equation,which is a commonly used and effective method for evaluating the effectiveness of temperature control measures for mass concrete.One important measure for temperature control in mass concrete is the use of cooling water pipes.However,the mismatch of grids between large-scale concrete models and small-scale cooling pipe models can result in a significant waste of calculation time when using the finite element method.Moreover,the temperature of the water in the cooling pipe needs to be iteratively calculated during the thermal transfer process.The substructure method can effectively solve this problem,and it has been validated by scholars.The Abaqus/Python secondary development technology provides engineers with enough flexibility to combine the substructure method with an iteration algorithm,which enables the creation of a parametric modeling calculation for cooling water pipes.This paper proposes such a method,which involves iterating the water pipe boundary and establishing the water pipe unit substructure to numerically simulate the concrete temperature field that contains a cooling water pipe.To verify the feasibility and accuracy of the proposed method,two classic numerical examples were analyzed.The results showed that this method has good applicability in cooling pipe calculations.When the value of the iteration parameterαis 0.4,the boundary temperature of the cooling water pipes can meet the accuracy requirements after 4∼5 iterations,effectively improving the computational efficiency.Overall,this approach provides a useful tool for engineers to analyze the temperature control measures accurately and efficiently for mass concrete,such as cooling water pipes,using Abaqus/Python secondary development. 展开更多
关键词 Fourier equation cooling water pipe mass concrete iteration algorithm
下载PDF
Noise-Tolerant ZNN-Based Data-Driven Iterative Learning Control for Discrete Nonaffine Nonlinear MIMO Repetitive Systems
16
作者 Yunfeng Hu Chong Zhang +4 位作者 Bo Wang Jing Zhao Xun Gong Jinwu Gao Hong Chen 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第2期344-361,共18页
Aiming at the tracking problem of a class of discrete nonaffine nonlinear multi-input multi-output(MIMO) repetitive systems subjected to separable and nonseparable disturbances, a novel data-driven iterative learning ... Aiming at the tracking problem of a class of discrete nonaffine nonlinear multi-input multi-output(MIMO) repetitive systems subjected to separable and nonseparable disturbances, a novel data-driven iterative learning control(ILC) scheme based on the zeroing neural networks(ZNNs) is proposed. First, the equivalent dynamic linearization data model is obtained by means of dynamic linearization technology, which exists theoretically in the iteration domain. Then, the iterative extended state observer(IESO) is developed to estimate the disturbance and the coupling between systems, and the decoupled dynamic linearization model is obtained for the purpose of controller synthesis. To solve the zero-seeking tracking problem with inherent tolerance of noise,an ILC based on noise-tolerant modified ZNN is proposed. The strict assumptions imposed on the initialization conditions of each iteration in the existing ILC methods can be absolutely removed with our method. In addition, theoretical analysis indicates that the modified ZNN can converge to the exact solution of the zero-seeking tracking problem. Finally, a generalized example and an application-oriented example are presented to verify the effectiveness and superiority of the proposed process. 展开更多
关键词 Adaptive control control system synthesis data-driven iterative learning control neurocontroller nonlinear discrete time systems
下载PDF
一种基于迭代近端投影的被动声纳探测离网格DOA估计方法
17
作者 戴泽华 张亮 +1 位作者 韩笑 殷敬伟 《哈尔滨工程大学学报(英文版)》 CSCD 2024年第2期417-424,共8页
Traditional direction of arrival(DOA)estimation methods based on sparse reconstruction commonly use convex or smooth functions to approximate non-convex and non-smooth sparse representation problems.This approach ofte... Traditional direction of arrival(DOA)estimation methods based on sparse reconstruction commonly use convex or smooth functions to approximate non-convex and non-smooth sparse representation problems.This approach often introduces errors into the sparse representation model,necessitating the development of improved DOA estimation algorithms.Moreover,conventional DOA estimation methods typically assume that the signal coincides with a predetermined grid.However,in reality,this assumption often does not hold true.The likelihood of a signal not aligning precisely with the predefined grid is high,resulting in potential grid mismatch issues for the algorithm.To address the challenges associated with grid mismatch and errors in sparse representation models,this article proposes a novel high-performance off-grid DOA estimation approach based on iterative proximal projection(IPP).In the proposed method,we employ an alternating optimization strategy to jointly estimate sparse signals and grid offset parameters.A proximal function optimization model is utilized to address non-convex and non-smooth sparse representation problems in DOA estimation.Subsequently,we leverage the smoothly clipped absolute deviation penalty(SCAD)function to compute the proximal operator for solving the model.Simulation and sea trial experiments have validated the superiority of the proposed method in terms of higher resolution and more accurate DOA estimation performance when compared to both traditional sparse reconstruction methods and advanced off-grid techniques. 展开更多
关键词 DOA estimation Sparse reconstruction Off-grid model Iterative proximal projection Passive sonar detection
下载PDF
Existence and numerical approximation of a solution to frictional contact problem for electro-elastic materials
18
作者 Othman Baiz EL-Hassan Benkhira Rachid Fakhar 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2024年第2期201-219,共19页
In this paper,a frictional contact problem between an electro-elastic body and an electrically conductive foundation is studied.The contact is modeled by normal compliance with finite penetration and a version of Coul... In this paper,a frictional contact problem between an electro-elastic body and an electrically conductive foundation is studied.The contact is modeled by normal compliance with finite penetration and a version of Coulomb’s law of dry friction in which the coefficient of friction depends on the slip.In addition,the effects of the electrical conductivity of the foundation are taken into account.This model leads to a coupled system of the quasi-variational inequality of the elliptic type for the displacement and the nonlinear variational equation for the electric potential.The existence of a weak solution is proved by using an abstract result for elliptic variational inequalities and a fixed point argument.Then,a finite element approximation of the problem is presented.Under some regularity conditions,an optimal order error estimate of the approximate solution is derived.Finally,a successive iteration technique is used to solve the problem numerically and a convergence result is established. 展开更多
关键词 piezoelectric material frictional contact variational Inequality fixed point process finite element method error estimation iteration method
下载PDF
Adaptive state-constrained/model-free iterative sliding mode control for aerial robot trajectory tracking
19
作者 Chen AN Jiaxi ZHOU Kai WANG 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI CSCD 2024年第4期603-618,共16页
This paper develops a novel hierarchical control strategy for improving the trajectory tracking capability of aerial robots under parameter uncertainties.The hierarchical control strategy is composed of an adaptive sl... This paper develops a novel hierarchical control strategy for improving the trajectory tracking capability of aerial robots under parameter uncertainties.The hierarchical control strategy is composed of an adaptive sliding mode controller and a model-free iterative sliding mode controller(MFISMC).A position controller is designed based on adaptive sliding mode control(SMC)to safely drive the aerial robot and ensure fast state convergence under external disturbances.Additionally,the MFISMC acts as an attitude controller to estimate the unmodeled dynamics without detailed knowledge of aerial robots.Then,the adaption laws are derived with the Lyapunov theory to guarantee the asymptotic tracking of the system state.Finally,to demonstrate the performance and robustness of the proposed control strategy,numerical simulations are carried out,which are also compared with other conventional strategies,such as proportional-integralderivative(PID),backstepping(BS),and SMC.The simulation results indicate that the proposed hierarchical control strategy can fulfill zero steady-state error and achieve faster convergence compared with conventional strategies. 展开更多
关键词 aerial robot hierarchical control strategy model-free iterative sliding mode controller(MFISMC) trajectory tracking reinforcement learning
下载PDF
Iterative physical optics method based on efficient occlusion judgment with bounding volume hierarchy technology
20
作者 Yang Su Yu-Mao Wu Jun Hu 《Journal of Electronic Science and Technology》 EI CAS CSCD 2024年第1期1-12,共12页
This paper builds a binary tree for the target based on the bounding volume hierarchy technology,thereby achieving strict acceleration of the shadow judgment process and reducing the computational complexity from the ... This paper builds a binary tree for the target based on the bounding volume hierarchy technology,thereby achieving strict acceleration of the shadow judgment process and reducing the computational complexity from the original O(N^(3))to O(N^(2)logN).Numerical results show that the proposed method is more efficient than the traditional method.It is verified in multiple examples that the proposed method can complete the convergence of the current.Moreover,the proposed method avoids the error of judging the lit-shadow relationship based on the normal vector,which is beneficial to current iteration and convergence.Compared with the brute force method,the current method can improve the simulation efficiency by 2 orders of magnitude.The proposed method is more suitable for scattering problems in electrically large cavities and complex scenarios. 展开更多
关键词 Bounding volume hierarchy Cavity scattering Iterative physical optics(IPO)
下载PDF
上一页 1 2 121 下一页 到第
使用帮助 返回顶部