Exploring foci of:
arXiv (Cornell University)
Greedy Heuristics for Sampling-Based Motion Planning in High-Dimensional State Spaces
May 2024 • Phone Thiha Kyaw, Anh Vu Le, Lim Yi, Prabakaran Veerajagadheswar, Mohan Rajesh Elara, Dinh Tung Vo, Bùi Vũ Minh
Informed sampling techniques accelerate the convergence of sampling-based motion planners by biasing sampling toward regions of the state space that are most likely to yield better solutions. However, when the current solution path contains redundant or tortuous segments, the resulting informed subset may remain unnecessarily large, slowing convergence. Our prior work addressed this issue by introducing the greedy informed set, which reduces the sampling region based on the maximum heuristic cost along the current…
Computer Science
Motion
Artificial Intelligence
Theoretical Computer Science
Mathematics
Algorithm
Computer Vision
Robot