Generalized Fringe-Retrieving A*: faster moving target search on state lattices

Abstract

Moving target search is important for robotics applications where unmanned ground vehicles (UGVs) have to follow other friendly or hostile UGVs. Artificial intelligence researchers have recently used incremental search to speed up the computation of a simple strategy for the hunter. The fastest incremental search algorithm, Fringe-Retrieving A*, solves moving target search problems only on twodimensional grids, which are rather unrealistic models for robotics applications. We therefore generalize it to Generalized Fringe-Retrieving A*, which solves moving target search problems on arbitrary graphs, including the state lattices used for UGV navigation.

DOI: 10.1145/1838206.1838352

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Sun2010GeneralizedFA, title={Generalized Fringe-Retrieving A*: faster moving target search on state lattices}, author={Xiaoxun Sun and William Yeoh and Sven Koenig}, booktitle={AAMAS}, year={2010} }