This project requires expertise in c++ and algorithms.

We have a grid structure, X*Y, say X=100 and Y=100 Wwe have a set of target nodes which is denoted by n, say n=3 and the location of these target are (4,2), (50,20) and (2,1). We have a set of charging points which is denoted by m, say m=1 and the location of charging point is (4,1) We have a set of drones which is denoted by l, say l=2 and the initial location of all the drones is (0,0). Every drone has same initial energy, say e_l=100 and to move 1 unit of distance a drone requires 1 unit of energy, i.e., a drone can travel to a maximum distance of 100 units when it is fully charged. The digonal movement of drone is allowed. Various modes of drones 1: Move mode 2: Recharging mode 3: Non charging mode (default) 4: Solar power mode e_r = remaining energy e_t = threshold that is used to decide whether to go to a charging station Algorithm: For each drone if it is in non charging mode then { find the closest (Euclidean distance) target and its distance from the drone if e_r - dist > e_t { change the mode to move mode and move to closest target } else { find the nearest charging station and its distance to the drone if e_r - dist > e_t { change mode to move mode and visit this charging station to restore. Once drone is reached to the charing station change the drone's mode to recharging mode. Restore the full battery capacity of drone and once the battery power is fully restored change drone's mode to non charging mode Afterwards, check if the drone can move to the closest (from charging station) target with the full battery capacity or not. If it can travel to the closest target then change the mode to move mode and visit target node. Otherwise, change the mode to solar power mode and visit the target node } else { change the mode to solar mode and directly move to the closest target } } }