Intelligent obstacle avoidance path planning method for picking manipulator combined with artificial potential field method

Purpose The results of obstacle avoidance path planning for the manipulator using artificial potential field (APF) method contain a large number of path nodes, which reduce the efficiency of manipulators. This paper aims to propose a new intelligent obstacle avoidance path planning method for picking robot to improve the efficiency of manipulators. Design/methodology/approach To improve the efficiency of the robot, this paper proposes a new intelligent obstacle avoidance path planning method for picking robot. In this method, we present a snake-tongue algorithm based on slope-type potential field and combine the snake-tongue algorithm with genetic algorithm (GA) and reinforcement learning (RL) to reduce the path length and the number of path nodes in the path planning results. Findings Simulation experiments were conducted with tomato string picking manipulator. The results showed that the path length is reduced from 4.1 to 2.979 m, the number of nodes is reduced from 31 to 3 and the working time of the robot is reduced from 87.35 to 37.12 s, after APF method combined with GA and RL. Originality/value This paper proposes a new improved method of APF, and combines it with GA and RL. The experimental results show that the new intelligent obstacle avoidance path planning method proposed in this paper is beneficial to improve the efficiency of the robotic arm. Graphical abstract Figure 1 According to principles of bionics, we propose a new path search method, snake-tongue algorithm, based on a slope-type potential field. At the same time, we use genetic algorithm to strengthen the ability of the artificial potential field method for path searching, so that it can complete the path searching in a variety of complex obstacle distribution situations with shorter path searching results. Reinforcement learning is used to reduce the number of path nodes, which is good for improving the efficiency of robot work. The use of genetic algorithm and reinforcement learning lays the foundation for intelligent control.

Research on E-commerce Logistics Distribution Path Planning Based on Improved Genetic Algorithm

With the rapid development of the Internet, e-commerce business has gradually emerged. However, its logistics distribution route planning method has problems such as redundancy of logistics data, which cannot achieve centralized planning of distribution paths, resulting in low e-commerce logistics distribution efficiency and long distribution distances, higher cost. Therefore, in order to improve the ability of logistics distribution path planning, this paper designs an e-commerce logistics distribution path planning method based on improved genetic algorithm. Optimize the analysis of e-commerce logistics distribution nodes, establish a modern logistics distribution system, and optimize the total transportation time and transportation cost under the location model of the logistics distribution center. Using hybrid search algorithm and improved genetic algorithm parameters, an improved genetic algorithm distribution path planning model is established to select the optimal path of logistics distribution, and realize e-commerce logistics distribution path with high accuracy, low error and good convergence. planning. According to the experimental results, the method in this paper can effectively shorten the distance of e-commerce logistics distribution path, reduce the number of distribution vehicles, reduce distribution costs, improve distribution efficiency, and effectively achieve centralized planning of logistics distribution. Therefore, the e-commerce logistics distribution route planning method based on improved genetic algorithm has high practical application value.

An Adaptive Route Planning Method of Connected Vehicles for Improving the Transport Efficiency

In recent years, the route-planning problem has gained increased interest due to the development of intelligent transportation systems (ITSs) and increasing traffic congestion especially in urban areas. An independent route-planning strategy for each in-vehicle terminal improves its individual travel efficiency. However, individual optimal routes pursue the maximization of individual benefit and may contradict the global benefit, thereby reducing the overall transport efficiency of the road network. To improve traffic efficiency while considering the travel time of individual vehicles, we propose a new dynamic route-planning method by innovatively introducing a bidding mechanism in the connected vehicle scenario for the first time. First, a novel bidding-based dynamic route planning is proposed to formulate vehicle routing schemes for vehicles affected by congestion via the bidding process. Correspondingly, a bidding price incorporating individual and global travel times was designed to balance the travel benefits of both objectives. Then, in the bidding process, a new local search algorithm was designed to select the winning routing scheme set with the minimum bidding price. Finally, the proposed method was tested and validated through case studies of simulated and actual driving scenarios to demonstrate that the bidding mechanism would be conducive to improving the transport efficiency of road networks in large-scale traffic flow scenarios. This study positively contributes to the research and development of traffic management in ITSs.