Static target search path planning optimization with heterogeneous agents

As discrete multi‐agent static open‐loop target search path planning known to be computationally hard recently proved to be solvable in practice in the homogeneous case, its heterogeneous problem counterpart still remains very difficult. The heterogeneous problem introduces broken symmetry reflected by dissimilar sensing ability/capacity, agent capability and relative velocity and, is further exacerbated when operating under near real‐time problem‐solving constraints, as key decision variables grow exponentially in the number of agents. Departing from the homogeneous agent model already published, new integer linear and quadratic programming formulations are proposed to reduce computational complexity and near‐optimally solve the discrete static search path planning problem involving heterogeneous agents. The novelty consists in taking advantage of typical optimal path solution property to derive new tractable problem models. At the expense of a slightly accrued computational complexity, the proposed quadratic integer program formulation conveys considerable benefit by keeping key decision variables linear in the number of agents. The convexity property of its defined objective function further allows ensuring global optimality when a local optimum is computed. Special agent network representations capturing individual agent decision moves are also devised to simplify problem modeling and expedite constraint modeling specification. As a result, cost‐effective quadratic program implementation for realistic problems may be achieved to rapidly compute near‐optimal solutions, while providing a robust bound on solution quality through Lagrangian relaxation.