Automatic Planning of Fine Motions: Correctness and Completeness.

Abstract

This paper explores a method for automatic planning of robot fine-motion programs, first described in another paper. The primary result is a variation that is shown to be bounded-complete-the method obtains a solution whenever a solution consisting of a bounded number of motions exists. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 14, 1983
Accession Number
ADA137355

Entities

People

  • M. T. Mason

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Artificial Intelligence
  • Automatic
  • Computer Science
  • Computers
  • Construction
  • Control
  • Convergence
  • Directories
  • Equations
  • Errors
  • Motion Planning
  • Robotics
  • Robots
  • Three Dimensional
  • Trajectories

Readers

  • Mathematical Modeling and Probability Theory.
  • Robotics and Automation.

Technology Areas

  • AI & ML
  • AI & ML - Bayesian Inference
  • AI & ML - Machine Learning Algorithms
  • Autonomy