Modified method of a path planning on a local maps for transport and aerospace robots
Titenko Anatolyievich, Emelyanov Gennadyevich, Dobroserdov Guryevich, Borzov Borisovich, Frolov Nikolaevich, Lisitsin Alexsandrovicn, Bredikhina Vladimirovna, Sazonov Yuryevich · Istrazivanja i projektovanja za privredu · 2019
In this paper we consider the modification of the method of planning the A-star path for transport and aerospace robots. It is necessary to take into account obstacles in the local neighborhood of aerospace robot, but not sufficient for the rational path planning. The essence of the modification is to use additional information about the features of original cell array. This additional information is represented by binary flags. They represent obstacle-free rows and matrix columns. The modification allows you to build paths that include straight sections of free cells. The main feature of this method is the use of bitwise logical operations on cell values.