AngelCode.com > Reference Database > Artificial Intelligence/Path finding/A* and its derivatives

Optimal and Efficient Path Planning for Partially-Known Environments

Date written:1994
Authors:Anthony Stentz
Resource type:article
Links:[pdf] 8 pages

Description

This article is about the D* algorithm. D* is short for dynamic A*, and is designed to handle the problem where path costs change as you traverse the path.

DB information

Date created:0000-00-00 00:00:00
Date evaluated:0000-00-00 00:00:00
Categories:Artificial Intelligence/Path finding/A* and its derivatives