Multi-agent path finding with mutex propagation
From MaRDI portal
Recommendations
- Pairwise symmetry reasoning for multi-agent path finding search
- Conflict-based search for optimal multi-agent pathfinding
- Branch-and-cut-and-price for multi-agent path finding
- Fact-alternating mutex groups for classical planning
- Migrating techniques from search-based multi-agent path finding solvers to SAT-based approach
Cites work
- Conflict-based search for optimal multi-agent pathfinding
- Consistency in networks of relations
- Detecting cardinality constraints in CNF
- Efficient CNF encoding of Boolean cardinality constraints
- Fast planning through planning graph analysis
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- The increasing cost tree search for optimal multi-agent pathfinding
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Towards Robust CNF Encodings of Cardinality Constraints
Cited in
(6)- Pairwise symmetry reasoning for multi-agent path finding search
- Priority inheritance with backtracking for iterative multi-agent path finding
- scientific article; zbMATH DE number 5959974 (Why is no real title available?)
- Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity
- Mutex graphs and multicliques: reducing grounding size for planning
- Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective
This page was built for publication: Multi-agent path finding with mutex propagation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082515)
