Das, Senjuti Basu Roy)
1. We have explored that the presence of obstacle anywhere in the domain magnifies the altitude of the problem many times and existing solution doesnt work there. We are working to propose a computational geometry based solution technique to calculate the best coverage route and trying to analytically prove that our constructed route indeed contains the best coverage path.
2. However, a slight modification in the initial assumption of the obstacles can make things simpler and can lower down the computational complexity of the problem. Another effort is definitely to delve more into that scenario using computational geometry based techniques.
3. For a real life implementation, we felt that we needed a faster algorithm to work with. So using some approximation we are trying to propose a computational geometry based solution technique where the running time of the algorithm would definitely be less than the other 2 cases, and the constructed route would not be worse by more than a factor t of best coverage route.