In this study, an improved A* algorithm is proposed to solve the robot path planning problem. The first improvement of the advanced method is the local path between the current node and the goal node, which is
As a result, an improved multi-objective A-star (IMOA-star) algorithm for mobile robot path planning in a large workspace was designed and implemented in Python 3.8.3 in this study. In four test cases, the proposed IMOA-star is evaluated in a large workspace with dimensions of 7120 cm ...
32 proposed a credit-based improved PBFT consensus algorithm (CPBFT). The original C/S architecture is changed to a P2P architecture, the consensus step is reduced, the credit coefficient is introduced, and the voting method is used to select the master node so that the probability of a ...
we also prove that the accuracy of decision trees constructed by the improved algorithm is equal to the one of ID3 algorithm.At the same time,through the experiment of testing the large datasets,we find that the new algorithm has higher calculative efficiency than the old one in the same ...
To solve this problem, a robot welding guidance system based on an improved YOLOv5 algorithm with a RealSense Depth Camera was proposed. A coordinate attention (CA) module was embedded in the original YOLOv5 algorithm to improve the accuracy of weld groove detection. The center of the predicted...
Tan et al. also improved the MOEA/D algorithm in high dimensions and proposed a MOEA/D-based uniform design algorithm called the UMOEA/D algorithm [17]. The weight vectors on three to five objective spaces are more uniform. Besides, in some existing MOEAs, an external archive is usually ...
To address this need, this study aims to enhance the ability to forecast employee turnover and introduce a new method based on an improved random forest algorithm. The proposed weighted quadratic random forest algorithm is applied to employee turnover data with high-dimensional unbalanced ...
Algorithm developers are the people who design these tools to help software operate efficiently—which means there’s a constant need for new algorithm developers to help build and manage the tools of tomorrow. This guide will help you learn how to become an algorithm developer. You’ll learn ...
However, currently there are only a few publications which consider one or two realistic constraints simultaneously. Based on the efficiency performance of the Jaya algorithm and the problem features of the realistic FJSPs, we propose an improved Jaya (IJaya) that targets the transportation and ...
Improved approximation algorithm for TSP with relaxed triangle inequality. • Approximate Min. weight degree-4-bounded Eulerian subgraph of doubled complete graph. • Application of degree bounded matroids, b-matchings, and a new orientation technique. Abstract Given a complete edge-weighted graph ...