On the Complexity of Domain-Independent Planning

13 years 5 months ago

Download www.cs.umd.edu

In this paper, we examine how the complexity of domain-independent planning with strips-style operators depends on the nature of the planning operators. We show how the time complexity varies depending on a wide variety of conditions:

Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian

Real-time Traffic

AAAI 1992 | Domain-independent Planning | Intelligent Agents | Planning Operators | Strips-style Operators |

claim paper

» Combining DomainIndependent Planning and HTN Planning The Duet Planner

» Lessons Learned in Applying DomainIndependent Planning to HighSpeed Manufacturing

» DomainIndependent Construction of Pattern Database Heuristics for CostOptimal Planning

» Semantic Attachments for DomainIndependent Planning Systems

» DivideandEvolve A New Memetic Scheme for DomainIndependent Temporal Planning

» Inferring State Constraints for DomainIndependent Planning

» A DomainIndependent Framework for Effective Experimentation in Planning

» Safety domain independence and translation of complex value database queries

Post Info
More Details (n/a)

Added	06 Nov 2010
Updated	06 Nov 2010
Type	Conference
Year	1992
Where	AAAI
Authors	Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian

Comments (0)

Sciweavers

On the Complexity of Domain-Independent Planning

AAAI 1992 | Domain-independent Planning | Intelligent Agents | Planning Operators | Strips-style Operators |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers