Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A Robot's Response Acceleration Using the Metric Dimension Problem

Version 1 : Received: 15 November 2019 / Approved: 17 November 2019 / Online: 17 November 2019 (01:04:25 CET)

How to cite: Badr, E.; Aloufi, K. A Robot's Response Acceleration Using the Metric Dimension Problem. Preprints 2019, 2019110194. https://doi.org/10.20944/preprints201911.0194.v1 Badr, E.; Aloufi, K. A Robot's Response Acceleration Using the Metric Dimension Problem. Preprints 2019, 2019110194. https://doi.org/10.20944/preprints201911.0194.v1

Abstract

Consider a robot that is navigating in a space modeled by a graph, and that wants to know its current location. It can send a signal to determine how far it is from each landmark among a set of fixed landmarks. We study the problem of computing the minimum required number of landmarks, and where they should be placed so that the robot can always determine its location. Since the problem is an NP-complete problem, the robot's responses to the actions are slow. To accelerate this response, we can use the parallel version of this problem. In this work, we introduce a new parallel implementation for determining the metric dimension of a given graph. We run the proposed algorithm on a symmetric multi-processing (SMP) cluster using C programming language and the Message Passing Interface (MPI) library. Finally, we run our implementation on four categories of graphs (the tracks in which the robot moves): a cycle graph Cn, a path graph Pn, a triangular snake graph and a ladder graph Ln. Preliminary computational results indicate that the metric dimension problem is an NP-complete problem and prove the ability of the proposed algorithm to achieve a speedup of 6 for 8 processors.

Keywords

parallel processing; MPI cluster; metric dimension; resolving set; NP-complete

Subject

Computer Science and Mathematics, Robotics

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

* All users must log in before leaving a comment
Views 0