Delayed D*: The Proofs

Abstract

In this paper, we prove a number of properties of the Delayed D* algorithm introduced in [1], including its termination and correctness. In what follows, we deal with the fixed initial state version of Delayed D* (shown in Figures 1 and 2), but these results can easily be extended, following similar lines as in [2], to the navigation version.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 2004
Accession Number
ADA526172

Entities

People

  • Anthony Stentz
  • Dave Ferguson

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Contracts
  • Governments
  • Information Operations
  • Instructions
  • International Organizations
  • Military Research
  • Navigation
  • Reasoning
  • Robotics
  • Security
  • Sequences
  • Standards
  • Universities

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Computer Vision.
  • Mathematical Modeling and Probability Theory.