🔒 Locked

Robot Maze Navigation

Started by Slayer-X Jan 25, 2001 at 10:54 AM 6 replies 1.8k views

Original Post

Jan 25, 2001 at 10:54 AM

I''m back again for help on this maze naviagation problem. You CAN''T have a robot that follows the walls, because the maze will be designed in such a way that you cannot get to the end using this method. I need some algorithm to get through a maze, hopefully using a method of remembering where the robot has been, and making sure that it doesn''t go back to dead end areas. I was thinking about using an array at first, but decided that wouldn''t be a good idea because I''d have to be sorting and re-assigning old values with new data (example, if the robot started in the middle of one wall, it would start at (0,0) and some values would go negative which would mean that I''d have to be always re-assinging and moving values around in the array). Now I''m thinking about using a tree to hold the data, but I''m not sure if it''ll work. The purpose is to get through the maze the fastest. If anyone knows a good way of doing this, or has any ideas, let me know.

djsteffey

Jan 25, 2001 at 2:42 PM

now is this going to be an actual robot that gets put down in a physical maze or is this going to be done on a computer screen where the data for the maze will be in some sort of array or you will be able to call a function that tells you which directions you can go from your present location ?
if it is the latter then using recursion would be my best bet as the way to do it like the guy above me said. but be careful if the maze is too large then you may run out of memory and your program wont work or it will crash

"Now go away or I shall taunt you a second time"
- Monty Python and the Holy Grail
We are creating a Multi-player space strategy/shoot-em-up/RPG game.
Development is well under way and we do have a playable demo.
Always looking for help.
Digital Euphoria Soft

Slayer-X

Jan 25, 2001 at 4:02 PM

This is going to be an actual physical robot. The program being put onto it is a .lx file (the RCX box''s chips were replaced by a college and the new chip runs the linux kernel on it), and it has to be coded in C only. What I mean by fastest is actually being able to get the robot to get through the maze faster than the others, so it needs to get through it with the best time possible. If you need any more information, just ask.

Topic Locked

This topic has been locked by a moderator. New replies are not allowed.