Hi Sourav Dutta,<div><br></div><div>Your GSoC idea might eventually fit to the pgRouting project (<a href="http://www.pgrouting.org/">http://www.pgrouting.org/</a>), which also participates in GSoC as part of OSGeo as a mentoring organization: <a href="http://wiki.osgeo.org/wiki/OpenRouter_2012_SOC_Ideas">http://wiki.osgeo.org/wiki/OpenRouter_2012_SOC_Ideas</a></div>
<div><br></div><div>pgRouting had one GSoC project last year implementing time-dependent shortest path algorithm. An algorithm that takes into account the network condition at the time it reaches a link in the network. The library is not only about routing but open to any kind of network analysis, like flow algorithms would be something I'd like to see.</div>
<div><br></div><div>As Graham said, your proposal has only a small OSM part. But of course you can make use of OSM data for a reference implementation.</div><div>More general information about OSGeo and GSoC you can find here: <a href="http://wiki.osgeo.org/wiki/Google_Summer_of_Code_2012">http://wiki.osgeo.org/wiki/Google_Summer_of_Code_2012</a></div>
<div><br></div><div>Daniel</div><div> <br><br><div class="gmail_quote">On Wed, Apr 4, 2012 at 6:25 AM, Andres Oswaldo Calderon Romero <span dir="ltr"><<a href="mailto:andress.calderon@gmail.com">andress.calderon@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="gmail_quote">There is some work around it in SUMO (Simulation for Urban MObilitiy) [1]. It already allows the use of OSM networks [2]. ..<div>
<br><div>[1] <a href="http://sumo.sourceforge.net/" target="_blank">http://sumo.sourceforge.net/</a><br>
[2] <a href="http://sourceforge.net/apps/mediawiki/sumo/index.php?title=NETCONVERT#Supported_Formats" target="_blank">http://sourceforge.net/apps/mediawiki/sumo/index.php?title=NETCONVERT#Supported_Formats</a><div><div><div class="h5">
<div><div>
<br><div class="gmail_quote">On Tue, Apr 3, 2012 at 3:54 PM, Floris Looijesteijn <span dir="ltr"><<a href="mailto:osm@floris.nu" target="_blank">osm@floris.nu</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Hey,<br>
<br>
I also really like this idea. If you could spice up the OSM part in it<br>
I think you<br>
should definitely submit it!<br>
<br>
Maybe you could do something with the history in OSM. What happens if a new<br>
motorway is opened? Or you could work with the proposed=* ways...<br>
<br>
Greetings,<br>
Floris Looijesteijn<br>
<div><div><br>
On Tue, Apr 3, 2012 at 5:36 PM, Graham Jones <<a href="mailto:grahamjones139@gmail.com" target="_blank">grahamjones139@gmail.com</a>> wrote:<br>
> Hi,<br>
> This sounds like a really interesting idea - it is something I have always<br>
> had the idea of doing, but have never got around to it - I would like to<br>
> re-create the effect of someone touching their brakes on a busy road,<br>
> leading to someone doing an emergency stop 2km further back.<br>
><br>
> The OpenStreetMap part of the proposal is however quite minor - it is only<br>
> really providing you with the network - the 'interesting' part of the<br>
> proposal is the simulation.<br>
> Therefore by all means submit the idea to OSM and we will consider it along<br>
> side the other proposals, but it might be worth seeing if there is a<br>
> numerical simulation project that has been accepted to GSoC that you could<br>
> apply to as well, in case it is not accepted as part of OSM?<br>
><br>
> Regards<br>
><br>
> Graham.<br>
><br>
> On 3 April 2012 11:38, sourav dutta <<a href="mailto:mailsouravdutta@gmail.com" target="_blank">mailsouravdutta@gmail.com</a>> wrote:<br>
>><br>
>><br>
>> Hi,<br>
>> Sorry for mailing in so late, i came to know about Gsoc few days ago.<br>
>> I am Undergraduate doing my Btech-Hons for IIIT - Hyderabad. I have worked<br>
>> in OCR, Vision,(Sfm) ,Image Processing,Information retrieval.<br>
>><br>
>> OSM data have been used for path finding...with A star algo etc.but it is<br>
>> never used for simulation of traffic.<br>
>><br>
>> Traffic monitoring and simulation has been worked on for some time now.<br>
>> There are very elaborate systems like MITSIM which gather data from<br>
>> various sources and design a traffic model. But the problem is it is<br>
>> very difficult to implement them. The information about the streets, traffic<br>
>> data, satellite data etc. is difficult to gather.<br>
>> My idea is to design a traffic simulation using OSM data. as the OSM<br>
>> data is readily available and is available in many formats. To model the<br>
>> traffic probabilistic or network flow models are popular. But to get a<br>
>> more accurate simulation want to use multiple vehicles as bots interacting<br>
>> with<br>
>> each other.<br>
>> A basic overview of my idea ...<br>
>><br>
>> 1) first we need the area where want the simulation to run. This would be<br>
>> done by defining a rectangular region in the map. This data can be stored<br>
>> in posgreSQL which will make it easier to use the data.<br>
>> 2) Next we define for all the bots - source and destination and this find<br>
>> the appropriate path(A star) to go.<br>
>> 3) At the heart of the simulation we need to have a engine which would<br>
>> handle the collision etc. and directs the bots etc. I have tried a few<br>
>> physics<br>
>> engine but their performance degrades steeply decreases with the<br>
>> increase of number of objects.<br>
>> 4) So I want to use my own engine with only few rules for collision etc.<br>
>> The brute for implementation would require to check each bot with other bot<br>
>> ( the same thing which makes other engines slow O(n^2) ). But i plan to<br>
>> use a implementation of KD-tree, ANN(Approximate nearest neighbour) Open<br>
>> source implementation of the same exists and works pretty well. This<br>
>> would allow the matching to be done in O(nlogn).<br>
>> ANN implementation (<a href="http://www.cs.umd.edu/~mount/ANN/" target="_blank">http://www.cs.umd.edu/~mount/ANN/</a>)<br>
>> 5) To manage the interaction of the bots the memory requirements<br>
>> skyrockets as the number of bots increases. ie why i wish to treat them as<br>
>> Multi-Agent-System<br>
>> There are nice implementations of "distributed multi-agent framework"<br>
>> which use shared memory to manage the agents( bots in our case).<br>
>> 6) congestions , bottlenecks and collisions can thus be detected. In the<br>
>> streets.<br>
>> 7) Future Works - Once this frameworks is complete data from other sources<br>
>> like the traffic lights flyovers etc.. can be incorporated in the existing<br>
>> system.<br>
>><br>
>> --<br>
>> Sourav Dutta<br>
>> CSE,UG3<br>
>> IIIT H<br>
>><br>
>><br>
>> _______________________________________________<br>
>> talk mailing list<br>
>> <a href="mailto:talk@openstreetmap.org" target="_blank">talk@openstreetmap.org</a><br>
>> <a href="http://lists.openstreetmap.org/listinfo/talk" target="_blank">http://lists.openstreetmap.org/listinfo/talk</a><br>
>><br>
><br>
><br>
><br>
> --<br>
> Graham Jones<br>
> Hartlepool, UK.<br>
><br>
><br>
> _______________________________________________<br>
> talk mailing list<br>
> <a href="mailto:talk@openstreetmap.org" target="_blank">talk@openstreetmap.org</a><br>
> <a href="http://lists.openstreetmap.org/listinfo/talk" target="_blank">http://lists.openstreetmap.org/listinfo/talk</a><br>
><br>
<br>
_______________________________________________<br>
talk mailing list<br>
<a href="mailto:talk@openstreetmap.org" target="_blank">talk@openstreetmap.org</a><br>
<a href="http://lists.openstreetmap.org/listinfo/talk" target="_blank">http://lists.openstreetmap.org/listinfo/talk</a><br>
</div></div></blockquote></div><br><br clear="all"><div><br></div></div></div></div></div><span class="HOEnZb"><font color="#888888"><span><font color="#888888">-- <br>ANDRES O. CALDERON R.<br>MSc. Geoinformation Science & Earth Observation<br>
University of Twente, The Netherlands.<br>
<br>"Open Source Rocks - Open Source Rules"<br>
GNU/Linux User No. 433418<br>
</font></span></font></span></div></div></div><span class="HOEnZb"><font color="#888888">
</font></span></div><span class="HOEnZb"><font color="#888888"><br><br clear="all"><div><br></div>-- <br>ANDRES O. CALDERON R.<br>MSc. Geoinformation Science & Earth Observation<br>University of Twente, The Netherlands.<br>
<br>"Open Source Rocks - Open Source Rules"<br>
GNU/Linux User No. 433418<br>
</font></span><br>_______________________________________________<br>
talk mailing list<br>
<a href="mailto:talk@openstreetmap.org">talk@openstreetmap.org</a><br>
<a href="http://lists.openstreetmap.org/listinfo/talk" target="_blank">http://lists.openstreetmap.org/listinfo/talk</a><br>
<br></blockquote></div><br><br clear="all"><div><br></div>-- <br><span style="font-family:arial,sans-serif;font-size:13px;border-collapse:collapse">Georepublic UG & Georepublic Japan<br>eMail: <a href="mailto:daniel.kastl@georepublic.de" style="color:rgb(66,99,171)" target="_blank">daniel.kastl@georepublic.de</a><br>
Web: <a href="http://georepublic.de/" style="color:rgb(66,99,171)" target="_blank">http://georepublic.de</a></span><br>
</div>