Probabilistic Analysis of Sampling based Path Planning Algorithms

Bera, Titas and Bhat, Seetharama M and Ghose, D (2013) Probabilistic Analysis of Sampling based Path Planning Algorithms. In: IEEE International Symposium on Intelligent Control (ISIC) held as Part of 7th IEEE Multi-Conference on Systems and Control, AUG 28-30, 2013, Hyderabad, INDIA, pp. 370-375.

PDF IEEE_Int_Sym_Int_Con_370_2013.pdf - Published Version Restricted to Registered users only Download (187kB) | Request a copy

Abstract

In this paper we investigate probabilistic completeness and asymptotic optimality of various existing randomized sampling based algorithms such as, probabilistic roadmap methods (PRM) and its many variants. We give new alternate proofs to many such existing theorems regarding probabilistic completeness and asymptotic optimality, in both incremental and independent random problem model framework.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Intelligent Control
Publisher:	IEEE, NEW YORK
Additional Information:	Copy right for this article belongs to the IEEE International Symposium on Intelligent Control (ISIC) held as Part of 7th IEEE Multi-Conference on Systems and Control, Hyderabad, INDIA, AUG 28-30, 2013
Department/Centre:	Division of Mechanical Sciences > Aerospace Engineering(Formerly Aeronautical Engineering)
Date Deposited:	24 Aug 2016 09:52
Last Modified:	24 Aug 2016 09:52
URI:	http://eprints.iisc.ac.in/id/eprint/54583

Actions (login required)

View Item