Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present an algorithm for a pair of pursuers, each with one flashlight, searching for an unpredictable, moving target in a 2D environment (simple polygon). Given a polygon with n edges and m concave regions, the algorithm decides in time O(n2 + nm2 + m4) whether the polygon can be cleared by the two 1-searchers, and if so, constructs a search schedule. The pursuers are allod to move on the boundary and in the interior of the polygon. They are not required to maintain mutual visibility throughout the pursuit.
['Borislav H. Simov', 'Giora Slutzki', 'Steven M. LaValle']
I am writing a research paper on a idea CLEARING A POLYGON WITH TWO 1-SEARCHERS
[{"from": "human", "value": "I am writing a research paper on a idea CLEARING A POLYGON WITH TWO 1-SEARCHERS"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present an algorithm for a pair of pursuers, each with one flashlight, searching for an unpredictable, moving target in a 2D environment (simple polygon). Given a polygon with n edges and m concave regions, the algorithm decides in time O(n2 + nm2 + m4) whether the polygon can be cleared by the two 1-searchers, and if so, constructs a search schedule. The pursuers are allod to move on the boundary and in the interior of the polygon. They are not required to maintain mutual visibility throughout the pursuit."}]