Articles liés à Robotics Research Technical Report (Classic Reprint)
Synopsis
Robotics Research Technical Report (Classic Reprint)
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 18,94
EUR 1,06 expédition depuis Etats-Unis vers France
Destinations, frais et délais
Résultats de recherche pour Robotics Research Technical Report (Classic Reprint)
Image d'archives
Robotics Research Technical Report Classic Reprint
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332092253
Quantité disponible : 15 disponible(s)
Image d'archives
Robotics Research Technical Report Classic Reprint
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332092253
Quantité disponible : 15 disponible(s)
Image d'archives
Robotics Research Technical Report (Classic Reprint)
Edité par
Forgotten Books, 2015
ISBN 10 : 133209225X
ISBN 13 : 9781332092253
Ancien ou d'occasion
Couverture souple
Vendeur : Buchpark, Trebbin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 26050921/2
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Robotics Research Technical Report (Classic Reprint)
impression à la demandeVendeur : Forgotten Books, London, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. Print on Demand. This book explores the mathematical challenges and solutions surrounding finding the shortest paths between points in three-dimensional spaces bounded by polyhedral surfaces. It begins by addressing the two-dimensional case before tackling the more complex three-dimensional problem, which can also be applied to situations where barriers are aligned in a specific way along a straight line. The author provides a doubly exponential-time solution to this discrete subproblem of determining the sequence of boundary edges through which the shortest path passes. The book also offers an algorithm for solving the problem of finding the shortest path along the surface of a convex polyhedron in time O(n^3 log n), where n is the number of obstacle corners. Through its exploration of the theoretical underpinnings of pathfinding in bounded spaces, this book makes a significant contribution to the field of robotics and related disciplines. By providing efficient algorithms for solving these problems, the author opens up new possibilities for the optimization of path planning in a wide range of applications. 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 9781332092253_0
Quantité disponible : Plus de 20 disponibles