A deterministic path planning algorithm for manipulators

ISBN-13: 9786138258162 / Angielski / Miękka / 96 str.

Shinsuke Tamura

Opis

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.

O autorze

Tamura, ShinsukeShinsuke Tamura received B.S., M.S. and Dr. (Eng.) degrees in Control Engineering from Osaka University in 1970, 1972 and 1991, respectively. From 1972 to 2001, he worked for Toshiba Corporation, and from 2001 to 2013, he was a professor at the Department of Information Science, University of Fukui.