Artificial Intelligence - Special issue on knowledge representation
Remote Agent: to boldly go where no AI system has gone before
Artificial Intelligence - Special issue: artificial intelligence 40 years later
A Unifying Framework for Tractable Constraints
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
An integrated and flexible architecture for planning and scheduling
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
| Hi-index | 0.00 |
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can be made 驴dispatchable驴, i.e. executable incrementally in real time with guarantees against failure due to unfortunate event-time selections. In this work we show how the property of dispatchability can be extended to networks that include constraints for consumable resources. We first determine conditions for insuring that resource use does not exceed capacity under dispatchable execution for a single sequence of activities, or 驴bout驴, involving one resource. Then we show how to handle interactions between resource and temporal constraints to insure dispatchability, how to enhance flexibility of resource use under these conditions, and how to handle multiple bouts interspersed with instances of resource release. Finally, we consider methods for establishing the necessary dispatchability conditions during schedule creation (planning stage). The results demonstrate that flexible handling of resource use can be safely extended to the execution layer to provide more effective deployment of consumable resources.