Optimal Visual Coverage Path Based on Average Horizon
-
-
Abstract
This paper proposes the concept of “average horizon” to evaluate the optimality of the path visual coverage.An optimization model aiming at maximizing “average horizon” is established.By pre-computing and storing viewshed information,the optimal visual coverage path problem is resolved using simulated annealing algorithm based on viewshed amalgamation.
-
-