622 search results - page 7 / 125 » Solving the Robots Gathering Problem |
ICRA
2003
IEEE
14 years 1 months ago
2003
IEEE
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— The mapping and localization problems have received considerable attention in robotics recently. The exploration problem that drives mapping has started to generate sim...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, a novel artificial potential function is proposed for planning the path of a robotic sensor in a partially observed environment containing multiple obstacles and mul...