<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
jump	B-Algorithm
point	I-Algorithm
search	I-Algorithm
(	O
JPS	O
)	O
is	O
an	O
optimization	O
to	O
the	O
A*	B-Protocol
search	I-Protocol
algorithm	I-Protocol
for	O
uniform-cost	O
grids	O
.	O
</s>
<s>
Jump	B-Algorithm
point	I-Algorithm
search	I-Algorithm
preserves	O
A*'s	O
optimality	O
,	O
while	O
potentially	O
reducing	O
its	O
running	O
time	O
by	O
an	O
order	O
of	O
magnitude	O
.	O
</s>
<s>
Although	O
jump	B-Algorithm
point	I-Algorithm
search	I-Algorithm
is	O
limited	O
to	O
uniform	O
cost	O
grids	O
and	O
homogeneously	O
sized	O
agents	O
,	O
the	O
authors	O
are	O
placing	O
future	O
research	O
into	O
applying	O
JPS	O
with	O
existing	O
grid-based	O
speed-up	O
techniques	O
such	O
as	O
hierarchical	O
grids	O
.	O
</s>
