Multi-robot Search in a 3D Environment with Intersection System Constraints

Efficient task allocation is a challenge for multirobot search. The multi-robot search problem is reformulated as submodular maximization subject to intersection system constraints. The objective function is submodular and consists of a coverage function to cover environments and a balancing functio...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2024 IEEE International Conference on Robotics and Automation (ICRA) s. 5963 - 5969
Hlavní autori: Li, Yan-Shuo, Tseng, Kuo-Shih
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 13.05.2024
Predmet:
Clustering algorithms
Linear programming
Resource management
Routing
Search problems
Three-dimensional displays
Trajectory
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Efficient task allocation is a challenge for multirobot search. The multi-robot search problem is reformulated as submodular maximization subject to intersection system constraints. The objective function is submodular and consists of a coverage function to cover environments and a balancing function to efficiently dispatch robots. The intersection system is composed of routing and clustering constraints. The experiment results show that the proposed approach outperforms state-ofthe-art methods in multi-robot search.
DOI:10.1109/ICRA57147.2024.10610393