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.


    Access

    Download


    Export, share and cite



    Title :

    GRAPHS FOR NON-HOLONOMIC MOTION PLANNING FOR AUTONOMOUS SYSTEMS AND APPLICATIONS


    Contributors:

    Publication date :

    2024-12-05


    Type of media :

    Patent


    Type of material :

    Electronic Resource


    Language :

    English


    Classification :

    IPC:    B60W CONJOINT CONTROL OF VEHICLE SUB-UNITS OF DIFFERENT TYPE OR DIFFERENT FUNCTION , Gemeinsame Steuerung oder Regelung von Fahrzeug-Unteraggregaten verschiedenen Typs oder verschiedener Funktion






    Motion planning for parallel robots with non-holonomic joints

    Tchon, Krzysztof / Jakubiak, Janusz / Grosch Obregon, Patrick John et al. | BASE | 2012

    Free access

    Motion planning for parallel robots with non-holonomic joints

    Tchoń, Krzysztof / Jakubiak, Janusz / Grosch, Patrick et al. | BASE | 2012

    Free access