Art gallery theorems and algorithms
Art gallery theorems and algorithms
On maximum flows in polyhedral domains
Journal of Computer and System Sciences
Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Pursuit-evasion with imprecise target location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Thick non-crossing paths and minimum-cost flows in polygonal domains
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Offline variants of the “lion and man” problem
Theoretical Computer Science
Maximum thick paths in static and dynamic environments
Computational Geometry: Theory and Applications
Computing multiple watchman routes
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Efficient algorithms for pursuing moving evaders in terrains
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
Mountainous regions are typically hard to access by land; because of this, search operations in hilly terrains are often performed by airborne force such as Unmanned Aerial Vehicles (UAVs). We give algorithms for motion planning and coordination for a team of UAVs under various assumptions on the vehicles equipage/capabilities and present outputs of an implementation of the algorithms.