ML Anthology

2-Degree-of-Freedom Robot Path Planning Using Cooperative Neural Fields

Michael Lemmon
NeCo 1991 pp. 350-362
doi:10.1162/NECO.1991.3.3.350 /neco/1991/lemmon1991neco-2degreeoffreedom/

Abstract

This paper proposes a neural network solution to path planning by two degree-of-freedom (DOF) robots. The proposed network is a two-dimensional sheet of neurons forming a distributed representation of the robot's workspace. Lateral interconnections between neurons are “cooperative,” so that the field exhibits oscillatory behavior. This paper shows how that oscillatory behavior can be used to solve the path-planning problem. The results reported show that the proposed neural network finds the variational solution of Bellman's dynamic programming equation.

NeCo Semantic Scholar

Cite

Text

Lemmon. "2-Degree-of-Freedom Robot Path Planning Using Cooperative Neural Fields." Neural Computation, 1991. doi:10.1162/NECO.1991.3.3.350

Markdown

[Lemmon. "2-Degree-of-Freedom Robot Path Planning Using Cooperative Neural Fields." Neural Computation, 1991.](https://mlanthology.org/neco/1991/lemmon1991neco-2degreeoffreedom/) doi:10.1162/NECO.1991.3.3.350

BibTeX

@article{lemmon1991neco-2degreeoffreedom,
  title     = {{2-Degree-of-Freedom Robot Path Planning Using Cooperative Neural Fields}},
  author    = {Lemmon, Michael},
  journal   = {Neural Computation},
  year      = {1991},
  pages     = {350-362},
  doi       = {10.1162/NECO.1991.3.3.350},
  volume    = {3},
  url       = {https://mlanthology.org/neco/1991/lemmon1991neco-2degreeoffreedom/}
}