Vendeur
PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Vendeur AbeBooks depuis 7 avril 2005
New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332141555
The digital edition of all books may be viewed on our website before purchase. Excerpt from How to Move a Chair Through a Door (Classic Reprint)
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Titre : How to Move a Chair Through a Door Classic ...
Éditeur : Forgotten Books
Date d'édition : 2019
Reliure : PAP
Etat : New
Vendeur : Buchpark, Trebbin, Allemagne
Etat : Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. N° de réf. du vendeur 26062229/1
Quantité disponible : 1 disponible(s)
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. Print on Demand. This book explores how to solve motion-planning problems in robotics, where a robot must plan its movements to navigate around obstacles in its environment. The focus of this book is on one specific type of motion-planning problem, known as the door-width problem. The door-width problem asks how wide a door must be for a given robot to pass through it. The author develops an algorithm that can compute the door-width of a robot in O(n^2) time, where n is the number of vertices in the robot's polygonal representation. This algorithm is optimal among algorithms that must construct a graph of size O(n^3). The author also discusses several other related problems, such as the ring-width problem and the elastic width problem. These problems ask how wide a ring or an elastic band must be for a robot to pass through it. The author concludes by discussing the significance of these insights on the broader field of motion planning. 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. N° de réf. du vendeur 9781332141555_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332141555
Quantité disponible : 15 disponible(s)