A hierarchical strategy for path planning among moving obstacles (mobile robot)

摘要

A method is presented for planning a path in the presence of moving obstacles. Given a set of polygonal moving obstacles, the authors focus on generating a path for a mobile robot that navigates in the two-dimensional plane. Their methodology is to include time as one of the dimensions of the model world. This enables the authors to regard the moving obstacles as being stationary in the extended world. For a solution to be feasible, the robot must not collide with any other moving obstacles, and, also, it must navigate without exceeding the predetermined range of velocity, acceleration, and centrifugal force. The authors investigate an appropriate model to represent the extend world for the path-planning task, and give a time-optimal solution using this model.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>