Login / Signup

Electing an Approximate Center in a Huge Modular Robot with the k-BFS SumSweep Algorithm.

Andre NazBenoît PirandaJulien BourgeoisSeth Copen Goldstein
Published in: IROS (2018)
Keyphrases
  • np hard
  • learning algorithm
  • search space
  • dynamic programming
  • genetic algorithm
  • reinforcement learning
  • optimal solution
  • search algorithm
  • computer simulation
  • convergence rate