Excerpt from Robotics Research Technical Report: An Efficient Motion Planning Algorithm for a Convex Polygonal Object in 2-Dimensional Polygonal Space
The second algorithm [sis] also reduces the problem to a combinatorial graph searching, but uses a different graph, called the vertex graph, whose nodes are the corners of ff, and whose edges connect pairs of comers that are adjacent along edges of ff, or along some additional auxiliary arcs in ff.
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Forgotten Books, London, Vereinigtes Königreich
Paperback. Zustand: New. Print on Demand. This book explores an efficient algorithm for planning the motion of a convex polygonal object in a 2-dimensional polygonal space. The algorithm extends and combines techniques developed for the case in which the object is a line segment. It uses results on the planning of translational motion of the object amidst polygonal obstacles and a recent result on the number of free critical contacts of the object with such obstacles. The algorithm runs in time O(kn log kn), where k is the number of sides of the object, n is the number of obstacle edges, and x(q) is an almost linear function yielding the maximal number of connected portions of q continuous functions which compose the graph of their lower envelope, where it is assumed that each pair of these functions intersect in at most s points. 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. Bestandsnummer des Verkäufers 9781332088805_0
Anzahl: Mehr als 20 verfügbar
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332088805
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332088805
Anzahl: 15 verfügbar