Solving the Holed Space Budgeted Maximum Coverage Problem with a Discrete Selection Problem

Phillip Smith, Mohammad Zamani

2024

Abstract

In this paper, a new heuristic for the budgeted maximum coverage problem is introduced for environments that include obstacles (holed space). This heuristic leads to a solvable but NP-hard problem which requires a series of discrete decisions to be made. These decisions are non-trivial as the quality of each decision option may be impacted by the selected options of other decisions in the series and thus optimal solution formation is NP-hard. The effectiveness of the proposed heuristic is demonstrated by empirically comparing it to another known heuristic for the area coverage problem; finding it to be more effective at covering the space, at the cost of requiring greater computation time.

Paper Citation

in Harvard Style

Smith P. and Zamani M. (2024). Solving the Holed Space Budgeted Maximum Coverage Problem with a Discrete Selection Problem. In Proceedings of the 21st International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO; ISBN 978-989-758-717-7, SciTePress, pages 15-24. DOI: 10.5220/0012889300003822

in Bibtex Style

@conference{icinco24,
author={Phillip Smith and Mohammad Zamani},
title={Solving the Holed Space Budgeted Maximum Coverage Problem with a Discrete Selection Problem},
booktitle={Proceedings of the 21st International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO},
year={2024},
pages={15-24},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012889300003822},
isbn={978-989-758-717-7},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 21st International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO
TI - Solving the Holed Space Budgeted Maximum Coverage Problem with a Discrete Selection Problem
SN - 978-989-758-717-7
AU - Smith P.
AU - Zamani M.
PY - 2024
SP - 15
EP - 24
DO - 10.5220/0012889300003822
PB - SciTePress