Appeal No. 96-2418
Application 08/137,267
exists. In column 18, lines 15-51, Honey discloses that Figure 8
is a flow chart illustrating the overall vehicle navigational
algorithm. In block 8C, a multi-parameter evaluation is
performed by computer 12 to determine if a segment S in the
navigation neighborhood contains a point which is more likely
than the current dead reckoned position DRP . In column 20,
c
lines 23-60, Honey discloses that Figure 14 shows the flow chart
of the subroutine for determining the most probable line segment
S. First, the X,Y coordinate data of a line segment S are
fetched by computer 12 from the navigation neighborhood of the
map. Then, the computer 12 determines if this line segment S is
parallel to the heading H of the vehicle within a threshold. If
the segment S is parallel, then the computer 12 determines if
this line segment S intersects the contour of equal probability,
CEP. However, Honey does not teach setting second position
candidacies forward and backward of the present position
candidacy on the road in which the vehicle is currently
travelling.
In addition, Appellant argues on page 2 of the reply brief
that the mere assertion by the Examiner that use of contours of
equal probability would have provided the motivation for those
6
Page: Previous 1 2 3 4 5 6 7 8 Next
Last modified: November 3, 2007