Method for operating an driverless transport vehicle within an environment, which is configured to travel automatically from a start point to an end point, wherein the environment comprises intermediate points and track sections connecting the intermediate points, the start point and the end point, comprising the following method steps: a) providing a graph assigned to the environment, the graph comprising nodes (k1-k5) assigned to the intermediate points, a start node (s) assigned to the start point, an end node (z) assigned to the end point, and edges assigned to corresponding track sections connecting the start node (s), the end node (z) and nodes (k1-k5), wherein information is assigned to the edges respectively regarding the navigability of whether the corresponding track section can be travelled at a specific point in time and the travel time required by the driverless transport vehicle for travelling the course of the corresponding navigable track section, b) based on the information assigned to the edges and the current point in time at the start point, calculating a strategy for determining the track sections along which the driverless transport vehicle can travel most quickly in an automated manner to the end point, wherein the strategy comprises information regarding calculated potential arrival times at the corresponding intermediate points and the end point, c) based on the strategy, automatically moving the driverless transport vehicle from the start point to the corresponding intermediate point adjacent to the start point along the corresponding track section, d) based on the current arrival time at the intermediate point adjacent to the start point, and based on the strategy, automatically moving the driverless transport vehicle to the next intermediate point along the corresponding track section, e) based on the current arrival time at the next intermediate point, and based on the strategy, automatically moving the driverless transport vehicle along the corresponding track section to the intermediate point, which follows the next intermediate point, and f) repeating steps d) and e) until the driverless transport vehicle arrives at the end point, wherein the expected travel times are calculated for the individual track sections, which are calculated as probability distribution of the arrival times P ( Y t) at the next intermediate point according to the following formula: P Y t = ∑ P X t = x P Y t | X t = x x ∈ 0,1 wherein P(X t) is the probability distribution for the navigability of the track section assigned to the corresponding edge, and P(Y t |X t) is the conditional probability for the arrival time of the track section assigned to the corresponding edge, as a function of the navigability. a) providing a graph assigned to the environment, the graph comprising nodes (k1-k5) assigned to the intermediate points, a start node (s) assigned to the start point, an end node (z) assigned to the end point, and edges assigned to corresponding track sections connecting the start node (s), the end node (z) and nodes (k1-k5), wherein information is assigned to the edges respectively regarding the navigability of whether the corresponding track section can be travelled at a specific point in time and the travel time required by the driverless transport vehicle for travelling the course of the corresponding navigable track section, b) based on the information assigned to the edges and the current point in time at the start point, calculating a strategy for determining the track sections along which the driverless transport vehicle can travel most quickly in an automated manner to the end point, wherein the strategy comprises information regarding calculated potential arrival times at the corresponding intermediate points and the end point, c) based on the strategy, automatically moving the driverless transport vehicle from the start point to the corresponding intermediate point adjacent to the start point along the corresponding track section, d) based on the current arrival time at the intermediate point adjacent to the start point, and based on the strategy, automatically moving the driverless transport vehicle to the next intermediate point along the corresponding track section, e) based on the current arrival time at the next intermediate point, and based on the strategy, automatically moving the driverless transport vehicle along the corresponding track section to the intermediate point, which follows the next intermediate point, and f) repeating steps d) and e) until the driverless transport vehicle arrives at the end point, wherein the expected travel times are calculated for the individual track sections, which are calculated as probability distribution of the arrival times P ( Y t) at the next intermediate point according to the following formula: P Y t = ∑ P X t = x P Y t | X t = x x ∈ 0,1 wherein P(X t) is the probability distribution for the navigability of the track section assigned to the corresponding edge, and P(Y t |X t) is the conditional probability for the arrival time of the track section assigned to the corresponding edge, as a function of the navigability.