Cited By
View all- Wang WGoh W(2015)A stochastic algorithm for makespan minimized multi-agent path planning in discrete spaceApplied Soft Computing10.1016/j.asoc.2015.01.04630:C(287-304)Online publication date: 1-May-2015
Makespan-minimized multi-agent path planning (MAPP) seeks to minimize the time taken by the slowest of n agents to reach its destination and this is essentially a minimax-constrained optimization problem. In this work, an iterative max-min improvement (...
With the rise of automatic driving technology, it needs to be studied more and more problems, path planning is this paper needs to study, at present, the existing algorithms are mainly some traditional algorithms and some improved algorithms on the ...
Multi-agent path planning has wide application in fields such as robotics, transportation, logistics, computer games, etc.. To formulate the multi-agent path finding as a concisely discretized problem, most of the previous works did not construct a ...
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in