Incremental Local Search for Planning Problems

Authors:
Eva Onaindia;Laura Sebastia;Eliseo Marzal
Affiliations:
-;-;-
Venue:
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Year:
2000

Citing 4
Cited 1

Planning for conjunctive goals

Artificial Intelligence
Fast planning through planning graph analysis

Artificial Intelligence
Fast planning through greedy action graphs

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Accelerating partial-order planners: some techniques for effective search control and pruning

Journal of Artificial Intelligence Research

SimPlanner: An Execution-Monitoring System for Replanning in Dynamic Worlds

EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new approach to planning in STRIPS-like domains based on an incremental local search process. This approach arises as an attempt to combine the advantages of a graph-based analysis and a partial-order planner. The search process is carried out by a four-stage algorithm. The starting point is a graph, which totally or partially encodes the planning problem. The aim of the second phase is to obtain a first set of actions of a solution plan, the third stage guarantees the completeness and optimality of the generated solution and the fourth stage, a partial-order planner, completes the process by finding the missing actions of the final solution plan, if any.