From: "Mark Meijer" <meijer78@hotmail.com>
Reply-To: Lua list <lua@bazar2.conectiva.com.br>
To: lua@bazar2.conectiva.com.br
Subject: Re: Implementing the Dijkstra Algorithm
Date: Wed, 23 Nov 2005 11:03:13 +0000
On a side note, as also suggested on that wikipedia page, and depending on
what exactly you are using the algorithm for, you might want to consider
using the A* algorithm instead. Or perhaps another variant dubbed the D*
algorithm, where the shortest path found can be dynamically updated
"en-route" in real-time (i.e. while actually travelling) as circumstances
might change over time. I found a research paper about this once, I could
email it to you if you like, just let me know. The algorithm was designed
to be implemented on robots for navigation, and I'm sure it could be useful
for other applications as well, such as games and simulations.
