Sciweavers

547 search results - page 16 / 110
» A Planning Algorithm not based on Directional Search
Sort
View
ICRA
2007
IEEE
113views Robotics» more  ICRA 2007»
14 years 2 months ago
Sampling-Based Motion Planning With Sensing Uncertainty
Abstract— Sampling-based algorithms have dramatically improved the state of the art in robotic motion planning. However, they make restrictive assumptions that limit their applic...
Brendan Burns, Oliver Brock
CCCG
1996
13 years 9 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
ICRA
2003
IEEE
144views Robotics» more  ICRA 2003»
14 years 1 months ago
Error-tolerant execution of complex robot tasks based on skill primitives
— This paper presents a general approach to specify and execute complex robot tasks considering uncertain environments. Robot tasks are defined by a precise definition of socal...
Ulrike Thomas, Bernd Finkemeyer, Torsten Krög...
AAAI
2011
12 years 7 months ago
Exploiting Problem Symmetries in State-Based Planners
Previous research in Artificial Intelligence has identified the possibility of simplifying planning problems via the identification and exploitation of symmetries. We advance t...
Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein
ICCBR
2005
Springer
14 years 1 months ago
Learning to Win: Case-Based Plan Selection in a Real-Time Strategy Game
While several researchers have applied case-based reasoning techniques to games, only Ponsen and Spronck (2004) have addressed the challenging problem of learning to win real-time ...
David W. Aha, Matthew Molineaux, Marc J. V. Ponsen