Search results

This work aims to present a multilevel optimization strategy based on manifold‐mapping combined with multiquadric interpolation for the coarse model construction.

In the proposed approach the coarse model is obtained by interpolating the fine model using multiquadrics in a small number of points. As the algorithm iterates the response surface model is improved by enriching the set of interpolation points.

This approach allows to accurately solve the TEAM Workshop Problem 25 using as little as 33 finite element simulations. Furthermore, it allows a robust sizing optimization of a cylindrical voice‐coil actuator with seven design variables.

Further analysis is required to gain a better understanding of the role that the initial coarse model accuracy plays in the convergence of the algorithm. The proposed model allows to carry out such analysis by varying the number of points included in the initial response surface model. The effect of the trust‐region stabilization in the presence of manifolds of equivalent solutions is also a topic of further investigations.

Unlike the closely related space‐mapping algorithm, the manifold‐mapping algorithm is guaranteed to converge to a fine model optimal solution. By combining it with multiquadric response surface models, its applicability is extended to problems for which other kinds of coarse model such as lumped parameter approximations for instance are tedious or impossible to construct.

This paper aims to investigate three low-evaluation-budget optimization techniques: output space mapping (OSM), manifold mapping (MM) and Kriging-OSM. Kriging-OSM is an original approach having high-order mapping.

The electromagnetic device to be optimally sized is a five-phase linear induction motor, represented through two levels of modeling: coarse (Kriging model) and fine.The optimization comparison of the three techniques on the five-phase linear induction motor is discussed.

The optimization results show that the OSM takes more time and iteration to converge the optimal solution compared to MM and Kriging-OSM. This is mainly because of the poor quality of the initial Kriging model. In the case of a high-quality coarse model, the OSM technique would show its domination over the other two techniques. In the case of poor quality of coarse model, MM and Kriging-OSM techniques are more efficient to converge to the accurate optimum.

Kriging-OSM is an original approach having high-order mapping. An advantage of this new technique consists in its capability of providing a sufficiently accurate model for each objective and constraint function and makes the coarse model converge toward the fine model more effectively.

The space‐mapping (SM) optimization technique, with its input, implicit or output mapping‐based implementations, provides a basis for computationally efficient engineering optimization. Various algorithms and design optimization problems, related to microwave devices, antennas and electronic circuits, are presented in numerous publications. However, a new application area for SM optimization is currently expanding, i.e. the design of electromechanical actuators. The purpose of this paper is to present an overview of the recent developments.

New algorithm variants and their application to design problems in electromechanics and related fields are briefly summarized.

The paper finds that SM optimization offers a significant speed‐up of the optimization procedures for the design of electromechanical actuators. Its true potential in the area of magnetic systems and actuator design is still rather unexplored.

This overview is complementary to the previous published reviews and shows that the application of SM optimization has also extended to the design of electromechanical devices.

The purpose of this work is to investigate the similarity requirements for the application of multifidelity modeling (MFM) for the prediction of airfoil dynamic stall using computational fluid dynamics (CFD) simulations.

Dynamic stall is modeled using the unsteady Reynolds-averaged Navier–Stokes equations and Menter's shear stress transport turbulence model. Multifidelity models are created by varying the spatial and temporal discretizations. The effectiveness of the MFM method depends on the similarity between the high- (HF) and low-fidelity (LF) models. Their similarity is tested by computing the prediction error with respect to the HF model evaluations. The proposed approach is demonstrated on three airfoil shapes under deep dynamic stall at a Mach number 0.1 and Reynolds number 135,000.

The results show that varying the trust-region (TR) radius (λ) significantly affects the prediction accuracy of the MFM. The HF and LF simulation models hold similarity within small (λ ≤ 0.12) to medium (0.12 ≤ λ ≤ 0.23) TR radii producing a prediction error less than 5%, whereas for large TR radii (0.23 ≤ λ ≤ 0.41), the similarity is strongly affected by the time discretization and minimally by the spatial discretization.

The findings of this work present new knowledge for the construction of accurate MFMs for dynamic stall performance prediction using LF model spatial- and temporal discretization setup and the TR radius size. The approach used in this work is general and can be used for other unsteady applications involving CFD-based MFM and optimization.

The aim of this paper is to reduce the evaluations number of the fine model within the output space mapping (OSM) technique in order to reduce their computing time.

In this paper, n-level OSM is proposed and expected to be even faster than the conventional OSM. The proposed algorithm takes advantages of the availability of n models of the device to optimize, each of them representing an optimal trade-off between the model error and its computation time. Models with intermediate characteristics between the coarse and fine models are inserted within the proposed algorithm to reduce the number of evaluations of the consuming time model and then the computing time. The advantages of the algorithm are highlighted on the optimization problem of superconducting magnetic energy storage (SMES).

A major computing time gain equals to three is achieved using the n-level OSM algorithm instead of the conventional OSM technique on the optimization problem of SMES.

The originality of this paper is to investigate several models with different granularities within OSM algorithm in order to reduce its computing time without decreasing the performance of the conventional strategy.

Manifold‐mapping (MM) is an efficient surrogate‐based optimization technique aimed at the acceleration of very time‐consuming design problems. In this paper we present two new variants of the original algorithm that make it applicable to a broader range of optimization scenarios.

The first variant is useful when the optimization constraints are expressed by means of functions that are very expensive to compute. The second variant endows the original scheme with a trust‐region strategy and the result is a much more robust algorithm.

Two practical optimization problems from electromagnetics eventually show that the proposed variants perform efficiently.

The original MM algorithm is extended with two new variants. Therefore, the MM approach is applicable to a much larger set of design situations.

Single-shot multi-category clothing recognition and retrieval play a crucial role in online searching and offline settlement scenarios. Existing clothing recognition methods based on RGBD clothing images often suffer from high-dimensional feature representations, leading to compromised performance and efficiency.

To address this issue, this paper proposes a novel method called Manifold Embedded Discriminative Feature Selection (MEDFS) to select global and local features, thereby reducing the dimensionality of the feature representation and improving performance. Specifically, by combining three global features and three local features, a low-dimensional embedding is constructed to capture the correlations between features and categories. The MEDFS method designs an optimization framework utilizing manifold mapping and sparse regularization to achieve feature selection. The optimization objective is solved using an alternating iterative strategy, ensuring convergence.

Empirical studies conducted on a publicly available RGBD clothing image dataset demonstrate that the proposed MEDFS method achieves highly competitive clothing classification performance while maintaining efficiency in clothing recognition and retrieval.

This paper introduces a novel approach for multi-category clothing recognition and retrieval, incorporating the selection of global and local features. The proposed method holds potential for practical applications in real-world clothing scenarios.

The purpose of this paper is to discuss a data interpolation method of curved surfaces from the point of dimension reduction and manifold learning.

Instead of transmitting data of curved surfaces in 3D space directly, the method transmits data by unfolding 3D curved surfaces into 2D planes by manifold learning algorithms. The similarity between surface unfolding and manifold learning is discussed. Projection ability of several manifold learning algorithms is investigated to unfold curved surface. The algorithms’ efficiency and their influences on the accuracy of data transmission are investigated by three examples.

It is found that the data interpolations using manifold learning algorithms LLE, HLLE and LTSA are efficient and accurate.

The method can improve the accuracies of coupling data interpolation and fluid-structure interaction simulation involving curved surfaces.

A hybrid-electric unmanned aerial vehicle (HE-UAV) model has been developed to address the problem of low endurance of a small electric UAV. Electric-powered UAVs are not capable of achieving a high range and endurance due to the low energy density of its batteries. Alternatively, conventional UAVs (cUAVs) using fuel with an internal combustion engine (ICE) produces more noise and thermal signatures which is undesirable, especially if the air vehicle is required to patrol at low altitudes and remain undetected by ground patrols. This paper aims to investigate the impact of implementing hybrid propulsion technology to improve on the endurance of the UAV (based on a 13.6 kg UAV).

A HE-UAV model is developed to analyze the fuel consumption of the UAV for given mission profiles which were then compared to a cUAV. Although, this UAV size was used as reference case study, it can potentially be used to analyze the fuel consumption of any fixed wing UAV of similar take-off weight. The model was developed in a Matlab-Simulink environment using Simulink built-in functionalities, including all the subsystem of the hybrid powertrain. That is, the ICE, electric motor, battery, DC-DC converter, fuel system and propeller system as well as the aerodynamic system of the UAV. In addition, a ruled-based supervisory controlled strategy was implemented to characterize the split between the two propulsive components (ICE and electric motor) during the UAV mission. Finally, an electrification scheme was implemented to account for the hybridization of the UAV during certain stages of flight. The electrification scheme was then varied by changing the time duration of the UAV during certain stages of flight.

Based on simulation, it was observed a HE-UAV could achieve a fuel saving of 33% compared to the cUAV. A validation study showed a predicted improved fuel consumption of 9.5% for the Aerosonde UAV.

The novelty of this work comes with the implementation of a rule-based supervisory controller to characterize the split between the two propulsive components during the UAV mission. Also, the model was created by considering steady flight during cruise, but not during the climb and descend segment of the mission.

By means of topological conjugate transformation, the previous theory of abstract neural automata (ANA) on d‐dimensional (d≥1) integer lattice is extended to compact Riemannian manifold. This paper points out emphatically that intelligence of ANA is related to the geometrical features. The greater the volume of relative plane, the stronger the intelligence; curved Riemannian manifold X˜ configuration space of ANA are locally flat such that the cognitive process of NAN limits the Gibbs' probability measure for a sufficiently small time i.e. the cognitive process of ANA can determine the solution in a sufficiently small time the problem. This hypothesis was supported by studying the human brain, in particular by studying Einstein's brain.