Open AccessProceedings Article
Complexity of the Mover's Problem and Generalizations Extended Abstract
John H. Reif
- 01 Jan 1979
pp 421-427
878
TL;DR: This paper concerns the problem of moving a polyhedron through Euclidean space while avoiding polyhedral obstacles.
read more
About: This article is published in Foundations of Computer Science. The article was published on 01 Jan 1979. and is currently open access.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Dissertation
Navigation autonome en environnement dynamique : une approche par déformation de trajectoire
Vivien Delsart
- 11 Oct 2010
TL;DR: In this paper, the authors propose an approach for deformation de mouvement of a robot in order to solve the problem of navigation in environnement dynamique and incertain.
•Dissertation
Sampling-based motion planning algorithm to handle a narrow passage problem = 좁은 길 문제를 해결하기 위한 샘플링 기반 모션 플래닝 알고리즘
Jung-Hwan Lee,이정환 +1 more
- 01 Jan 2014
TL;DR: This thesis presents a novel kinodynamic motion planner designed for complex dynamics environments with many obstacles, and defines a motion database that is constructed as a preprocessing and can replace time-consuming propagation function integration of kinodynamic sampling-based planners.
The Beginnings of Robotics Research
Matthew T. Mason
- 01 Jan 2012
TL;DR: The early goals, perspectives and accomplishments of robotics research are reviewed in this paper, where the authors focus on uncertainty and structured versus unstructured environments, and the main ideas are: • Robotics research began with teleoperation in the 40's and 50's.
Distributed Safe Learning and Planning for Multi-robot Systems
Zhenyuan Yuan,Minghui Zhu +1 more
TL;DR: A distributed safe learning and planning algorithm is developed that allows the robots to learn about the external unknown disturbances and safely navigate through the environment via their single trajectories by leveraging set-valued analysis.
The anatomy of a distributed motion planning roadmap
Sam Ade Jacobs,Nancy M. Amato +1 more
- 06 Nov 2014
TL;DR: An argument is made and experimental results are provided that show that motion planning problems involving heterogenous environments (common in most realistic and large-scale motion planning) is a natural fit for spatial subdivision-based parallel processing.
References
An algorithm for planning collision-free paths among polyhedral obstacles
TL;DR: A collision avoidance algorithm for planning a safe path for a polyhedral object moving among known polyhedral objects that transforms the obstacles so that they represent the locus of forbidden positions for an arbitrary reference point on the moving object.
Relationships between nondeterministic and deterministic tape complexities
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.
1.6K
A mobius automation: an application of artificial intelligence techniques
Nils J. Nilsson
- 07 May 1969
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.
Modelling, trajectory calculation and servoing of a computer controlled arm
Richard Paul Collins Paul
- 01 Jan 1972
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.
Topics in computational geometry
Kenneth Jay Supowit
- 01 Jan 1981
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.
36