[Gtkradiant] gtk

[michael j dahinten]

An HTML attachment was scrubbed...
URL: http://zerowing.idsoftware.com/pipermail/gtkradiant/attachments/20090101/0a28d3ff/attachment.html 
-------------- next part --------------

what is forest hail?

 

forest hail or forest hale?

 

michael

 

los angeles, ca, usa

 

 

 


Send Gtkradiant mailing list submissions to 
gtkradiant at zerowing.idsoftware.com 

To subscribe or unsubscribe via the World Wide Web, visit 
http://zerowing.idsoftware.com/cgi-bin/mailman/listinfo/gtkradiant 
or, via email, send a message with subject or body 'help' to 
gtkradiant-request at zerowing.idsoftware.com 

You can reach the person managing the list at 
gtkradiant-owner at zerowing.idsoftware.com 

When replying, please edit your Subject line so it is more specific 
than "Re: Contents of Gtkradiant digest..." 


Today's Topics: 

1. Re: AAS System (Forest Hale) 


---------------------------------------------------------------------- 

Message: 1 
Date: Sun, 28 Dec 2008 14:34:43 -0800 
From: Forest Hale 
Subject: Re: [Gtkradiant] AAS System 
To: GtkRadiant developer discussion 

Message-ID: <4957FF03.5090304 at ghdigital.com> 
Content-Type: text/plain; charset=ISO-8859-1 

MrElusive once tersely described the Q3 AAS system as having two-level navigation - at a high level there are areas identified by the compilre which have all possible routes precomputed, then within 
each area there are entrance/exit portals to other areas, the routing from the current leaf in the AAS bsp tree to an exit to another area is computed on the fly, but the routes from an entrance to an 
exit in an area is cached (it caches a certain number of recently queried routes of this sort). 

So basically, the bot figures out how to get from area to area, and queries a route cache for how to get from this leaf to the exit portal of the area, it follows this path (re-querying it each frame) 
until it ends up in the next area and the route cache figures out the path from that entrance to the appropriate exit, and this process repeats until it ends up in the same area as the destination, 
then it's caching the route from one leaf to another, soon it arrives at its destination. 

It's kind of a two-level A* algorithm, similar to the variations of A* used in RTS games (which often use multiple levels of routing). 

Timothee Besset wrote: 
> Matthew Tang wrote: 
>> I would like to understand how the area awareness system works. I am 
>> interested in using such a system for navigation of bots. If someone 
>> could point in to some resources that would be nice. 
>> 
>> Thanks, 
>> Matthew Tang 
>> 
>> 
> 
> Good thing that all the code is available .. have fun :-) 
> 
> I'm not aware that any "high level" documentation / introduction exists. 
> 
> TTimo 
> 
>> _______________________________________________ 
>> Gtkradiant mailing list 
>> Gtkradiant at zerowing.idsoftware.com 
>> http://zerowing.idsoftware.com/cgi-bin/mailman/listinfo/gtkradiant 
>> 
> 
> 
> 
> _______________________________________________ 
> Gtkradiant mailing list 
> Gtkradiant at zerowing.idsoftware.com 
> http://zerowing.idsoftware.com/cgi-bin/mailman/listinfo/gtkradiant 
> 


-- 
LordHavoc 
Author of DarkPlaces Quake1 engine and mod 
http://icculus.org/twilight/darkplaces/ 
"War does not prove who is right, it proves who is left." - Unknown 
"Any sufficiently advanced technology is indistinguishable from a rigged demo." - James Klass 




------------------------------ 

_______________________________________________ 
Gtkradiant mailing list 
Gtkradiant at zerowing.idsoftware.com 
http://zerowing.idsoftware.com/cgi-bin/mailman/listinfo/gtkradiant 

End of Gtkradiant Digest, Vol 52, Issue 3 
***************************************** 




~ ~ ~

living, loving, learning


...earning. and freedom