Week of Nov 9th

ToDo:
DEACCON work – interface more granular loading of models features for FLAIRS papers
Committee and PhD proposal setup targeting week of December 7th

FLAIRS paper
Hyp: It is possible to discover a navigation mesh using information gained from one or more agents moving through the world.

Applications: Simulations of Search and rescue in unknown environments, more “fair” agents for games and simulations, others

Approach: Crib some of the D* working with unknown areas and combine that with dynamic rebuilding of decomps. Assume world is empty then rebuild when this assumption is invalidated.

Validation and Experimentation: Compare the error levels present in a agents generated decomposition (incorrectly classified space, missed gateways, average path lengths) to the “optimum decomposition” in a time lapsed manor. How quickly does agent discovery converge on optimum decomp?

Leave a Reply

You must be logged in to post a comment.