Multi-flocking of networked non-holonomic mobile robots with proximity graphs (Q6976232)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8048486
Language Label Description Also known as
default for all languages
No label defined
    English
    Multi-flocking of networked non-holonomic mobile robots with proximity graphs
    scientific article; zbMATH DE number 8048486

      Statements

      Multi-flocking of networked non-holonomic mobile robots with proximity graphs (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      2 June 2025
      0 references
      multi-robot systems
      0 references
      mobile robots
      0 references
      graph theory
      0 references
      collision avoidance
      0 references
      algebra
      0 references
      multiflocking
      0 references
      networked nonholonomic mobile robots
      0 references
      proximity graphs
      0 references
      neighbouring information
      0 references
      distributed control protocol
      0 references
      potential function
      0 references
      algebraic graph theory
      0 references
      barbalat lemma
      0 references
      connectivity preservation
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references