{"type":"ScholarlyArticle","title":"Exploratory Digraph Navigation Using A","authors":[{"name":"Fabrice Mayran de Chamisso","slug":"fabrice-mayran-de-chamisso","given":"Fabrice Mayran","family":"de Chamisso","affiliation":""},{"name":"Laurent Soulier","slug":"laurent-soulier","given":"Laurent","family":"Soulier","affiliation":""},{"name":"Michaël Aupetit","slug":"michael-aupetit","given":"Michaël","family":"Aupetit","affiliation":""}],"abstract":"We describe Exploratory Digraph Navigation as a fundamental problem of graph theory concerned with using a graph with incomplete edge and vertex information for navigation in a partially unknown environment. We then introduce EDNA*, a simple A* extension which provably solves the problem and give worst-case bounds on the number of edges explored by said algorithm. We compare the performance of this algorithm to a non-exploratory strategy using A* and discuss its relation to existing algorithms such as D* Lite, PHA* with early stopping, EWP or exploration algorithms.","doi":null,"url":"https://ijcai.org/proceedings/2015/232","pdf":"https://ijcai.org/proceedings/2015/0232.pdf","markdown":"https://ijcai.org/proceedings/2015/232.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/232","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning","track":"Main Track","number":232,"pages":{"first":1624,"last":1629},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}