Abstract
This paper focuses on the problem of cooperatively searching a given area to detect objects of interest, using a team of heterogenous unmanned air vehicles (UAVs). The paper presents algorithms to divide the whole area taking into account UAV’s relative capabilities and initial locations. Resulting areas are assigned among the UAVs, who could cover them using a zigzag pattern. Each UAV has to compute the sweep direction which minimizes the number of turns needed along a zigzag pattern. Algorithms are developed considering their computational complexity in order to allow near-real time operation. Results demonstrating the feasibility of the cooperative search in a scenario of the COMETS multi-UAV project are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alami R, Robert F, Ingrand F, Suzuki S (1995) Multi-robot cooperation through incremental plan-merging. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2573–2579. Nagoya, Japan
Barcala M, Rodriguez A (1998) Helicopteros. EUIT Aeronautica, Madrid
Beard R W, McLain T W, Goodrich M (2002) Coordinated target assignment and intercept for unmanned air vehicles. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2581–2586. Washington
Bellingham J, Tillerson M, Richards A, How J P (2001) Multi-task allocation and path planning for cooperating UAVs. In: Cooperative Control: Models, Applications and Algorithms, pp. 1–19, Conference on Coordination, Control and Optimization.
Butler Z J, Rizzi A A, Hollis R L(2000) Cooperative coverage of rectilinear environments. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2722–2727. San Francisco, CA
Chandler P R, Pachter M, Swaroop D, Fowler J M, Howlett J K, Rasmussen S, Schumacher C, Nygard K (2002) Complexity in UAV cooperative control. In: Proceedings of the American Control Conference. Anchorage, AK
Computational Geometry Algorithms Library (CGAL). Web address: http://www.egal.org/
Giulietti F, Pollini L, Innocenti M (2000) Autonomous formation flight. IEEE Control Systems Magazine 20:34–44
Hert S, Lumelsky V (1998) Polygon area decomposition for multiple-robot workspace division. International Journal of Computational Geometry and Applications, 8(4):437–466.
Luo C., Yang S X, Stacey D A, Jofriet J C (2002) A solution to vicinity problem of obstacles in complete coverage path planning. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 612–617. Washington DC
McLain T, Beard R (2000) Cooperative rendezvous of multiple unmanned air vehicles. In: Proceedings of the AIAA Guidance, Navigation and Control Conference, paper no. AIAA 2000-4369. Denver, CO
Pachter M, D’Azzo J J, Proud A W (2001) Tight formation flight control. AIAA Journal of Guidance, Control and Dynamics 24:246–254
Pledgie S T, Hao Y, Ferreira A M, Agrawal S K, Murphey R (2002) Groups of unmanned vehicles: Differential flatness, trajectory planning, and control. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 3461–3466. Washington DC
Wesley H., Huang W H (2001) Optimal line-sweep-based decompositions for coverage algorithms. In: Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 1:27–32. Seoul, Korea
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this paper
Cite this paper
Maza, I., Ollero, A. (2007). Multiple UAV cooperative searching operation using polygon area decomposition and efficient coverage algorithms. In: Alami, R., Chatila, R., Asama, H. (eds) Distributed Autonomous Robotic Systems 6. Springer, Tokyo. https://doi.org/10.1007/978-4-431-35873-2_22
Download citation
DOI: https://doi.org/10.1007/978-4-431-35873-2_22
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-35869-5
Online ISBN: 978-4-431-35873-2
eBook Packages: EngineeringEngineering (R0)