Board-Laying Techniques Improve Local Search in Mixed Planning and Scheduling

Authors:
Russell Knight;Gregg Rabideau;Steve Chien
Affiliations:
-;-;-
Venue:
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
Year:
2000

Citing 5
Cited 1

Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Intelligent scheduling

Intelligent scheduling
Automating planning and scheduling of shuttle payload operations

Artificial Intelligence - Special issue on applications of artificial intelligence
An Argument for a Hybrid HTN/Operator-Based Approach to Planning

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Planning with sharable resource constraints

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Guided restarting local search for production planning

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and find it difficult to make further progress. To help move out of a local maximum, we can often make large steps in the search space by aggregating constraints. Our techniques improve the performance of our planner/scheduler on real problems.