Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane.
Mattia D'EmidioGabriele Di StefanoDaniele FrigioniAlfredo NavarraPublished in: Inf. Comput. (2018)
Keyphrases
- computational power
- euclidean plane
- mobile robot
- parallel processing
- computing power
- path planning
- indoor environments
- dynamic environments
- memory requirements
- graph theory
- multi robot
- autonomous robots
- graph matching
- obstacle avoidance
- motion control
- directed graph
- mobile robotics
- robot control
- collision avoidance
- graph theoretic
- motion planning
- graph structure
- unknown environments
- hardware architectures
- control system
- motion estimation
- undirected graph
- graph databases
- social networks
- bipartite graph