Differences

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

--- ongoing [2011/02/07 20:42] – bil
+++ ongoing [2011/04/18 20:34] (current) – bil
@@ Line 1: / Line 1: @@
 ====== Ongoing projects ======
-====== Leadership Election Among Numbered Agents with Constrained Interactions ======
+No projects are ongoing yet.
-**Student**:  Stephen Voland
+<html><!--
-**Supervisor**:  Patrick Dymond and Michael Jenkin
-__Description__
-This project is an examination of the efficiency with which numbered distributed agents are able to elect a leader, given certain constraints.  It builds on the paper 'Efficient Leader Election Among Numbered Agents', by R. Chaturvedi, P. Dymond, and M. Jenkin.
-When collections of agents are deployed to solve a problem it can be beneficial to establish a leader among the group. For certain applications it may be desirable to establish this leader in some static manner. For other situations it is desirable to have the group of agents establish the leader themselves. Chatuervedi et al. (2011) developed an algorithm that enables a group of identical agents differentiated only by their unique identification number to elect their own leader. Chaturvedi et al.'s work contained a very simple simulator for a specific algorithm. Ongoing work requires the development of a more sophisticated simulator of this collection of agents, in particular the development of a simulator that allows for systematic evaluation of certain properties of the collection of agents.  It is also desirable to perform a rigorous mathematical analysis of some of the more simpler variants of the existing work.
-The project will involve the creation of a simulator which will take parameters for the number of agents, their internal initial state such as arrangement in space, and a function to determine the probability of an interaction between two given agents based on their positions.  In the most straightforward case, all paired interactions would be equally likely, and thus the agents would have no associated positions.  Another case would have the agents spread randomly on a bounded plane, where the probability of a pair interacting would be inversely proportional to the distance between them.  A third would have the agents distributed among rooms, and would allow an agent to communicate only with agents in the same or an adjacent room.  The program will simulate a leadership election using the supplied parameters, and report properties of the simulation including how many interactions were necessary to complete the election, if the election was successful, and actual number of interactions taken for election
-Theoretical results for such elections will also be determined, and will be compared with the experimental results for mutual validation.
 ====== Acoustic Cues and Self Motion ======
@@ Line 93: / Line 81: @@
 More information: [[http://www.eol.org]]
+--> </html>