Efficient Path Planning with Soft Homology Constraints
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911935670255616 |
|---|---|
| author | Taveras, Carlos A. Segarra, Santiago Uribe, César A. |
| author_facet | Taveras, Carlos A. Segarra, Santiago Uribe, César A. |
| contents | We study the problem of path planning with soft homology constraints on a surface topologically equivalent to a disk with punctures. Specifically, we propose an algorithm, named $\Hstar$, for the efficient computation of a path homologous to a user-provided reference path. We show that the algorithm can generate a suite of paths in distinct homology classes, from the overall shortest path to the shortest path homologous to the reference path, ordered both by path length and similarity to the reference path. Rollout is shown to improve the results produced by the algorithm. Experiments demonstrate that $\Hstar$ can be an efficient alternative to optimal methods, especially for configuration spaces with many obstacles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_19551 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Efficient Path Planning with Soft Homology Constraints Taveras, Carlos A. Segarra, Santiago Uribe, César A. Optimization and Control Computational Geometry Robotics We study the problem of path planning with soft homology constraints on a surface topologically equivalent to a disk with punctures. Specifically, we propose an algorithm, named $\Hstar$, for the efficient computation of a path homologous to a user-provided reference path. We show that the algorithm can generate a suite of paths in distinct homology classes, from the overall shortest path to the shortest path homologous to the reference path, ordered both by path length and similarity to the reference path. Rollout is shown to improve the results produced by the algorithm. Experiments demonstrate that $\Hstar$ can be an efficient alternative to optimal methods, especially for configuration spaces with many obstacles. |
| title | Efficient Path Planning with Soft Homology Constraints |
| topic | Optimization and Control Computational Geometry Robotics |
| url | https://arxiv.org/abs/2406.19551 |