On probabilistic completeness and expected complexity for probabilistic path planning

DSpace/Manakin Repository

On probabilistic completeness and expected complexity for probabilistic path planning
 
Svestka, P.
(1996) Utrecht University Repository
(Report)
Download/Full Text
Open Access version via Utrecht University Repository Unknown
 
Keywords: Wiskunde en Informatica (WIIN), Ordered by external client
ISBN: 0924-3275
Publisher: Utrecht University: Information and Computing Sciences
 
 
See more statistics about this item