Sciweavers

622 search results - page 39 / 125
» Solving the Robots Gathering Problem
Sort
View
IJRR
2007
60views more  IJRR 2007»
13 years 7 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
RAS
2000
119views more  RAS 2000»
13 years 7 months ago
Benchmarking cerebellar control
Cerebellar models have long been advocated as viable models for robot dynamics control. Building on an increasing insight in and knowledge of the biological cerebellum, many model...
P. Patrick van der Smagt
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
14 years 1 months ago
Fast Implementation of Lemke's Algorithm for Rigid Body Contact Simulation
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
John E. Lloyd
OPODIS
2008
13 years 9 months ago
Rendezvous of Mobile Agents When Tokens Fail Anytime
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
Shantanu Das, Matús Mihalák, Rastisl...
ICRA
2010
IEEE
121views Robotics» more  ICRA 2010»
13 years 6 months ago
On the global optimum of planar, range-based robot-to-robot relative pose estimation
Abstract— In this paper, we address the problem of determining the relative position and orientation (pose) of two robots navigating in 2D, based on known egomotion and noisy rob...
Nikolas Trawny, Stergios I. Roumeliotis