Verification and Automated Construction of Social Laws for MAPF (Student Abstract)

Abstract

Multi-Agent Pathfinding is the problem of collision-free navigation of agents to their destinations. Social Laws for MAPF are a decentralized framework for MAPF, where predefined laws (ordered rules) are used to avoid collisions. This work defines the key properties of such laws and proposes verification procedures, which are necessary for automatic construction of the laws.