Preprint. Under Review for the CCP2023 Proceedings.
Elliptical Pursuit and Evasion
Extended Version
Abstract
Many studies on one-on-one pursuit-evasion problems have shown that formulas about the pursuer’s trajectory can be solved by supposing three conditions. First, the evader follows specific figures. Second, the pursuer’s velocity vector always points toward the evader’s position. Third, the ratio of their respective speed remains constant. However, previous studies often assumed that the evader moves at a steady speed. This study aims to investigate how changes in the evader’s speed affect the pursuer’s trajectory. We hypothesized that the pursuer’s trajectory would remain unchanged. First, the pursuer’s trajectories were obtained from three scenarios where the evader orbits an ellipse with different speeds and angular velocities. These trajectories coincided. Second, changes in the evader’s speed correspond to changes in the evader’s trajectory parameters. Replacing the evader’s parameter is proven to be replacing the pursuer’s parameter. It is shown that replacing the evader’s parameter is equivalent to replacing the pursuer’s parameter. Consequently, the shape of the pursuer’s trajectory is unaffected by the evader’s speed; only the speed ratio matters in the game.
This version includes additional sections on the dynamical system that were not present in the original version. If the evader’s speed is always one, a dynamical system can be derived from the three conditions of pursuit and evasion. When the evader orbits a circle, this dynamical system is autonomous and has an asymptotically stable equilibrium point. However, when the evader orbits an ellipse, the dynamical system becomes non-autonomous, and the solution trajectory converges to a closed curve. Additionally, we present a second-order nonlinear differential equation describing the angular difference between the velocity vectors of both players.
Keywords: Pursuit and Evasion, Ellipse, Pursuit-Evasion differential game, dynamical system
1 Introduction
This study explores the classical one-on-one pursuit and evasion problem in a two-dimensional plane. We focus on analyzing the pursuer’s trajectory under three conditions:
-
1.
The evader’s movement is unaffected by the pursuer.
-
2.
The pursuer’s velocity vector constantly points toward the evader’s position.
-
3.
The ratio of the pursuer’s speed to the evader’s speed remains constant.
Differential equations that formalize this problem are given in Section 2.
Notably, when the evader follows a circular trajectory, this problem is referred to as Hathaway’s dog and duck pursuit problem. Moreover, when the pursuer’s speed is times slower than the evader, the pursuer’s trajectory converges to a circle reduced by a factor of . [1, 2] We investigated the pursuer’s trajectory when the evader orbits an ellipse, as discussed in [3], and found that this phenomenon does not occur (see Fig.1).
In [3], the evader’s speed and angular velocity were not constant. We hypothesize that changing the ellipse parameters will alter the pursuer’s trajectory. This hypothesis is tested in Section 3, where we derive two alternative sets of ellipse parameters with constant speed and constant angular velocity. We calculate three numerical solutions about the pursuer’s trajectory corresponding to these three different scenarios where the evader orbits an ellipse. The resulting three pursuer trajectories were consistent, disproving the hypothesis.
Experimental data show that for parameter values that result in the same evader coordinates across different parameterizations, the pursuer coordinates are also consistent. This indicates that replacing the evader’s parameters is equivalent to replacing the pursuer’s parameters, leaving the shape of the pursuer’s trajectory unchanged. In Section 4, we mathematically prove this supposition.
Sections 5-8 are additional sections to the original version for the CCP2023 proceedings. In these sections, we assume the evader’s velocity is 1. According to the theorem presented in Section 4, this assumption does not affect the shape of the pursuer’s trajectory. In Section 5, we derive the dynamical system using the angular difference between the velocity vectors of the two players and the distance between them as variables. Section 6 explores the properties of the dynamical system when the evader orbits a circle. In this scenario, the dynamical system is autonomous and has an asymptotically stable equilibrium point. In Section 7, we investigate the case where the evader orbits an ellipse. Here, the dynamical system is non-autonomous, and thus, it lacks an equilibrium point. Additionally, the solution trajectory converges to a closed curve. In Section 8, we propose a method to reduce the variables in the dynamical system from two to one. This leads to a second-order nonlinear differential equation describing the angular difference between the velocity vectors of the two players.


