Quantifying controllability in temporal networks with uncertainty

DOI10.1016/j.artint.2020.103384zbMath1504.68201OpenAlexW3088688049MaRDI QIDQ2046026

Lindsay Popowski, James C. jun. Boerkoel, Hemeng Li, Michael Gao, Savana Ammons, Shyan S. Akmal

Publication date: 16 August 2021

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2020.103384

zbMATH Keywords

controllabilityschedulingtemporal planningprobabilistic simple temporal networkssimple temporal networks with uncertainty

Mathematics Subject Classification ID

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

Related Items (1)

Numerical interpretation of controllability coefficients in nonlinear dynamics

Cites Work

• Unnamed Item
• An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
• Temporal constraint networks
• A polyhedral branch-and-cut approach to global optimization
• Flexibility and decoupling in simple temporal networks
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Probability Theory
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Quantifying controllability in temporal networks with uncertainty