Next Article in Journal
Achievement of Automatic Copper Wire Elongation System
Previous Article in Journal
Improved Neural Networks Based on Mutual Information via Information Geometry
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle

Balanced Parallel Exploration of Orthogonal Regions

1
School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA 70803, USA
2
School of Biological and Agricultural Engineering, Louisiana State University, Baton Rouge, LA 70803, USA
*
Authors to whom correspondence should be addressed.
Algorithms 2019, 12(5), 104; https://doi.org/10.3390/a12050104
Received: 28 January 2019 / Revised: 26 April 2019 / Accepted: 9 May 2019 / Published: 15 May 2019
  |  
PDF [451 KB, uploaded 15 May 2019]
  |  

Abstract

We consider the use of multiple mobile agents to explore an unknown area. The area is orthogonal, such that all perimeter lines run both vertically and horizontally. The area may consist of unknown rectangular holes which are non-traversable internally. For the sake of analysis, we assume that the area is discretized into N points allowing the agents to move from one point to an adjacent one. Mobile agents communicate through face-to-face communication when in adjacent points. The objective of exploration is to develop an online algorithm that will explore the entire area while reducing the total work of all k agents, where the work is measured as the number of points traversed. We propose splitting the exploration into two alternating tasks, perimeter and room exploration. The agents all begin with the perimeter scan and when a room is found they transition to room scan after which they continue with perimeter scan until the next room is found and so on. Given the total traversable points N, our algorithm completes in total O ( N ) work with each agent performing O ( N / k ) work, namely the work is balanced. If the rooms are hole-free the exploration time is also asymptotically optimal, O ( N / k ) . To our knowledge, this is the first agent coordination algorithm that considers simultaneously work balancing and small exploration time. View Full-Text
Keywords: online algorithm; mobile agents; parallel exploration; limited communication; work balancing online algorithm; mobile agents; parallel exploration; limited communication; work balancing
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Clements, W.; Busch, C.; Pu, L.; Smith, D.; Wu, H.-C. Balanced Parallel Exploration of Orthogonal Regions. Algorithms 2019, 12, 104.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top