ABSTRACT Exploring unknown environments by multiple robots is promising but challenging. The challenges are posed not only by the coordination among multiple robots to improve exploration efficiency, but also by dynamic obstacles that suddenly appear on planned paths. To address those two challenges, this paper proposes a two‐layer architecture where the high‐level layer generates target locations for each robot to explore the unknown environment, while the low‐level layer plans paths in the dynamic environment for each robot. Specifically, in the high‐level design, a novel auction algorithm is proposed, which considers both the distance of robots to target locations and the number of frontiers within the clustering domain of target locations. This approach enables robots to explore different target locations while reducing redundant exploration compared to traditional exploration algorithms. In the low‐level design, a neural network‐based Q‐learning algorithm is employed for path planning to achieve dynamic obstacle avoidance. Robots can dynamically adjust their actions through interaction with the external environment, thus avoid obstacles and reach the target position. To validate our methods, a series of simulation experiments are conducted. The experimental results demonstrate that robots can not only efficiently accomplish exploration tasks in unknown environments, but also achieve effective obstacle avoidance when faced with suddenly appearing dynamic obstacles.
Chu et al. (Wed,) studied this question.