Search results

Agriculture is the backbone of a country, contributing more than half of the sector of economy throughout the world. The need for precision agriculture is essential in evaluating the conditions of the crops with the aim of determining the proper selection of pesticides. The conventional method of pest detection fails to be stable and provides limited accuracy in the prediction. This paper aims to propose an automatic pest detection module for the accurate detection of pests using the hybrid optimization controlled deep learning model.

The paper proposes an advanced pest detection strategy based on deep learning strategy through wireless sensor network (WSN) in the agricultural fields. Initially, the WSN consisting of number of nodes and a sink are clustered as number of clusters. Each cluster comprises a cluster head (CH) and a number of nodes, where the CH involves in the transfer of data to the sink node of the WSN and the CH is selected using the fractional ant bee colony optimization (FABC) algorithm. The routing process is executed using the protruder optimization algorithm that helps in the transfer of image data to the sink node through the optimal CH. The sink node acts as the data aggregator and the collection of image data thus obtained acts as the input database to be processed to find the type of pest in the agricultural field. The image data is pre-processed to remove the artifacts present in the image and the pre-processed image is then subjected to feature extraction process, through which the significant local directional pattern, local binary pattern, local optimal-oriented pattern (LOOP) and local ternary pattern (LTP) features are extracted. The extracted features are then fed to the deep-convolutional neural network (CNN) in such a way to detect the type of pests in the agricultural field. The weights of the deep-CNN are tuned optimally using the proposed MFGHO optimization algorithm that is developed with the combined characteristics of navigating search agents and the swarming search agents.

The analysis using insect identification from habitus image Database based on the performance metrics, such as accuracy, specificity and sensitivity, reveals the effectiveness of the proposed MFGHO-based deep-CNN in detecting the pests in crops. The analysis proves that the proposed classifier using the FABC+protruder optimization-based data aggregation strategy obtains an accuracy of 94.3482%, sensitivity of 93.3247% and the specificity of 94.5263%, which is high as compared to the existing methods.

The proposed MFGHO optimization-based deep-CNN is used for the detection of pest in the crop fields to ensure the better selection of proper cost-effective pesticides for the crop fields in such a way to increase the production. The proposed MFGHO algorithm is developed with the integrated characteristic features of navigating search agents and the swarming search agents in such a way to facilitate the optimal tuning of the hyperparameters in the deep-CNN classifier for the detection of pests in the crop fields.

This study aims to address the inherent uncertainties within closed-loop supply chain (CLSC) networks through the application of a multi-objective approach, specifically focusing on the optimization of integrated production and transportation processes. The primary purpose is to enhance decision-making in supply chain management by formulating a robust multi-objective model.

In dealing with uncertainty, this study uses Pythagorean fuzzy numbers (PFNs) to effectively represent and quantify uncertainties associated with various parameters within the CLSC network. The proposed model is solved using Pythagorean hesitant fuzzy programming, presenting a comprehensive and innovative methodology designed explicitly for handling uncertainties inherent in CLSC contexts.

The research findings highlight the effectiveness and reliability of the proposed framework for addressing uncertainties within CLSC networks. Through a comparative analysis with other established approaches, the model demonstrates its robustness, showcasing its potential to make informed and resilient decisions in supply chain management.

This study successfully addressed uncertainty in CLSC networks, providing logistics managers with a robust decision-making framework. Emphasizing the importance of PFNs and Pythagorean hesitant fuzzy programming, the research offered practical insights for optimizing transportation routes and resource allocation. Future research could explore dynamic factors in CLSCs, integrate real-time data and leverage emerging technologies for more agile and sustainable supply chain management.

This research contributes significantly to the field by introducing a novel and comprehensive methodology for managing uncertainty in CLSC networks. The adoption of PFNs and Pythagorean hesitant fuzzy programming offers an original and valuable approach to addressing uncertainties, providing practitioners and decision-makers with insights to make informed and resilient decisions in supply chain management.

The purpose of this paper is to propose a new grey prediction model, GOFHGM (1,1), which combines generalised fractal derivative and particle swarm optimisation algorithms. The aim is to address the limitations of traditional grey prediction models in order selection and improve prediction accuracy.

The paper introduces the concept of generalised fractal derivative and applies it to the order optimisation of grey prediction models. The particle swarm optimisation algorithm is also adopted to find the optimal combination of orders. Three cases are empirically studied to compare the performance of GOFHGM(1,1) with traditional grey prediction models.

The study finds that the GOFHGM(1,1) model outperforms traditional grey prediction models in terms of prediction accuracy. Evaluation indexes such as mean squared error (MSE) and mean absolute error (MAE) are used to evaluate the model.

The research study may have limitations in terms of the scope and generalisability of the findings. Further research is needed to explore the applicability of GOFHGM(1,1) in different fields and to improve the model’s performance.

The study contributes to the field by introducing a new grey prediction model that combines generalised fractal derivative and particle swarm optimisation algorithms. This integration enhances the accuracy and reliability of grey predictions and strengthens their applicability in various predictive applications.

