Symmetric caging formation for convex polygon object transportation by multiple mobile robots

In this paper, the problem of object caging and transporting is considered by multiple mobile robots using object closure technology. With the consideration of minimizing the number of the robots and decreasing the rotation of the object, the proper points are calculated and assigned to the multiple mobile robots to form the symmetric caging formation. The caging formation guarantees that all of the Euclidean distances between two adjacent robots are smaller than the minimal width of the polygon object and the object cannot escape. Finally, the simulation results represent multiple mobile robots which cage and transport the polygon object to the goal position.