Gaining efficiency and flexibility in the simple temporal problem

Authors:
A. Cesta;A. Oddi
Affiliations:
-;-
Venue:
TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
Year:
1996

Citing 0
Cited 20

Issues in temporal reasoning for autonomous control systems

AGENTS '98 Proceedings of the second international conference on Autonomous agents
Introduction

Constraints
Constraint Techniques for Authoring Multimedia Documents

Constraints
Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem

Journal of Heuristics
Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results

Artificial Intelligence
TimeNetManager - A Software Tool for Generating Random Temporal Networks

AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Combining local and global search in a constraint programming environment

The Knowledge Engineering Review
IPSS: A Hybrid Approach to Planning and Scheduling Integration

IEEE Transactions on Knowledge and Data Engineering
Distributed management of flexible times schedules

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A Practical Temporal Constraint Management System for Real-Time Applications

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Evaluating consistency algorithms for temporal metric constraints

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Exploiting the structure of hierarchical plans in temporal constraint propagation

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
PDDL2.1: an extension to PDDL for expressing temporal planning domains

Journal of Artificial Intelligence Research
Distributed coordination of mobile agent teams: the advantage of planning ahead

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Partitioning the multiagent simple temporal problem for concurrency and privacy

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
An Optimal Constraint Programming Approach to the Open-Shop Problem

INFORMS Journal on Computing
Toward interactive scheduling systems for managing medical resources

Artificial Intelligence in Medicine
COLIN: planning with continuous linear numeric change

Journal of Artificial Intelligence Research
Time-Dependent simple temporal networks

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Distributed reasoning for multiagent simple temporal problems

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

y Abstract: Deals with the problem of managing quantitative temporal networks without disjunctive constraints. This problem is known as the "simple temporal problem". Dynamic management algorithms are considered to be coupled with incremental constraint posting approaches for planning and scheduling. A basic algorithm for incremental propagation of a new time constraint is presented which is a modification of the Bellman-Ford algorithm for the single-source shortest-path problem. For this algorithm, a sufficient condition for inconsistency is given, based on cycle detection in the shortest-paths graph. Moreover, the problem of constraint retraction from a consistent situation is considered, and properties for repropagating the network locally are exploited. Some experiments are also presented that show the usefulness of these properties.