返回
Adaptive Random Testing for Multiagent Path Finding Systems
DOI:10.1109/TR.2022.3146323.png)
摘要
En 中文
The multiagent path finding (MAPF) problem identifies the scheduling of multiple agents simultaneously, such that all of them can reach their targets efficiently. To date, MAPF systems have been assigned important tasks such as traffics and warehouses. It is essential to conduct testing for MAPF systems to detect potential failures. Namely, in an MAPF system, a test case is a specific MAPF scenario, including the initial locations of the agents and the environment for these agents to play in. By testing, we intend to find the scenarios (i.e., test cases) whose executions reveal failures. Testing MAPF systems is challenging due to the complexity of its input and the interactions among multiple agents. This article proposes the testing approach based on the adaptive random testing (ART) for MAPF systems. ART aims to generate new test cases far from the already executed ones. Particularly, to calculate the distance between each pair of test cases, we introduce two metrics, the initial density distribution and the destination density distribution, to characterize the distribution of the agents' initial and destination nodes, respectively. Benefit from ART, the diversity of the information generated during testing can be improved. Experimental results show that compared with the random testing, our approach can detect more diverse failure-revealing scenarios.
Keyword:
Measurement
Adaptive systems
Job shop scheduling
Scalability
Subspace constraints
Benchmark testing
Planning
Adaptive random testing (ART)
density measurement
multiagent path finding (MAPF)
multiagent systems
software testing
期刊
IF:
5.7
论文数:
2.8K
被引数:
8.5K
机构
引用论文
Association of vitamin D receptor gene polymorphism with the risk of systemic lupus erythematosus维生素d受体基因多态性与系统性红斑狼疮发病风险的相关性研究
Preferential centrality – A new measure unifying urban activity, attraction and accessibility优先中心性 -- 统一城市活动、吸引力和可达性的新措施

