Robot Motion Planning: A Game-Theoretic Foundation

@article{LaValle2000RobotMP,
  title={Robot Motion Planning: A Game-Theoretic Foundation},
  author={Steven M. LaValle},
  journal={Algorithmica},
  year={2000},
  volume={26},
  pages={430-465}
}
Analysis techniques and algorithms for basic path planning have become quite valuable in a variety of applications such as robotics, virtual prototyping, computer graphics, and computational biology. Yet, basic path planning represents a very restricted version of general motion planning problems often encountered in robotics. Many problems can involve complications such as sensing and model uncertainties, nonholonomy, dynamics, multiple robots and goals, optimality criteria, unpredictability… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

55 Citations

0510'98'02'07'12'17
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 100 references

A Game-Theoretic Framework for Robot Motion Planning

  • S. M. LaValle
  • PhD thesis,
  • 1995
Highly Influential
9 Excerpts

Stochastic Systems

  • P. R. Kumar, P. Varaiya
  • Prentice-Hall, Englewood Cli s, NJ
  • 1986
Highly Influential
5 Excerpts

Automatic systhesis of ne-motion strategies for robots

  • T. Lozano-P erez, M. T. Mason, R. H. Taylor
  • Int. J. Robot. Res.,
  • 1984
Highly Influential
5 Excerpts

On the piano movers' problem: II

  • J. T. Schwartz, M. Sharir
  • General techniqies for computing topological…
  • 1983
Highly Influential
12 Excerpts

Similar Papers

Loading similar papers…