... | ... | @@ -112,8 +112,19 @@ __Exercise 6__ |
|
|
|
|
|
In this exercise we use the program of Philippe Houdain to create a similar program that makes the car follow a wall. Then we compare the NQC algorithms with other suggestions.
|
|
|
|
|
|
Plan
|
|
|
|
|
|
Write the NQC (“not quite c”) program to a similar java program and the compare the algorith with ones suggested in the exercises from the book.
|
|
|
|
|
|
Result/Conclusion
|
|
|
Writing a program in Java that had similarities to the NQC program resulted in some issue. We had a hard time writing the java, and only achieved a three-state solution. This wasn’t efficient enough for the robot to turn corners properly and follow the wall again. Furthermore, this was caused because of the constant turns, if we could have done the algorithm correctly we would achieve different and sensitive turns according to the distance to the wall.
|
|
|
|
|
|
**Comparison of the NQC to the different algorithms from the book:**
|
|
|
1.Using this suggestion results in the issues as mentioned above
|
|
|
|
|
|
2.The second suggestion uses hard and gentle turns, to make cornering easier, furthermore it helps the robot to stay closer to the wall, however it lacks the state of going straight
|
|
|
|
|
|
Not finished yet, will be done by tuesday evening and uploaded to course page and our Gitlab account.
|
|
|
3.This suggestion uses the former two suggestions and looks very familiar to NQC algorithm in theory, however we can’t compare them with a graph.
|
|
|
|
|
|
|
|
|
__References__
|
... | ... | |