Back Diagonal Reflex Algorithm for Finding the Maximal Visual Area Polygon
The following are our main contributions: (i) A back diagonal reflex (BDR) algorithm that is a noncontinuous gradient VAP algorithm over a BDP domain, (ii) incorporation of this gradient algorithm into a probabilistic heuristic algorithm for finding a point in which finds an approximate solution to the Max VAP problem, and (iii) an efficient heuristic algorithm for the guardhouse problem based on the gradient algorithm.
Author (s) Details
Prof. Helman I. Stern
Department of Industrial Engineering and Management, Ben Gurion University of the Negev, Beer-Sheva, Israel.
Dr. Moshe Zofi
Department of industrial Management, Sapir College, Sderot, Israel.
View Book :- https://stm.bookpi.org/NICST-V10/article/view/592