CTP: A new constraint-based formalism for conditional, temporal planning
From MaRDI portal
Publication:1768744
DOI10.1023/A:1025894003623zbMath1074.68616MaRDI QIDQ1768744
Thierry Vidal, Ioannis Tsamardinos, Martha E. Pollack
Publication date: 15 March 2005
Published in: Constraints (Search for Journal in Brave)
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Temporal Reasoning in Nested Temporal Networks with Alternatives, Efficient execution of dynamically controllable simple temporal networks with uncertainty, Dynamic controllability via timed game automata, Discovering implied constraints in precedence graphs with alternatives, A new method for constructing a minimal PERT network, Efficient solution techniques for disjunctive temporal reasoning problems, Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way, Allocation and scheduling of conditional task graphs, A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs, Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm, Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games, Mining CSTNUDs significant for a set of traces is polynomial, Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks, A theoretic and practical framework for scheduling in a stochastic environment, Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty, Conditional simple temporal networks with uncertainty and decisions, Scheduling Conditional Task Graphs, Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models, SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
