Planning Domain + Execution Semantics: A Way Towards Robust Execution?
Citations
43 citations
29 citations
Cites background from "Planning Domain + Execution Semanti..."
...[24], which can benefit from CHIMP’s rich plan representation....
[...]
29 citations
Cites background from "Planning Domain + Execution Semanti..."
...As pointed out in [8], the planner’s knowledge and that of the semantic execution monitor need not overlap completely: some of it may be execution-specific for improving robustness and enabling early failure detection....
[...]
27 citations
26 citations
References
8,387 citations
"Planning Domain + Execution Semanti..." refers background in this paper
...All modules communicate through the ROS (Quigley et al. 2009) middleware....
[...]
...A common way to execute and monitor a plan in ROS is by using a Finate State Machine architecture (Bohren et al. 2011)....
[...]
3,848 citations
"Planning Domain + Execution Semanti..." refers background in this paper
...These bounds are updated as a result of temporal constraint reasoning, an operation which can be performed in low-order polynomial time (Dechter, Meiri, and Pearl 1991; Floyd 1962)....
[...]
2,631 citations
"Planning Domain + Execution Semanti..." refers methods in this paper
...We model temporal relations between fluents as constraints in Allen’s Interval Algebra (IA) (Allen 1984)....
[...]
2,439 citations
1,989 citations
"Planning Domain + Execution Semanti..." refers background in this paper
...The STP maintains a time bound [se, sl] for the start of ψ consisting of earliest possible start time se and latest possible start time sl....
[...]
...A STP maintains a lower and an upper bound for each time point (start or finish time of a fluent)....
[...]
...Such a network can be transformed into a Simple Temporal Problem — STP (Dechter, Meiri, and Pearl 1991)....
[...]
...These bounds are updated as a result of temporal constraint reasoning, an operation which can be performed in low-order polynomial time (Dechter, Meiri, and Pearl 1991; Floyd 1962)....
[...]