Least commitment in Graphplan

Authors:
Michel Cayrol;Pierre Régnier;Vincent Vidal
Affiliations:
Univ. Paul Sabatier, Toulouse Cedex, France;Univ. Paul Sabatier, Toulouse Cedex, France;Univ. Paul Sabatier, Toulouse Cedex, France
Venue:
Artificial Intelligence
Year:
2001

Citing 0
Cited 7

Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs

Constraints
Planning as satisfiability: parallel plans and algorithms for plan search

Artificial Intelligence
Domain-independent temporal planning in a planning-graph-based approach

AI Communications
Loosely coupled formulations for automated planning: an integer programming perspective

Journal of Artificial Intelligence Research
Planning as satisfiability: parallel plans and algorithms for plan search

Artificial Intelligence
Planning as satisfiability with relaxed ∃-step plans

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
A weighted CSP approach to cost-optimal planning

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract