Skip navigation

A heuristic informative-path-planning algorithm to map unknown areas and a benchmark solution

A heuristic informative-path-planning algorithm to map unknown areas and a benchmark solution

Orisatoki, Mobolaji O., Amouzadi, Mahdi and Dizqah, Arash M. (2024) A heuristic informative-path-planning algorithm to map unknown areas and a benchmark solution. In: 2024 IEEE Conference on Control Technology and Applications (CCTA). Institute of Electrical and Electronics Engineers (IEEE), Piscataway, New Jersey, pp. 254-261. ISBN 979-8350370959 ISSN 2768-0762 (Print), 2768-0770 (Online) (doi:10.1109/CCTA60707.2024.10666559)

[thumbnail of AAM]
Preview
PDF (AAM)
47471_ORISATOKI_A_heuristic_informative-path-planning_algorithm_to_map_unknown_areas_and_a_benchmark_solution.pdf - Accepted Version

Download (636kB) | Preview

Abstract

Informative path planning algorithms are of paramount importance in applications like disaster management to efficiently gather information through a priori unknown environments. This is, however, a complex problem that involves finding a globally optimal path that gathers the maximum amount of information (e.g., the largest map with a minimum travelling distance) while using partial and uncertain local measurements. This paper addresses this problem by proposing a novel heuristic algorithm that continuously estimates the potential mapping gain for different sub-areas across the partially created map, and then uses these estimations to locally navigate the robot. Furthermore, this paper presents a novel algorithm to calculate a benchmark solution, where the map is a priori known to the planar, to evaluate the efficacy of the developed heuristic algorithm over different test scenarios. The findings indicate that the efficiency of the proposed algorithm, measured in terms of the mapped area per unit of travelling distance, ranges from 70\% to 80\% of the benchmark solution in various test scenarios. In essence, the algorithm demonstrates the capability to generate paths that come close to the globally optimal path provided by the benchmark solution.

Item Type: Conference Proceedings
Title of Proceedings: 2024 IEEE Conference on Control Technology and Applications (CCTA)
Uncontrolled Keywords: mapping, path planning
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / School / Research Centre / Research Group: Faculty of Engineering & Science
Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Last Modified: 05 Nov 2024 16:41
URI: http://gala.gre.ac.uk/id/eprint/47471

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics