Search results

Bayesian cubature (BC) has emerged to be one of most competitive approach for estimating the multi-dimensional integral especially when the integrand is expensive to evaluate, and alternative acquisition functions, such as the Posterior Variance Contribution (PVC) function, have been developed for adaptive experiment design of the integration points. However, those sequential design strategies also prevent BC from being implemented in a parallel scheme. Therefore, this paper aims at developing a parallelized adaptive BC method to further improve the computational efficiency.

By theoretically examining the multimodal behavior of the PVC function, it is concluded that the multiple local maxima all have important contribution to the integration accuracy as can be selected as design points, providing a practical way for parallelization of the adaptive BC. Inspired by the above finding, four multimodal optimization algorithms, including one newly developed in this work, are then introduced for finding multiple local maxima of the PVC function in one run, and further for parallel implementation of the adaptive BC.

The superiority of the parallel schemes and the performance of the four multimodal optimization algorithms are then demonstrated and compared with the k-means clustering method by using two numerical benchmarks and two engineering examples.

Multimodal behavior of acquisition function for BC is comprehensively investigated. All the local maxima of the acquisition function contribute to adaptive BC accuracy. Parallelization of adaptive BC is realized with four multimodal optimization methods.

The purpose of this paper is to exploit a new and robust method to forecast the long-term extreme dynamic responses for wave energy converters (WECs).

A new adaptive binned kernel density estimation (KDE) methodology is first proposed in this paper.

By examining the calculation results the authors has found that in the tail region the proposed new adaptive binned KDE distribution curve becomes very smooth and fits quite well with the histogram of the measured ocean wave dataset at the National Data Buoy Center (NDBC) station 46,059. Carefully studying the calculation results also reveals that the 50-year extreme power-take-off heaving force value forecasted based on the environmental contour derived using the new method is 3572600N, which is much larger than the value 2709100N forecasted via the Rosenblatt-inverse second-order reliability method (ISORM) contour method.

The proposed method overcomes the disadvantages of all the existing nonparametric and parametric methods for predicting the tail region probability density values of the sea state parameters.

It is concluded that the proposed new adaptive binned KDE method is robust and can forecast well the 50-year extreme dynamic responses for WECs.

This study aims to achieve superior localization and mapping performance in point cloud degradation scenarios through the effective removal of dynamic obstacles. With the continuous development of various technologies for autonomous vehicles, the LIDAR-based Simultaneous localization and mapping (SLAM) system is becoming increasingly important. However, in SLAM systems, effectively addressing the challenges of point cloud degradation scenarios is essential for accurate localization and mapping, with dynamic obstacle removal being a key component.

This paper proposes a method that combines adaptive feature extraction and loop closure detection algorithms to address this challenge. In the SLAM system, the ground point cloud and non-ground point cloud are separated to reduce the impact of noise. And based on the cylindrical projection image of the point cloud, the intensity features are adaptively extracted, the degradation direction is determined by the degradation factor and the intensity features are matched with the map to correct the degraded pose. Moreover, through the difference in raster distribution of the point clouds before and after two frames in the loop process, the dynamic point clouds are identified and removed, and the map is updated.

Experimental results show that the method has good performance. The absolute displacement accuracy of the laser odometer is improved by 27.1%, the relative displacement accuracy is improved by 33.5% and the relative angle accuracy is improved by 23.8% after using the adaptive intensity feature extraction method. The position error is reduced by 30% after removing the dynamic target.

Compared with LiDAR odometry and mapping algorithm, the method has greater robustness and accuracy in mapping and localization.

This paper aims to focus on solving the path optimization problem by modifying the probabilistic roadmap (PRM) technique as it suffers from the selection of the optimal number of nodes and deploy in free space for reliable trajectory planning.

Traditional PRM is modified by developing a decision-making strategy for the selection of optimal nodes w.r.t. the complexity of the environment and deploying the optimal number of nodes outside the closed segment. Subsequently, the generated trajectory is made smoother by implementing the modified Bezier curve technique, which selects an optimal number of control points near the sharp turns for the reliable convergence of the trajectory that reduces the sum of the robot’s turning angles.

The proposed technique is compared with state-of-the-art techniques that show the reduction of computational load by 12.46%, the number of sharp turns by 100%, the number of collisions by 100% and increase the velocity parameter by 19.91%.

The proposed adaptive technique provides a better solution for autonomous navigation of unmanned ground vehicles, transportation, warehouse applications, etc.

