Differences

This shows you the differences between two versions of the page.

--- papers:ezra_stallings [2014/10/16 17:50] – [Abstract] vyross
+++ papers:ezra_stallings [2014/12/01 21:45] (current) – vyross
@@ Line 1: / Line 1: @@
-====== Finding the Enemy: Active Sensing in an Indefinitely Scalable Machine ======
+====== Resource Finding and Distribution in an Indefinitely Scalable Machine ======
+{{:papers:alife_paper_ezra_stallings.pdf|}}
+{{:papers:cs491_presentation.pdf|}}
-===== Abstract =====
-In the Movable Feast Machine (MFM), a simulated architecture for an infinite computer, we have to contend with a highly limited scope of memory and random asynchronous execution, which complicates search algorithms and data structures.
-We took on the problem of finding other elements in a sparsely populated system using an active sensing system, in which we have a "conflict" between various colonies - like ant hills - which have to find and destroy each other. The scouts from each colony leave behind breadcrumbs, like pheromone trails, which act like linked lists, and can be "activated" to lead other ants to enemies in order to conquer them.
-===== Conclusion =====
-This method for pathfinding works well for sparse structures, demonstrating both an ability for the concept to work with a clear goal in the context of a more complex system (the conflict) and an ideal density level for the system to allow pathfinding to work well. If the machine is too sparsely populated, it can take scouts far too long to find their adversaries, while in a densely populated system the optimization (and eventually, the movement of the scouts) is severely limited. Additionally, when breadcrumbs persist too long, they can contribute to system clutter; I found that giving them a built-in maximum age of [X] helped mitigate this, as well as causing them to die after they are finished functioning for a single alert cycle.