Excerpt from Robotics Research Technical Report
U) Work on this paper by the firs: author has been supported in part by a grant from the o.s.-israeli Binational Science Foundation.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
EUR 14,90 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoEUR 0,66 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoLibrería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332092253
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332092253
Cantidad disponible: 15 disponibles
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: 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 ref. del artículo: 9781332092253_0
Cantidad disponible: Más de 20 disponibles
Librería: Buchpark, Trebbin, Alemania
Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 26050921/2
Cantidad disponible: 1 disponibles