Motion planning
AssigneeNVIDIA Corporation
InventorDavid Nister
Life of this patent
Estimating the term…
Loading patent…
AssigneeNVIDIA Corporation
InventorDavid Nister
Estimating the term…
Path planning may be performed under non-holonomic constraints based at least on discretizing and selectively analyzing a solution space using a graph that includes vertices corresponding to machine configurations in a configuration space, along with associated maneuver types used by the machine to traverse these configurations. The graph may include transition edges associating costs with machine transitions between maneuver types and maneuvers. One or more of the vertices may correspond to a transition state between maneuver types. In some examples, a maneuver type may be used as a transition state between maneuver types to reduce the vertices and edges of the graph. The graph may incorporate vertices and edges representing optimal maneuver types for traversing the configuration space, including longitudinally extremal and/or laterally extremal maneuvers based on machine models.
A method comprising:
A system comprising:
At least one processor comprising:
Dependencies are inferred from the claim text.