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.

Foraging behaviour and patch size distribution jointly determine population dynamics in fragmented landscapes.

Increased fragmentation caused by habitat loss represents a major threat to the persistence of animal populations. How fragmentation affects populations depends on the rate at which individuals move between spatially separated patches. Whereas negative effects of habitat loss on biodiversity are well known, the effects of fragmentation per se on population dynamics and ecosystem stability remain less well understood. Here, we use a spatially explicit predator-prey model to investigate how the interplay between fragmentation and optimal foraging behaviour affects predator-prey interactions and, subsequently, ecosystem stability. We study systems wherein prey occupies isolated patches and are consumed by predators that disperse following Lévy random walks. Our results show that the Lévy exponent and the degree of fragmentation jointly determine coexistence probabilities. In highly fragmented landscapes, Brownian and ballistic predators go extinct and only scale-free predators can coexist with prey. Furthermore, our results confirm that predation causes irreversible habitat loss in fragmented landscapes owing to overexploitation of smaller patches of prey. Moreover, we show that predator dispersal can reduce, but not prevent or minimize, the amount of lost habitat. Our results suggest that integrating optimal foraging theory into population and landscape ecology is crucial to assessing the impact of fragmentation on biodiversity and ecosystem stability.

Hybrid foraging in patchy environments using spatial memory.

Efficient random searches are essential to the survival of foragers searching for sparsely distributed targets. Lévy walks have been found to optimize the search over a wide range of constraints. When targets are distributed within patches, generating a spatial memory over the detected targets can be beneficial towards optimizing the search efficiency. Because foragers have limited memory, storing each target location separately is unrealistic. Instead, we propose incrementally learning a spatial distribution in favour of memorizing target locations. We demonstrate that an ensemble of Gaussian mixture models is a suitable candidate for such a spatial distribution. Using this, a hybrid foraging strategy is proposed, which interchanges random searches with informed movement. Informed movement results in displacements towards target locations, and is more likely to occur if the learned spatial distribution is correct. We show that, depending on the strength of the memory effects, foragers optimize search efficiencies by continuous revisitation of non-destructive targets. However, this negatively affects both the target and patch diversity, indicating that memory does not necessarily optimize multi-objective searches. Hence, the benefits of memory depend on the specific goals of the forager. Furthermore, through analysis of the distribution over walking distances of the forager, we show that memory changes the underlying walk characteristics. Specifically, the forager resorts to Brownian motion instead of Lévy walks, due to truncation of the long straight line displacements resulting from memory effects. This study provides a framework that opens up new avenues for investigating memory effects on foraging in sparse environments.

Adaptive Foraging in Dynamic Environments Using Scale-Free Interaction Networks.

Group interactions are widely observed in nature to optimize a set of critical collective behaviors, most notably sensing and decision making in uncertain environments. Nevertheless, these interactions are commonly modeled using local (proximity) networks, in which individuals interact within a certain spatial range. Recently, other interaction topologies have been revealed to support the emergence of higher levels of scalability and rapid information exchange. One prominent example is scale-free networks. In this study, we aim to examine the impact of scale-free communication when implemented for a swarm foraging task in dynamic environments. We model dynamic (uncertain) environments in terms of changes in food density and analyze the collective response of a simulated swarm with communication topology given by either proximity or scale-free networks. Our results suggest that scale-free networks accelerate the process of building up a rapid collective response to cope with the environment changes. However, this comes at the cost of lower coherence of the collective decision. Moreover, our findings suggest that the use of scale-free networks can improve swarm performance due to two side-effects introduced by using long-range interactions and frequent network regeneration. The former is a topological consequence, while the latter is a necessity due to robot motion. These two effects lead to reduced spatial correlations of a robot's behavior with its neighborhood and to an enhanced opinion mixing, i.e., more diversified information sampling. These insights were obtained by comparing the swarm performance in presence of scale-free networks to scenarios with alternative network topologies, and proximity networks with and without packet loss.

The Neglected Pieces of Designing Collective Decision-Making Processes.

Autonomous decision-making is a fundamental requirement for the intelligent behavior of individual agents and systems. For artificial systems, one of the key design prerequisites is providing the system with the ability to make proper decisions. Current literature on collective artificial systems designs decision-making mechanisms inspired mostly by the successful natural systems. Nevertheless, most of the approaches focus on voting mechanisms and miss other fundamental aspects. In this paper, we aim to draw attention to the missed pieces for the design of efficient collective decision-making, mainly information processes in its two types of stimuli and options set.

Scale invariance in natural and artificial collective systems: a review.

Self-organized collective coordinated behaviour is an impressive phenomenon, observed in a variety of natural and artificial systems, in which coherent global structures or dynamics emerge from local interactions between individual parts. If the degree of collective integration of a system does not depend on size, its level of robustness and adaptivity is typically increased and we refer to it as scale-invariant. In this review, we first identify three main types of self-organized scale-invariant systems: scale-invariant spatial structures, scale-invariant topologies and scale-invariant dynamics. We then provide examples of scale invariance from different domains in science, describe their origins and main features and discuss potential challenges and approaches for designing and engineering artificial systems with scale-invariant properties.