Abstract
An action is redundant in a planning domain if it is not needed to reach the goal. In this paper, we study the computational complexity of some problems related to the redundancy of actions: checking whether a domain contains a redundant action, what is the minimal number of actions needed to make the goal reachable, checking whether the removal of an action does not increase the minimal plan length, etc.
This is a preview of subscription content, log in via an institution to check access.
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
Fink, E., Yang, Q.: Formalizing plan justifications. In: Proceedings of the Ninth Conference of the Canadian Society for Computational Studies of Intelligence, pp. 9–14 (1992)
Fink, E., Yang, Q.: A spectrum of plan justifications. In: Proceedings of the AAAI 1993 Spring Symposium, pp. 29–33 (1993)
Knoblock, C., Tenenberg, J., Yang, Q.: Characterizing abstraction hierarchies for planning. In: Proc. of AAAI 1991, pp. 692–697 (1991)
Yang, Q., Tenenberg, J.: ABTWEAK: Abstracting a nonlinear, least commitment planner. In: Proc. of AAAI 1990, pp. 204–209 (1990)
Bacchus, F., Yang, Q.: The downward refinement property. In: Proc. of IJCAI 1991, pp. 286–293 (1991)
Nebel, B., Dimopoulos, Y., Koehler, J.: Ignoring irrelevant facts and operators in plan generation. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 338–350. Springer, Heidelberg (1997)
Fikes, R., Nilsson, N.: STRIPS: a new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 189–208 (1971)
Bylander, T.: Complexity results for planning. In: Proc. of IJCAI 1991, pp. 274–279 (1991)
Nebel, B., Bäckström, C.: On the computational complexity of temporal projection, planning, and plan validation. Artificial Intelligence 66, 125–160 (1994)
Bäckström, C., Nebel, B.: Complexity results for SAS+ planning. Computational Intelligence 11, 625–656 (1995)
Bäckström, C.: Equivalence and tractability results for SAS+ planning. In: Proc. of KR 1992, pp. 126–137 (1992)
Bäckström, C., Nebel, B.: On the computational complexity of planning and story understanding. In: Proc. of ECAI 1992, pp. 349–353 (1992)
Bäckström, C., Nebel, B.: Complexity results for SAS+ planning. In: Proc. of IJCAI 1993, pp. 1430–1435 (1993)
Bäckström, C., Jonsson, P.: Planning with abstraction hierarchies can be exponentially less efficient. In: Proc. of IJCAI 1995, pp. 1599–1605 (1995)
Goldman, R., Geib, C., Miller, C.: A new model of plan recognition. In: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI 1999), pp. 245–254 (1999)
Kambhampati, S., Hendler, J.: A validation-structure-based theory of plan modification and reuse. Artificial Intelligence 55, 193–258 (1992)
Hanks, S., Weld, D.: A domain-independent algorithm for plan adaptation. J. of Artificial Intelligence Research 2, 319–360 (1995)
Nebel, B., Koehler, J.: Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence 76, 427–454 (1995)
Liberatore, P.: On non-conservative plan modification. In: Proc. of ECAI 1998, pp. 518–519 (1998)
Kambhampati, S.: On the utility of systematicity: Understanding tradeoffs between redundancy and commitment in partial-ordering planning. In: Proc. of IJCAI 1993, pp. 1380–1387 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrara, A., Liberatore, P., Schaerf, M. (2005). The Complexity of Action Redundancy. In: Bandini, S., Manzoni, S. (eds) AI*IA 2005: Advances in Artificial Intelligence. AI*IA 2005. Lecture Notes in Computer Science(), vol 3673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558590_1
Download citation
DOI: https://doi.org/10.1007/11558590_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29041-4
Online ISBN: 978-3-540-31733-3
eBook Packages: Computer ScienceComputer Science (R0)