This study aims to investigate the effects of irregular groove textures on the friction and wear performance of sliding contact surfaces. These textures possess multiple depths and asymmetrical features. To optimize the irregular groove texture structure of the sliding contact surface, an adaptive genetic algorithm was used for research and optimization purposes.

Using adaptive genetic algorithm as an optimization tool, numerical simulations were conducted on surface textures by establishing a dimensionless form of the Reynolds equation and setting appropriate boundary conditions. An adaptive genetic algorithm program in MATLAB was established. Genetic iterative methods were used to calculate the optimal texture structure. Genetic individuals were selected through fitness comparison. The depth of the groove texture is gradually adjusted through genetic crossover, mutation, and mutation operations. The optimal groove structure was ultimately obtained by comparing the bearing capacity and pressure of different generations of micro-convex bodies.

After about 100 generations of iteration, the distribution of grooved textures became relatively stable, and after about 320 generations, the depth and distribution of groove textures reached their optimal structure. At this stage, irregular texture structures can support more loads by forming oil films. Compared with regular textures, the friction coefficient of irregular textures decreased by nearly 47.01%, while the carrying capacity of lubricating oil films increased by 54.57%. The research results show that irregular texture structures have better lubrication characteristics and can effectively improve the friction performance of component surfaces.

Surface textures can enhance the friction and lubrication performance of metal surfaces, improving the mechanical performance and lifespan of components. However, surface texture processing is challenging, as it often requires multiple experimental comparisons to determine the optimal texture structure, resulting in high trial-and-error costs. By using an adaptive genetic algorithm as an optimization tool, the optimal surface groove structure can be obtained through simulation and modeling, effectively saving costs in the process.

The purpose of this paper is to design a simple and accurate a-posteriori Lagrangian-based error estimator is developed for the class of backward differentiation formula (BDF) algorithms with variable time step size, and the adaptive time-stepping in BDF algorithms is demonstrated for efficient time-dependent simulations in fluid flow and heat transfer.

The Lagrange interpolation polynomial is used to predict the time derivative, and then the accurate primary result is obtained by the Gauss integral, which is applied to evaluate the local error. Not only the generalized formula of the proposed error estimator is presented but also the specific expression for the widely applied BDF1/2/3 is illustrated. Two essential executable MATLAB functions to implement the proposed error estimator are appended for practical applications. Then, the adaptive time-stepping is demonstrated based on the newly proposed error estimator for BDF algorithms.

The validation tests show that the newly proposed error estimator is accurate such that the effectivity index is always close to unity for both linear and nonlinear problems, and it avoids under/overestimation of the exact local error. The applications for fluid dynamics and coupled fluid flow and heat transfer problems depict the advantage of adaptive time-stepping based on the proposed error estimator for time-dependent simulations.

In contrast to existing error estimators for BDF algorithms, the present work is more accurate for the local error estimation, and it can be readily extended to practical applications in engineering with a few changes to existing codes, contributing to efficient time-dependent simulations in fluid flow and heat transfer.

The study aims to equip robots with the ability to precisely maintain interaction forces, which is crucial for tasks such as polishing in highly dynamic environments with unknown and varying stiffness and geometry, including those found in airplane wings or thin, soft materials. The purpose of this study is to develop a novel adaptive force-tracking admittance control scheme aimed at achieving a faster response rate with higher tracking accuracy for robot force control.

In the proposed method, the traditional admittance model is improved by introducing a pre-proportional-derivative controller to accelerate parameter convergence. Subsequently, the authors design an adaptive law based on fuzzy logic systems (FLS) to compensate for uncertainties in the unknown environment. Stability conditions are established for the proposed method through Lyapunov analysis, which ensures the force tracking accuracy and the stability of the coupled system consisting of the robot and the interaction environment. Furthermore, the effectiveness and robustness of the proposed control algorithm are demonstrated by simulation and experiment.

A variety of unstructured simulations and experimental scenarios are designed to validate the effectiveness of the proposed algorithm in force control. The outcomes demonstrate that this control strategy excels in providing fast response, precise tracking accuracy and robust performance.

In real-world applications spanning industrial, service and medical fields where accurate force control by robots is essential, the proposed method stands out as both practical and straightforward, delivering consistently satisfactory performance across various scenarios.

This research introduces a novel adaptive force-tracking admittance controller based on FLS and validated through both simulations and experiments. The proposed controller demonstrates exceptional performance in force control within environments characterized by unknown and varying.

Traditional case-adaptation methods have poor accuracy, low efficiency and limited applicability, which cannot meet the needs of knowledge users. To address the shortcomings of the existing research in the industry, this paper proposes a case-adaptation optimization algorithm to support the effective application of tacit knowledge resources.

The attribute simplification algorithm based on the forward search strategy in the neighborhood decision information system is implemented to realize the vertical dimensionality reduction of the case base, and the fuzzy C-mean (FCM) clustering algorithm based on the simulated annealing genetic algorithm (SAGA) is implemented to compress the case base horizontally with multiple decision classes. Then, the subspace K-nearest neighbors (KNN) algorithm is used to induce the decision rules for the set of adapted cases to complete the optimization of the adaptation model.

The findings suggest the rapid enrichment of data, information and tacit knowledge in the field of practice has led to low efficiency and low utilization of knowledge dissemination, and this algorithm can effectively alleviate the problems of users falling into “knowledge disorientation” in the era of the knowledge economy.

This study provides a model with case knowledge that meets users’ needs, thereby effectively improving the application of the tacit knowledge in the explicit case base and the problem-solving efficiency of knowledge users.

The adaptation model can serve as a stable and efficient prediction model to make predictions for the effects of the many logistics and e-commerce enterprises' plans.

This study designs a multi-decision class case-adaptation optimization study based on forward attribute selection strategy-neighborhood rough sets (FASS-NRS) and simulated annealing genetic algorithm-fuzzy C-means (SAGA-FCM) for tacit knowledgeable exogenous cases. By effectively organizing and adjusting tacit knowledge resources, knowledge service organizations can maintain their competitive advantages. The algorithm models established in this study develop theoretical directions for a multi-decision class case-adaptation optimization study of tacit knowledge.

Cross-layer approach in media access control (MAC) layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in wireless sensor network (WSN) and Internet of Things (IoT) applications. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes. Game theory optimization for distributed may increase the network performance. The purpose of this study is to survey the various operations that can be carried out using distributive and adaptive MAC protocol. Hill climbing distributed MAC does not need a central coordination system and location-based transmission with neighbor awareness reduces transmission power.

Distributed MAC in wireless networks is used to address the challenges like network lifetime, reduced energy consumption and for improving delay performance. In this paper, a survey is made on various cooperative communications in MAC protocols, optimization techniques used to improve MAC performance in various applications and mathematical approaches involved in game theory optimization for MAC protocol.

Spatial reuse of channel improved by 3%–29%, and multichannel improves throughput by 8% using distributed MAC protocol. Nash equilibrium is found to perform well, which focuses on energy utility in the network by individual players. Fuzzy logic improves channel selection by 17% and secondary users’ involvement by 8%. Cross-layer approach in MAC layer will address interference and jamming problems. Hybrid distributed MAC can be used for simultaneous voice, data transmissions in WSN and IoT applications. Cross-layer and cooperative communication give energy savings of 27% and reduces hop distance by 4.7%. Choosing the correct objective function in Nash equilibrium for game theory will address fairness index and resource allocation to the nodes.

Other optimization techniques can be applied for WSN to analyze the performance.

Game theory optimization for distributed may increase the network performance. Optimal cuckoo search improves throughput by 90% and reduces delay by 91%. Stochastic approaches detect 80% attacks even in 90% malicious nodes.

Channel allocations in centralized or static manner must be based on traffic demands whether dynamic traffic or fluctuated traffic. Usage of multimedia devices also increased which in turn increased the demand for high throughput. Cochannel interference keep on changing or mitigations occur which can be handled by proper resource allocations. Network survival is by efficient usage of valid patis in the network by avoiding transmission failures and time slots’ effective usage.

Literature survey is carried out to find the methods which give better performance.

In this study, supervision and control of the possible problems among people over a large area with a limited number of drone cameras and security staff is established.

These drones, namely unmanned aerial vehicles (UAVs) will be adaptively and automatically distributed over the crowds to control and track the communities by the proposed system. Since crowds are mobile, the design of the drone clusters will be simultaneously re-organized according to densities and distributions of people. An adaptive and dynamic distribution and routing mechanism of UAV fleets for crowds is implemented to control a specific given region. The nine popular clustering algorithms have been used and tested in the presented mechanism to gain better performance.

The nine popular clustering algorithms have been used and tested in the presented mechanism to gain better performance. An outperformed clustering performance from the aggregated model has been received when compared with a singular clustering method over five different test cases about crowds of human distributions. This study has three basic components. The first one is to divide the human crowds into clusters. The second one is to determine an optimum route of UAVs over clusters. The last one is to direct the most appropriate security personnel to the events that occurred.

This study has three basic components. The first one is to divide the human crowds into clusters. The second one is to determine an optimum route of UAVs over clusters. The last one is to direct the most appropriate security personnel to the events that occurred.