Difference between revisions of "Mean Targeting"
Jump to navigation
Jump to search
m (no dash in pseudocode, caps stuff) |
|||
(One intermediate revision by one other user not shown) | |||
Line 17: | Line 17: | ||
* Use these values as input to a [[circular targeting]] algorithm. | * Use these values as input to a [[circular targeting]] algorithm. | ||
+ | {{Targeting Navbox}} | ||
[[Category:Simple Targeting Strategies]] | [[Category:Simple Targeting Strategies]] | ||
− |
Latest revision as of 18:18, 1 April 2011
A style of targeting that averages the data from a few recent scans to use as input to its prediction algorithm.
Linear Mean
Given the enemy's current position and their position t
ticks in the past, assume the enemy will continue to move with the same direction and average speed deduced from these scans. The pseudocode would look like this:
- Take a present scan position and an older scan position,
t
ticks in the past. Ignore actual heading and velocity. - Find the angle from from the old scan to the new one. This is the mean heading.
- Find the distance between the two points and divide by
t
. This is the mean velocity. - Use these values as input to a linear targeting algorithm.
Circular Mean
Given a collection of x
recent scans of the enemy, calculate his average velocity and turn rate and assume that he will continue to move with those values. The pseudocode would look like this:
- Iterate over the group of scans, summing the
x - 1
heading changes andx
velocities. - Divide the sum of heading changes by
x - 1
to find the mean heading change. - Divide the sum of velocities by
x
to find the mean velocity. - Use these values as input to a circular targeting algorithm.
|