Sciweavers

914 search results - page 30 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
ICRA
2006
IEEE
114views Robotics» more  ICRA 2006»
15 years 5 months ago
Multi-level Free-space Dilation for Sampling narrow Passages in PRM Planning
— Free-space dilation is an effective approach for narrow passage sampling, a well-recognized difficulty in probabilistic roadmap (PRM) planning. Key to this approach are method...
David Hsu, Gildardo Sánchez-Ante, Ho-Lun Ch...
IROS
2008
IEEE
171views Robotics» more  IROS 2008»
15 years 6 months ago
Motion planning in urban environments: Part I
— We present the motion planning framework for an autonomous vehicle navigating through urban environments. Such environments present a number of motion planning challenges, incl...
Dave Ferguson, Thomas M. Howard, Maxim Likhachev
IROS
2008
IEEE
172views Robotics» more  IROS 2008»
15 years 6 months ago
Motion planning in urban environments: Part II
— We present the motion planning framework for an autonomous vehicle navigating through urban environments. Such environments present a number of motion planning challenges, incl...
Dave Ferguson, Thomas M. Howard, Maxim Likhachev
CEC
2007
IEEE
15 years 6 months ago
Evolving tiles for automated self-assembly design
Abstract— Self-assembly is a distributed, asynchronous mechanism that is pervasive across natural systems where hierarchical complex structures are built from the bottom-up. The ...
Germán Terrazas, Marian Gheorghe, Graham Ke...
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 2 days ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...