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

Navigation
Graph theory

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.

Exploratory digraph navigation using A. / De Chamisso, Fabrice Mayran; Soulier, Laurent; Aupetit, Michael.

IJCAI International Joint Conference on Artificial Intelligence. Vol. 2015-January International Joint Conferences on Artificial Intelligence, 2015. p. 1624-1630.

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

De Chamisso, FM, Soulier, L & Aupetit, M 2015, Exploratory digraph navigation using A. in IJCAI International Joint Conference on Artificial Intelligence. vol. 2015-January, International Joint Conferences on Artificial Intelligence, pp. 1624-1630, 24th International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25/7/15.
De Chamisso FM, Soulier L, Aupetit M. Exploratory digraph navigation using A. In IJCAI International Joint Conference on Artificial Intelligence. Vol. 2015-January. International Joint Conferences on Artificial Intelligence. 2015. p. 1624-1630
De Chamisso, Fabrice Mayran ; Soulier, Laurent ; Aupetit, Michael. / Exploratory digraph navigation using A. IJCAI International Joint Conference on Artificial Intelligence. Vol. 2015-January International Joint Conferences on Artificial Intelligence, 2015. pp. 1624-1630
@inproceedings{2ad4b392418141c6b78d3085cfddf286,
title = "Exploratory digraph navigation using A",
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.",
author = "{De Chamisso}, {Fabrice Mayran} and Laurent Soulier and Michael Aupetit",
year = "2015",
language = "English",
isbn = "9781577357384",
volume = "2015-January",
pages = "1624--1630",
booktitle = "IJCAI International Joint Conference on Artificial Intelligence",
publisher = "International Joint Conferences on Artificial Intelligence",

}

TY - GEN

T1 - Exploratory digraph navigation using A

AU - De Chamisso, Fabrice Mayran

AU - Soulier, Laurent

AU - Aupetit, Michael

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84949758596&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949758596&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781577357384

VL - 2015-January

SP - 1624

EP - 1630

BT - IJCAI International Joint Conference on Artificial Intelligence

PB - International Joint Conferences on Artificial Intelligence

ER -