A deterministic path planning algorithm for manipulators: - Backtrack free path planning algorithm (BFA) - - Shinsuke Tamura
-20% with code BOOKS
Shipping in 15-21 days
30-day return policy
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, ... Full description
You May Also Like
Description
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.
More Information
| Author | Shinsuke Tamura |
|---|---|
| Publisher | GlobeEdit |
| Release year | 2022 |
| Cover type | Softcover |
| EAN | 9786138258162 |