Don't miss our weekly PhD newsletter | Sign up now Don't miss our weekly PhD newsletter | Sign up now

  Models and Algorithms for Systems of Programmable Particles


   School of Electrical Engineering, Electronics and Computer Science

This project is no longer listed on FindAPhD.com and may not be available.

Click here to search FindAPhD.com for PhD studentship opportunities
Dr O Michail Prof I Potapov  No more applications being accepted  Funded PhD Project (European/UK Students Only)

About the Project

The project will investigate the algorithmic framework necessary for the development of systems of programmable particles. These are roughly systems of tiny and computationally weak entities equipped with computing and possibly also actuation capabilities. Additionally, some of these systems are typically highly dynamic both in space and time. During the project the student is expected to explore topics from the related areas of Population Protocols and Network Constructors, Dynamic Networks, Discrete Dynamic Systems, and Algorithmic properties of Programmable Matter. This research has the potential to reveal new modes of computing as well as to establish novel computability and complexity insights.

The student apart from working on existing models and problems from the state of the art will have the opportunity to develop a set of novel reasonable models that capture well essential parameters of emerging and future systems. The student will be able to enhance those models through our close collaboration with experts from EEE and Mechanical Engineering. For each of these models, we shall explore adaptations of existing problems as well as identify and formulate naturally occurring new problems, investigate feasibility and efficiency questions, develop a wide range of centralised and distributed algorithms, and consider relationships between the various models (e.g., through simulation relations, characterisations, and complexity classes). Our solutions shall be extensively tested analytically and through simulations and visualization. Another PhD student (based in the EEE Department, member of our team) will be working in parallel on the design and implementation of a real system corresponding to the best model predicted by our theoretical framework, so the two students are expected to form a team.

The project will study models of both actively-mobile and passively-mobile systems of programmable particles. As part of the latter direction, it shall be investigated how recent techniques from the area of dynamic networks can be applied in programmable matter models.

The aforementioned opportunity to interact with academics from Electrical Engineering, and Electronics and Mechanical Engineering will enable the student to form a global perspective and arrive at more realistic models. It is also anticipated that a collaboration with the Virtual Engineering Centre at Daresbury and the NeST initiative of the Computer Science department shall be established during the project.

Candidates should have completed a BSc degree in Computer Science (preferably 1st class, i.e. 70%+, but upper second class, i.e. 60-69%, shall also be considered) or other closely related field, be passionate and highly motivated for pursuing a PhD in Computer Science and to have a strong relevant background (example topics: sequential/distributed algorithms, computability/complexity theory, modelling computing systems, graphs/networks, analysis and formal proofs). Holding an MSc in Computer Science or other closely related field is not necessary for applying to this position (but will be taken into account). Candidates are also expected to have reasonable programming skills, to be willing to get involved in interdisciplinary collaborations which are already in place, and to acquire new knowledge ranging from theoretical aspects to applied issues and experimentation.

Funding Notes

The PhD project is a 3-year project funded by EPSRC (DTP) and the School of Electrical Engineering, Electronics and Computer Science. The value is £20,000 per year. For UK/EU students this will relate to Full Tuition Fees and Maintenance (current fee £4,195). Funding is available only for UK/EU nationals. EU students are only eligible if they have studied in the UK for the last 3 years.

References

D. Angluin, J. Aspnes, Z. Diamadi, M.J. Fischer, and R. Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4), 235-253, 2006.

F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. Proceedings of the forty-second ACM symposium on Theory of computing (STOC), 513-522 2010.

O. Michail, G. Skretas, and P.G. Spirakis: On the transformation capability of feasible mechanisms for programmable matter. Proceedings of the 44th International Colloquium on Automata, Languages and Programming (ICALP), 136:1–136:15, 2017.

O. Michail and P.G. Spirakis: Elements of the Theory of Dynamic Networks. Commun. ACM, 61(2), 72-81, 2018.

O. Michail and P.G. Spirakis. Simple and efficient local codes for distributed stable network construction. Distributed Computing, 29(3), 207-237, 2016.

Where will I study?


Project supervisors

Career overview

Dr Othon Michail is a Senior Lecturer in Algorithms and Computing Systems at the University of Liverpool, part of the School of Computer Science and Informatics within the Faculty of Science and Engineering. Further details regarding Dr Michail''s educational background, research interests, and professional history are not provided in the available profile information.


Research interests

Dr Michail''s research interests lie in algorithms and computing systems. He focuses on the development and analysis of algorithms, particularly in the context of computational complexity and optimisation. His work often involves exploring efficient algorithmic solutions to problems in various domains, including graph theory and combinatorial optimisation. Dr Michail is also interested in the theoretical foundations of computer science, contributing to the understanding of algorithm performance and efficiency.

View Dr Othon Michail's profile 
Career overview

Professor Igor Potapov is a Professor of Computer Science at the University of Liverpool and leads the ''Algorithms, Complexity Theory and Optimisation'' group. He is also a council member of Networks Sciences & Technologies within the Department of Computer Science. His research primarily focuses on various reachability questions and the distinctions between decidable and undecidable problems related to automata, formal languages, semigroups, and iterative maps. These research areas are interconnected with algorithms, combinatorics on words, abstract algebra, topology, and computation theory. Additionally, he has interests in designing and analysing algorithms within distributed computational models, particularly concerning self-organisation, pattern formation, and the analysis of computational power. Professor Potapov has been a Royal Society Apex Award fellow since 2024, concentrating on interdisciplinary research in Algorithmic Crystal Structure Prediction for Material Design. In the period of 2020 to 2021, he served as a Royal Society Leverhulme Trust Senior Research Fellow, where he worked on a project titled ''Cornerstones of Reachability: Between Automata and Matrix Theories.'' Since March 2022, he has been involved with the Science for Ukraine initiative, contributing to strategic planning for the UK branch, exploring funding and sponsorship opportunities, and engaging with media. He has also played a role in coordinating UK-Ukraine academic mentoring and other research twinning programmes.


Research interests

Professor Potapov''s research primarily focuses on various reachability questions and the delineation between decidable and undecidable problems related to automata, formal languages, semigroups, and iterative maps. These areas have extensive connections with algorithms, combinatorics on words, abstract algebra, topology, and computation theory. Additionally, he is interested in the design and analysis of algorithms within distributed computational models, with a particular emphasis on self-organisation, pattern formation, and the analysis of computational power. He is currently a Royal Society Apex Award fellow, concentrating on interdisciplinary research in Algorithmic Crystal Structure Prediction for Material Design. Previously, he held the position of Royal Society Leverhulme Trust Senior Research Fellow, where he worked on a project titled ''Cornerstones of Reachability: Between Automata and Matrix Theories.''

View Professor Igor Potapov's profile