This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile senso...
— This paper introduces a planning method for handling furniture which exists in real world. We propose a method which is easily expandable its handle able furniture such as clos...
We introduce a new algorithm to cover an unknown space with a homogeneous team of circular mobile robots. Our approach is based on a single robot coverage algorithm, a boustrophed...
DeWitt Latimer IV, Siddhartha S. Srinivasa, Vincen...
— This paper presents an approach to time-optimal kinodynamic motion planning for a mobile robot. A global path planner is used to generate collision-free straight-line paths fro...