On the Movement of Robot Arms in 2-Dimensional Bounded Regions.

Abstract

The classical mover's problem is the following: can a rigid object in 3-dimensional space be moved from one given position to another while avoiding obstacles? It is known that a more general version of this problem involving objects with movable joints is PSPACE complete, even for a simple tree-like structure moving in a 3-dimensional region. In this paper, we investigate a 2-dimensional mover's problem in which the object is a robot arm with an arbitrary number of joints. In particular, we give a polynomial time algorithm for moving an arm confined within a circle from one given configuration to another. We also give a polynomial time algorithm for moving the arm from its initial position to a position in which the end of the arm reaches a given point within the circle. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1982
Accession Number
ADA119507

Entities

People

  • Deborah A. Joseph
  • John E. Hopcroft
  • Sue H. Whitesides

Organizations

  • Cornell University

Tags

Communities of Interest

  • Autonomy
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Computer Science
  • Computers
  • Contracts
  • Integrals
  • Intervals
  • Manipulators
  • New York
  • Orientation (Direction)
  • Polynomials
  • Robotics
  • Robots
  • Sequences
  • Three Dimensional
  • Two Dimensional
  • Universities

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Robotics and Automation.

Technology Areas

  • AI & ML
  • AI & ML - Autonomous Systems
  • AI & ML - Machine Learning Algorithms
  • Autonomy
  • Space
  • Space - Space Objects
  • Space - Spacecraft Maneuvers