Printer Carrier Optimum Move Algorithm
Original Publication Date: 1983-Nov-01
Included in the Prior Art Database: 2005-Feb-07
The carrier move algorithm discussed herein increases system throughput by minimizing the time required to perform a tab or carrier return in a typewriter or printer. Typically, a carrier move is made either at a given low speed or at several speeds depending upon the distance of the move. The move distance determines the move speed since ramp-up distance and stopping distance are dependent upon steady-state speed. Thus, for this type of algorithm the carrier never reaches maximum speed (and thus shortest move time) except for very long moves. The algorithm described achieves the shortest possible move times by always accelerating toward the maximum move speed. The move is optimized in time by always accelerating to the maximum speed possible for the length of move while still decelerating to a stop by the stop point.