A deterministic path planning algorithm for manipulators: - Backtrack free path planning algorithm (BFA) - - Shinsuke Tamura
-25% koodilla BOOKS
Toimitus 15-21 arkipäivässä
30 päivän palautusoikeus
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, ... Täydellinen kuvaus
Saatat myös pitää
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Shinsuke Tamura |
|---|---|
| Julkaisija | GlobeEdit |
| Julkaisuvuosi | 2022 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9786138258162 |