Balanced Parallel Exploration of Orthogonal Regions
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 a...
Main Authors: | Wyatt Clements, Costas Busch, Limeng Pu, Daniel Smith, Hsiao-Chun Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-05-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/12/5/104 |
Similar Items
-
Algorithms for deterministic parallel graph exploration
by: Pajak, Dominik
Published: (2014) -
Dynamic load balancing in parallel processing on non-homogeneous clusters
by: Armando Eduardo De Giusti, et al.
Published: (2005-12-01) -
Dynamic Ring Exploration with (<i>H</i>,<i>S</i>) View
by: Tsuyoshi Gotoh, et al.
Published: (2020-06-01) -
An imperialist competitive algorithm for a bi-objective parallel machine scheduling problem with load balancing consideration
by: Mansooreh Madani-Isfahani, et al.
Published: (2013-04-01) -
Efficient state space exploration for parallel test generation
by: Ramasamy Kandasamy, Manimozhian
Published: (2009)