— We present a novel algorithm for motion planning of multiple robots amongst dynamic obstacles. Our approach is based on a new roadmap representation that uses deformable links ...
Russell Gayle, Avneesh Sud, Ming C. Lin, Dinesh Ma...
— We develop a framework to allow generic object detection algorithms to exploit geometric information commonly available to robot vision systems. Robot systems take pictures wit...
Michael Dixon, Frederick Heckel, Robert Pless, Wil...
Abstract— We address the problem of determining and obtaining the visibility of a moving target from multiple angles using a mobile robot. The pursuer uses a modified form of pu...
Abstract— Tactile telepresence has been expected to be technology which encourages operators of robotic systems to remotely maneuver objects or recognize materials being touched ...
— In this paper, we studied how a mobile robot equipped with a 3D laser scanner can start from primitive behaviors and learn to use them to achieve goal-directed behaviors. For t...
Mehmet Remzi Dogar, Maya Cakmak, Emre Ugur, Erol S...
— This paper presents the development of a contact interaction-based navigation strategy for a biped humanoid robot with the aim of supporting current visual-based navigation. Th...
Hanafiah B. Yussof, Mitsuhiro Yamano, Masahiro Ohk...
— We present in this article a simple method to estimate an IPM view from an embedded camera. The method is based on the tracking of the road markers assuming that the road is lo...
Abstract— Robots are emerging from industrial plants toward every people’s daily life. Thus, navigation in and understanding of human related environments becomes a prerequisit...
Christian Pascal Connette, Oliver Meister, Martin ...
— Any given task can be solved in a number of ways, whether through path-planning, modeling, or control techniques. In this paper, we present a methodology for natural task decom...
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...