|
Formula Student Autonomous Systems
The code for the main driverless system
|

Go to the source code of this file.
Functions | |
| TEST (NearestNeighbor, TestCase1) | |
| Test with mostly easy matches and a new landmark. | |
| TEST (NearestNeighbor, TestCase2) | |
| Same case as TestCase1 but with rotation. | |
| TEST (NearestNeighbor, TestCase3) | |
| Same case as TestCase2 but with translation. | |
| TEST (NearestNeighbor, TestCase4) | |
| Only new landmarks with high confidence. | |
| TEST (NearestNeighbor, TestCase5) | |
| Only new landmarks with low confidence. | |
| TEST (NearestNeighbor, TestCase6) | |
| Only new landmarks with high confidence, high covariance and empty landmarks. | |
| TEST (NearestNeighbor, TestCase7) | |
| Empty landmarks and observations. | |
| TEST (NearestNeighbor, TestCase8) | |
| TEST | ( | NearestNeighbor | , |
| TestCase1 | |||
| ) |
Test with mostly easy matches and a new landmark.
Definition at line 9 of file nearest_neighbor_test.cpp.

| TEST | ( | NearestNeighbor | , |
| TestCase2 | |||
| ) |
Same case as TestCase1 but with rotation.
Definition at line 33 of file nearest_neighbor_test.cpp.

| TEST | ( | NearestNeighbor | , |
| TestCase3 | |||
| ) |
Same case as TestCase2 but with translation.
Definition at line 59 of file nearest_neighbor_test.cpp.

| TEST | ( | NearestNeighbor | , |
| TestCase4 | |||
| ) |
Only new landmarks with high confidence.
Definition at line 85 of file nearest_neighbor_test.cpp.

| TEST | ( | NearestNeighbor | , |
| TestCase5 | |||
| ) |
Only new landmarks with low confidence.
Definition at line 110 of file nearest_neighbor_test.cpp.

| TEST | ( | NearestNeighbor | , |
| TestCase6 | |||
| ) |
Only new landmarks with high confidence, high covariance and empty landmarks.
Definition at line 135 of file nearest_neighbor_test.cpp.

| TEST | ( | NearestNeighbor | , |
| TestCase7 | |||
| ) |
Empty landmarks and observations.
Definition at line 159 of file nearest_neighbor_test.cpp.

| TEST | ( | NearestNeighbor | , |
| TestCase8 | |||
| ) |