Sciweavers

122 search results - page 4 / 25
» Incremental Sampling-based Algorithms for Optimal Motion Pla...
Sort
View
AAAI
2008
15 years 3 days ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
ICRA
2002
IEEE
115views Robotics» more  ICRA 2002»
15 years 2 months ago
DEEP: Dual-Space Expansion for Estimating Penetration Depth Between Convex Polytopes
Abstract— We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution”...
Young J. Kim, Ming C. Lin, Dinesh Manocha
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
FSR
2007
Springer
135views Robotics» more  FSR 2007»
15 years 4 months ago
State Space Sampling of Feasible Motions for High Performance Mobile Robot Navigation in Highly Constrained Environments
Sampling in the space of controls or actions is a well-established method for ensuring feasible local motion plans. However, as mobile robots advance in performance and competence ...
Thomas M. Howard, Colin J. Green, Alonzo Kelly
ICCV
2001
IEEE
15 years 11 months ago
Propagation of Innovative Information in Non-Linear Least-Squares Structure from Motion
We present a new technique that improves upon existing structure from motion (SFM) methods. We propose a SFM algorithm that is both recursive and optimal. Our method incorporates ...
Drew Steedly, Irfan A. Essa