Solving Multi-Agent Pathfinding Problems on Graphs in Polynomial Time

저자
정보 없음
출판사
KS OmniScriptum Publishing
출판일
20120814
ISBN
9783659200779
ISBN 등록 지역
독일어권 (ISBN 978-3)

소개

Multi-agent pathfinding problems involve finding plans for agents that must travel from their start locations to their targets without colliding. Recent work produced a number of algorithms to solve the problem as well as an ample supply of related theory. Most existing works, however, were either too inefficient for practical use or had very restrictive conditions.