Path Planning in the Presence of Dynamically Moving Obstacles with Uncertainty
In this paper, the problem of path-planning with dynamically moving elliptical obstacles is addressed. A new analytical result for computing the axes aligned bounding box for the ellipses with bounded uncertainty in the position of the centre and the orientation is presented. Genetic algorithm is utilised for finding the shortest path from the initial to goal position avoiding the moving obstacles.
Defence Science Journal, 2010, 60(1), pp.55-60, DOI:http://dx.doi.org/10.14429/dsj.60.107
Where otherwise noted, the Articles on this site are licensed under Creative Commons License: CC Attribution-Noncommercial-No Derivative Works 2.5 India