[Routing] Making

[Robert (Jamie) Munro]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Guy Martin wrote:
| Hi all,
|
| I am working on making a routing application on mobile phone project.
|
| The mobile application uses openstreetmap as vector map data.
|
| I need your opinions to select one of the two approach:
|
| 1. online routing:
| the mobile application will depend on openstreetmap server to calculate
| the route.
| It will send start node and end node to openstreetmap server.
| openstreetmap server will calculate the route and send back the route to
| the mobile application

Someone did have a server side script that returned a machine readable
route from a start and end point. I can't remember much else about it,
though.

| 2. offline routing:
| the mobile application need to store routing nodes information offline
| and caculate the route by itself.
|
| For approach 1:
| May I know, is there any routing protocol API exist in openstreetmap
| server that my application can make use of it? Or I have to develop that
| API from scratch?
|
| For approach 2:
| I did search on the internet and found 3 offline vector map applications
| for mobile phone:
| 1. http://gpsmid.sourceforge.net --> this application is open source and
| has simple routing engine.
| 2. http://www.celumap.com.ar --> this application does not have routing
| engine. it is just a map render application. The author of this
| application is willing to providde source code for further development.
| 3. http://www.digitalmobilemap.com --> this application has autorouting
| engine. I tried the london map on my phone and it surprise me with the
| animated routing. However this application is not open source.

See also http://wiki.openstreetmap.org/index.php/WhereAmI
and http://wiki.openstreetmap.org/index.php/PyS60Editor



I think the ideal approach is a hybrid - WhereAmI, for example, only
downloads data to the phone as it is needed. If I search for somewhere,
it should search the data it has already cached, and then route to it if
it can. If it can't find it, it should offer me the chance to go
on-line, then it can use the namefinder service to find the place, and
download a small area around it. As it will then have 2 islands of data,
it will have to route by asking an on-line routing service, and then it
could download data surrounding the areas that it passes through. If it
can route somewhere using A* and never reach the edge of the known map,
it should do that. If it reaches the edge of the map, it could offer to
go online and see if a better route exists.

Robert (Jamie) Munro
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (Darwin)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iD8DBQFH2VGXz+aYVHdncI0RAsXSAJwIr5xGNH+8OUz4B1XF7opvNHtFfQCfT8pE
pxuyPpDE1B9Rkpje4LBIdGQ=
=rGJ8
-----END PGP SIGNATURE-----