C. Behring

Learn More
The application of Cellular Automata to the problem of robot path planning is presented. It is shown that a Cellular Automata allows the efficient computation of an optimal collision free path from an initial to a goal configuration on a physical space cluttered with obstacles. The cellular space represents a discrete version of the workspace for a mobile(More)
  • 1