We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
Neil Yorke-Smith, Kristen Brent Venable, Francesca...
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...