Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!news.mathworks.com!fu-berlin.de!news.dfn.de!news.uni-bielefeld.de!news
From: Andreas Zielke <andreasz>
Subject: Looking for fast obstacle avoidance.
Sender: news@hermes.hrz.uni-bielefeld.de (News Administrator)
Message-ID: <DLsH88.9ID@hermes.hrz.uni-bielefeld.de>
Date: Fri, 26 Jan 1996 12:55:19 GMT
X-Url: news:comp.ai.games
Content-Transfer-Encoding: 7bit
Content-Type: text/plain; charset=us-ascii
Nntp-Posting-Host: castor.hrz.uni-bielefeld.de
Mime-Version: 1.0
X-Mailer: Mozilla 1.12 (X11; I; HP-UX B.10.01 9000/770)
Organization: Universitaet Bielefeld, Rechenzentrum
Lines: 25

Hi!

I'm currently coding a kind of simulation for my computer studies. Imagine
tiny lifeforms, that walk around in a 2D-World, searching for cookies. At the
very beginning they know nothing about their surroundings. If they find a
cookie they'll take it (they can only carry one cookie at a time) and return
it to the place where they started the game. So much on the general idea.
Here's my problem: If a lifeform (l) wants to return to it's home (h) and
stumbles across an obstacle (o) like in the 'picture' below, it gets kind of
stuck. Is there any good (fast) algorithm to surround/avoid obstacles?

................h.....
......................
.......oooooooo.......
............loo.......
.............o........
.............oo.......
......................

Thanx in advance for your help!

Andreas

(email: azielke@techfak.uni-bielefeld.de   OR   andreasz@hrz.uni-bielefeld.de)