2 Preliminary
We formulate the problem of pursuit and evasion based on [4] as a differential equation problem. Let and denote the evader and the pursuer position at time , respectively. According to the first condition, is given. The second condition can be expressed as follows:
(1) |
where represents the ratio of the distance between the pursuer and the evader to the pursuer’s speed. The third condition can be formulated as follows:
(2) |
where denotes the ratio of the pursuer to the evader speed. By putting and , the component equations for the vectors are as follows:
(3) | |||
(4) | |||
(5) |
The problem of pursuit and evasion problem then reduces to solving for and that satisfy equations (3)- (5) for given and . These equations are challenging to solve numerically, but they can be transformed into a more solvable form. From equation (1) and (2),
(6) |
Substituting this into the component equations for and ((3) and (4), respectively), we obtain the following two equations:
(7) | ||||
(8) |
Thus, the pursuit and evasion problem reduces to solving for and that satisfy equations (7) and (8) for given , , and . This method can calculate the solution only up until just before the pursuer catches the evader, as the denominators in these two equations approach zero at that point.
3 Deriving Ellipse Parameters
When the evader orbits an ellipse, and satisfy the following equation:
(9) |
In this paper, the evader starts from and rotates counterclockwise. These are standard ellipse parameters.
(10) |
If , the evader’s speed and angular velocity are constant, but if neither is constant. In Fig.1(A), , , while in Fig.1(A), , . Therefore, we hypothesize that the lack of constant speed and angular velocity is the cause of the difference in the pursuer’s trajectory. We derive two ellipse parameterizations where either the speed or the angular velocity is constant. Note that no parameterization can ensure both remain constant simultaneously.
3.1 Constant Angular Velocity
We derive a paremeter where the angular velocity is constant and equal to . Given that the angular velocity is , the argument at the point is . Therefore, we have:
(11) |
where . Substituting these into the ellipse equation(9):
(12) |
Thus, the parameterization becomes:
(13) |
3.2 Constant Speed
Next, we derive a parameter where the speed is constant and equal to . Directly determining and is difficult. Instead, we parameterize the velocity vector as:
(14) |
Differentiating the ellipse equation (9) with respect to time and dividing by ,
(15) |
Hence, and are orthogonal. Since, has a length of and parallel to the vector obtained by rotating by . Hence, is the vector which is normalized. Then we find:
(16) |
To obtain the pursuer’s trajectory, we convert in (7) and (8) to . The pursuer’s trajectory is determined by and , satisfying the following two equations:
(17) | ||||
(18) |
We also need to determine . From equation (16):
(19) |
Differentiating with respect to time and substituting (14) and (16), we obtain:
(20) |
Therefore,
(21) |
3.3 Experiment
We studied the trajectory of a pursuer starting from the origin as the evader moved once around the ellipse from . We set , and . For the case in equation (10), we obtained numerical solutions of equations (7) and (8) from to . For the case in equation (13), we calculated of the same equations for the same interval. For the case in equation (16), we computed of equations (17) and (18) from to .
The results are shown in Fig. 2. As demonstrated, the pursuer’s trajectories are consistent across all cases.
Fig. 3 plots the x-coordinates of the evaders in Fig. 2 (A), (B), and (C). To facilitate comparison, we have set the horizontal axes of panels Fig. 2 (A) and (B) to , while in panel Fig. 2 (C), the horizontal axis is set to . The position of three evaders coincide at , (), and at this moment, the pursuer’s x-coordinates also coincide.

Green:Evader.

Green:Evader.

Green:Evader.

