Society of Robots - Robot Forum

Software => Software => Topic started by: pomprocker on September 22, 2008, 04:11:58 PM

Title: $50 Robot A* pathfinding implementation
Post by: pomprocker on September 22, 2008, 04:11:58 PM

I am writing a paper on A* best-first, graph traversal pathfinding algorithm for the class i'm in.

Next I want to come up with a Binary Heap implementation of it for the $50 robot for large grids.

Then I want to write a member tutorial on it.

Any advice?

Title: Re: $50 Robot A* pathfinding implementation
Post by: benji on September 23, 2008, 04:30:56 PM

try to include path smoothing,, as its very used in robots,, somtimes you dont want shortest path ,it may has many turns , robots seek smoothest paths  ;)

Title: Re: $50 Robot A* pathfinding implementation
Post by: pomprocker on September 25, 2008, 12:06:42 PM

Is it possible to implement pathfinding without encoders, using only rangefinders????

Title: Re: $50 Robot A* pathfinding implementation
Post by: benji on September 25, 2008, 03:50:53 PM

if your robot moves the same distance you ordered him to,with small error then yea u can (legged robot)
adding an encoder would defenitly be a good add, id recommend a digital compass too

Title: Re: $50 Robot A* pathfinding implementation
Post by: Admin on October 08, 2008, 04:55:43 AM

Quote

I am writing a paper on A* best-first, graph traversal pathfinding algorithm for the class i'm in.

Next I want to come up with a Binary Heap implementation of it for the $50 robot for large grids.

The memory and processing on the $50 Robot is really poor . . . look into using flash for map storage, and add an xtal to boost processing speed.