论文标题
使用答案集编程基于冲突解决的动态多试路径查找
Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming
论文作者
论文摘要
我们研究了多代理路径发现问题的动态版本（称为D-MAPF），现有代理可能会离开，而新代理商可能会在不同的时间加入团队。我们介绍了一种基于冲突解决的新方法来解决D-MAPF。这个想法是，当一组新的代理人加入团队并且存在冲突时，而不是为整个团队重新重建，而是为了最小的计划相互冲突的代理人而重新启动。我们利用答案集编程作为我们计划，重新认定和确定最小冲突集的方法的一部分。
We study a dynamic version of multi-agent path finding problem (called D-MAPF) where existing agents may leave and new agents may join the team at different times. We introduce a new method to solve D-MAPF based on conflict-resolution. The idea is, when a set of new agents joins the team and there are conflicts, instead of replanning for the whole team, to replan only for a minimal subset of agents whose plans conflict with each other. We utilize answer set programming as part of our method for planning, replanning and identifying minimal set of conflicts.
