A deterministic path planning algorithm for manipulators: - Backtrack free path planning algorithm (BFA) - - Shinsuke Tamura
-25% su kodu BOOKS
Pristatymas per 15-21 d.d.
30 dienų grąžinimo politika
Different from other available path planning algorithms for manipulators which exploit heuristics extensively, BFA is a deterministic algorithm. It determines whether paths exist or not correctly, and always finds paths if they exist much faster than other algorithms do. Namely, its computation volume is proportional to the number of links and does not change with the complexity of environments. Therefore, ... Visas aprašymas
Jums taip pat gali patikti
Aprašymas
Different from other available path planning algorithms for manipulators which exploit heuristics extensively, BFA is a deterministic algorithm. It determines whether paths exist or not correctly, and always finds paths if they exist much faster than other algorithms do. Namely, its computation volume is proportional to the number of links and does not change with the complexity of environments. Therefore, it is easy to estimate the computation time. Although this book is an English version of the one published in 2018, the computation volume of other deterministic algorithms still increases exponentially with the number of links.
Daugiau informacijos
| Autorius | Shinsuke Tamura |
|---|---|
| Leidėjas | GlobeEdit |
| Išleidimo metai | 2022 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9786138258162 |