If you find this article contains errors or problems rendering it unreadable (missing images or files, mangled code, improper text formatting, etc) please contact the editor so corrections can be made. Thank you for helping us improve this resource |
Copyright © 2000 Nicholas Van Caldwell
A common problem when writing networked virtual environments is overcoming the lag inherent to the Internet; players seem to jerk about the field of play as new data packets are incorporated. Common solutions include increasing the frequency of packets sent, reducing packet size through compression, and most importantly, dead reckoning. This article will attempt to explain a technique for eliminating the "jerk" of lag by employing the power of cubic splines in a dead-reckoning algorithm.
What is Dead Reckoning?
Before jumping straight into cubic splines, a brief description of dead reckoning is required. Programmers use this technique to reduce the effects of lag in a game by trying to guess that an object takes. Dead reckoning makes its guess based on the object's characteristics. For example, if an object has a known starting position and velocity then its path can be created using simple physics. The paths created can be applied to the object, creating the illusion of smooth motion. Cubic splines are a kind of dead reckoning that creates a smooth transition between two data points.
Possible Forms of Dead Reckoning
What the programmer wants to do is take a current position for an object and form a smooth path to where the object is supposed to be. Several techniques are available.
The most basic form of dead reckoning is the "point-to-point" method. As its name implies, this method involves only moving a player to a new point when a data-packet arrives. Given an average Internet lag of 200-300 ms this creates a noticeably "jerky" player. This method is by far the worst because unless a remote player is absolutely still, his onscreen representation is completely erroneous. The reason for the error is that data packets in a fast quake-style game arrive only 5-10 times per second, while even a slow game updates at 30 frames per second. The only way to make players move smoothly is to send one packet for every game frame. This is a terrible strain on bandwidth, thus the point-to-point updating method is nearly impossible to effectively implement in a real-time game.
The next level of precision is the "linear" method. This method involves creating a straight-line path to the next position. In terms of physics, this means that the velocity of an object is used to decide where it should next appear. This method reduces jitters caused by lag but has a tragic flaw: it assumes people will only move with a constant velocity. Thus, the generated and actual paths vary noticeably (although the game will be much improved over the "point-to-point" method). When playing a game that uses this method, players will seem to move in straight lines. Further, whenever a player starts a new linear path his velocity could change abruptly. The end result is a thoroughly unrealistic game.
NewPosition = OldPosition + Velocity*Time
NewPosition = OldPosition + Velocity*Time + Acceleration*(time)^{2}
Using Cubic Splines
Using cubic splines to create a path is a matter of simple algebraic equations. The input for these equations are four (x,y) coordinates. The first coordinate represents the object's starting position. Similarly, the fourth coordinate signifies the object's ending position. Usually the end position is a new (x,y) coordinate that has just arrived in a data packet. The most important coordinates are the second and third; they represent the object's velocity. For the second coordinate, calculate where the object will appear after 1 second with its current velocity. For the third coordinate, reverse the object's end velocity, and calculate where it would appear after 1 second. This is the same as traveling back in time for 1 second (assuming constant velocity). In summary:
- Coordinate 1 = Starting position
Coordinate 2 = Position after 1 second using starting velocity
= Coordinate1 + StartVelocity
Coordinate 3 = Position after 1 second using reversed ending velocity
= Coordinate4 – EndVelocity
Coordinate 4 = Ending position - Here are the parametric equations used to form the spline.
x = At^{3} + Bt^{2} + Ct + D
y = Et^{3} + Ft^{3} + Gt + H
t is the time variable. It ranges from 0 at the initial point to 1 at the end point. - Formulating the rest of the variables.
A = x_{3} – 3x_{2} +3x_{1} – x_{0}
B = 3x_{2} – 6x_{1} + 3x_{0}
C = 3x_{1} – 3x_{0}
D = x_{0}
E = y_{3} – 3y_{2} +3y_{1} – y_{0}
F = 3y_{2} – 6y_{1} + 3y_{0}
G = 3y_{1} – 3y_{0}
H = y_{0} - Once the equation is created, the next step is deciding how to implement it in the game. The following method is simple and effective.
- Allow an object to move according physical laws (account for velocity and acceleration).
- When a data packet arrives begin creating a spline to the next position.
- Coordinates 1 and 2 of the spline can be found using the current position and velocity.
Coord2 = x_{old} + v_{old} - Coordinates 3 and 4 are more difficult to get. Decide on the number of steps the object will take on the spline before it reaches the final position. Let this number be time T. For coordinate 4, use the new data packet to calculate the final position after t seconds. The same information can be used to calculate the velocity at the new time.
Coord3 = x_{packet} + v_{packet}*t + .5*a_{packet}*t^{2}
Coord4 = Coord3 – (V_{packet} + a_{packet}*t)
This method combines two forms of dead reckoning: a cubic spline, and quadratic motion. The result is more realistic. - Make the object travel along the spline for T frames.
- At the end of the spline resume at step 1.
Conclusion
This article has covered some of the basics of cubic splines and provided psuedocode for use in any game using 2d Newtonian physics. The provided equations can also be easily extended into use for three-dimensional games. While creating cubic splines is easy, actually implementing them introduces several problems that must be left to the reader to explore on his own.
Happy Coding,
Nick Caldwell
Massachusetts Institute of Technology
Class of '03