Skip to search formSkip to main contentSkip to account menu

Graphplan

Known as: Graphplan algorithm 
Graphplan is an algorithm for automated planning developed by Avrim Blum and Merrick Furst in 1995. Graphplan takes as input a planning problem… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
AlgorithmGraph (discrete mathematics)STRIPSSatplan

Broader (1)

Automated planning and scheduling

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A tool for automatic generation of WS-BPEL compositions from OWL-S described services
Service composition is a fundamental facet of Service Oriented Architecture to burst the creation of new services and knowledge… 
2009
2009
Semantic Web service composition using Graphplan
Web service composition has become a key area of research in the services oriented architecture (SOA) community. The idea of… 
2009
2009
Toward a Smart Cyber-Physical Space: A Context-Sensitive Resource-Explicit Service Model
Cyber-Physical Systems (CPSs) are combinations of physical devices controlled by software systems to accomplish specified tasks… 
2007
2007
A Multi-agent Context-aware Service Platform in a Smart Space
Ubiquitous computing technology plays a key role for providing context information and makes context-aware services can be… 
2006
2006
Fuzzy Resource Constraints Graphplan
Graphplan [Blum & Furst] has proved a popular and successful basis for a succession of extensions. In this paper, we explore the… 
2005
2005
Research and Advances on Intelligent Planning in the Graphplan Framework
This paper classifies the main fruits involved in the field in the last ten years, especially states research and advances in the… 
2004
2004
Research and implementation based on bidirectional-paralleled graphplan algorithm
Nowadays, intelligent planning is a very hot branch in AI because of its wide application. This paper proposes two new concepts… 
Review
2001
Review
2001
An Overview of Recent Algorithms for AI Planning
During the past several years, AI planning has made major steps forward in terms of the size and difficulty of problems that can… 
2001
2001
On the Complexity of Planning in Transportation and Manipulation Domains
Acknowledgments I want to thank all people who (in some way or other) helped me complete this thesis. Specifically, I want to… 
2000
2000
Flexible Graphplan
Traditionally, planning problems are cast in terms of imperative constraints that are either wholly satisfied or wholly violated… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)