Abstract
In this paper, we address the task of finding the minimal network of a Temporal Constraint Satisfaction Problem (TCSP). We report the integration of three approaches to improve the performance of the exponential-time backtrack search (BT-TCSP) proposed by Dechter et al. [6] for this purpose. The first approach consists of using a new efficient algorithm (\(\triangle\)STP) [21] for solving the Simple Temporal Problem (STP), an operation that must be executed at each node expansion during BT-TCSP. The second approach improves BT-TCSP itself by exploiting the topology of the temporal network. This is accomplished in three ways: finding and exploiting articulation points (AP), checking the graph for new cycles (NewCyc), and using a new heuristic for edge ordering (EdgeOrd). The third approach is a filtering algorithm, \(\triangle\)AC, which is used as a preprocessing step to BT-TCSP, and which significantly reduces the size of the TCSP [22]. In addition to introducing two new techniques, NewCyc and EdgeOrd, this paper discusses an extensive evaluation of the merits of the above three approaches. Our experiments on randomly generated problems demonstrate significant improvements in the number of nodes visited, constraint checks, and CPU time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bessière, C., Régin, J.-C.: Refining the Basic Constraint Propagation Algorithm. In: Proc. of the 17 th IJCAI, pp. 309–315 (2001)
Bliek, C., Sam-Haroud, D.: Path Consistency for Triangulated Constraint Graphs. In: Proc. of the 16 th IJCAI, pp. 456–461 (1999)
Choueiry, B.Y., Davis, A.M.: Dynamic Bundling: Less Effort for More Solutions. In: Koenig, S., Holte, R.C. (eds.) SARA 2002. LNCS (LNAI), vol. 2371, pp. 64–82. Springer, Heidelberg (2002)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw-Hill Book Co & MIT Press (2001)
Dechter, R.: Constraint Programming. Morgan Kaufmann, San Francisco (2003)
Dechter, R., Meiri, I., Pearl, J.: Temporal Constraint Networks. Artificial Intelligence 49, 61–95 (1991)
Dechter, R., Pearl, J.: Network-Based Heuristics for Constraint-Satisfaction Problems. Artificial Intelligence 34, 1–38 (1987)
Dechter, R., Pearl, J.: The Cycle-Cutset Method for improving Search Performance in AI Applications. In: Third IEEE Conference on AI Applications, pp. 224–230 (1987)
Even, S.: Graph Algorithm. Computer Science Press, Rockville (1979)
Freuder, E.C.: A Sufficient Condition for Backtrack-Free Search. JACM 29(1), 24–32 (1982)
Freuder, E.C.: A Sufficient Condition for Backtrack-Bounded Search. JACM 32(4), 755–761 (1985)
Freuder, E.C., Hubbe, P.D.: A Disjunctive Decomposition Control Schema for Constraint Satisfaction. In: Saraswat, V., Van Hentenryck, P. (eds.) Principles and Practice of Constraint Programming, pp. 319–335. MIT Press, Cambridge (1995)
Haralick, R.M., Elliott, G.L.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, 263–313 (1980)
Mohr, R., Henderson, T.C.: Arc and Path Consistency Revisited. Artificial Intelligence 28, 225–233 (1986)
Montanari, U.: Networks of Constraints: Fundamental Properties and Application to Picture Processing. Information Sciences 7, 95–132 (1974)
Oddi, A., Cesta, A.: Incremental Forward Checking for the Disjunctive Temporal Problem. In: Proc. of the 14 th ECAI (2000)
Kjærulff, U.: Triagulation of Graphs - Algorithms Giving Small Total State Space. Research Report R-90-09, Aalborg University, Denmark (1990)
Schwalb, E., Dechter, R.: Processing Disjunctions in Temporal Constraint Networks. Artificial Intelligence 93, 29–61 (1997)
Stergiou, K., Koubarakis, M.: Backtracking Algorithms for Disjunctions of Temporal Constraints. Artificial Intelligence 12(1), 81–117 (2000)
Tsamardinos, I., Pollack, M.E.: Efficient Solution Techniques for Disjunctive Temporal Reasoning Problems. Artificial Intelligence (2003) (in press)
Xu, L., Choueiry, B.Y.: A New Efficient Algorithm for Solving the Simple Temporal Problem. In: Proc. of the 10 th TIME-ICTL. IEEE Computer Society Press, Los Alamitos (2003)
Xu, L., Choueiry, B.Y.: An Approximation of Generalized Arc-Consistency for TCSPs. In: Working notes of the Workshop on Spatial and Temporal Reasoning (IJCAI 2003) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, L., Choueiry, B.Y. (2003). Improving Backtrack Search for Solving the TCSP. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive