Sciweavers

622 search results - page 32 / 125
» Solving the Robots Gathering Problem
Sort
View
SIROCCO
2008
13 years 9 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
IROS
2008
IEEE
121views Robotics» more  IROS 2008»
14 years 2 months ago
Online ZMP sampling search for biped walking planning
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
Jinsu Liu, Manuela M. Veloso
ICRA
2006
IEEE
117views Robotics» more  ICRA 2006»
14 years 1 months ago
Novel Design and Modeling of a Mobile Parallel Manipulator
— A novel design of a mobile parallel manipulator (MPM), which is composed by a multi-degree of freedom (DOF) parallel robot and an autonomous wheeled mobile platform, is propose...
Yangmin Li, Qingsong Xu, Yugang Liu
CDC
2010
IEEE
154views Control Systems» more  CDC 2010»
13 years 2 months ago
Multi-robot SLAM using M-Space feature representation
This paper presents a SLAM algorithm for a team of mobile robots exploring an indoor environment, described by adopting the M-Space representation of linear features. Each robot so...
Daniele Benedettelli, Andrea Garulli, Antonio Gian...
ICRA
2003
IEEE
118views Robotics» more  ICRA 2003»
14 years 1 months ago
Capturing a convex object with three discs
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
Jeff Erickson, Shripad Thite, Fred Rothganger, Jea...