I wrote a path-finding algorithm with obstacles , if you want to check it out here it is http://perlhobby.googlecode.com/svn/trunk/robot_nav/article.pdf (however it has some corner cases that are not covered). It was mostly an experiment and I would not recommend you use it.
Then I read from the wikipedia page of "Voronoi diagrams" that they can be used for this: "In autonomous robot navigation, Voronoi diagrams are used to find clear routes. If the points are obstacles, then the edges of the graph will be the routes furthest from obstacles (and theoretically any collisions)." http://en.wikipedia.org/wiki/Voronoi_diagram HTH Stefan On Sep 14, 11:46 am, TJ <[email protected]> wrote: > An example is: > > A person rides with a bike in a new city. The person wants to avoid > possible crime areas. He needs to bike from A to B. > The application needs to return a route from A to B which AVOIDS all > locations where there was a crime in the last 2 years. > Ofcourse, the algorithm might take into consideration severity of > crime, type of crime, etc. These are aditional optional constraints. > > This is just an example of a routing trying to avoid specific > locations. > > I hope this makes the problem space clearer. > > Regards, > TJ --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google Maps API" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-maps-api?hl=en -~----------~----~----~----~------~----~------~--~---
