| Pages: [1] :: one page |
|
|
| Author |
Thread Statistics | Show CCP posts - 0 post(s) |
Thero 'Deidorian
   |
Posted - 2006.03.12 14:50:00 -
[1]
Hi, i have written an Eve navigation tool, that calculates gate-to-gate routes and jump drive routes from a list of waypoints. I managed to implement a real travelling-salesman solver with linear runtime. So round trips are now possible to calculate. The jump drive routing routine does not only optimize routes for the number of jumps but also it optimizes the routes for fuel need.
To share calculated routes with my corp mates i can insert a calculated route into the clip board and then paste it into the corp channel. But its still quite uncomfortable for my mates to search every sytem in p&p and add it as a waypoint to their autopilot.
Now i would like to generate strings that contain a "Showinfo"-link for each waypoint system when pasted into the corp channel. As normal IGB-showinfo-links do not work in chat channels i just wanted to ask you, dear devs, how to format a link-string for chat channels if that isnt against any rules.
Thank you in advance!
Thero 'Deidorian
|
Ranack
|
Posted - 2006.03.12 18:40:00 -
[2]
I can't answer your question, but I have something I'd like to ask you. I'm trying to figure out how to make an autopilot, but using the A* algorithm I have to have some criteria that marks a node as being "better" or "worse" based on a hueristic. Did you figure something out? Or are you just doing a breadth-first search of the entire tree?
About the only thing I can think of is comparing a solar system's x,y,z coordinates to the target and using that as my F value for entering a node.
|
Sebastato
|
Posted - 2006.03.12 19:49:00 -
[3]
Thero is my alt, i accidentally posted with him.
Im using a Dijsktra algorithm. For gate-to-gate travelling it is easy. Each system only has maximum 10 neighboring systems or so and the costs for each jump are constant. So you could easily do a BFS based search. With jump routes its a bit trickier. I use the same Dijkstra algorithm. They key here is to filter out as many systems as possible before finding the next system with minimum costs: for example systems that are out of jump range or have a security rating higher than 0.4. The function that calculates the costs is very important for getting an optimal route. I used to use something like 1000+distance(s,v) in light years. Thats it. A good heuristic for A* might be to calculate the remaining distance from the node you currently are in to the destination node. Feel free to test my algorithms: Eve Navigation Router
|
Ranack
|
Posted - 2006.03.12 22:51:00 -
[4]
Hmm, that's a good point. I had assumed that breadth-first like Dijkstra's Algorithm would be too slow. I guess I should just give it a try on my own. Thank you!
|
|
|
| |
|
| Pages: [1] :: one page |
| First page | Previous page | Next page | Last page |