image/svg+xml Experiments dynamic smallstatic smallFast Downwardquick skip 1071113111441140 strategy solved Quick Skip Strategy Fast Downward Strategy Pruning Rate (higher value = more pruning) ComplexityAnalysis Action-centric Atom-centric Precomputation Per node time Action-centric Atom-centric Precomputation Per node space Atom Selection StrategyQuick Skip StrongStubborn Sets contains at least one action fromat least one plan from For every inapplicable , contains anecessary enabling set for and . For every applicable , contains all actionsthat interfere with in any state from . ‒ all strongly optimal plans for the state‒ states that are visited by such a plan is a strong stubborn set if C1 C2 C3 contains at least one action fromat least one plan from C1 For every inapplicable , contains anecessary enabling set for and . C2 Include action from every plan For every applicable , contains all actionsthat interfere with in any state from . C3 Include achievers of unsatisfied precondition Include potentially interfering actions Observation 1 Potential interference can be determinedfrom the occurence of individual atomsin preconditions and effects. Observation 2 This is also true fornecessary enabling sets. Observation 3 The order in which the actions are processed is not important for the fixed-point computation. PotentialInterference Interference a b a b a b a b a b = atom atom siblings: achieves depends on goal precondition effect atoms actions Atom-centric Algorithm SAS Planning + Action-centric Algorithm a b c a b c An Atom-centric Perspective on Stubborn Sets Gabriele Röger Malte Helmert Jendrik Seipp Silvan Sievers Quick Skip Strategy Fast Downward Strategy
1
  1. Title
  2. POR
  3. POR
  4. Stubborn Sets
  5. Stubborn Sets
  6. Stubborn Setsb
  7. Valmari
  8. Alkhazraji
  9. Wehrle
  10. Old Algorithm
  11. new algorithm
  12. new algorithm with enhancements
  13. actions vs. atoms
  14. SAS+ Title
  15. SAS+
  16. SAS+ preconditions
  17. SAS+ effects
  18. SAS+ plan
  19. SAS+ goal
  20. SAS+ nothing
  21. SAS+ atom
  22. SAS+ siblings
  23. SAS+ depends
  24. SAS+ achieves
  25. Interference
  26. Interference
  27. Interference
  28. Interference
  29. Strong Stubborn Sets
  30. Strong Stubborn Sets
  31. Strong Stubborn Sets
  32. Strong Stubborn Sets
  33. Strong Stubborn Sets
  34. Strong Stubborn Sets
  35. Strong Stubborn Sets
  36. Strong Stubborn Sets
  37. Action-centric
  38. Action-centric
  39. Action-centric
  40. Action-centric
  41. Action-centric
  42. Potential Interference
  43. Potential Interference
  44. Potential Interference
  45. Potential Interference
  46. Potential Interference
  47. Potential Interference
  48. Observation 1
  49. Observation 2
  50. Observation 3
  51. Observation all
  52. Atom-centric algorithm
  53. Atom-centric algorithm
  54. Atom-centric algorithm
  55. Atom-centric algorithm
  56. Atom-centric algorithm
  57. Atom-centric algorithm
  58. Atom-centric algorithm
  59. Complexity Analysis
  60. Complexity Analysis
  61. Complexity Analysis
  62. Quick Skip
  63. Quick Skip
  64. Quick Skip
  65. Quick Skip
  66. Experiments
  67. Experiments
  68. Experiments
  69. Experiments
  70. Experiments
  71. Experiments
  72. Experiments
  73. Experiments
  74. Conclusion
  75. Conclusion
  76. Conclusion
  77. Conclusion