Transition Constraints for Parallel Planning
Authors: Nina Ghooshchi, Majid Namazi, M A Hakim Newton, Abdul Sattar
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Empirical results exhibit the efficiency of our planning system over state-of-the-art constraint-based planners. |
| Researcher Affiliation | Academia | Nina Ghanbari Ghooshchi1, Majid Namazi1, M.A.Hakim Newton2, Abdul Sattar2 1Computer Engineering Department, Urmia University, West Azarbaijan, Iran 2Institute for Integrated and Intelligent Systems (IIIS), Griffith University, Australia |
| Pseudocode | Yes | Procedure 1 Planning To CSP(n) // makespan n [...] Procedure 2 tc(vi τ) // transition-constraint |
| Open Source Code | No | The paper mentions using "Minion the constraint solver" which is open source, but does not state that the code for their proposed planner (TCPP) is open source or provided. |
| Open Datasets | Yes | We tested our planner on 12 domains from past International Planning Competition (IPC) STRIPS versions. |
| Dataset Splits | No | The paper does not specify training, validation, or test dataset splits using percentages or sample counts. It mentions using 'problem instances' from IPC domains for testing. |
| Hardware Specification | Yes | We ran experiments on a PC with Intel 3.5GHz CPU, 8GB memory limit and 30 minute timeout. |
| Software Dependencies | No | The paper mentions using "Minion the constraint solver" and "SHORTSTR2 propagation" but does not provide specific version numbers for these software components. |
| Experiment Setup | Yes | To solve the resulting CSP model, we use the open source constraint solver Minion with singleton arc consistency and dom/wdeg (conflict) for variable ordering. [...] We selected singleton arc consistency and dom/wdeg in Minion by testing various options. |