Dashed line:
4 A New Theorem on Parametrization
We have derived a theorem stating that transforming the evader’s parameters does not change the shape of the pursuer’s trajectory. In other words, the pursuer’s trajectory is unique, and if the evader’s parameters are changed, only the parameters of that trajectory are altered accordingly.
Theorem 1.
Assume that satisfies (3)-(5) for a given , . If the evader’s parameters are changed from to while maintaining the same orientation, then and satisfy the following system of differential equations, where in (3)-(5) is replaced by .
(22) | |||
(23) | |||
(24) |
Proof.
We derive a formula relating and . From the definition of , the following equation holds.
(25) |
Since is a function of , the following two equations hold:
(26) | ||||
(27) |
Moreover, since , , and , the function is transformed as follows:
(28) |
Therefore, . By applying the chain rule, we have:
(29) | ||||
(30) | ||||
Since , are solutions of (3), we have: | ||||
(31) |
As the parameter is transformed from , which is the parameter of the evader’s trajectory, . Therefore, .
We can prove the equation for in the same manner. Also, The equation (24) for the speed ratio can also be shown as follows:
(32) | ||||
(33) | ||||
(34) |
∎
The same argument applies to equations (7) and (8), which were used in Section 3 to numerically calculate the trajectory of the pursuer.
Theorem 2.
Assume that and satisfy equations (7) and (8) for a given and . If the evader’s parameters are changed from to while maintaining the orientation, then and satisfy the following system of differential equations, where in equations (7) and (8) is replaced by :
(35) | ||||
(36) |
Proof.
Since is a function of , and is a function of , we have:
(37) |
The same holds for , and . Therefore,
(38) |
Since , , , and , the right-hand side of equation (35) transforms as follows:
(39) | |||
(40) |
Substituting (37) and (38) for this equation, we have:
(41) |
The right side of equation (36) can be transformed similarly, leading to:
(42) |
∎
5 Derivation of a Dynamical System
Theorem.1 allows us to assume the evader’s speed is consistently when we are only concerned with the shape of the pursuer’s trajectory. From this assumption, a dynamical system can be derived from this assumption. First, let . From equation (2), . As in Section 3.2, we parameterize the velocity vector as follows:
(43) | |||
(44) |
Second, let . Taking the absolute value in (1),
(45) | ||||
(46) | ||||
(47) |
Substituting equation (47) for (3) and (4),
(48) |
Third, we derive a simultaneous differential equation for and . The following equation is the result of differentiating equation (48) with respect to , written for each component.
(49) |
Substituting equations (43) and (44) into equation (49) and applying the addition theorem of trigonometric functions, we obtain:
(50) |
Finally, we introduce a new variable . (50) is transformed into the following more analyzable simultaneous differential equation:
(51) |
The simultaneous differential equation (51) represents a dynamical system. It is simpler than the original simultaneous differential equation (3)-(5).
6 Dynamical System in Circular Pursuit and Evasion
We discuss the case of circular pursuit and evasion. The parameters for a circle are and . These are not consistent with , so we modify to . Therefore, the parameters change to and . By differentiating, we find that and . Thus, the dynamical system (51) for circular pursuit and evasion becomes:
(52) |
If , (52) has an equilibrium point . Therefore, the pursuer’s trajectory converges to a reduced circle scaled by a factor of .
6.1 Stability in Equilibrium Point
In this subsection, we demonstrate that the equilibrium point (52), is asymptotically stable. Proving that this equilibrium point is globally asymptotically stable is more challenging. Let:
(53) | |||
(54) |
If is close to , the stability of (52) is determined by the eigenvalues of the following matrix:
(55) | ||||
(56) | ||||
Let matrix be defined as follows: | ||||
(57) |
Matrix has two eigenvalues, which are:
(58) |
If , is negative, so are complex numbers with negative real parts. If , less than , so are real negative numbers. Therefore, is asymptotically stable.
7 Dynamical System in Elliptical Pursuit and Evasion
We examine the elliptical pursuit and evasion scenario. A function in equation (51) corresponds to in Section 3.2. Substituting equation (21) into equation (51), we obtain:
(59) |
In the case of circular pursuit and evasion, equation (51) becomes equation (52) which is an autonomous dynamical system. However, equation (51) becomes equation (59) which is non-autonomous when considering elliptical pursuit and evasion. Since equation (59) lacks information about , both equations (59) and (21) must be solved simultaneously to obtain numerical solutions. Note that if , equation (59) coincides with equation (52), and so it reduces to the circular pursuit and evasion case.
We illustrate the difference between these two dynamical systems by drawing two , as shown in Fig.(4). Fig.(4(a)) represents the phase portrait of equation (52) with parameters and . We obtained a numerical solution of equation (52) from to , with initial conditions and . In this figure, the solution trajectory terminates at an equilibrium point with coordinates . Fig.(4(b)) represents the phase portrait of equation (59), where is set to and the other parameters are the same as in Fig. (4(a)). We obtained a numerical solution of equation (59) from to , with initial conditions and . As shown in the figure, the solution trajectory converges to a closed curve, although no mathematical proof has been established for this observation. Additionally, the shape of this closed curve remains unclear.


