Cox James Yap Chee Keng (3 results)

Condition: New. SUPER FAST SHIPPING.

Paperback. Condition: New. Print on Demand. This book develops an algorithm for planning the motion of a rod-shaped object within a two-dimensional space containing obstacles bounded by simple, closed polygons. While previous approaches to motion planning assumed the planning algorithm had an explicit description of the scene as input, the author develops an algorithm that does not require this. Instead, it only requires the algorithm to be able to obtain information about obstacles by detecting points of contact with the obstacles. The computational complexity of the algorithm is O(n^2), which is optimal for the general motion planning problem. The book thus advances the field of motion planning and will be of interest to researchers working in robotics and other areas that require autonomous motion. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.

Condition: New. Print on Demand pp. 38.