By Topic

A comparative study of A-star algorithms for search and rescue in perfect maze

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiang Liu ; School of Electronic Information and Control Engineering, Beijing university of Technology, 100124, China ; Daoxiong Gong

Robots can be widely used to fulfill the task of search and rescue trapped persons in some dangerous situations, which can be abstracted as a maze. Three A-star algorithms are studied in this paper to compare the maze searching capacity and efficiency of their different heuristic functions, and the depth-first search algorithm, which has no heuristic information, is also adopted as a benchmark to judge the usefulness of the 3 heuristic functions of A-star algorithms. Experiments validated the usefulness of heuristic function with the results that the A-star algorithms outperform the depth-first search algorithm in most cases, and the A-star algorithm with the Euclidean distance from the father point of current point to the target point included in the heuristic function shows the best performance.

Published in:

Electric Information and Control Engineering (ICEICE), 2011 International Conference on

Date of Conference:

15-17 April 2011