Pawan Jindal
New member
...ITTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT? Good morning Sir,
The problem statement is that "In moving target tsp with resupply, when all targets are moving away from the origin in a straight line with the +ve constant accleration(a1,a2,a3,_ _ an) and the pursuer is moving with the constant velocity(v) with the constraint that after intercepting the each and every targets the pursuer must come back to the origin for resupply and the goal is to intercept the targets in such a way that the total intercepting time can be minimized."
Plz design an algo and email me at [email protected] as early as possible. I shall be very much thankful to u
The problem statement is that "In moving target tsp with resupply, when all targets are moving away from the origin in a straight line with the +ve constant accleration(a1,a2,a3,_ _ an) and the pursuer is moving with the constant velocity(v) with the constraint that after intercepting the each and every targets the pursuer must come back to the origin for resupply and the goal is to intercept the targets in such a way that the total intercepting time can be minimized."
Plz design an algo and email me at [email protected] as early as possible. I shall be very much thankful to u