Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Authors: Phillip Smith and Mohammad Zamani

Affiliation: Defence Science and Technology Group, Melbourne, Victoria, Australia

Keyword(s): Motion and Path Planning, Collision Avoidance, Detouring, Area Coverage, Genetic Algorithm.

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 13.58.74.190

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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; ISSN 2184-2809, SciTePress, pages 15-24. DOI: 10.5220/0012889300003822

@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},
issn={2184-2809},
}

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
IS - 2184-2809
AU - Smith, P.
AU - Zamani, M.
PY - 2024
SP - 15
EP - 24
DO - 10.5220/0012889300003822
PB - SciTePress