Chance-constrained Static Schedules for Temporally Probabilistic Plans

DOI10.1613/JAIR.1.13636MaRDI QIDQ5870515zbMATH OpenOpenAlexFDO

Authors

Publication date 9 January 2023

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.13636

zbMATH Keywords

temporal reasoningprobabilistic reasoning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• AI*IA 2005: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 2087251
• An approach to temporal planning and scheduling in domains with predictable exogenous events
• Probabilistic Motion Planning Under Temporal Tasks and Soft Constraints
• scientific article; zbMATH DE number 826383
• Stochastic planning and scheduling with logic-based Benders decomposition
• Planning with Concurrency under Resources and Time Uncertainty
• Contingent planning under uncertainty via stochastic satisfiability
• Chance constrained programming models for intelligent scheduling problems and their efficient solutions
• Dynamic controllability of temporal plans in uncertain and partially observable environments

Cited in

(2)

• AI*IA 2005: Advances in Artificial Intelligence
• A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form

This page was built for publication: Chance-constrained Static Schedules for Temporally Probabilistic Plans

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