A fundamental robotics task is to plan collision-free motions for complex bodies from a start to a goal position among a set of static and dynamic obstacles. This problem is well known in the literature as motion planning (or the piano mover's problem). The complexity of the problem has motivated many works in the field of robot path planning. One of the most popular algorithms is the Artificial Potential Field technique (APF). This method defines an artificial potential field in the configuration space (C-space) that produces a robot path from a start to a goal position. This technique is very fast for RT applications. However, the robot could be trapped in a deadlock (local minima of the potential function). The solution of this problem lies in the use of harmonic functions in the generation of the potential field, which satisfy the Laplace equation. Unfortunately, this technique requires a numerical simulation in a discrete mesh, making useless for RT applications. In our previous work, it was presented for the first time, the Proper Generalized Decomposition method to solve the motion planning problem. In that work, the PGD was designed just for static obstacles and computed as a vademecum for all Start and Goal combinations. This work demonstrates that the PGD could be a solution for the motion planning problem. However, in a realistic scenario, it is necessary to take into account more parameters like for instance, dynamic obstacles. The goal of the present paper is to introduce a diffusion term into the Laplace equation in order to take into account dynamic obstacles as an extra parameter. Both cases, isotropic and non-isotropic cases are into account in order to generalize the solution.
|ScienceOpen disciplines:||Applied mathematics, Applications, Statistics, Data analysis, Mathematics, Mathematical modeling & Computation|
|Keywords:||dynamic environment, mobile robot, PGD|