Dynamic motion planning in low obstacle density environments

Abstract

A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. The weak and realistic low obstacle density (L.O.D.) assumption results in linear complexity in the number of obstacles of the free space (Van der Stappen et al., 1997). In this paper we address the dynamic version of the motion planning problem in which a robot moves among polygonal obstacles which move along polylines. The obstacles are assumed to move along constant complexity polylines, and to respect the low density property at any given time. We will show that in this situation a cell decomposition of the free space of size O( n 2 α( n) log 2 n) can be computed in O( n 2 α( n) log 2 n) time. The dynamic motion planning problem is then solved in O( n 2 α( n) log 3 n) time. We also show that these results are close to optimal.