A method for determining a path (P) of an object like a robot, etc. for moving from a starting state (N0) to an end state set (ESS) comprising one or more end states (NE) via one or more nodes (PN, CN) each being defined as an obstacle free state that has been explored avoiding one or more obstacles (O), characterized by the steps of a) Determining (S1) a plurality of child nodes (CNO, CN1, CN2) to a parent node (PN), wherein the starting node (N0) representing the starting state is the parent node (PN) when step a) is performed for the first time, and wherein the child nodes (CNO, CN1, CN2) are within a certain distance to the parent node (PN), b) Checking (S2) whether the transitions from the parent node (PN) to each of the child nodes (CNO, CN1, CN2) are free of obstacles (O), and if not the corresponding child node (CNO, CN1, CN2) and this partial path from the parent node (PN) to this child node (CNO, CN1, CN2) is excluded, c) Computing (S3) a cost value for each of said partial paths, d) Add (S4) said computed cost value to a cost value from the starting node (N0) to the parent node (PN), e) Add (S5) an estimated or expected cost value for the partial paths from each of the child nodes (CNO, CN1, CN2) to an end node (NE) representing an end state (NE), f) Determining (S6) the lowest overall cost value from the determined cost values according to steps d)-f) and selecting the child node (CNO, CN1, CN2) as new parent node (PN) associated with the determined lowest cost, g) Repeated (S7) performing the steps a)-g) until at least one termination condition is fulfilled including the termination condition if a selected child node (CNO, CN1, CN2) is within a pregiven distance to the end node (NE) wherein a lower bound value for the real cost from a child node (CNO, CN1, CN2) to the end state set (ESS) may be determined and used as said estimated or expected cost in step e). a) Determining (S1) a plurality of child nodes (CNO, CN1, CN2) to a parent node (PN), wherein the starting node (N0) representing the starting state is the parent node (PN) when step a) is performed for the first time, and wherein the child nodes (CNO, CN1, CN2) are within a certain distance to the parent node (PN), b) Checking (S2) whether the transitions from the parent node (PN) to each of the child nodes (CNO, CN1, CN2) are free of obstacles (O), and if not the corresponding child node (CNO, CN1, CN2) and this partial path from the parent node (PN) to this child node (CNO, CN1, CN2) is excluded, c) Computing (S3) a cost value for each of said partial paths, d) Add (S4) said computed cost value to a cost value from the starting node (N0) to the parent node (PN), e) Add (S5) an estimated or expected cost value for the partial paths from each of the child nodes (CNO, CN1, CN2) to an end node (NE) representing an end state (NE), f) Determining (S6) the lowest overall cost value from the determined cost values according to steps d)-f) and selecting the child node (CNO, CN1, CN2) as new parent node (PN) associated with the determined lowest cost, g) Repeated (S7) performing the steps a)-g) until at least one termination condition is fulfilled including the termination condition if a selected child node (CNO, CN1, CN2) is within a pregiven distance to the end node (NE) wherein a lower bound value for the real cost from a child node (CNO, CN1, CN2) to the end state set (ESS) may be determined and used as said estimated or expected cost in step e). <EOS>