Method for planning a
route (11) that can be followed by a motor vehicle (10) with several waypoints (A, B, C, D, E, F), characterized by the following features: - a
route network comprising the waypoints (A, B, C, D, E, F) is modelled as a graph with nodes corresponding to the waypoints (A, B, C, D, E, F), - the nodes are connected in pairs by edges if there is a connection between the corresponding waypoints (A, B, C, D, E, F) in the
route network, and - using the Grover
algorithm, a Hamiltonian path is determined in the graph, which corresponds to the
optimal route (11) along the waypoints (A, B, C, D, E, F).