|
Rules: P1: P1(angle) = P1(angle) + P1(angular increment) P1(x) = P3(x) + P1(radius) * P1(cos(angle)) P1(y) = P3(y) + P1(radius) * P1(sin(angle)) P2: P2(angle) = P2(angle) + P2(angular increment) P2(x) = P3(x) + P2(radius) * P2(cos(angle)) P2(y) = P3(y) + P2(radius) * P2(sin(angle)) P3: P3(angle) = P3(angle) + P3(angular increment) P3(x) = P0(x) + P3(radius) * P3(cos(angle)) P3(y)
= P0(y) + P3(radius) * P3(sin(angle)) |
P4: d1 = distance(P1, P4)
d2
= distance(P2, P4)
d3
= distance(P3, P4)
if d1
equals the greatest of d1, d2 and d3, then
let
P4 pursue P1
end if
if d2
equals the greatest of d1, d2 and d3, then
let
P4 pursue P2
end if
if d3
equals the greatest of d1, d2 and d3, then
let
P4 pursue P3
end if
Trajectory Recorded:
P4
Table: Case
3-4.1 Parameters Assigned (Figure
3-4.1)
|
Figure 3-4.1 (18,000,000 iterations)
|
Table: Case
3-4.2 Parameters Assigned (Figure
3-4.2)
|
Figure 3-4.2 (18,000,000 iterations)
|
Table: Case
3-4.3 Parameters Assigned (Figure
3-4.3)
|
Figure 3-4.3 (18,000,000 iterations)
|
Table: Case
3-4.4 Parameters Assigned (Figure
3-4.4)
|
Figure 3-4.4 (18,000,000 iterations)
|
Table: Case
3-4.5 Parameters Assigned (Figure
3-4.5)
|
Figure 3-4.5 (18,000,000 iterations)
|
Table: Case
3-4.6 Parameters Assigned (Figure
3-4.6)
|
Figure 3-4.6 (18,000,000 iterations)
|
Table: Case
3-4.7 Parameters Assigned (Figure
3-4.7)
|
Figure 3-4.7 (18,000,000 iterations)
|
d2
= distance(P2, P4)
d3
= distance(P3, P4)
if d1
equals the smallest of d1, d2 and d3, then
let
P4 pursue P1
end if
if d2
equals the
let
P4 pursue P2
end if
if d3
equals the
let
P4 pursue P3
end if
Trajectory Recorded:
P4
Table: Case
3-4.8 Parameters Assigned (Figure
3-4.8)
|
Figure 3-4.8 (18,000,000 iterations)
|
Table: Case
3-4.9 Parameters Assigned (Figure
3-4.9)
|
Figure 3-4.9 (12,000,000 iterations)
|
Table: Case
3-4.10 Parameters Assigned (Figure
3-4.10)
|
Figure 3-4.10 (18,000,000 iterations)
|
Table: Case
3-4.11 Parameters Assigned (Figure
3-4.11)
|
Figure 3-4.11 (18,000,000 iterations)
|
Table: Case
3-4.12 Parameters Assigned (Figure
3-4.12)
|
Figure 3-4.12 (18,000,000 iterations)
|
Table: Case
3-4.13 Parameters Assigned (Figure
3-4.13)
|
Figure 3-4.13 (18,000,000 iterations)
|
|
Rules: P1: P1(angle) = P1(angle) + P1(angular increment) P1(x) = P2(x) + P1(radius) * P1(cos(angle)) P1(y) = P2(y) + P1(radius) * P1(sin(angle)) P2: P2(angle) = P2(angle) + P2(angular increment) P2(x) = P3(x) + P2(radius) * P2(cos(angle)) P2(y) = P3(y) + P2(radius) * P2(sin(angle)) P3: P3(angle) = P3(angle) + P3(angular increment) P3(x) = P0(x) + P3(radius) * P3(cos(angle)) P3(y)
= P0(y) + P3(radius) * P3(sin(angle)) |
P4: d1 = distance(P1, P4)
d2
= distance(P2, P4)
d3
= distance(P3, P4)
if d1
equals the greatest of d1, d2 and d3, then
let
P4 pursue P1
end if
if d2
equals the greatest of d1, d2 and d3, then
let
P4 pursue P2
end if
if d3
equals the greatest of d1, d2 and d3, then
let
P4 pursue P3
end if
Trajectory Recorded:
P4
Table: Case
3-4.14 Parameters Assigned (Figure
3-4.14)
|
Figure 3-4.14 (12,000,000 iterations)
|
Table: Case
3-4.15 Parameters Assigned (Figure
3-4.15)
|
Figure 3-4.15 (12,000,000 iterations)
|
Table: Case
3-4.16 Parameters Assigned (Figure
3-4.16)
|
Figure 3-4.16 (12,000,000 iterations)
|
d2
= distance(P2, P4)
d3
= distance(P3, P4)
if d1
equals the smallest of d1, d2 and d3, then
let
P4 pursue P1
end if
if d2
equals the
let
P4 pursue P2
end if
if d3
equals the
let
P4 pursue P3
end if
Trajectory Recorded:
P4
Table: Case
3-4.17 Parameters Assigned (Figure
3-4.17)
|
Figure 3-4.17 (12,000,000 iterations)
|
Table: Case
3-4.18 Parameters Assigned (Figure
3-4.18)
|
Figure 3-4.18 (12,000,000 iterations)
|
Table: Case
3-4.19 Parameters Assigned (Figure
3-4.19)
|
Figure 3-4.19 (12,000,000 iterations)
|
Table: Case
3-4.20 Parameters Assigned (Figure
3-4.20)
|
Figure 3-4.20 (12,000,000 iterations)
|
Table: Case
3-4.21 Parameters Assigned (Figure
3-4.21)
|
Figure 3-4.21 (12,000,000 iterations)
|
Table: Case
3-4.22 Parameters Assigned (Figure
3-4.22)
|
Figure 3-4.22 (12,000,000 iterations)
|
CONTENTS:
Conclusions |