After got stuck trying to add more vertex properties using Boost Library, I decided to develop my own library for graph utilities. Now the program works fine and after minor enhancements will be ready to continue the tasks left before I quit using the Boost Library.
Tomorrow I have to report my progress to my thesis supervisor/advisor. Guess I need to peek on some crypto code I created some times ago, wishing that I can still grab those main ideas about elliptic curves, protocols and so forth…
After spending 3 days wandering (aimlessly?) trying to make my code implementing boost library works, we decide to simplify it and minimize the using of the library 
Now the code is working but I hate it because it’s so not fancy, not implementing OOP and far from design pattern! But the must important thing is that it works, giving us the map representation in graph. Next is represent the visited node and heuristic values in graph. And at the same time I plan to revise the code. Either digging more deeper into the boost library, or developing my own library! A simple but sufficient library of my own! 
(as if there’s still plenty of time left, hi hi hi)
Vertex list and edge list have been generated and these are graph representations for correlated maps.
n = 4
n = 10
n = 20
Next to do: generating more attributes for the graph (different colors, boldness, numbers, for indicating occupancy status)
Well, the framework is finally ready. And Graphviz worked just fine, it gave nice visualizations of our .dot files. Lovely!
Next to do is modifying and optimizing the path planning module. And of course designing the best algorithm for navigation (Master Shifu has a million ideas in his head already.)
There are also some progress for my quals prep. Have got approval for the title and also have got some corrections for the proposal and presentation slides. Good.
Quite happy and progressing day
Defining my own properties tags to be added to the vertex, edge and graph.
We have agreed that the information about occupancy of obstacle in the map will be stored in the vertices.
Recent Comments