Since adopting the spherical wave model in near-field, the imperfect resolution of beamfocusing has significantly enabled non-orthogonal multiple access (NOMA) technique to enhance spectrum efficiency, where one user&...
详细信息
The voltage closed-loop field-weakening control is an effective way to extend the speed of permanent magnet synchronous motors (PMSMs). However, the serious voltage overshoot always exists in the transition process en...
详细信息
The traditional BP neural network can identify the parameters of permanent magnet synchronous motor, but the identification accuracy of the algorithm is poor, and the dynamic identification is difficult to meet the ne...
详细信息
The permanent magnet synchronous motor (PMSM) adopts the current vector control method with id = 0 to achieve current decoupling of the d-q axis during static processes. However, this method does not solve the problem...
详细信息
To address the eccentric error of circular marks in camera calibration,a circle location method based on the invariance of collinear points and pole–polar constraint is proposed in this ***,the centers of the ellipse...
详细信息
To address the eccentric error of circular marks in camera calibration,a circle location method based on the invariance of collinear points and pole–polar constraint is proposed in this ***,the centers of the ellipses are extracted,and the real concentric circle center projection equation is established by exploiting the cross ratio invariance of the collinear ***,since the infinite lines passing through the centers of the marks are parallel,the other center projection coordinates are expressed as the solution problem of linear *** problem of projection deviation caused by using the center of the ellipse as the real circle center projection is addressed,and the results are utilized as the true image points to achieve the high precision camera *** demonstrated by the simulations and practical experiments,the proposed method performs a better location and calibration performance by achieving the actual center projection of circular *** relevant results confirm the precision and robustness of the proposed approach.
Servo motor and transmission device are important equipment in modern industrial production. However, after long-term use, it is inevitable that faults will occur. Therefore, identifying faults in equipment holds sign...
详细信息
Noise is currently a highly concerned index for High end automobiles. In the rapid development of the new energy vehicle field, Most of the existing automotive relays cannot meet the noise requirements of new energy v...
详细信息
Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they prop...
详细信息
Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they propose serious challenges for *** all constraints,some constraints are highly correlated with optimal feasible regions;thus they can provide effective help to find feasible Pareto ***,most of the existing constrained multi-objective evolutionary algorithms tackle constraints by regarding all constraints as a whole or directly ignoring all constraints,and do not consider judging the relations among constraints and do not utilize the information from promising single ***,this paper attempts to identify promising single constraints and utilize them to help solve *** be specific,a CMOP is transformed into a multitasking optimization problem,where multiple auxiliary tasks are created to search for the Pareto fronts that only consider a single constraint ***,an auxiliary task priority method is designed to identify and retain some high-related auxiliary tasks according to the information of relative positions and dominance ***,an improved tentative method is designed to find and transfer useful knowledge among *** results on three benchmark test suites and 11 realworld problems with different numbers of constraints show better or competitive performance of the proposed method when compared with eight state-of-the-art peer methods.
Post-layout simulation provides accurate guidance for analog circuit design, but post-layout performance is hard to be directly optimized at early design stages. Prior work on analog circuit sizing often utilizes pre-...
详细信息
Post-layout simulation provides accurate guidance for analog circuit design, but post-layout performance is hard to be directly optimized at early design stages. Prior work on analog circuit sizing often utilizes pre-layout simulation results as the optimization objective. In this work, we propose a post-layoutsimulation-driven(post-simulation-driven for short) analog circuit sizing framework that directly optimizes the post-layout simulation performance. The framework integrates automated layout generation into the optimization loop of transistor sizing and leverages a coupled Bayesian optimization algorithm to search for the best post-simulation performance. Experimental results demonstrate that our framework can achieve over 20% better post-layout performance in competitive time than manual design and the method that only considers pre-layout optimization.
This paper studies an online distributed optimization problem over multi-agent *** this problem,the goal of agents is to cooperatively minimize the sum of locally dynamic cost *** from most existing works on distribut...
详细信息
This paper studies an online distributed optimization problem over multi-agent *** this problem,the goal of agents is to cooperatively minimize the sum of locally dynamic cost *** from most existing works on distributed optimization,here we consider the case where the cost function is strongly pseudoconvex and real gradients of objective functions are not *** handle this problem,an online zeroth-order stochastic optimization algorithm involving the single-point gradient estimator is *** the algorithm,each agent only has access to the information associated with its own cost function and the estimate of the gradient,and exchange local state information with its immediate neighbors via a time-varying *** performance of the algorithm is measured by the expectation of dynamic *** mild assumptions on graphs,we prove that if the cumulative deviation of minimizer sequence grows within a certain rate,then the expectation of dynamic regret grows ***,a simulation example is given to illustrate the validity of our results.
暂无评论