Search results

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.

For achieving the profitable human activity recognition (HAR) method, this paper solves the HAR problem under wireless body area network (WBAN) using a developed ensemble learning approach. The purpose of this study is,to solve the HAR problem under WBAN using a developed ensemble learning approach for achieving the profitable HAR method. There are three data sets used for this HAR in WBAN, namely, human activity recognition using smartphones, wireless sensor data mining and Kaggle. The proposed model undergoes four phases, namely, “pre-processing, feature extraction, feature selection and classification.” Here, the data can be preprocessed by artifacts removal and median filtering techniques. Then, the features are extracted by techniques such as “t-Distributed Stochastic Neighbor Embedding”, “Short-time Fourier transform” and statistical approaches. The weighted optimal feature selection is considered as the next step for selecting the important features based on computing the data variance of each class. This new feature selection is achieved by the hybrid coyote Jaya optimization (HCJO). Finally, the meta-heuristic-based ensemble learning approach is used as a new recognition approach with three classifiers, namely, “support vector machine (SVM), deep neural network (DNN) and fuzzy classifiers.” Experimental analysis is performed.

The proposed HCJO algorithm was developed for optimizing the membership function of fuzzy, iteration limit of SVM and hidden neuron count of DNN for getting superior classified outcomes and to enhance the performance of ensemble classification.

The accuracy for enhanced HAR model was pretty high in comparison to conventional models, i.e. higher than 6.66% to fuzzy, 4.34% to DNN, 4.34% to SVM, 7.86% to ensemble and 6.66% to Improved Sealion optimization algorithm-Attention Pyramid-Convolutional Neural Network-AP-CNN, respectively.

The suggested HAR model with WBAN using HCJO algorithm is accurate and improves the effectiveness of the recognition.

This study aims to intend and implement the optimal power flow, where tuning the production cost is done with the inclusion of stochastic wind power and different kinds of flexible AC transmission systems (FACTS) devices. Here, the speed with fitness-based krill herd algorithm (SF-KHA) is adopted for deciding the FACTS devices’ optimal sizing and placement integrated with wind power. Here, the modified SF-KHA optimizes the sizing and location of FACTS devices for attaining the minimum average production cost and real power depletions of the system. Especially, the objective includes reserve cost for overestimation, cost of thermal generation of the wind power, direct cost of scheduled wind power and penalty cost for underestimation. The efficiency of the offered method over several popular optimization algorithms has been done, and the comparison over different algorithms establishes proposed KHA algorithm attains the accurate optimal efficiency for all other algorithms.

The proposed FACTS devices-based power system with the integration of wind generators is based on the accurate placement and sizing of FACTS devices for decreasing the actual power loss and total production cost of the power system.

Through the cost function evaluation of the offered SF-KHA, it was noted that the proposed SF-KHA-based power system had secured 13.04% superior to success history-based adaptive differential evolution, 9.09% enhanced than differential evolution, 11.5% better than artificial bee colony algorithm, 15.2% superior to particle swarm optimization and 9.09% improved than flower pollination algorithm.

The proposed power system with the accurate placement and sizing of FACTS devices and wind generator using the suggested SF-KHA was effective when compared with the conventional algorithm-based power systems.

The purpose of this paper is to propose a whole set of methods for underwater target detection, because most underwater objects have small samples, low quality underwater images problems such as detail loss, low contrast and color distortion, and verify the feasibility of the proposed methods through experiments.

The improved RGHS algorithm to enhance the original underwater target image is proposed, and then the YOLOv4 deep learning network for underwater small sample targets detection is improved based on the combination of traditional data expansion method and Mosaic algorithm, expanding the feature extraction capability with SPP (Spatial Pyramid Pooling) module after each feature extraction layer to extract richer feature information.

The experimental results, using the official dataset, reveal a 3.5% increase in average detection accuracy for three types of underwater biological targets compared to the traditional YOLOv4 algorithm. In underwater robot application testing, the proposed method achieves an impressive 94.73% average detection accuracy for the three types of underwater biological targets.

Underwater target detection is an important task for underwater robot application. However, most underwater targets have the characteristics of small samples, and the detection of small sample targets is a comprehensive problem because it is affected by the quality of underwater images. This paper provides a whole set of methods to solve the problems, which is of great significance to the application of underwater robot.

Accurate and rapid tracking and counting of building materials are crucial in managing on-site construction processes and evaluating their progress. Such processes are typically conducted by visual inspection, making them time-consuming and error prone. This paper aims to propose a video-based deep-learning approach to the automated detection and counting of building materials.

A framework for accurately counting building materials at indoor construction sites with low light levels was developed using state-of-the-art deep learning methods. An existing object-detection model, the You Only Look Once version 4 (YOLO v4) algorithm, was adapted to achieve rapid convergence and accurate detection of materials and site operatives. Then, DenseNet was deployed to recognise these objects. Finally, a material-counting module based on morphology operations and the Hough transform was applied to automatically count stacks of building materials.

The proposed approach was tested by counting site operatives and stacks of elevated floor tiles in video footage from a real indoor construction site. The proposed YOLO v4 object-detection system provided higher average accuracy within a shorter time than the traditional YOLO v4 approach.

The proposed framework makes it feasible to separately monitor stockpiled, installed and waste materials in low-light construction environments. The improved YOLO v4 detection method is superior to the current YOLO v4 approach and advances the existing object detection algorithm. This framework can potentially reduce the time required to track construction progress and count materials, thereby increasing the efficiency of work-in-progress evaluation. It also exhibits great potential for developing a more reliable system for monitoring construction materials and activities.

