Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A subset of Vehicle Routing Problems (VRPs) address the problem in which a vehicle is required to service targets by picking them up at an origin and deliver them to their destination. With respect to surveillance functions, this becomes a realistic problem as UAVs are restricted by operating range, data rate, Anti-Jam margins, and cost. Therefore, UAVs must be allocated to pickup targets and then deliver them to a communication range to be able to transmit information back to a command and control HQ. Research on similar problems illustrates the importance of studying dynamic scenarios as most of these problems are dynamic in nature (similar to this one). To maximize the information return to the communication range, the objective of allocating the UAVs is such that the total service time (pickup and delivery) of all the targets is minimized. A heuristic solution has been applied to this problem in previous work showing that good result can be obtained for the static problem. The focus of this research is to extend the work to operate in a dynamic scenario where requests arrive according to a stochastic process. It is shown that a solution to the static problem is also a solution to the dynamic problem. To address how the solution would perform in a dynamic environment, the scalability of the static solution is analyzed. Furthermore, the performance is analyzed under varying degrees of dynamism. Results show that the short execution times of the heuristic solution allow it to be used in a dynamic setup and show good performance under varying arrival rates. Furthermore, the boundaries for the regions of light and heavy load cases re identified and presented.
['Chelsea Sabo', 'Kelly Cohen']
I am writing a research paper on a idea Dynamic Allocation of Unmanned Aerial Vehicles with Communication Constraints
[{"from": "human", "value": "I am writing a research paper on a idea Dynamic Allocation of Unmanned Aerial Vehicles with Communication Constraints"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A subset of Vehicle Routing Problems (VRPs) address the problem in which a vehicle is required to service targets by picking them up at an origin and deliver them to their destination. With respect to surveillance functions, this becomes a realistic problem as UAVs are restricted by operating range, data rate, Anti-Jam margins, and cost. Therefore, UAVs must be allocated to pickup targets and then deliver them to a communication range to be able to transmit information back to a command and control HQ. Research on similar problems illustrates the importance of studying dynamic scenarios as most of these problems are dynamic in nature (similar to this one). To maximize the information return to the communication range, the objective of allocating the UAVs is such that the total service time (pickup and delivery) of all the targets is minimized. A heuristic solution has been applied to this problem in previous work showing that good result can be obtained for the static problem. The focus of this research is to extend the work to operate in a dynamic scenario where requests arrive according to a stochastic process. It is shown that a solution to the static problem is also a solution to the dynamic problem. To address how the solution would perform in a dynamic environment, the scalability of the static solution is analyzed. Furthermore, the performance is analyzed under varying degrees of dynamism. Results show that the short execution times of the heuristic solution allow it to be used in a dynamic setup and show good performance under varying arrival rates. Furthermore, the boundaries for the regions of light and heavy load cases re identified and presented."}]