        |
 |
|
|||
|
 |
|
My name is Plamen Ivanov and I am an undergaduate junior in Vassar College and I plan to graduate in 2011. I am a Computer Science major and I plan to double-major in Physics. I am from Stara Zagora, Bulgaria. My advisor for my summer research is Jennifer Walter, who is an Associate Professor in the Computer Science Department in Vassar College. I will be working on developing motion planning algorithms for hexagonal self-reconfigurable metamorphic robots. More specifically, my work will involve implementing and proving the correctness of bridging algorithms developed by REU Vassar student Isaac Krull in 2008.
My abstract:
This paper presents a bridging algorithm that deterministically plans the simultaneous, collision-free movement of n hexagonal metamorphic robots (modules) over any contiguous surface in a hexagonal grid, from the source to the goal end of the surface. Our centralized planning stage algorithm identifies narrow passages between cells in the surface where modules will come into contact. We call such non-concurrently traversable surface segments “narrow pockets”. After identifying these narrow pockets, our algorithm finds the cells that must be filled by modules to block the pockets and marks these cells in the surface map of each module. Our algorithm does not use message passing between the modules at any stage of the traversal. In this paper we show how our algorithm guarantees a successful traversal of any contiguous surface in a hexagonal grid by building temporary module structures consisting of 1 or 2 modules that we call bridges. We also show that our algorithm identifies and correctly classifies all possible narrow pocket formations and their corresponding bridges. The bridging modules use pre-calculated delays, and in some cases changes of direction, to maintain optimal spacing between modules and to avoid collisions and deadlock throughout the traversal. Our current algorithm is an improvement over previous bridging algorithms because the bridge forming modules do not generate additional narrow pockets. We discuss the results of simulating our algorithms using a discrete event simulator.
You can see my paper here and my poster here .
Parasol Home | Research | People | General info | Seminars | Resources Parasol Lab, 301 Harvey R. Bright Bldg, 3112 TAMU, College Station, TX 77843-3112 Contact Webmaster Phone 979.458.0722 Fax 979.458.0718 
Department of Computer Science and Engineering | Dwight Look College of Engineering | Texas A&M University Privacy statement: Computer Science and Engineering Engineering TAMU |