Learn More
Discrete static open-loop target search path planning is known to be a NP (non-deterministic polynomial) - Hard problem, and problem-solving methods proposed so far rely on heuristics with no way to properly assess solution quality for practical size problems. Departing from traditional nonlinear model frameworks, a new integer linear programming (ILP)(More)
  • 1