Motion planning is one of the most important areas of robotics research. The complexity of
the motion-planning problem has hindered the development of practical algorithms. This …

This paper will present an algorithm for path planning to a goal with a mobile robot in an
unknown environment. The robot maps the environment only to the extent that is necessary …

This paper examines the problem of locating a mobile, non-adversarial target in an indoor
environment using multiple robotic searchers. One way to formulate this problem is to …

Two problems for path planning of a mobile robot are considered. The first problem is to find
a shortest-time, collision-free path for the robot in the presence of stationary obstacles in two …

A simple time delay method for avoiding collisions between two general robot arms is
proposed. Links of the robots are approximated by polyhedra and the danger of collision …

An approach to robot-path planning is developed by considering both the traveling distance
and the safety of the robot. A computationally-efficient algorithm is developed to find a near …

We propose a probabilistic approach to the problem of global path planning with uncertainty
for mobile robots in a dynamic manufacturing environment. To model the changing …

In this paper, we examine the problem of locating a non-adversarial target using multiple
robotic searchers. This problem is relevant to many applications in robotics including …

Presents a path planning algorithm to solve the find path problem in mapped environments.
The moving objects considered in this paper can be any shape, which is approximated by its …

In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion
domain. We examine the problem of multiple robotic pursuers attempting to locate a non …