Abstract
AbstractThis study addresses the complexities of maritime area information collection, particularly in challenging sea environments, by introducing a multi-agent control model for regional information gathering. Focusing on three key areas—regional coverage, collaborative exploration, and agent obstacle avoidance—we aim to establish a multi-unmanned ship coverage detection system. For regional coverage, a multi-objective optimization model considering effective area coverage and time efficiency is proposed, utilizing a heuristic simulated annealing algorithm for optimal allocation and path planning, achieving a 99.67% effective coverage rate in simulations. Collaborative exploration is tackled through a comprehensive optimization model, solved using an improved greedy strategy, resulting in a 100% static target detection and correct detection index. Agent obstacle avoidance is enhanced by a collision avoidance model and a distributed underlying collision avoidance algorithm, ensuring autonomous obstacle avoidance without communication or scheduling. Simulations confirm zero collaborative failures. This research offers practical solutions for multi-agent exploration and coverage in unknown sea areas, balancing workload and time efficiency while considering ship dynamics constraints.
Publisher
Springer Science and Business Media LLC
Reference43 articles.
1. T. Balch, The case for randomized search, in 2000 IEEE International Conference on Robotics and Automation (ICRA) (IEEE, San Francisco, 2000), pp. 213–215
2. V.P. Tran, M.A. Garratt, K. Kasmarik et al., Dynamic frontier-led swarming: multi-robot repeated coverage in dynamic environments. IEEE/CAA J. Autom. Sin. 10(3), 646–661 (2023)
3. J. Lu, B. Zeng, J. Tang et al., Tmstc*: a path planning algorithm for minimizing turns in multi-robot coverage. IEEE Robot. Autom. Lett. (2023)
4. S. Schwartz, An overview of graph covering and partitioning. Discrete Math. 345(8), 112884 (2022)
5. W. Yu, Z. Liu, B.X. New, LP relaxations for minimum cycle/path/tree cover problems. Theor. Comput. Sci. 803, 71–81 (2020)