network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 4 months |
| seen | Apr 1 at 6:27 | |
| stats | profile views | 1 |
|
Mar 12 |
awarded | Tumbleweed |
|
Mar 5 |
asked | map script can not be showed into php |
|
Jan 21 |
comment |
How to calculate heuristic shooting star algorithm? Probably, it was historical reason. heuristic function and for some reason (I don't remember now) decided that for a common road network this In Shooting* we are using Euclidian distance. pgrouting.postlbs.org/browser/trunk/core/src/… . The other formula: - Euclidean distance > Sqrt(Dx²+Dy²+Dz²) ; - Manhattan distance > |Dx|+|Dy|+|Dz| ; - Maximum distance > Max(|Dx|, |Dy|, |Dz|). I still don’t understand about all.Friend, Can you tell me briefly and detail of The process algorithm shooting star? |
|
Jan 21 |
comment |
How to calculate heuristic shooting star algorithm? And I get this one agaian from Anton Patrushev: download.osgeo.org/pgrouting/forum/pgrouting.postlbs.org/…. You write like this: In A* we are using something similar to Manhattan function (|Dx|+|Dy|)/2 pgrouting.postlbs.org/browser/trunk/core/src/… There you'll see other attempts commented out. We tried different function is OK. |
|
Jan 21 |
comment |
How to calculate heuristic shooting star algorithm? And then you can assign an edge-to-edge passage cost (as a special attribute of your adjacent edges structure or as a cost of the line graph) which actually represents any kind of limitations or penalties for going from one edge to another - such as turn restrictions in a case of turns or any other kind of restrictions like traffic lights. Having this you can use A* or any other shortest path algorithm using edges as vertices. So, that's an idea behind the Shooting*. |
|
Jan 21 |
comment |
How to calculate heuristic shooting star algorithm? I get this one from mailing list. Shooting* is edge-based, so it goes from edge to edge while A* and Dijkstra go vrom vertex to vertex. Thus you need a data structure which keeps all adjacent edges for every edge of your graph. It can be also done by making a line graph (en.wikipedia.org/wiki/Line_graph) out your original road network |
|
Jan 21 |
answered | How to calculate heuristic shooting star algorithm? |
|
Jan 19 |
comment |
How to calculate heuristic shooting star algorithm? Can you tell me about shooting star algorithm, not just source code , Mr Mario? |
|
Jan 19 |
comment |
How to calculate heuristic shooting star algorithm? Can you tell me about shooting star algorithm, Mr Mario? |
|
Jan 19 |
awarded | Supporter |
|
Jan 18 |
comment |
How to calculate heuristic shooting star algorithm? Thanks Mr.Mario Miler,your source code is same with pgrouting or library in Postgresql, Postgis.Right? |
|
Jan 18 |
awarded | Student |
|
Jan 18 |
asked | How to calculate heuristic shooting star algorithm? |
