Exploratory digraph navigation using A

Fabrice Mayran De Chamisso, Laurent Soulier, Michael Aupetit

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
PublisherInternational Joint Conferences on Artificial Intelligence
Pages1624-1630
Number of pages7
Volume2015-January
ISBN (Print)9781577357384
Publication statusPublished - 2015
Event24th International Joint Conference on Artificial Intelligence, IJCAI 2015 - Buenos Aires, Argentina
Duration: 25 Jul 201531 Jul 2015

Other

Other24th International Joint Conference on Artificial Intelligence, IJCAI 2015
CountryArgentina
CityBuenos Aires
Period25/7/1531/7/15

    Fingerprint

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

De Chamisso, F. M., Soulier, L., & Aupetit, M. (2015). Exploratory digraph navigation using A. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2015-January, pp. 1624-1630). International Joint Conferences on Artificial Intelligence.