Filtering by
- All Subjects: Creative Project
- All Subjects: Algorithms
- Creators: School of Mathematical and Statistical Sciences
- Member of: Barrett, The Honors College Thesis/Creative Project Collection
![147863-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-07/147863-Thumbnail%20Image.png?versionId=FWxs9e4qdfSw9dqZSxp.OimYY5pOSUId&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240530/us-west-2/s3/aws4_request&X-Amz-Date=20240530T154427Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=24c46ddbf96cfc0bd191ef7219d7e228421c82b26be8d53e7750b4f1ae1948a5&itok=oLjribK6)
Over the years, advances in research have continued to decrease the size of computers from the size of<br/>a room to a small device that could fit in one’s palm. However, if an application does not require extensive<br/>computation power nor accessories such as a screen, the corresponding machine could be microscopic,<br/>only a few nanometers big. Researchers at MIT have successfully created Syncells, which are micro-<br/>scale robots with limited computation power and memory that can communicate locally to achieve<br/>complex collective tasks. In order to control these Syncells for a desired outcome, they must each run a<br/>simple distributed algorithm. As they are only capable of local communication, Syncells cannot receive<br/>commands from a control center, so their algorithms cannot be centralized. In this work, we created a<br/>distributed algorithm that each Syncell can execute so that the system of Syncells is able to find and<br/>converge to a specific target within the environment. The most direct applications of this problem are in<br/>medicine. Such a system could be used as a safer alternative to invasive surgery or could be used to treat<br/>internal bleeding or tumors. We tested and analyzed our algorithm through simulation and visualization<br/>in Python. Overall, our algorithm successfully caused the system of particles to converge on a specific<br/>target present within the environment.
![148207-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-07/148207-Thumbnail%20Image.png?versionId=BDrwDWUnPg_FZXIfCf7IOABj.g6lgtrJ&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240613/us-west-2/s3/aws4_request&X-Amz-Date=20240613T073023Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=2b6eaf942db3e904bcb390c147ae3024279caa75400cf248157bf2f3a2849164&itok=uUNCKrQ9)
Optimal foraging theory provides a suite of tools that model the best way that an animal will <br/>structure its searching and processing decisions in uncertain environments. It has been <br/>successful characterizing real patterns of animal decision making, thereby providing insights<br/>into why animals behave the way they do. However, it does not speak to how animals make<br/>decisions that tend to be adaptive. Using simulation studies, prior work has shown empirically<br/>that a simple decision-making heuristic tends to produce prey-choice behaviors that, on <br/>average, match the predicted behaviors of optimal foraging theory. That heuristic chooses<br/>to spend time processing an encountered prey item if that prey item's marginal rate of<br/>caloric gain (in calories per unit of processing time) is greater than the forager's<br/>current long-term rate of accumulated caloric gain (in calories per unit of total searching<br/>and processing time). Although this heuristic may seem intuitive, a rigorous mathematical<br/>argument for why it tends to produce the theorized optimal foraging theory behavior has<br/>not been developed. In this thesis, an analytical argument is given for why this<br/>simple decision-making heuristic is expected to realize the optimal performance<br/>predicted by optimal foraging theory. This theoretical guarantee not only provides support<br/>for why such a heuristic might be favored by natural selection, but it also provides<br/>support for why such a heuristic might a reliable tool for decision-making in autonomous<br/>engineered agents moving through theatres of uncertain rewards. Ultimately, this simple<br/>decision-making heuristic may provide a recipe for reinforcement learning in small robots<br/>with little computational capabilities.
![136450-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-05/136450-Thumbnail%20Image.png?versionId=KOTmJK6y2yFdMYU73H2jHIZWe4zW0rJq&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240613/us-west-2/s3/aws4_request&X-Amz-Date=20240613T133907Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=616b64a3af4113827704f3cb842250e0fe93c9ee70fbf2b0a34631fc489a1636&itok=zcN8tChs)
![136508-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-05/136508-Thumbnail%20Image.png?versionId=8uxh2QLkFjD0a7yBw8qh7MKBDgCR5_no&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240612/us-west-2/s3/aws4_request&X-Amz-Date=20240612T101243Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=f0dfebd50b23cf1a3e8db6ad38ce7f03750910b9318b2317f9a4a804a27d60b9&itok=T0lLUEgo)
![135739-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-05/135739-Thumbnail%20Image.png?versionId=HqnmdtFg8AyKvHOep8aRurA5KE..N_3C&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240613/us-west-2/s3/aws4_request&X-Amz-Date=20240613T095432Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=71127a337552998a597c053425a0593fc89ff23473164044fa5569d4f3ce856c&itok=id1v-eG7)
![136691-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-05/136691-Thumbnail%20Image.png?versionId=gN3uzWXaJw66W01UosrtLyjZR_CZBMwg&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240613/us-west-2/s3/aws4_request&X-Amz-Date=20240613T135829Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=3059bd7bbaf1396cf7d25fbc0133dddc3536d2fc855c0175794885a9cae57a3d&itok=U32DprCM)
![136702-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-05/136702-Thumbnail%20Image.png?versionId=6q9f0iNepgA3qwfSZZs91JKuCFCZyLyr&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240612/us-west-2/s3/aws4_request&X-Amz-Date=20240612T111416Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=eab9f362431aada60062d7375e6b98458d590285d63b2040d03a421d60acb6dd&itok=DF0wSDqo)
![137020-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-05/137020-Thumbnail%20Image.png?versionId=.Niqz5MU0eXJ2gwO.8B98NsQufQ3R0qP&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240613/us-west-2/s3/aws4_request&X-Amz-Date=20240613T135829Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=9a1ac235e7c33aa873ff2fa6721a330a868d486dd65ac363f229ee851b5b8be1&itok=54K8lZgF)
![137164-Thumbnail Image.png](https://d1rbsgppyrdqq4.cloudfront.net/s3fs-public/styles/width_400/public/2021-05/137164-Thumbnail%20Image.png?versionId=SPP7EFtDEg.e2w6s3_6NxMTJyvTxenL5&X-Amz-Content-Sha256=UNSIGNED-PAYLOAD&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIASBVQ3ZQ42ZLA5CUJ/20240613/us-west-2/s3/aws4_request&X-Amz-Date=20240613T030611Z&X-Amz-SignedHeaders=host&X-Amz-Expires=120&X-Amz-Signature=c2a4831ae98a1c56f2e48efca5cca1cfb3af62da684b51fbf4bd8b627919d69a&itok=yJoGzfY7)