← Search

Adnan Tahirovic

2 accepted papers

2018

Rapidly-Exploring Random Vines (RRV) for Motion Planning in Configuration Spaces with Narrow Passages

ICRA 2018poster

Classical RRT algorithm is blind to efficiently explore configuration space for expanding the tree through a narrow passage when solving a motion planning (MP) problem. Although there have been several attempts to deal with narrow passages which are based on a wide spectrum of assumptions and config…

Cited by 49SourceScholar
2015

A fast cost-to-go map approximation algorithm on known large scale rough terrains

IROS 2015poster

Obtaining the optimal cost-to-go map for large scale rough terrains is computationally very expensive both in terms of duration and memory resources. A fast algorithm for approximation of the optimal cost-to-go map in terms of terrain traversability measures for path planning on known large scale ro…

Cited by 4SourceScholar