Strong temporal planning with uncontrollable durations

DOI10.1016/J.ARTINT.2017.11.006MaRDI QIDQ1748463zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Xianqiang Yang

Publication date 11 May 2018

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11572/258649

zbMATH Keywords

strong controllabilitytemporal planningPDDLANMLforward state-space planningstrong temporal planninguncontrollable durations

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Dynamic controllability of temporal plans in uncertain and partially observable environments
• Timeline-based planning over dense temporal domains
• scientific article; zbMATH DE number 140366
• scientific article; zbMATH DE number 2085254
• Taming the complexity of timeline-based planning over dense temporal domains
• scientific article; zbMATH DE number 2087251
• Domain-independent temporal planning in a planning-graph-based approach
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Decidability and complexity of action-based temporal planning over dense time

Cites work

• scientific article; zbMATH DE number 5547912 (Why is no real title available?)
• scientific article; zbMATH DE number 1216125 (Why is no real title available?)
• scientific article; zbMATH DE number 1946847 (Why is no real title available?)
• scientific article; zbMATH DE number 2038893 (Why is no real title available?)
• scientific article; zbMATH DE number 2038898 (Why is no real title available?)
• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• COLIN: planning with continuous linear numeric change
• Compiling uncertainty away in conformant planning problems with bounded width
• Constraint-based attribute and interval planning
• Efficient solution techniques for disjunctive temporal reasoning problems
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Managing concurrency in temporal planning using planner-scheduler interaction
• Planning with Concurrency under Resources and Time Uncertainty
• Solving strong controllability of temporal problems with uncertainty using SMT
• Strong Controllability of Disjunctive Temporal Problems with Uncertainty
• Temporal constraint networks
• The MathSAT5 SMT solver

Cited in

(5)

• Safe multi-agent pathfinding with time uncertainty
• A game-theoretic approach to timeline-based planning with uncertainty
• scientific article; zbMATH DE number 2087251 (Why is no real title available?)
• On timeline-based games and their complexity
• Solving strong controllability of temporal problems with uncertainty using SMT

Describes a project that uses

Uses Software

• COLIN
• ANML
• MathSAT5
• PDDL

This page was built for publication: Strong temporal planning with uncontrollable durations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748463)