Comments on: Pathfinder (AI) http://www.rubenswieringa.com/blog/pathfinder-ai Ruben Swieringa on Actionscript and a whole lot of other stuff.. Wed, 14 Jul 2010 10:22:27 +0200 http://wordpress.org/?v=2.8.2 hourly 1 By: Lezyrk http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-84473 Lezyrk Mon, 04 May 2009 02:00:06 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-84473 hi..i like your work. actually im graduating this year so i think this is going to be good as my topic for my thesis. i hope i could get a copy of your source. thanks! =) hi..i like your work. actually im graduating this year so i think this is going to be good as my topic for my thesis. i hope i could get a copy of your source. thanks! =)

]]> By: balhau http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-83500 balhau Wed, 15 Apr 2009 21:12:56 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-83500 Sorry, when I say automaton mechanism I'm referring to an heuristic perspective.. By the way sorry for my bad english but I'm a Portuguese guy ;) Sorry, when I say automaton mechanism I’m referring to an heuristic perspective..

By the way sorry for my bad english but I’m a Portuguese guy ;)

]]> By: balhau http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-83499 balhau Wed, 15 Apr 2009 21:11:14 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-83499 On a very large scale the complexity is also very high and the brute force is always a bad idea for problems of this nature. The idea of an automaton mechanism like this is a very way (and the best in my opinion) to solve the problem. If you search in the literature for the Travelling salesman problem (http://en.wikipedia.org/wiki/Travelling_salesman_problem) you'll see that this is a particular case of this classical problem. You'll find also that bruteforce is inadequate in the real world... Nice work Ruben. ;) On a very large scale the complexity is also very high and the brute force is always a bad idea for problems of this nature. The idea of an automaton mechanism like this is a very way (and the best in my opinion) to solve the problem. If you search in the literature for the Travelling salesman problem (http://en.wikipedia.org/wiki/Travelling_salesman_problem) you’ll see that this is a particular case of this classical problem. You’ll find also that bruteforce is inadequate in the real world…
Nice work Ruben. ;)

]]> By: Larsey http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-78648 Larsey Mon, 19 Jan 2009 11:48:38 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-78648 Hi! Really want to do some AI stuff myself and I'm pretty newbie. Your algorithm as you explained is pretty straight forward, random. In what ways could this algorithm be improved? On a very large scale would it not be better trying to find the "exit" bruteforce and then calculate the shortest path? Hi!

Really want to do some AI stuff myself and I’m pretty newbie.

Your algorithm as you explained is pretty straight forward, random. In what ways could this algorithm be improved?

On a very large scale would it not be better trying to find the “exit” bruteforce and then calculate the shortest path?

]]> By: Ashwinkumar http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-73175 Ashwinkumar Mon, 01 Dec 2008 05:34:59 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-73175 HI I have an Confusion that if the dist of an object(TARGET).is same in any sense from the start possition then please tell me how he can choose its path when he has more that minimal path in its sequense. Thanking you Ashwinkumar HI

I have an Confusion that if the dist of an object(TARGET).is same in any sense from the start possition then please tell me how he can choose its path
when he has more that minimal path in its sequense.

Thanking you
Ashwinkumar

]]> By: kim bo kastekniv http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-42206 kim bo kastekniv Sat, 19 Jul 2008 18:43:18 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-42206 i agree with bechte to some degree.. a* forgets about paths that didn't work in the past - but they could work later - so starting over again from scratch when reaching a deadend maybe isn't such a bad idea under some circumstances.. i agree with bechte to some degree.. a* forgets about paths that didn’t work in the past – but they could work later – so starting over again from scratch when reaching a deadend maybe isn’t such a bad idea under some circumstances..

]]> By: bechte http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-30659 bechte Sat, 24 May 2008 06:39:25 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-30659 Hi there, I think backtracking is potencial a possible first idea, but in the end you will end up in bad performance with high memory allocation for your stack, just if the map you are trying to find your way out becomes bigger as 5x5. Have you been looking for other path finder implementations, such as the A* Pathfinder algorithm. I think this is what you really need. :-) Cheerio bechte Hi there,
I think backtracking is potencial a possible first idea, but in the end you will end up in bad performance with high memory allocation for your stack, just if the map you are trying to find your way out becomes bigger as 5×5.
Have you been looking for other path finder implementations, such as the A* Pathfinder algorithm. I think this is what you really need. :-)
Cheerio bechte

]]> By: Martin http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-26048 Martin Sat, 26 Apr 2008 16:29:16 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-26048 An A* algorithm would be much more practical. If you have no information (heuristic) about where the target might be, use dijkstra shortest path (essentially the same as A* with a constant heuristic). An A* algorithm would be much more practical. If you have no information (heuristic) about where the target might be, use dijkstra shortest path (essentially the same as A* with a constant heuristic).

]]> By: sean http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-24469 sean Mon, 14 Apr 2008 21:53:14 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-24469 This is Dijkstraaaaaaa!!!!! ( and not using backtracking only worsens the performance ) This is Dijkstraaaaaaa!!!!! ( and not using backtracking only worsens the performance )

]]> By: Ruben http://www.rubenswieringa.com/blog/pathfinder-ai/comment-page-1#comment-24294 Ruben Sun, 13 Apr 2008 09:05:42 +0000 http://www.rubenswieringa.com/blog/pathfinder-ai#comment-24294 Hey jack, thanks! I had a look, very interesting :) Hey jack, thanks! I had a look, very interesting :)

]]>