914 search results - page 36 / 183 » The Computational Complexity of Probabilistic Planning |
ICRA
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...
ICRA
2005
IEEE
14 years 4 months ago
2005
IEEE
— Robotic motion planning requires configuration space exploration. In high-dimensional configuration spaces, a complete exploration is computationally intractable. Practical m...
Presentation
In robotic navigation, path planning is aimed at getting the optimum collision-free
path between a starting and target locations. The optimality criterion depends on
the surround...
BMVC
1998
13 years 11 months ago
1998
A new technique is presented for determining the positions where a range sensor should be located to acquire the surfaces of a complex scene. The algorithm consists of two stages....
COLCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
—In disaster areas, office buildings, or at home, multiple autonomous networked mobile robots may act instead of human beings. These robots have to move to their destination so ...