A Collective Motion Algorithm for Tracking Time-Dependent Boundaries
Abstract
We present a numerical method that allows a formation of communicating agents to target the boundary of a time dependent concentration by following a time dependent concentration gradient. The algorithm motivated by MB, BKM, allows the agents to move in space in a non-stationary environment. Our method is applicable to finding the boundary of any regular surface and may be of interest for for studying motions of swarms in biology, as well as to engineering applications where boundary detection is an issue.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.