Online Path Planning for Multi‐Robot Multi‐Source Seeking Using Distributed Gaussian Processes
IET Cyber-Systems and Robotics · 2025-01 · 7 (1)
DOI: 10.1049/csy2.70030 ↗Kurz gefasst
Fachartikel in der Zeitschrift IET Cyber-Systems and Robotics, online erschienen am 17.11.2025. Verfasst von Hua Huang und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Multi‐robot source seeking in unknown environments is challenging due to the difficulties in coordinating multi‐robot sensing, information fusion and path planning. Existing approaches often struggle with computational scalability and search efficiency, particularly when dealing with multiple sources. In this paper, we develop a distributed multi‐robot multi‐source seeking strategy that enables robots to discover multiple sources using local sensing and neighbourhood communication. Our approach consists of three key components. First, we design a distributed mapping technique that leverages Gaussian processes for probabilistic inference across the entire environment and adapts it for a decentralised setup. Second, we formulate the source‐seeking problem as an informative path planning problem and design a new information‐theoretic objective function that combines predicted source locations with environmental uncertainty to prevent robots from being trapped at discovered sources. Third, we develop a tree search algorithm for planning the actions of robots over a fixed‐horizon cycle. The algorithm generates a sequence of points leading to the most informative location. Based on the sequence, the robot is guided to the target location by taking a fixed‐step movement inspired by the principles of model predictive control. Simulations validate our approach across different scenarios with varying numbers of sources and robots. In particular, the proposed information‐theoretic heuristic outperforms the broadly used uncertainty‐first and mean‐gradient‐first approaches, reducing search steps by up to 36.7%. Furthermore, our approach achieves an improvement of up to 63.8% in search efficiency compared to state‐of‐the‐art coverage‐based methods for multi‐robot multi‐source seeking problems. The average computational time of the proposed method is below 90 ms, supporting its feasibility for real‐time applications.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Huang, H., Zhu, H., Zhu, X., Mei, W., & Deng, B. (2025). Online Path Planning for Multi‐Robot Multi‐Source Seeking Using Distributed Gaussian Processes. IET Cyber-Systems and Robotics, 7(1). https://doi.org/10.1049/csy2.70030
Vancouver
Huang H, Zhu H, Zhu X, Mei W, Deng B. Online Path Planning for Multi‐Robot Multi‐Source Seeking Using Distributed Gaussian Processes. IET Cyber-Systems and Robotics. 2025;7(1). doi:10.1049/csy2.70030
BibTeX
@article{Huang2025,
author = {Huang, Hua and Zhu, Hai and Zhu, Xiaozhou and Mei, Wenjun and Deng, Baosong},
title = {Online Path Planning for Multi‐Robot Multi‐Source Seeking Using Distributed Gaussian Processes},
journal = {IET Cyber-Systems and Robotics},
year = {2025},
volume = {7},
number = {1},
doi = {10.1049/csy2.70030}
}
EUVIMED