On the Combinatorial Complexity of Motion Coordination (Classic Reprint) - Softcover

Inhaltsangabe

Excerpt from On the Combinatorial Complexity of Motion Coordination

In this set~up, unidirectional motions are modelled by directed edges and we also may consider one-pass vertices: A vertex is one-pass if no additional pebbles can visit it as soon as a single pebble passes through it. In this paper, we provide evidence that the (geometric) motion planning problem is harder than the problem of motion.

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.