A distributed algorithm to estimate node counts in self-organizing ring topologies.
Dennis SchwerdelMatthias PriebePaul MüllerPublished in: CCNC (2011)
Keyphrases
- detection algorithm
- experimental evaluation
- estimation algorithm
- computational complexity
- preprocessing
- dynamic programming
- optimization algorithm
- learning algorithm
- improved algorithm
- optimal solution
- graph structure
- np hard
- mobile robot
- worst case
- path planning
- distributed systems
- high accuracy
- genetic algorithm
- cost function
- k means
- search space
- clustering algorithm
- particle swarm optimization
- computational cost
- matching algorithm
- significant improvement
- times faster
- estimation error
- undirected graph
- finding the shortest path