Offline Grid-Based Coverage path planning for guards in games

01/15/2020
by   Wael Al Enezi, et al.
0

Algorithmic approaches to exhaustive coverage have application in video games, enabling automatic game level exploration. Current designs use simple heuristics that frequently result in poor performance or exhibit unnatural behaviour. In this paper, we introduce a novel algorithm for covering a 2D polygonal (with holes) area. We assume prior knowledge of the map layout and use a grid-based world representation. Experimental analysis over several scenarios ranging from simple layouts to more complex maps used in actual games show good performance. This work serves as an initial step towards building a more efficient coverage path planning algorithm for non-player characters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2023

A Multi-robot Coverage Path Planning Algorithm Based on Improved DARP Algorithm

The research on multi-robot coverage path planning (CPP) has been attrac...
research
07/04/2016

Path planning with Inventory-driven Jump-Point-Search

In many navigational domains the traversability of cells is conditioned ...
research
08/03/2021

CPPNet: A Coverage Path Planning Network

This paper presents a deep-learning based CPP algorithm, called Coverage...
research
11/12/2018

SLAM-Assisted Coverage Path Planning for Indoor LiDAR Mapping Systems

Applications involving autonomous navigation and planning of mobile agen...
research
05/18/2021

Coverage Path Planning for Spraying Drones

The COVID-19 pandemic is causing a devastating effect on the health of g...
research
11/19/2019

Path Planning Problems with Side Observations-When Colonels Play Hide-and-Seek

Resource allocation games such as the famous Colonel Blotto (CB) and Hid...
research
06/28/2023

Reducing Redundant Work in Jump Point Search

JPS (Jump Point Search) is a state-of-the-art optimal algorithm for onli...

Please sign up or login with your details

Forgot password? Click here to reset