Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search
Path planning in robotics often requires finding high-quality solutions to continuously valued and/or high-dimensional problems. These problems are challenging and most planning algorithms instead solve simplified approximations. Popular approximations include graphs and random samples, as used by i...
| Автори: | , , |
|---|---|
| Формат: | Journal article |
| Мова: | English |
| Опубліковано: |
SAGE Publications
2020
|