Inventory-Aware Pathfinding is concerned with finding paths while taking into account that picking up items, e.g., keys, allow the character to unlock blocked pathways, e.g., locked doors. In this work we present a pruning method and a prepro-cessing method that can improve significantly the scalability of such approaches. We apply our methods to the recent approach of Inventory-Driven Jump-Point Search (InvJPS). First, we introduce InvJPS+ that allows to prune large parts of the search space by favoring short detours to pick up items, offering a trade-off between efficiency and optimality. Second, we propose a preprocessing step that allows to decide on runtime which items, e.g., keys, are worth using thus pruning potentially unnecessary items before the search starts. We show results for combinations of the pruning and preprocessing methods illustrating the best choices over various scenarios.

Pruning and Preprocessing Methods for Inventory-Aware Pathfinding / Aversa, Davide; Vassos, Stavros; Sardina, Sebastian. - ELETTRONICO. - (2016), pp. 1-8. (Intervento presentato al convegno 2016 IEEE Conference on Computational Intelligence and Games, CIG 2016 tenutosi a Santorini; Greece nel Settembre 2016) [10.1109/CIG.2016.7860417].

Pruning and Preprocessing Methods for Inventory-Aware Pathfinding

AVERSA, DAVIDE
;
VASSOS, STAVROS;SARDINA, SEBASTIAN
2016

Abstract

Inventory-Aware Pathfinding is concerned with finding paths while taking into account that picking up items, e.g., keys, allow the character to unlock blocked pathways, e.g., locked doors. In this work we present a pruning method and a prepro-cessing method that can improve significantly the scalability of such approaches. We apply our methods to the recent approach of Inventory-Driven Jump-Point Search (InvJPS). First, we introduce InvJPS+ that allows to prune large parts of the search space by favoring short detours to pick up items, offering a trade-off between efficiency and optimality. Second, we propose a preprocessing step that allows to decide on runtime which items, e.g., keys, are worth using thus pruning potentially unnecessary items before the search starts. We show results for combinations of the pruning and preprocessing methods illustrating the best choices over various scenarios.
2016
2016 IEEE Conference on Computational Intelligence and Games, CIG 2016
pathfinding; games; non-player characters
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Pruning and Preprocessing Methods for Inventory-Aware Pathfinding / Aversa, Davide; Vassos, Stavros; Sardina, Sebastian. - ELETTRONICO. - (2016), pp. 1-8. (Intervento presentato al convegno 2016 IEEE Conference on Computational Intelligence and Games, CIG 2016 tenutosi a Santorini; Greece nel Settembre 2016) [10.1109/CIG.2016.7860417].
File allegati a questo prodotto
File Dimensione Formato  
Aversa_Pruning-and-Preprocessing_2016.pdf

solo gestori archivio

Note: Articolo principale
Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 388.39 kB
Formato Adobe PDF
388.39 kB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/933494
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact