Mutex propagation is a form of efficient constraint popularly used in AI planning to tightly approximate the reachable states from given state. We utilize this idea context Multi-Agent Path Finding (MAPF). When adapted MAPF, mutex provides stronger constraints for conflict resolution CBS, popular optimal search-based MAPF algorithm, as well MDD-SAT, an satisfiability-based algorithm. CBS with a...

We study a novel graph path planning problem for multiple agents that may crash at runtime, and block part of the workspace. In our setting, can detect neighboring crashed agents, change followed paths runtime. The objective is then to prepare set switching rules each agent, ensuring all correct reach their destinations without collisions or deadlocks, despite unforeseen crashes other agents. S...

An efficient multi-path acoustic model based on database likelihoods for spontaneous speech recognition is presented. Although a multi-path phone HMM that has several mod­ els for di仔erent target in parallel is considered effective to express multi-style or speed-variant nature of spontaneous speech， assuming various model to match at every time for all phones may cause mismatch of unintended m...