Abstract
A new local path planning method for dual-arm mobile robot shuttling within the truss is presented. Like the probabilistic roadmaps method, this method proceeds in two stages: preprocessing stage and path planning stage. In preprocessing stage, the workspace is divided into a set of non-overlapping cubical cells. The nodes in the free workspace are stored in a matrix. In path planning stage, three query strategies are adopted to search the path from start point to goal point. Take use of vertex query strategy, the smooth path can be acquired in a fraction of a second. The algorithm is simple, and is applicable to any static environment with convex obstacles.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have