Sciweavers

622 search results - page 15 / 125
» Solving the Robots Gathering Problem
Sort
View
CP
2008
Springer
13 years 9 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus
ICRA
2003
IEEE
120views Robotics» more  ICRA 2003»
14 years 1 months ago
Inverse dynamics of gel robots made of electro-active polymer gel
— This paper formulates and solves the inverse dynamics problem of deformable robots made entirely of electro-active polymer gel. One of the primary difficulties with deformable...
Mihoko Otake, Yoshiharu Kagami, Yasuo Kuniyoshi, M...
ICRA
2002
IEEE
144views Robotics» more  ICRA 2002»
14 years 21 days ago
Simultaneous Localization and Mapping with Detection and Tracking of Moving Objects
Both simultaneous localization and mapping (SLAM) and detection and tracking of moving objects (DTMO) play key roles in robotics and automation. For certain constrained environmen...
Chieh-Chih Wang, Charles E. Thorpe
ICRA
2010
IEEE
111views Robotics» more  ICRA 2010»
13 years 6 months ago
Multi-tasking SLAM
— The problem of simultaneous localization and mapping (SLAM) is one of the most studied in the robotics literature. Most existing approaches, however, focus on scenarios where l...
Arthur Guez, Joelle Pineau
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
14 years 2 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso