A method for generating a movement policy includes determining a probability distribution function for multiples nodes of a roadmap and determining, in parallel, a cost and a collision probability for each edge of the roadmap. The method also includes generating the movement policy based on the probability distribution function, the cost, and the collision probability.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method for generating a movement policy, comprising: determining a probability distribution function (PDF) for a plurality of nodes of a roadmap, the plurality of nodes including at least a start node, an end node, and at least two intermediary nodes; determining, in parallel, a cost and a collision probability for each edge of the roadmap, and each edge connecting two of the plurality of nodes; and generating the movement policy based at least in part on the PDF, the cost, and the collision probability. 2. The method of claim 1, in which the movement policy is a closed loop policy that determines movement to the end node from any of the plurality of nodes. 3. The method of claim 1, further comprising determining the cost and the collision probability for each edge by calculating cost values and collision events for each of a plurality of samples associated with each edge. 4. The method of claim 1, further comprising stabilizing a probability distribution function for a robot state in a vicinity of each selected node to the PDF of the selected node. 5. The method of claim 1, in which a first cost and a first collision probability of a first edge of a plurality of edges is independent of a second cost and a second collision probability of a second edge of the plurality of edges. 6. An apparatus for generating a movement policy, comprising: a memory unit; and at least one processor coupled to the memory unit, the at least one processor configured: to determine a probability distribution function (PDF) for a plurality of nodes of a roadmap, the plurality of nodes including at least a start node, an end node, and at least two intermediary nodes; to determine, in parallel, a cost and a collision probability for each edge of the roadmap, and each edge connecting two of the plurality of nodes; and to generate the movement policy based at least in part on the PDF, the cost, and the collision probability. 7. The apparatus of claim 6, in which the movement policy is a closed loop policy that determines movement to the end node from any of the plurality of nodes. 8. The apparatus of claim 6, in which the at least one processor is further configured to determine the cost and the collision probability for each edge by calculating cost values and collision events for each of a plurality of samples associated with each edge. 9. The apparatus of claim 6, in which the at least one processor is further configured to stabilize a probability distribution function for a robot state in a vicinity of each selected node to the PDF of the selected node. 10. The apparatus of claim 6, in which a first cost and a first collision probability of a first edge of a plurality of edges is independent of a second cost and a second collision probability of a second edge of the plurality of edges. 11. An apparatus for generating a movement policy, comprising: means for determining a probability distribution function (PDF) for a plurality of nodes of a roadmap, the plurality of nodes including at least a start node, an end node, and at least two intermediary nodes; means for determining, in parallel, a cost and a collision probability for each edge of the roadmap, and each edge connecting two of the plurality of nodes; and means for generating the movement policy based at least in part on the PDF, the cost, and the collision probability. 12. The apparatus of claim 11, in which the movement policy is a closed loop policy that determines movement to the end node from any of the plurality of nodes. 13. The apparatus of claim 11, further comprising means for determining the cost and the collision probability for each edge by calculating cost values and collision events for each of a plurality of samples associated with each edge. 14. The apparatus of claim 11, further comprising means for stabilizing a probability distribution function for a robot state in a vicinity of each selected node to the PDF of the selected node. 15. The apparatus of claim 11, in which a first cost and a first collision probability of a first edge of a plurality of edges is independent of a second cost and a second collision probability of a second edge of the plurality of edges. 16. A non-transitory computer-readable medium having program code recorded thereon, the program code being executed by a processor and comprising: program code to determine a probability distribution function (PDF) for a plurality of nodes of a roadmap, the plurality of nodes including at least a start node, an end node, and at least two intermediary nodes; program code to determine, in parallel, a cost and a collision probability for each edge of the roadmap, and each edge connecting two of the plurality of nodes; and program code to generate a movement policy based at least in part on the PDF, the cost, and the collision probability. 17. The non-transitory computer-readable medium of claim 16, in which the movement policy is a closed loop policy that determines movement to the end node from any of the plurality of nodes. 18. The non-transitory computer-readable medium of claim 16, in which the program code further comprises program code to determine the cost and the collision probability for each edge by calculating cost values and collision events for each of a plurality of samples associated with each edge. 19. The non-transitory computer-readable medium of claim 16, in which the program code further comprises program code to stabilize a probability distribution function for a robot state in a vicinity of each selected node to the PDF of the selected node. 20. The non-transitory computer-readable medium of claim 16, in which a first cost and a first collision probability of a first edge of a plurality of edges is independent of a second cost and a second collision probability of a second edge of the plurality of edges.