Artificial Intelligence Depot
Visiting guest. Why not sign in?
News, knowledge and discussion for the AI enthusiast.
FEATURES COMMUNITY KNOWLEDGE SEARCH  
The Age of Spiritual Machines
This is a book for computer enthusiasts, science fiction writers in search of cutting-edge themes, and anyone who wonders where human technology is going next.
More information at Amazon US UK
Path-Planning from Start to Finish
All You Ever Wanted To Know
 
Path-Planning from Start to Finish (Step 1)

The issue of a multi-part tutorial covering all the aspects of path planning. This issue looks at the global picture, explaining the abstract concepts behind route generation. A formal definition, as well as a mathematical model of the problem is explained.

http://ai-depot.com/BotNavigation/Path.html

Sorry about the delay in new features everyone, these are busy times for me ;) Things should pick up over the next few days!

932 posts.
Friday 22 March, 21:08
Reply
Step 2

The second part has been posted. This issue looks into single source algorithms more closely. A prototype definition is given, and the Dijkstra approach is detailed thereafter.

932 posts.
Saturday 23 March, 22:59
Reply
Dijkstra's Algorithm

Hello,

I added a pseudo code for Dijkstra's Algorithm to wikipedia. It's from Rivest's algorithm book. You may find it readable and elegant (at least I do). Perhaps even useful for your article.

http://www.wikipedia.com/wiki/Dijkstras_Algorithm

Heikki Orsila
heikki.orsila@tut.fi
http://www.ee.tut.fi/~heikki

3 posts.
Monday 25 March, 15:30
Reply
finding shortest path

Hi!

i can't understand the implementation of Dijistar's algorithm.
i want to find a shortest path from one source to one destination.
i have 50 nodes.
can any one help me in implementation in VC++.
or refer me any site from where i can take some help.
i am very thankful.

1 posts.
Wednesday 30 October, 12:53
Reply
Step 3

The third part of the series has been posted, discussing negative arc-lengths and algorithms that use the label-correcting approach.

932 posts.
Saturday 13 April, 17:36
Reply
Step 4

The 4th article in the series has just been posted, discussing all-pairs shortest path algorithms, naive implementations, and dynamic programming approaches. Improvements and optimisations are briefly analysed.

932 posts.
Wednesday 17 April, 11:07
Reply
Step 5

This issue discusses single-pair shortest paths, and how different kinds of search algorithms solve them. A* (star) is then explained as a heuristic approach; pseudo-code is provided and optimisation are overlooked.

932 posts.
Friday 26 April, 10:08
Reply