Path Planning of Logistic Robot Using Method of Vector Marks Tree Generation

摘要

The authors of this article analyzed the problem of logistic robotics. This paper presents a method for robot navigation in a known environment. The method consists of two steps. The first step is to model the system, assign vector marks to the prominent edges of the virtual environment map, and direct the robot to reach these marks. The second step is to enable the robot to execute a specific task based on the given paths and deal with the local obstacles avoidance independently. The identification of the prominent point, the computation of the vector mark, and optimal path calculation are performed on the computer model using colored Petri nets in the software ‘Centaurus CPN’. The proposed approach was extended to simulate the work of a logistic robot, which has to take boxes and deliver them to certain places in storages. The experimental investigation has shown that the simulated mobile robots with the proposed navigation system were efficiently moving along the planned path. The analysis of the vector tree reveals that it takes 0.389 s to compute and graphically represent it. The occupation of certain places in storages is visualized and shown in experimental graphics.