        |
 |
|
|||
|
|
 |
|
Week 0001
This is the first week of the REU summer program. It started off with many meetings. Orientation was good, I got to meet a lot of new people. Then the rest of the week was work filled. I was working on a modularity plan for the Group Behaviors Project that would allow the framework to become more flexible. Also this week was an intoduction to motion planning with a reading group. This will probably last a few weeks to get everyone acquainted with the projects. Next week I will hopefully be able to move on to the summer research plan I created, which will be partitioning a roadmap. I'm pretty excited about that so hopefully soon I'll get started on it. Well, thats about it for week 1.
Week 0010
This week I created the website that you are looking at. I also made up my research page that is able to be viewed from a link on the bottom of the page. I continued on with the motion planning crash course that Lydia and Phil are putting on to make sure that all the undergrads know important information about motion planning. On Friday, I gave a presentation about what research I am doing this summer. I thought it went well. As for this week's work, I have been working on this modularity problem in the framework of the group behaviors project. I made up a good plan, but since I will be changing focus next week to partitioning, I handed the reins off to Aditya. I felt this week was productive and I cannot wait till next week.
Week 0011
Its week three and I am finally getting to my project. :) I'm excited for the roadmap partitioning. So this week, I've thought up two new methods for roadmap partitioning. One method is a divide and conquer strategy. In this way, it starts with one big region then splits this region up recursivly. The second method I've created works in a similar fashion to Kruskal's Algorithm for finding a minimum spanning tree on a graph. My method starts with n partitions then merges them. Also this week, I worked through the theoretical time complexity of these algorithms, along with two other algorithms I will be testing this summer. The next problem I need to solve is how to quantify the quality of a partition, then from there I can start some programming and testing.
Week 0100
This week basically started off with a huge reading assignment for the motion planning reading group, which I am a part of. Also throughout this week there were plenty of meetings to go to. First off there was the regular weekly meetings for the motion planning and Group Behaviors Project. Those were exciting. There was also a parasol seminar about multi-agent systems that I attended on friday. I worked on creating my own environment for my experiments. Other then that it was a quiet week.
Week 0101
This week I finally got started on my framework for the roadmap partitioning. This was a tough task because in the period of about two days, I planned out probably about eight opjects in the framework and programmed them all. They aren't quite finished, but I have a good start. By friday, I got a working, compiling version of the code. All I need to do now is to be able to load input files. But that'll be for next week.
Week 0110
This week I continued on with my framework for my roadmap partitioning. By the end of the week, I was able to get the Kmeans algorithm working for partitioning. During this week, I was asked to create a plan to keep track of a partition hierarchy. This would be where the top node in the hierarchy is the entire map, then after that each level would represent some partition that has occurred. All the leaf nodes in this hierarchy would be the base partitions and contain all the information for the partitions. Hopefully next week I will have the hierarchy of partitions created.
Week 0111
This week I implented, debugged, and tested the hierarchy of partitions. This was a difficult task that took all week. Other then this I found out I made an A in statistics 211, and gave a speech for Communications 203. Thats about it for this week, it was pretty uneventful.
Week 1000
Now that the hierarchy works I have turned my attention to preliminary testing and so far its inconclusive, but I have hope for my algorithm. I also started my paperthat is due in two weeks, so far I have almost finished the first draft. I went to some meetings, and gave a speech for my speech class. Thats it for this week.
Week 1001
This week I have turned my attention away from the paper towards my poster, presentation, and testing. I have gotten my poster finished for next Monday. I have finished my presentation which I gave twice on friday. I have begun all but one of my twenty tests I have to run for the paper, and only thirteen have finished thus far. Well that all folks.
Week 1010
Final week, I worked to get my paper done. I finished this website. I gave two poster presentations and had dinner with the group thursday night. It has been a fun summer and I can't wait for the rest of the years research, it'll be so much fun. I also can't wait till next year because this summer was alot of fun.
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 |