[OSM-dev] Gsoc 2010 project idea

[amit singh]

Re: I attached a sample java project to my previos mail .since it exceeded
the size limit its waiting for moderator's approval . In the mean time I'm
posting again without the attachment

Sir,

The IDEA :
How many times have we called our friends, relatives or colleagues,etc to
know their whereabouts while waiting for them to arrive at the decided
meeting point. This is after we took big pain in deciding the meeting place.
The solution to this problem is what I would like to take up as project.

The PROPOSAL :
I would also like to propose a routing project which would allow user to
find a suitable path and if used with a gps device it will take user's
desination as input to show the path(updated as he moves). Also the time of
journey(estimated using various factors) will be updated taking his current
speed of movement into account. The ( intelligent ) application will ,in
addition, also have a group connect feature which will allow various users
to find a suitable meeting point ( mall, park, restaurant, etc depending on
user choice) and will suggest the group members detailed plans of travel
depending on time of meeting. It will show the real-time location and
estimated arrival time ( speed of the user will be taken into account ) once
the user embarks on the journey[privacy feature can be added if required].
Every user will be alerted at the appropriate time they should depart , also
other will be notified once he has arrived the meeting point.

The application can be developed as both standalone desktop app or
web-browser based. I wish to use java for it as I have already worked on one
very basic map application which has basic feature of geocoding and
reverse-geocoding along with weather info search and wikipedia search, user
can store temp record of a place for future references and also store
his favorite place.

The IMPLEMENTATION :
The routing algorithm will be developed so as to take very less resources ,
requiring only as much data (nodes) as necessary ,ie before path finding I
would use a node selection algo to reduce time to compute the path. Once the
path has been calculated we don't find it again(only repaint it by changing
the starting point ) until user deviates from it. Every update in the user's
position can be sent to the server using Xml ,which produces an update in
the groups database which in turn issues an update to  other group members
using the application concurrently.

-Amit Singh
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/dev/attachments/20100405/04e6b259/attachment.html>