Phase transitions of contingent planning problem (Q474510): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Wei-hua Su / rank | |||
Normal rank | |||
| Property / review text | |||
Summary: This paper explores the phase transitions of the contingent planning problems. We present the CONTINGENT PLAN-EXISTENCE algorithm and the CONTINGENT PLAN-NONEXISTENCE algorithm for quickly proving that the contingent planning instances have solutions and have no solutions, respectively. By analyzing the two algorithms, the phase transition area of the contingent planning problems is obtained. If the number of the actions is not greater than \(\theta_{\mathrm{ub}}\), the CONTINGENT PLAN-NONEXISTENCE algorithm can prove that nearly all the contingent planning instances have no solution. If the number of the actions is not lower than \(\theta_{\mathrm{lb}}\), the CONTINGENT PLAN-EXISTENCE algorithm can prove that nearly all the contingent planning instances have solutions.The results of the experiments show that there exist phase transitions from a region where almost all the contingent planning instances have no solution to a region where almost all the contingent planning instances have solutions. | |||
| Property / review text: Summary: This paper explores the phase transitions of the contingent planning problems. We present the CONTINGENT PLAN-EXISTENCE algorithm and the CONTINGENT PLAN-NONEXISTENCE algorithm for quickly proving that the contingent planning instances have solutions and have no solutions, respectively. By analyzing the two algorithms, the phase transition area of the contingent planning problems is obtained. If the number of the actions is not greater than \(\theta_{\mathrm{ub}}\), the CONTINGENT PLAN-NONEXISTENCE algorithm can prove that nearly all the contingent planning instances have no solution. If the number of the actions is not lower than \(\theta_{\mathrm{lb}}\), the CONTINGENT PLAN-EXISTENCE algorithm can prove that nearly all the contingent planning instances have solutions.The results of the experiments show that there exist phase transitions from a region where almost all the contingent planning instances have no solution to a region where almost all the contingent planning instances have solutions. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68T20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 60C05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q87 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6372932 / rank | |||
Normal rank | |||
Revision as of 17:32, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Phase transitions of contingent planning problem |
scientific article |
Statements
Phase transitions of contingent planning problem (English)
0 references
24 November 2014
0 references
Summary: This paper explores the phase transitions of the contingent planning problems. We present the CONTINGENT PLAN-EXISTENCE algorithm and the CONTINGENT PLAN-NONEXISTENCE algorithm for quickly proving that the contingent planning instances have solutions and have no solutions, respectively. By analyzing the two algorithms, the phase transition area of the contingent planning problems is obtained. If the number of the actions is not greater than \(\theta_{\mathrm{ub}}\), the CONTINGENT PLAN-NONEXISTENCE algorithm can prove that nearly all the contingent planning instances have no solution. If the number of the actions is not lower than \(\theta_{\mathrm{lb}}\), the CONTINGENT PLAN-EXISTENCE algorithm can prove that nearly all the contingent planning instances have solutions.The results of the experiments show that there exist phase transitions from a region where almost all the contingent planning instances have no solution to a region where almost all the contingent planning instances have solutions.
0 references
