Phase Transitions of Contingent Planning Problem

Junping Zhou, Weihua Su, Zhiqiang Ma and Minghao Yin

Mathematical Problems in Engineering, 2013, vol. 2013, 1-9

Abstract:

This paper explores the phase transitions of the contingent planning problems. We present CONTINGENT PLAN-EXISTENCE algorithm and 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 , 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 , 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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/687578.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/687578.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:687578

DOI: 10.1155/2013/687578

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().