Decades ago, Paul Erdős used randomness to illuminate the vast and weird world of networks. Now mathematicians are making his ...
Abstract: Multi-agent path finding (MAPF) problem in warehouse automation consists of optimal task assignment and path planning, where small runtime is necessary. In this letter, we present a new MAPF ...
Abstract: In this paper, we address the problem of efficiently computing finite-size approximations of the set of -locally optimal solutions of a given multi-objective optimization problem (MOP). Such ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results