8 Equation about
In this section we derive a single differential equation from (51). Assume that the argument of the evader’s velocity vector, , is strictly monotonically increasing. This assumption holds when the Evader is orbiting a circle or an ellipse in a counterclockwise direction. Under this assumption, the time variable can be converted into . Equation (51) then transforms as follows:
(60) | ||||
(61) |
Where denotes the derivative with respect to , and . Differentiating the second equation (61) with respect to , we obtain:
(62) |
Substitute the first equation (60) for and multiplying both sides by :
(63) |
From the second equation (61), , therefore we obtain the following second-order nonlinear differential equation for .
(64) |
We now derive (64) for the elliptical pursuit and evasion case. Divide equation (64) by ,
(65) |
Substituting equation (21) for , we have:
(66) |
Thus, the dynamical system in elliptical pursuit and evasion, given by equation (59), can be rewritten as the following two-order nonlinear differential equation:
(67) |
9 Conclusion
This paper explored two key findings. First, we demonstrated that changing the parameterization of the evader does not alter the shape of the pursuer’s trajectory. As a result, we can infer that the fact that the pursuer’s trajectory does not become an ellipse scaled by a factor of is not solely due to the evader’s speed or acceleration, but rather the specific shape of the ellipse itself. Second, we examined the pursuit-evasion game from the perspective of dynamical systems. The main difference between circular and elliptical pursuit and evasion lies in whether the dynamical system is autonomous or non-autonomous, and in the shape of the solution trajectories.
10 Future Works
There are two important areas for future work. First, we need to show that the dynamical system for circular pursuit and evasion, described by equation (52), has a globally asymptotically stable equilibrium point. Second, it is crucial to demonstrate that the solution trajectory of the dynamical system for elliptical pursuit and evasion, given by equation (59), converges to a closed curve. Additionally, solving the differential equation governing the angular difference between the two players, as described by equation (64), is an important problem that remains to be addressed.
11 Acknowledgement
This paper was completed under the guidance of professor Toru Ohira of the Graduate School of Mathematics, Nagoya University. This work was financially supported by JST SPRING, Grant Number JPMJSP2125. The author S.Y. would like to take this opportunity to thank the “THERS Make New Standards Program for the Next Generation Researchers.”
References
- [1] Nahin P J 2007 Chases and Escapes: The Mathematics of Pursuit and Evasion (Princeton : Princeton University Press)
- [2] Kamimura A and Ohira T 2019 Group Chase and Escape: Fusion of Pursuit-Escapes and Collective Motion (Singapore: Springer)
- [3] Yoshihara S and Ohira T 2022 Journal of Physics: Conference Series 012014
- [4] Barton J C and Eliezer C J 2000 Journal of the Australian Mathematical Society Series B 358