• Anglický jazyk

A deterministic path planning algorithm for manipulators

Autor: Shinsuke Tamura

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... Viac o knihe

Na objednávku, dodanie 2-4 týždne

34.20 €

bežná cena: 38.00 €

O knihe

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.

  • Vydavateľstvo: GlobeEdit
  • Rok vydania: 2022
  • Formát: Paperback
  • Rozmer: 220 x 150 mm
  • Jazyk: Anglický jazyk
  • ISBN: 9786138258162

Generuje redakčný systém BUXUS CMS spoločnosti ui42.