An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767)

From MaRDI portal
Revision as of 16:08, 4 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
scientific article

    Statements

    An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 September 2002
    0 references
    collision-free path planning problem
    0 references
    point robot
    0 references

    Identifiers