Abstract
Many animals perform two distinct alternating movement strategies when foraging: intensive searches with low speed and high turning to cover a small area in high detail and extensive searches with high speed and low turning to cover a large area in low detail. Observed movement paths will tend to exhibit differences in speed and correlation between these different search strategies. Identifying transitions between strategies can enable one to acquire information regarding both the distribution of resources and the underlying behavioural mechanisms performed by a foraging animal. Methods such as the moving average, first-passage time, residence time and fractal landscape methods have been used to identify behavioural states of various real and simulated foragers. We provide a review of these current methods and identify a set of common limitations associated with each procedure. We develop a new mathematical approach: the partial sum method, which is designed to avoid these limitations. A comprehensive test is undertaken to evaluate and compare the performance of the partial sum and the existing methods using a carefully constructed set of computer-generated movement paths. Each simulated track was designed to replicate the possible paths performed by an animal under different foraging conditions. Our results provide strong evidence that the partial sum method is better than existing analytical methods for identifying transitions between two different search strategies.
Similar content being viewed by others
References
Baker LG, Gollub J (1996) Chaotic dynamics: an introduction. Cambridge University Press, Cambridge
Banks JC (1954) The searching behaviour of coccinellid larvae. Anim Behav 28:37–38
Barraquand F, Benhamou S (2008) Animal movements in heterogeneous landscapes: identifying profitable areas and homogeneous movement bouts. Ecology 89:3336–3348
Bartumeus F, Levin SA (2008) Fractal reorientation clocks: linking animal behaviour to statistical patterns of search. PNAS 105:19072–19077
Bartumeus F (2009) Behavioural intermittence, Lévy patterns, and randomness in animal movement. Oikos 118:488–494
Benhamou S (2007) How many animals really do the Lévy walk? Ecology 88:1962–1969
Bond BA (1980) Optimal foraging in a uniform habitat: the search mechanism of the green lacewing. Anim Behav 28:10–19
Bossel H (1994) Modeling and simulation. Peters, USA
Boyd LI (1996) Temporal scales of foraging in a marine predator. Ecology 77:426–434
Cazelles B, Chavez M, Berteaux FM, Vik JO, Jenouvrier S, Stenseth NC (2008) Wavelet analysis of ecological time series. Oecologia 156:287–304
Chandler FE (1969) Locomotory behaviour of first instar larvae of aphidophagous Syrphidae (Diptera) after contact with aphids. Anim Behav 17:673–678
Codling EA, Hill NA (2005) Sampling rate effects on measurements of correlated and biased random walks. J Theor Biol 233:573–588
Codling EA, Plank MJ (2010) Turn designation, sampling rate and the misidentification of power-laws in movement path data using maximum likelihood estimates. J Theor Ecol. doi:10.1007/s12080-010-0086-9
Codling EA, Plank MJ, Benhamou S (2008) Random walk models in biology. J R Soc Interface 5:813–834
Curio E (1976) The ethology of predation. Springer, New York
Dicke M, Burrough AP (1988) Using fractal dimensions for characterizing the tortuosity of animal trails. Physiol Entomol 13:393–398
Edwards AM, Phillips RA, Watkins NW, Freeman MP, Murphy EJ, Afanasyev V, Buldyrev SV, da Luz MGE, Raposo EP, Stanley HE, Viswanathan GM (2007) Revisiting Lévy flight search patterns of wandering albatrosses, bumblebees and deer. Nature 449:1044–1048
Fauchald P, Tvera T (2003) Using first-passage time in the analysis of area-restricted search and habitat selection. Ecology 84:282–288
Flanders E (1947) Elements of host discovery exemplified by parasitic hymenoptera. Ecology 28:299–309
Ford RG (1983) Home range in a patchy environment: optimal foraging predictions. Am Zool 23:315–326
Giuggioli L, Bartumeus F (2009) Animal movement, search strategies, and behavioural ecology: across-disciplinary way forward. J Anim Ecol 79:906–909
Gutenkunst R, Newlands N, Lutcavage M, Edelstein-Keset L (2007) Inferring resource distributions from Atlantic bluefin tuna movements: an analysis based on net displacement and length of track. J Theor Biol 245:243–257
Harrison R, Lin Z, Carroll GR, Carley KM (2007) Time series and dynamic models. Acad Manage Rev 32:1229–1245
Hawkins MD, Olwell HD (1998) Cumulative sum charts and charting for quality improvement. Springer, New York
Jonsen ID, Flemming JM, Myers RA (2005) Robust state-space modeling of animal movement data. Ecology 86:2874–2880
Kareiva MP, Odell G (1987) Swarms of predators exhibit preytaxis if individual predators use area-restricted search. Am Nat 130:233–270
Laing J (1937) Host-finding by insect parasites. In: Observations on the finding of hosts by Alysia manducator, Mormoniella vitripennis and Trichogramma evanescens. J Anim Ecol 6:298–317
Le Boeuf JB, Crocker ED, Costa PD, Blackwell BS, Webb MP, Houser SD (2000) Foraging ecology of northern elephant seals. Ecol Monogr 70:353–382
Mandelbrot B (1967) How long is the coast of Britain? Statistical self-similarity and fractional dimension. Science 156:636–638
Morales JM, Haydon DT, Frair J, Holsinger KE, Fryxell JM (2004) Extracting more out of relocation data: building movement models as mixtures of random walks. Ecology 85:2436–2445
Newell GF (1962) Asymptotic extreme value distributions for one dimensional diffusions. J Math Mech 11:481–496
Plank MJ, Codling EA (2009) Sampling rate and misidentification of Lévy and non-Lévy movement paths. Ecology 90:3546–3553
Polansky L, Wittemyer G, Cross PC, Tambling CJ, Wayne GM (2010) From moonlight to movement and synchronized randomness: Fourier and wavelet analyses of animal location time series data. Ecology 91:1506–1518
Robinson WP, Tremblay ED, Crocker AM, Kappes EC, Kuhn AS, Shaffer ES, Simmons ES, Costa PD (2007) A comparison of indirect measures of feeding behaviour based on ARGOS tracking data. Deep-Sea Res Pt II 54:356–368
Tel T, Gruiz M (2006) Chaotic dynamics: an introduction based on classical mechanics. Cambridge University Press, Cambridge
Tong H (1993) Dimension estimation and models. World Scientific, Singapore
Tremblay Y, Roberts JA, Costa PD (2007) Fractal landscape method: an alternative to measuring area-restricted searching behavior. J Exp Biol 210:935–945
Tuckwell HC, Wan FM (1984) First-passage time of Markov processes to moving barriers. J Appl Probab 21:695–709
Turchin P (1996) Fractal analysis of animal movement: a critique. Ecology 77:2086–2090
Viswanathan GM, Afanasyev V, Buldyrev S, Murphy EJ, Prince PA, Stanley HE (1996) Lévy flight search patterns of wandering albatrosses. Nature 381:413–415
Viswanathan GM, Buldyrev SV, Havlin S, da Luz MGE, Raposo EP, Stanley HE (1999) Optimizing the success of random searches. Nature 401:911–914
Wiens AJ (1976) Population responses to patchy environments. Annu Rev Ecol Syst 7:81–120
Author information
Authors and Affiliations
Corresponding author
Electronic supplementary material
Below is the link to the electronic supplementary material.
Supplementary Material
(PDF 1.34 MB)
Appendices
Appendix 1: The partial sum method
The PS method is an analytical approach designed specifically to identify transitions between two different behavioural states within an observed movement path of an animal. A continuous animal movement path in a two-dimensional space can be represented as a discrete ordered pair (x t ,y t ), for 1 ≤ t ≤ T, with x t , y t , representing the Cartesian coordinates of the location at time step t, where T denotes the total number of time steps in the observed movement path. Variables θ t , l t , d t and v t = (l t /τ t ) denote the change in direction, distance, time and speed between successive observations (x t − 1,y t − 1) and (x t ,y t ).
-
1.
Cumulative sum. Determine the cumulative sum
$$ \begin{array}{rll} C_{1}&=&\bar{S}=\displaystyle\frac{\sum^{T}_{t=2}S_{t}}{(T-1)}, \\ C_{\tau}&=&\sum^{\tau}_{t=2}(S_{t}-\bar{S}), \end{array} $$for τ = 2,...,T, where C τ denotes the cumulative sum of information at time step τ and S t denotes one of the following statistical properties at time step t:
-
a.
Speed
$$ S_{t}=v_{t}=\frac{\sqrt{(x_{t}-x_{t-1})^{2}+(y_{t}-y_{t-1})^{2}}}{d_{t}}. $$ -
b.
Absolute turning angle (i.e. the sign of the turning angle is not important)
$$ S_{t}=\vert\theta_{t}\vert=\left\vert\arctan\left(\frac{x_{t}-x_{t-1}}{y_{t}-y_{t-1}}\right)\right\vert. $$ -
c.
Sum of the normalised absolute turning angle and inverse of the normalised speed (i.e. these quantities are inversely proportional and are normalised as they use different scales)
$$ S_{t}=\left(\frac{\vert\theta_{t}\vert-\mu_{\theta}}{\sigma_{\theta}}\right)+\left(\frac{\sigma_{v}}{v_{t}-\mu_{v}}\right), $$where σ θ , σ v and μ θ , μ v denote the sample standard deviation and sample mean (i.e. for time steps 2,...,T) for both θ and v, respectively.
-
a.
-
2.
Time series. Construct the time series C τ vs. τ.
-
3.
Termination criterion. Does a turning point exist within the generated time series?
-
Yes: proceed to 4.
-
No: one cannot effectively analyse this movement path; terminate procedure.
-
-
4.
Max–min algorithm. Determine turning points of the time series using the max–min algorithm (see “Appendix 2” for full algorithm).
-
5.
Conclusion. Classify turning points as either transitions from an extensive to an intensive search strategy or an intensive to an extensive search strategy.
Appendix 2: The max–min algorithm
The max–min (MM) algorithm is designed specifically to identify turning points within a time series generated from the PS method (see “ Appendix 1” for full method). Suppose a time series consisting of T steps is increasing. One aims to find the first turning point in the time series (i.e. a local maximum). One sets the current maximum value \(C_{\tau_{\rm max}}\) equal to the cumulative sum at time τ (i.e C τ ). Then for step τ + 1 we determine whether \(C_{\tau+1}>C_{\tau_{\rm max}}\). If \(C_{\tau+1}>C_{\tau_{\rm max}}\) then we set \(C_{\tau_{\rm max}}=C_{\tau+1}\); however, if \(C_{\tau+1}>C_{\tau_{\rm max}}\), then \(C_{\tau_{\rm max}}\) is unchanged. If \(C_{\tau_{\rm max}}\) remains unchanged up to a period of ϵ, time then the location of \(C_{\tau_{\rm max}}\) (i.e. τ max), is classified as a turning point within the time series. A similar procedure is also used to locate local minimum values.
-
1.
Determine initial parameters.
Set τ = 1 and choose a suitable threshold ϵ.
-
2.
Increasing–decreasing criterion.
Let C τ denote the cumulative sum at time step τ, defined by Eq. 5 in the main text;
-
If C τ < C τ + ϵ : increasing at τ, proceed to 3.
-
If C τ > C τ + ε : decreasing at τ , proceed to 7.
-
-
3.
Maximisation table.
Construct maximisation table with headings: I, τ, C τ , τ max, \(C_{\tau_{\rm max}}\) and ϵ. Enter initial values I = 1, τ = τ, C τ = C τ , τ max = τ, \(C_{\tau_{\rm max}}=C_{\tau}\) and ν = 0, where I: iteration number, \(C_{\tau_{\rm max}}\): current maximum value for C τ , τ max: time step of current \(C_{\tau_{\rm max}}\) and ν: consecutive occurrences of current \(C_{\tau_{\rm max}}\).
-
4.
Termination criterion.
Set I = I + 1;
-
If τ < T: set τ = τ + 1 and proceed to 5.
-
If τ ≥ T: terminate procedure.
-
-
5.
Determine τ max , \(C_{\tau_{max}}\) and ϵ.
-
If \(C_{\tau}>C_{\tau_{\rm max}}\): set τ max = τ, \(C_{\tau_{\rm max}}=C_{\tau}\), ν = 0 and proceed to 6.
-
If \(C_{\tau}<C_{\tau_{\rm max}}\): leave \(C_{\tau_{\rm max}}\) and τ max unchanged, ν = ν + 1 and proceed to 6.
-
-
6.
Maximum criterion.
-
If ν = ϵ: define maximum at τ max with corresponding value \(C_{\tau_{\rm max}}\), set τ = τ max and proceed to 2.
-
If ν ≠ ϵ—proceed to 4.
-
-
7.
Minimisation table.
Construct minimisation table with headings: I, τ, C τ , τ min, \(C_{\tau_{\rm min}}\) and ε. Enter initial values I = 1, τ = τ, C τ = C τ , τ min = τ, \(C_{\tau_{\rm min}}=C_{\tau}\) and ε = 0, where I: iteration number, \(C_{\tau_{\rm min}}\): current minimum value for C τ , τ min: time step of current \(C_{\tau_{\rm min}}\) and ν: consecutive occurrences of current \(C_{\tau_{\rm min}}\).
-
8.
Termination criterion.
Set I = I + 1;
-
If τ < T: set τ = τ + 1 and proceed to 9.
-
If τ ≥ T: terminate procedure.
-
-
9.
Determine τ min , \(C_{\tau_{\min}}\) and τ.
-
If \(C_{\tau}<C_{\tau_{\rm min}}\): set τ min = τ, \(C_{\tau_{\rm min}}=C_{\tau}\), ν = 0 and proceed to 10.
-
If \(C_{\tau}>C_{\tau_{\rm min}}\): leave \(C_{\tau_{\rm min}}\) and τ min unchanged, ν = ν + 1 and proceed to 10.
-
-
10.
Minimum criterion.
-
If ν = ϵ: define minimum at τ min with corresponding value \(C_{\tau_{\rm min}}\), set τ = τ min and proceed to 2.
-
If ν ≠ ϵ: proceed to 8.
-
Rights and permissions
About this article
Cite this article
Knell, A.S., Codling, E.A. Classifying area-restricted search (ARS) using a partial sum approach. Theor Ecol 5, 325–339 (2012). https://doi.org/10.1007/s12080-011-0130-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12080-011-0130-4