Hi, The input to path-planning algorithms is often a graph (graph, as in, nodes and edges). For a given map, one needs to first construct the graph; one thumb rule is to establish all discrete reachable points (like a cross-road, or an avenue) as vertices. Essentially, starting from your source, create connections to "all" the points that are reachable. Another heuristic is to eliminate points which are on the same path (line or curve or whatever), and treat only the end points as vertices. Once you have a graph, then based on the optimization criterion (whether it's the total weight of the path, or the number of hops), you decide the appropriate search algorithm (which, as mentioned earlier, includes Dijkstra's algo among others).
There are some randomized algorithms for faster path-planning ...google for them if you wish... Thanks, Mayur On 4/19/07, Lukas alkauskas <[EMAIL PROTECTED]> wrote: > I haven't any problems, just i like to know what kinda algos use to create > path finding in _city map_, how to define map data, like nodes? (x, y), > street have : street start x, start y, and street end x, end y, and homes > near street just nodes from street? > But how then with streets whom is like half circle, circle or irregularly - > shaped shape - i think need more nodes but how to define where i need to > put that node in kinda circle form shape, or very smooth street. > Maybe any one knows, this kinda information, maybe anyone does any similar > project. > > Please give your suggestions. > > > On 4/19/07, chitta koushik <[EMAIL PROTECTED]> wrote: > > > > Hi, > > > > please explain your problem clearly..u have just given the map....there > are many popular alogs...like Travelling salesperson algo,Dijkstra shortest > path,Bellmond ford shortest path,All pairs shortest path depending on the > problem.. > > > > cheers, > > koushiki chitta > > > > > > On 4/18/07, Lukas alkauskas < [EMAIL PROTECTED]> wrote: > > > Hello, > > > What suggestions you have for path finding like this? algos, etc. > > > > > > > > > -- > > > You can contact me by : > > > msn messanger: [EMAIL PROTECTED] > > > yahoo messanger: [EMAIL PROTECTED] > > > ICQ: 443443043 > > > Google Talk: [EMAIL PROTECTED] > > > Skype: halfas.online.now > > > IRC: HalFas` (irc2.omnitel.net) > > > Home page: http://www.revidev.com/halfas/ > > > One's leisure project: > http://rvision.gamedev.lt/RVengine > > > > > > > > > > > > > > > > > > > > -- > > > *************************************************************** > > 30 years from now it doesn't matter which shoe you wore,which branded jean > you wore..what all matters is WHAT YOU HAVE LEARNED AND HOW YOU HAVE USED > IT. > > > > http://students.iiit.ac.in/~koushik_c > > > > > > > > > > -- > You can contact me by : > msn messanger: [EMAIL PROTECTED] > yahoo messanger: [EMAIL PROTECTED] > ICQ: 443443043 > Google Talk: [EMAIL PROTECTED] > Skype: halfas.online.now > IRC: HalFas` (irc2.omnitel.net ) > Home page: http://www.revidev.com/halfas/ > One's leisure project: > http://rvision.gamedev.lt/RVengine > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
