projects
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
projects [2017/01/05 21:06] – roumani | projects [2017/01/05 21:15] (current) – roumani | ||
---|---|---|---|
Line 1: | Line 1: | ||
+ | ======Distributed leader election for simple robots====== | ||
+ | ======Distributed leader election for simple robots====== | ||
+ | **Supervisors**: | ||
+ | |||
+ | **Project**: | ||
+ | Utilizing the concept of an infection algorithm — a process much like the spread of a disease in which agents infect each other with | ||
+ | information — it is possible to develop a probabilistic approach to this kind of leader election problem. Solutions to this type of problem finds wide application in distributed computing, and in particular distributed computing of autonomous agents and sensors which must compute information about control structures with limited information about the presence/ | ||
+ | |||
+ | To make this project more specific, and given the limited time available for an undergraduate student project, this project will explore certain properties of leader election algorithms, both with real and simulated | ||
+ | If time permits, the project will also study possible | ||
+ | |||
+ | **Required skills**: knowledge of Java or Python. Interest in algorithms for a distributed collection of simple robot agents. Completion of 3rd year courses in computer science or computer engineering. | ||
+ | |||
+ | |||
+ | ======Asynchronicity in infection algorithms====== | ||
+ | |||
+ | **Supervisors**: | ||
+ | |||
+ | **Project**: | ||
+ | |||
+ | Infection algorithms are a class of algorithms within which individual agents exchange information via infection. That is, the algorithm proceeds by the various agents transmitting (infecting) each other with information. Under an assumption of synchronization — that is, a model in which no two agents can infect each other at precisely the same time — it is possible to derive models of expected time until all agents have been infected. But how does this algorithm adapt when agents can actually infect each other simultaneously? | ||
+ | |||
+ | **Required skills**: knowledge of Java or Python. Interest in algorithms for a distributed collection of simple robot agents. Completion of 3rd year courses in computer science or computer engineering. | ||
+ | |||
+ | \\ | ||
+ | ======Simultaneous localization and mapping (SLAM) aided by a single unique directional landmark====== | ||
+ | |||
+ | **Supervisors**: | ||
+ | |||
+ | **Project**: | ||
+ | |||
+ | SLAM algorithms have been developed for a large number of different environments, | ||
+ | |||
+ | **Required skills**: knowledge of Java or Python. Interest in algorithms for robots. Completion of 3rd year courses in computer science or computer engineering. | ||
+ | |||
+ | |||
+ | \\ | ||
======Extracting Information from Music====== | ======Extracting Information from Music====== | ||
projects.1483650369.txt.gz · Last modified: 2017/01/05 21:06 by roumani