BDDRPA: An Efficient BDD-Based Incremental Heuristic Search Algorithm for Replanning

There are no files associated with this record.

Title BDDRPA: An Efficient BDD-Based Incremental Heuristic Search Algorithm for Replanning
Author Yue, Weiya; Xu, Yanyan; Su, Kaile
Publication Title AI 2006: Advances in Artificial Intelligence
Editor Abdul Sattar and Byeong-Ho Kang
Year Published 2006
Place of publication Berlin
Publisher Springer
Abstract We introduce a new algorithm, BDDRPA*, which is an efficient BDD-based incremental heuristic search algorithm for replanning. BDDRPA* combines the incremental heuristic search with BDD-based search to efficiently solve replanning search problems in artificial intelligence. We do a lot of experiments and our experiment evaluation proves BDDRPA* to be a powerful incremental search algorithm. BDDRPA* outperforms breadth-first search by several orders of magnitude for huge size search problems. When the changes to the search problems are small, BDDRPA* needs less runtime by reusing previous information, and even when the changes reach to 20 percent of the size of the problems, BDDRPA* still works more efficiently.
Peer Reviewed Yes
Published Yes
Publisher URI
Copyright Statement Copyright 2006 Springer : Reproduced in accordance with the copyright policy of the publisher : The original publication will be available at SpringerLink (use hypertext links)
ISBN 3-540-49787-0
Conference name 19th Australian Joint Conference on Artificial Intelligence
Location Hobart
Date From 2006-03-04
Date To 2006-12-08
Date Accessioned 2007-03-02
Language en_AU
Faculty Faculty of Science, Environment, Engineering and Technology
Subject Other Artificial Intelligence
Publication Type Conference Publications (Full Written Paper - Refereed)
Publication Type Code e1

Show simple item record

Griffith University copyright notice