Pathfinding and resource allocation with GHOST

By FRADIN Julien
Working Paper HAL (2015)

1 companion websites

Filling the lattice: A stylized agent-based model of socio-economic impacts of migration

JASSS (2022)

Akopov Andranik

A Multi-Scale Learning Local Phase and Amplitude Blind Image Quality Assessment for Multiply Distorted Images

IEEE Access (2018)

Li Chaofeng

Data on air pollutants and greenery in the city of Yerevan, Armenia

Data in Brief (2019)

Akopov Andranik, Beklaryan Levon, and Beklaryan Gayane

Review of data structures for computationally efficient nearest-neighbour entropy estimators for large systems with periodic boundary conditions

Journal of Computational Science (2017)

Brown Josh, Bossomaier Terry, and Barnett Lionel

Sustainability and Reproducibility via Containerized Computing

arXiv (2015)

Nagler Robert

An Introduction to the Patstat Database with Example Queries

Australian Economic Review (2014)

de Rassenfosse Gaetan, Dernis Helene, and Boedt Geert

Esiminer: Extendebel Tool for Data Mining

Working Paper (2011)

Kellou-menouer Kenza and Mokhtari Djalil

Abstract

GHOST is a framework to help game developers to model and implement their own optimization problems, or to simply instantiate a problem already encoded in GHOST. Previous works show that GHOST leads to high-quality solutions in some tens of milliseconds for three RTS-related problems: build order, wall-in placement and target selection. In this paper, we present two new problems in GHOST: pathfinding and resource allocation. The goal of this paper is to show the robustness of the framework, having very good results for a problem it is not designed for (pathfinding), and to show its flexibility, where it is easy to propose different models of the same problem (resource allocation problem).

See paper

Please cite the paper as follows:

FRADIN J. (2015) Pathfinding and resource allocation with GHOST. Working Paper HAL.

See paper