This paper aims to propose a novel control scheme and offer a control parameter optimizer to achieve better automatic carrier landing. Carrier landing is a challenging work because of the severe sea conditions, high demand for accuracy and non-linearity and maneuvering coupling of the aircraft. Consequently, the automatic carrier landing system raises the need for a control scheme that combines high robustness, rapidity and accuracy. In addition, to exploit the capability of the proposed control scheme and alleviate the difficulty of manual parameter tuning, a control parameter optimizer is constructed.

A novel reference model is constructed by considering the desired state and the actual state as constrained generalized relative motion, which works as a virtual terminal spring-damper system. An improved particle swarm optimization algorithm with dynamic boundary adjustment and Pareto set analysis is introduced to optimize the control parameters.

The control parameter optimizer makes it efficient and effective to obtain well-tuned control parameters. Furthermore, the proposed control scheme with the optimized parameters can achieve safe carrier landings under various severe sea conditions.

The proposed control scheme shows stronger robustness, accuracy and rapidity than sliding-mode control and Proportion-integration-differentiation (PID). Also, the small number and efficiency of control parameters make this paper realize the first simultaneous optimization of all control parameters in the field of flight control.

Fused Filament Fabrication (FFF) is one of the growing technologies in additive manufacturing, that can be used in a number of applications. In this method, process parameters can be customized and their simultaneous variation has conflicting impacts on various properties of printed parts such as dimensional accuracy (DA) and surface finish. These properties could be improved by optimizing the values of these parameters.

In this paper, four process parameters, namely, print speed, build orientation, raster width, and layer height which are referred to as “input variables” were investigated. The conflicting influence of their simultaneous variations on the DA of printed parts was investigated and predicated. To achieve this goal, a hybrid Genetic Algorithm – Artificial Neural Network (GA-ANN) model, was developed in C#.net, and three geometries, namely, U-shape, cube and cylinder were selected. To investigate the DA of printed parts, samples were printed with a central through hole. Design of Experiments (DoE), specifically the Rotational Central Composite Design method was adopted to establish the number of parts to be printed (30 for each selected geometry) and also the value of each input process parameter. The dimensions of printed parts were accurately measured by a shadowgraph and were used as an input data set for the training phase of the developed ANN to predict the behavior of process parameters. Then the predicted values were used as input to the Desirability Function tool which resulted in a mathematical model that optimizes the input process variables for selected geometries. The mean square error of 0.0528 was achieved, which is indicative of the accuracy of the developed model.

The results showed that print speed is the most dominant input variable compared to others, and by increasing its value, considerable variations resulted in DA. The inaccuracy increased, especially with parts of circular cross section. In addition, if there is no need to print parts in vertical position, the build orientation should be set at 0° to achieve the highest DA. Finally, optimized values of raster width and layer height improved the DA especially when the print speed was set at a high value.

By using ANN, it is possible to investigate the impact of simultaneous variations of FFF machines’ input process parameters on the DA of printed parts. By their optimization, parts of highly accurate dimensions could be printed. These findings will be of significant value to those industries that need to produce parts of high DA on FFF machines.

The present paper aims to address challenges associated with path planning and obstacle avoidance in mobile robotics. It introduces a pioneering solution called the Bi-directional Adaptive Enhanced A* (BAEA*) algorithm, which uses a new bidirectional search strategy. This approach facilitates simultaneous exploration from both the starting and target nodes and improves the efficiency and effectiveness of the algorithm in navigation environments. By using the heuristic knowledge A*, the algorithm avoids unproductive blind exploration, helps to obtain more efficient data for identifying optimal solutions. The simulation results demonstrate the superior performance of the BAEA* algorithm in achieving rapid convergence towards an optimal action strategy compared to existing methods.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bidirectional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The paper adopts a careful design focusing on the development and evaluation of the BAEA* for mobile robot path planning, based on the reference [18]. The algorithm has remarkable adaptability to dynamically changing environments and ensures robust navigation in the context of environmental changes. Its scale further enhances its applicability in large and complex environments, which means it has flexibility for various practical applications. The rigorous evaluation of our proposed BAEA* algorithm with the Bi-directional adaptive A* (BAA*) algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm.

The rigorous evaluation of our proposed BAEA* algorithm with the BAA* algorithm [18] in five different environments demonstrates the superiority of the BAEA* algorithm. The BAEA* algorithm consistently outperforms BAA*, demonstrating its ability to plan shorter and more stable paths and achieve higher success rates in all environments.

The originality of this paper lies in the introduction of the bidirectional adaptive enhancing A* algorithm (BAEA*) as a novel solution for path planning for mobile robots. This algorithm is characterized by its unique characteristics that distinguish it from others in this field. First, BAEA* uses a unique bidirectional search strategy, allowing to explore the same path from both the initial node and the target node. This approach significantly improves efficiency by quickly converging to the best paths and using A* heuristic knowledge. In particular, the algorithm shows remarkable capabilities to quickly recognize shorter and more stable paths while ensuring higher success rates, which is an important feature for time-sensitive applications. In addition, BAEA* shows adaptability and robustness in dynamically changing environments, not only avoiding obstacles but also respecting various constraints, ensuring safe path selection. Its scale further increases its versatility by seamlessly applying it to extensive and complex environments, making it a versatile solution for a wide range of practical applications. The rigorous assessment against established algorithms such as BAA* consistently shows the superior performance of BAEA* in planning shorter paths, achieving higher success rates in different environments and cementing its importance in complex and challenging environments. This originality marks BAEA* as a pioneering contribution, increasing the efficiency, adaptability and applicability of mobile robot path planning methods.

