作者: Shyni Thomas , Dipti Deodhare , M. Narasimha Murty
DOI: 10.1109/MIS.2015.96
关键词:
摘要: The Convoy Movement Problem (CMP) is a common military scenario that requires clash-free plan for moving large convoys from one location to another with constraints on time and space. This article proposes distributed agent-based approach CMP meets most on-field deployment constraints. solution based multi-agent path-finding algorithm called conflict-based search (CBS) point objects. Convoys can't be regarded as objects: their length can significantly longer than the edges which they travel. Hence, modification CBS makes it applicable spatially extended eXtended (XCBS) has been used solve while meeting of its tested road networks many 40,000 vertices 79,600 800 convoys.