Planning by Search through Simulations.

Abstract

This research is directed towards the creation of automatic planning systems capable of directing the actions of robots in solving realistic tasks. Realistic domains often involve constraints on quantitative issues such as time and cost. In order to produce successful plans, interactions and conflicts between plan steps that involve these quantities must be detected and resolved. The central assumption of this work is that the ordering of tasks, and the sequencing of the plan steps created for their solution, are major and necessary parts of the planning process. The order in which a plan's actions are to be carried out can greatly affect the efficiency and outcome of executing the plan. The actual design of the plan can and should be affected by the ordering of its steps. Keywords: Heuristic search; Scheduling algorithm; Scheduling loops.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1985
Accession Number
ADA162470

Entities

People

  • David A. B. Miller

Organizations

  • Yale University

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Autonomous Navigation
  • Computational Complexity
  • Computer Programming
  • Computer Science
  • Computers
  • Dead Reckoning
  • Information Processing
  • Language
  • Navigation
  • Production
  • Robot Navigation
  • Robots
  • Scheduling (Production)
  • Simulations
  • Travel Time

Readers

  • Operations Research
  • Robotics and Automation.
  • Systems Analysis and Design

Technology Areas

  • AI & ML
  • AI & ML - DoD AI Strategy
  • AI & ML - Machine Learning Algorithms
  • Autonomy