Complexity of the Mover's Problem and Generalizations Extended Abstract

TL;DR: The first known computational complexity hardness result for the 3D version of this problem is provided; the problem is PSPACE hard; and the first known efficient approximation algorithms with bounded error are given.

TL;DR: An alternative approach is proposed, which aims at the fast falsification of safety properties; this approach provides the designer with a complementary set of tools to the ones based on conservative analysis, providing additional insight into the characteristics of the system under analysis.

TL;DR: The goal is to find interesting cases for which the solution can be obtained without the explicit construction of the entire visibility graph, which solve the problems by constructing the shortest-path tree from the source to all the vertices of the obstacles and to the destination.

TL;DR: It is shown that, given the target position, local feedback information is sufficient to guarantee reaching a global objective and present a nonheuristic algorithm which generates reasonable—if, in general, not optimal—collision-free paths.

TL;DR: The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is investigated and a specific set is produced, namely the set of all codings of threadable mazes, such that, if there is any set which distinguishes nondeter microscopic complexity classes from deterministic tape complexity classes, then this is one such set.

TL;DR: The main theme of the research is the integration of the necessary planning systems, models of the world, and sensory processing systems into an efficient whole capable of performing a wide range of tasks in a real environment.

TL;DR: In modelling the author uses a symbolic data structure to represent objects in the environment and a planning program interprets symbolic arm control instructions and generates a plan consisting of arm motions and hand actions.

TL;DR: Multicolored pile materials, and particularly pile carpets, comprising a fabricated backing and a fabricated pile face having: (1) upper pile face portions which are substantially white in color; and (2) lower pile face portion which have a color which is different and darker than white, whereby unusual multicolored, frosted effects are obtained.