On probabilistic completeness and expected complexity for probabilistic path planning

Publication date

1996

Authors

Svestka, P.

Editors

Advisors

Supervisors

DOI

Document Type

Report
Open Access logo

License

Abstract

Keywords

Wiskunde en Informatica (WIIN), Ordered by external client

Citation

Svestka, P 1996, On probabilistic completeness and expected complexity for probabilistic path planning. vol. 1996-20, UU-CS edn, Utrecht University: Information and Computing Sciences, Utrecht, the Netherlands. < http://www.cs.uu.nl/research/techreps/UU-CS-1996-20.html >