Centrala begrepp
PINSAT introduces systematic parallelization in INSAT to reduce planning times while maintaining lower costs.
Sammanfattning
PINSAT is an algorithm that combines graph search and trajectory optimization for kinodynamic motion planning. It addresses challenges in long-horizon planning around obstacles by parallelizing the expensive calls to the optimizer. By leveraging edge-based parallel search techniques, PINSAT achieves close to real-time performance with higher success rates compared to INSAT. The algorithm guarantees completeness and aims to explore independence checks for optimality in the future.
Statistik
Threads: 5, 10, 50, 120
Success rate (%): 58, 72, 81, 90 (for different thread budgets)
Time (s): Mean planning time ranges from 0.02s to 0.99s for various thread budgets.
Cost: Mean cost ranges from 4.25 to 9.19 for different thread budgets.
Citat
"We demonstrate PINSAT by evaluating it on 6 DoF kinodynamic manipulation planning with obstacles."
"PINSAT achieves significantly higher success rates than INSAT for all thread budgets greater than 1."
"PINSAT guarantees only completeness at present, but in the future, we aim to explore how to establish independence checks."