A Collective Motion Algorithm for Tracking Time-Dependent Boundaries
classification
🌊 nlin.PS
nlin.AO
keywords
boundaryagentsalgorithmallowsconcentrationdependentmethodtime
read the original 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 \cite{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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.