抄録
This paper presents a navigation scheme for a mobile robot which works even in an environment with multiple moving obstacles. An “iterated forecast and planning” approach is proposed by the authors. It is assumed that each obstacle moves at a constant velocity in the approach. The most feasible path for a robot is planned in (x, y, t) space. The planning and motion according to the plan are iterated frequently to cope with changes of motion of the moving obstacles. The behavior of proposed navigation algorithm is also presented by means of computer simulations.