This study aims to propose a more precise method for robust design optimization of mechanical structures with black-box problems, while also considering the efficiency of uncertainty analysis.

The method first introduces a dual adaptive chaotic flower pollination algorithm (DACFPA) to overcome the shortcomings of the original flower pollination algorithm (FPA), such as its susceptibility to poor accuracy and convergence efficiency when dealing with complex optimization problems. Furthermore, a DACFPA-Kriging model is developed by optimizing the relevant parameter of Kriging model via DACFPA. Finally, the dual Kriging model is constructed to improve the efficiency of uncertainty analysis, and a robust design optimization method based on DACFPA-Dual-Kriging is proposed.

The DACFPA outperforms the FPA, particle swarm optimization and gray wolf optimization algorithms in terms of solution accuracy, convergence speed and capacity to avoid local optimal solutions. Additionally, the DACFPA-Kriging model exhibits superior prediction accuracy and robustness contrasted with the original Kriging and FPA-Kriging. The proposed method for robust design optimization based on DACFPA-Dual-Kriging is applied to the motor hanger of the electric multiple units as an engineering case study, and the results confirm a significant reduction in the fluctuation of the maximum equivalent stress.

This study represents the initial attempt to enhance the prediction accuracy of the Kriging model using the improved FPA and to combine the dual Kriging model for uncertainty analysis, providing an idea for the robust optimization design of mechanical structure with black-box problem.

This paper aims to present a set of processes for obtaining the global spraying trajectory of a cold spraying robot on a complex surface.

The complex workpiece surfaces in the project are first divided by triangular meshing. Then, the geodesic curve method is applied for local path planning. Finally, the subsurface trajectory combination optimization problem is modeled as a GTSP problem and solved by the ant colony algorithm, where the evaluation scores and the uniform design method are used to determine the optimal parameter combination of the algorithm. A global optimized spraying trajectory is thus obtained.

The simulation results show that the proposed processes can achieve the shortest global spraying trajectory. Moreover, the cold spraying experiment on the IRB4600 six-joint robot verifies that the spraying trajectory obtained by the processes can ensure a uniform coating thickness.

The proposed processes address the issue of different parameter combinations, leading to different results when using the ant colony algorithm. The two methods for obtaining the optimal parameter combinations can solve this problem quickly and effectively, and guarantee that the processes obtain the optimal global spraying trajectory.

The purpose of this paper is to propose a novel improved teaching and learning-based algorithm (TLBO) to enhance its convergence ability and solution accuracy, making it more suitable for solving large-scale optimization issues.

Utilizing multiple cooperation mechanisms in teaching and learning processes, an improved TBLO named CTLBO (collectivism teaching-learning-based optimization) is developed. This algorithm introduces a new preparation phase before the teaching and learning phases and applies multiple teacher–learner cooperation strategies in teaching and learning processes. Applying modularization idea, based on the configuration structure of operators of CTLBO, six variants of CTLBO are constructed. For identifying the best configuration, 30 general benchmark functions are tested. Then, three experiments using CEC2020 (2020 IEEE Conference on Evolutionary Computation)-constrained optimization problems are conducted to compare CTLBO with other algorithms. At last, a large-scale industrial engineering problem is taken as the application case.

Experiment with 30 general unconstrained benchmark functions indicates that CTLBO-c is the best configuration of all variants of CTLBO. Three experiments using CEC2020-constrained optimization problems show that CTLBO is one powerful algorithm for solving large-scale constrained optimization problems. The application case of industrial engineering problem shows that CTLBO and its variant CTLBO-c can effectively solve the large-scale real problem, while the accuracies of TLBO and other meta-heuristic algorithm are far lower than CLTBO and CTLBO-c, revealing that CTLBO and its variants can far outperform other algorithms. CTLBO is an excellent algorithm for solving large-scale complex optimization issues.

The innovation of this paper lies in the improvement strategies in changing the original TLBO with two-phase teaching–learning mechanism to a new algorithm CTLBO with three-phase multiple cooperation teaching–learning mechanism, self-learning mechanism in teaching and group teaching mechanism. CTLBO has important application value in solving large-scale optimization problems.

Flights are often delayed owing to emergencies. This paper proposes a cooperative slot secondary assignment (CSSA) model based on a collaborative decision-making (CDM) mechanism, and the operation mode of flight waves designs an improved intelligent algorithm to solve the optimal flight plan and minimize the total delay of passenger time.

Taking passenger delays, transfer delays and flight cancellation delays into account comprehensively, the total delay time is minimized as the objective function. The model is verified by a linear solver and compared with the first come first service (FCFS) method to prove the effectiveness of the method. An improved adaptive partheno-genetic algorithm (IAPGA) using hierarchical serial number coding was designed, combining elite and roulette strategies to find pareto solutions.

Comparing and analyzing the experimental results of various scale examples, the optimization model in this paper is greatly optimized compared to the FCFS method in terms of total delay time, and the IAPGA algorithm is better than the algorithm before in terms of solution performance and solution set quality.

Based on the actual situation, this paper considers the operation mode of flight waves. In addition, the flight plan solved by the model can be guaranteed in terms of feasibility and effectiveness, which can provide airlines with reasonable decision-making opinions when reassigning slot resources.

This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.

In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.

The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.

In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.