swarm-support
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Implementing vision in Swarm


From: Theodore C. Belding
Subject: Re: Implementing vision in Swarm
Date: Thu, 14 Nov 1996 07:47:01 -0500

Hi-
Here's an article from a thread on comp.ai.genetic.  Hope this helps.
-Ted

>
>Path:
>news.itd.umich.edu!newsxfer.itd.umich.edu!news.ececs.uc.edu!newsrelay.netins.net
>!newsfeed.dacom.co.kr!usenet.kornet.nm.kr!howland.erols.net!newsfeed.internetmci
>.com!news.bbnplanet.com!cpk-news-hub1.bbnplanet.com!news.ums.edu!haven.umd.edu!c
>s.umd.edu!carmi.cs.umd.edu!seanl
>From: address@hidden (Sean Luke)
>Newsgroups: comp.ai.alife
>Subject: Re: Agent Neighborhoods - implementation question.
>Date: 11 Nov 1996 17:57:30 GMT
>Organization: U Maryland at College Park
>Lines: 30
>Message-ID: <address@hidden>
>References: <address@hidden> <address@hidden>
>NNTP-Posting-Host: carmi.cs.umd.edu
>X-Newsreader: TIN [version 1.2 PL2]
>
>Kimmo Fredriksson (address@hidden) wrote:
>>cristobal baray <address@hidden> wasted bandwith...
>
>>cb: This has been discussed before, but I can't find my notes on it
>>anymore -
>
>>cb: In writing multi-agent simulations, there's a problem of finding out
>>which
>>cb: agents are within a certain radius of a specific radius.  Calculating the
>>cb: neighborhoods for a set of agents can have a BigO of N^2.  I seem to
>>cb: remember a discussion of some algorithms used in graphics that might help
>>cb: with the neighborhood calculations - can anyone give me some pointers?
>
>>The first graphics related thing that comes to mind and that might be
>>useful in here is the `quad tree' method. Give these two words to Alta
>>Vista, and you surely find a lot of related links (even code maybe).
>
>Quite right.
>
>Dr. Hanan Samet of the University of Maryland at College Park (where I'm a
>grad student ;-) is THE quadtree guy.  So I figure now is a good time to
>push his (and the definitive) book on the subject:
>
>        The Design and Analysis of Spatial Data Structures
>        Hanan Samet
>        1994, Addison-Wesley
>        ISBN: 0-201-50255-0
>
>_____________________________________________________________________________
>Sean Luke                   "I've discovered that P==NP, but the proof is too
>U Maryland at College Park   large to fit in the margins of this signature."
>address@hidden             URL: http://www.cs.umd.edu/~seanl/


--
Ted Belding                      <mailto:address@hidden>
University of Michigan Program for the Study of Complex Systems
<http://www-personal.engin.umich.edu/~streak/>




reply via email to

[Prev in Thread] Current Thread [Next in Thread]