Sampling-Based Path Planning Algorithm for a Plug & Produce Environment

Abstract

The purpose of this article is to investigate a suitable path planning algorithm for a multi-agent-based Plug & Produce system that can run online during manufacturing. This is needed since in such systems, resources can move around frequently, making it hard to manually create robot paths. To find a suitable algorithm and verify that it can be used online in a Plug & Produce system, a comparative study between various existing sampling-based path planning algorithms was conducted. Much research exists on path planning carried out offline; however, not so much is performed in online path planning. The specific requirements for Plug & Produce are to generate a path fast enough to eliminate manufacturing delays, to make the path energy efficient, and that it run fast enough to complete the task. The paths are generated in a simulation environment and the generated paths are tested for robot configuration errors and errors due to the target being out of reach. The error-free generated paths are then tested on an industrial test bed environment, and the energy consumed by each path was measured and validated with an energy meter. The results show that all the implemented optimal sampling-based algorithms can be used for some scenarios, but that adaptive RRT and adaptive RRT* are more suitable for online applications in multi-agent systems (MAS) due to a faster generation of paths, even though the environment has more constraints. For each generated path the computational time of the algorithm, move-along time and energy consumed are measured, evaluated, compared, and presented in the article.

Keywords

• adaptive RRT*
• path planning
• Plug & Produce
• PRM
• RRT*
• sampling-based algorithms