Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805)

From MaRDI portal
Revision as of 12:27, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
scientific article

    Statements

    Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2016
    0 references
    robot network
    0 references
    de Bruijn graph
    0 references
    graph decomposition
    0 references
    pose estimation
    0 references
    linear feedback shift register
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references