Mutex graphs and multicliques: reducing grounding size for planning

MaRDI QIDQ5020552FDOQ5020552

Authors:

Publication date: 6 January 2022

Full work available at URL: https://arxiv.org/abs/1909.08240

Recommendations

• Long-distance mutual exclusion for planning
• Fact-alternating mutex groups for classical planning
• Multi-agent path finding with mutex propagation
• A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
• Temporal planning using subgoal partitioning and resolution in SGPlan

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Fast planning through planning graph analysis
• Probabilistic graphical models.
• Title not available (Why is that?)
• Reducibility among combinatorial problems
• Node-and edge-deletion NP-complete problems
• Algorithms for maximum independent sets
• The maximum edge biclique problem is NP-complete
• Approximating Clique and Biclique Problems
• Title not available (Why is that?)
• ASP-Core-2 input language format
• Domain-independent cost-optimal planning in ASP

Uses Software

• Graphplan

This page was built for publication: Mutex graphs and multicliques: reducing grounding size for planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020552)