Reactive shepherding along a dynamic path.

Shepherding, the task of guiding a herd of autonomous individuals in a desired direction, is an essential skill employed in the herding of animals, crowd control, and evacuation operations. Integrating shepherding capabilities into robots holds promise to perform such tasks with increased efficiency and reduced labor costs. To date, robotic shepherds have only been designed to steer a herd towards a predetermined goal location without constraints on the trajectory. However, the tasks of a sheepdog encompass not only steering the herd but also (i) maintaining the herd within a designated area and (ii) averting dangers, obstacles, or undesirable terrain such as newly sown land. We present a decentralized control algorithm for multi-robot shepherding designed to guide a group of animals along a specified path delineated by two boundaries. The algorithm incorporates the additional objective of preserving the group within these boundaries. Simulation results reveal that, especially in sections of the path with sharp turns and a small distance between the boundaries, the group exhibits a tendency to deviate beyond the prescribed margin. Additionally, our findings emphasize the algorithm's sensitivity to the ratio of robot-group sizes and the magnitude of the group's velocity.

Steering herds away from dangers in dynamic environments.

Shepherding, the task of guiding a herd of autonomous individuals in a desired direction, is an essential skill to herd animals, enable crowd control and rescue from danger. Equipping robots with the capability of shepherding would allow performing such tasks with increased efficiency and reduced labour costs. So far, only single-robot or centralized multi-robot solutions have been proposed. The former is unable to observe dangers at any place surrounding the herd, and the latter does not generalize to unconstrained environments. Therefore, we propose a decentralized control algorithm for multi-robot shepherding, where the robots maintain a caging pattern around the herd to detect potential nearby dangers. When danger is detected, part of the robot swarm positions itself in order to repel the herd towards a safer region. We study the performance of our algorithm for different collective motion models of the herd. We task the robots to shepherd a herd to safety in two dynamic scenarios: (i) to avoid dangerous patches appearing over time and (ii) to remain inside a safe circular enclosure. Simulations show that the robots are always successful in shepherding when the herd remains cohesive, and enough robots are deployed.