The purpose of this paper is to extract electrochemical reaction kinetics parameters, such as Tafel slope, exchange current density and equilibrium potential, which cannot be directly measured, this study aims to propose an improved particle swarm optimization (PSO) algorithm.

In traditional PSO algorithms, each particle’s historical optimal solution is compared with the global optimal solution in each iteration step, and the optimal solution is replaced with a certain probability to achieve the goal of jumping out of the local optimum. However, this will to some extent undermine the (true) optimal solution. In view of this, this study has improved the traditional algorithm: at each iteration of each particle, the historical optimal solution is not compared with the global optimal solution. Instead, after all particles have iterated, the optimal solution is selected and compared with the global optimal solution and then the optimal solution is replaced with a certain probability. This to some extent protects the global optimal solution.

The polarization curve plotted by this equation is in good agreement with the experimental values, which demonstrates the reliability of this algorithm and provides a new method for measuring electrochemical parameters.

This study has improved the traditional method, which has high accuracy and can provide great support for corrosion research.

This paper aims to find the best method to predict the friction coefficient of textured 45# steel by comparing different machine learning algorithms and analytical calculations.

Five machine learning algorithms, including K-nearest neighbor, random forest, support vector machine (SVM), gradient boosting decision tree (GBDT) and artificial neural network (ANN), are applied to predict friction coefficient of textured 45# steel surface under oil lubrication. The superiority of machine learning is verified by comparing it with analytical calculations and experimental results.

The results show that machine learning methods can accurately predict friction coefficient between interfaces compared to analytical calculations, in which SVM, GBDT and ANN methods show close prediction performance. When texture and working parameters both change, sliding speed plays the most important role, indicating that working parameters have more significant influence on friction coefficient than texture parameters.

This study can reduce the experimental cost and time of textured 45# steel, and provide a reference for the widespread application of machine learning in the friction field in the future.

Milling is a flexible creation process for the manufacturing of dies and aeronautical parts. While machining thin-walled parts, heat generation during machining essentially affects the accuracy. The workpiece temperature (WT), as well as the responses like material removal rate (MRR) and surface roughness (SR) for input parameters like cutting speed (CS), feed rate (F), depth-of-cut (DOC), step over (SO) and tool diameter (TD), becomes critical for sustaining the accuracy of the thin walls.

Response surface methodology was used to make 46 tests. To convert the multi-character problem into a single-character problem, the weightage was assessed using the entropy approach and the grey relational coefficient (GRC) was determined. To investigate the connection among input parameters and single-objective (GRC), a fuzzy mathematical modelling technique was used. The optimal performance of process parameters was estimated by grey relational entropy grade (GREG)-fuzzy and genetic algorithm (GA) optimization.

SR was found to be a significant process parameter, with CS, feed and DOC, respectively. Similarly, F, DOC and TD were found to be significant process parameters with MRR, respectively, and F, DOC, SO and TD were found to be significant process parameters with WT, respectively. GREG-fuzzy-GA found more suitable for minimizing the WT with the constraint s of SR and MRR and provide maximum desirability of 0.665. The projected and experimental values have a good agreement, with a standard error of 5.85%, and so the responses predicted by the suggested method are better optimized.

The GREG-fuzzy-GA is a new hybrid technique for analysing Inconel625 behaviour during machining in a 2.5D milling process.

Parallelogram linkages are used to increase the stiffness of manipulators and allow precise control of end-effectors. They help maintain the orientation of connected links when the manipulator changes its position. They are implemented in many palletizing robots connected with binary, ternary and quaternary links through both active and passive joints. This limits the motion of some joints and hence results in relative and negative joint angles when assigning coordinate axes. This study aims to provide a simplified accurate model for manipulators built with parllelogram linkages to ease the kinematics calculations.

This study introduces a simplified model, replacing each parallelogram linkage with a single (binary) link with an active and a passive joint at the ends. This replacement facilitates countering motion while preserving subsequent link orientations. Validation of kinematics is performed on palletizing manipulators from five different OEMs. The validation of Dobot Magician and ABB IRB1410 was carried out in real time and in their control software. Other robots from ABB, Yaskawa, Kuka and Fanuc were validated using control environments and simulators.

The proposed model enables the straightforward derivation of forward kinematics and transforms hybrid robots into equivalent serial-link robots. The model demonstrates high accuracy streamlining the derivation of kinematics.

The proposed model facilitates the use of classical methods like the Denavit–Hartenberg procedure with ease. It not only simplifies kinematics derivation but it also helps in robot control and motion planning within the workspace. The approach can also be implemented to simplify the parallelogram linkages of robots with higher degrees of freedom such as the IRB1410.