A computer-implemented method, comprising: providing a map; determining a start point and a destination point in the map; acquiring transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406), wherein the transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406) comprises at least the following: - dimensions (L, B, H) of a transport vehicle including goods to be transported; and - a total weight; calculating at least one first route (306, 308) from the starting point to the destination point in the map; acquiring three-dimensional obstacle data (408, 410; 506; 1110) on the at least one first route (306, 308); checking the three-dimensional obstacle data (408, 410; 506; 1110) for compatibility with the transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406), wherein the checking outputs at least one of the following: - passage without instructions; - passage impossible; and - passage with instructions; excluding those from the at least one first route for which the checking outputs that the passage is impossible; creating a second route based on a selection of the remaining ones from the at least one first route (306, 308), or a combination of the remaining ones from the at least one first route (306, 308), the transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406) and the three-dimensional obstacle data (408, 410; 506; 1110); determining obstacle positions associated with the three-dimensional obstacle data (408,410; 506; 1110); storing the obstacle positions in a storage device; acquiring a position of a transport vehicle on the second route between the starting point and the destination point, the transport vehicle having the transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406); calculating a next obstacle position from the obstacle positions that is closest to the position of the transport vehicle; and if the checking for the three-dimensional obstacle data (408, 410; 506; 1110) with which the next obstacle position is associated comprises passage with instructions, providing an indication of instructions for passing the three-dimensional obstacle data (408, 410; 506; 1110) with which the next obstacle position is associated. providing a map; determining a start point and a destination point in the map; acquiring transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406), wherein the transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406) comprises at least the following: - dimensions (L, B, H) of a transport vehicle including goods to be transported; and - a total weight; - dimensions (L, B, H) of a transport vehicle including goods to be transported; and - a total weight; calculating at least one first route (306, 308) from the starting point to the destination point in the map; acquiring three-dimensional obstacle data (408, 410; 506; 1110) on the at least one first route (306, 308); checking the three-dimensional obstacle data (408, 410; 506; 1110) for compatibility with the transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406), wherein the checking outputs at least one of the following: - passage without instructions; - passage impossible; and - passage with instructions; - passage without instructions; - passage impossible; and - passage with instructions; excluding those from the at least one first route for which the checking outputs that the passage is impossible; creating a second route based on a selection of the remaining ones from the at least one first route (306, 308), or a combination of the remaining ones from the at least one first route (306, 308), the transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406) and the three-dimensional obstacle data (408, 410; 506; 1110); determining obstacle positions associated with the three-dimensional obstacle data (408,410; 506; 1110); storing the obstacle positions in a storage device; acquiring a position of a transport vehicle on the second route between the starting point and the destination point, the transport vehicle having the transport data (L, B, H, G1, G2, G, A1, A2; W202, D1-D5, C1, C2; 1404, 1406); calculating a next obstacle position from the obstacle positions that is closest to the position of the transport vehicle; and if the checking for the three-dimensional obstacle data (408, 410; 506; 1110) with which the next obstacle position is associated comprises passage with instructions, providing an indication of instructions for passing the three-dimensional obstacle data (408, 410; 506; 1110) with which the next obstacle position is associated.