@inproceedings{dc8963c9eb4748c18e505dc93bafd636,
title = "Rapidly Replanning A∗",
abstract = "In this paper, Rapidly Replanning A∗ (RRA∗) algorithm is proposed for path planning and replanning in partially unknown environments. RRA∗ uses an effective mechanism to reuse previous search results, which considerably accelerates its replanning process compared to repetitive replanning from scratch. RRA∗ guarantees to find an optimal path from the current location of an agent to its target location based on the available information. Simulation results verify the optimality of the path generated by RRA∗ and the superior efficiency of RRA∗ in path replanning.",
keywords = "A∗, Heuristic search, Incremental search, Path planning, Replanning, RRA∗",
author = "Nuwan Ganganath and Chi-Tsun Cheng and Tse, \{Chi K.\}",
year = "2016",
month = oct,
doi = "10.1109/CyberC.2016.81",
language = "English",
series = "Proceedings - 2016 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2016",
publisher = "IEEE",
pages = "386--389",
booktitle = "Proceedings - 2016 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC 2016)",
address = "United States",
note = "8th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2016 ; Conference date: 13-10-2016 Through 15-10-2016",
}