<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Turn-by-turn navigation - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=turn-by-turn_navigation&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=turn-by-turn_navigation&amp;p=3">3.Next</a>
</p>
<p>the distance to the next turn.</p>

<p>Mathematically, turn by turn navigation is based on the <a href="page.php?w=shortest_path_problem">shortest path problem</a> within <a href="page.php?w=graph_theory">graph theory</a>, which examines how to identify the path that best meets some criteria (shortest, cheapest, fastest, etc.) between two points in a large network.</p>

<p><big>History</big></p>
<p>Real-time turn-by-turn navigation instructions by computer was first developed at the MIT Media Laboratory by James Raymond Davis and Christopher M. Schmandt</p><p>
<a accesskey="1" href="page.php?w=turn-by-turn_navigation&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=turn-by-turn_navigation&amp;p=3">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
