PRE2017 3 Group 17 Test Cases: Difference between revisions
(Adding test layouts) |
(Added explanations to the tests) |
||
| Line 1: | Line 1: | ||
== Layout with nodes == | == Layout with nodes == | ||
Below a couple of very basic initial test layouts can be found. These layouts are used to test the parser, the model and the UI.<br><br> | Below a couple of very basic initial test layouts can be found. These layouts are used to test the parser, the model and the UI.<br><br> | ||
[[File:Test1.jpg]] [[File:Test2.jpg]] [[File:Test3.jpg]] [[File:Test4.jpg]] [[File:Test5.jpg]] [[File:Test6.jpg]] [[File:Test7.jpg]] [[File:Test8.jpg]] | Test 1 is simple test to check the basics of loading in an environment and nodes.<br> | ||
[[File:Test1.jpg]]<br><br> | |||
The test below was created to test an edge-case scenario, where the end node is not reachable. This test also illustrates very well that it is not desired that the drone simply flies back. In this case it is usefull if the nearest node would become the target. How does the drone choose these target nodes, or does the user need to pick a reachable target node for the system.<br> | |||
[[File:Test2.jpg]]<br><br> | |||
A simple test to see if the optimal path was chosen.<br> | |||
[[File:Test3.jpg]]<br><br> | |||
Another test to see if the optimal path was chosen.<br> | |||
[[File:Test4.jpg]]<br><br> | |||
A test to see if boundaries are respected. However, since the drones follow the nodes this test case has less relevance.<br> | |||
[[File:Test5.jpg]]<br><br> | |||
A circular test case. Also a boundary case, depending on your implementation of an algorithm can get stuck on searching for the optimal path, since there are always combinations that cannot be scouted.<br> | |||
[[File:Test6.jpg]]<br><br> | |||
A very besic test case to make us think about difference in floors and how this will be implemented.<br> | |||
[[File:Test7.jpg]]<br><br> | |||
Also a test case with mulitple floors, however, this time there are multiple paths: | |||
*Stays on the same level, but has more nodes | |||
*Different level, but with less nodes | |||
This test case is made to make us think about how we want to handle different floors. Do we always require the absolute shortest flight path, or do we take energy into account? (since lifting a heavy object requires more force than keeping it on the same level<br> | |||
[[File:Test8.jpg]] | |||
Revision as of 23:36, 14 March 2018
Layout with nodes
Below a couple of very basic initial test layouts can be found. These layouts are used to test the parser, the model and the UI.
Test 1 is simple test to check the basics of loading in an environment and nodes.
The test below was created to test an edge-case scenario, where the end node is not reachable. This test also illustrates very well that it is not desired that the drone simply flies back. In this case it is usefull if the nearest node would become the target. How does the drone choose these target nodes, or does the user need to pick a reachable target node for the system.
A simple test to see if the optimal path was chosen.
Another test to see if the optimal path was chosen.
A test to see if boundaries are respected. However, since the drones follow the nodes this test case has less relevance.
A circular test case. Also a boundary case, depending on your implementation of an algorithm can get stuck on searching for the optimal path, since there are always combinations that cannot be scouted.
A very besic test case to make us think about difference in floors and how this will be implemented.
Also a test case with mulitple floors, however, this time there are multiple paths:
- Stays on the same level, but has more nodes
- Different level, but with less nodes
This test case is made to make us think about how we want to handle different floors. Do we always require the absolute shortest flight path, or do we take energy into account? (since lifting a heavy object requires more force than keeping it on the same level
