Mobile robot path planning method based on parameterized level set

Abstract

The invention discloses a mobile robot path planning method based on a parameterized level set. The method comprises: enabling a mobile robot path planning problem to be equivalent to a topology optimization problem of a heat conduction path; establishing a finite element calculation model of a base structure; and with the heat dissipation weakness as an objective function, determining a growth direction of each step of cooling channel based on a topology optimization method expressed by a parameterized level set, and acquiring a planned path based on continuous growth of the cooling channel.Therefore, a problem of falling into local optimum is solved fundamentally. The generated path is one with the low energy consumption by using the heat dissipation weakness as the objective function;the generated path is formed by a series of explicit geometric points and can be applied to navigation of the mobile robot directly; on the basis of combination of the growth conception, the high computing load in one operation is avoided and the planning quality is improved; and since the growth direction is not limited by the underlying mesh, searching is performed freely to obtain an optimal path that is better than that in the traditional method.

Description

Technical field [0001] The invention belongs to the technical field of robot path planning, and specifically relates to a method for path planning of a mobile robot based on a parameterized level set. Background technique [0002] As a category of robots, mobile robots are widely used in factory automation, intelligent transportation and life services. How to find a safe collision-free path from the starting point to the end point in the configuration space of a mobile robot is an important direction of robot research. The existing path planning methods mainly include map search method, map construction method, artificial potential field method and heuristic method. Because of the blindness of the search method, the calculation amount increases with the expansion of the environment; the results obtained by the map construction method are relatively rough; the artificial potential field method has the problems of local minimum and path oscillation near obstacles; heuristic method...

AI Technical Summary

Problems solved by technology

Due to the blindness of the search in the graph search method, the amount of calculation increases with the expansion of the environment; the results obtained by the map construction method are relatively rough; the artificial potential field method has the problem of local minimum and the path oscillates near obstacles; the heuristic method Treating path planning as a discrete optimization problem leads to large fluctuations in the resulting path

Images