← Back to the chapter · Previous detail · Next detail →
Technical detail · ACE and Shared Context Sensing
Compare conditional sensing plans
14.11 Sensing-Planner Complexity and a Practical Heuristic
A conditional sensing plan is a decision tree. An internal node tests a cached attribute, wakes a sensor or runs an inference; each edge represents a result. A leaf returns context with explicit confidence and freshness. For node , cost and outcomes ,
At a terminal leaf, only when evidence is sufficient. Otherwise another test or authoritative fallback is required. Consider InMeeting:
| First test | Test energy | Resolves request | Unresolved fallback | Expected plan cost |
|---|---|---|---|---|
| Time-window rule | 0.02 mJ | 20% | 2.0 mJ | mJ |
| Accelerometer classifier | 0.30 mJ | 75% | 2.0 mJ | mJ |
| Acquire all sensors | 2.0 mJ | 100% | 0 | 2.0 mJ |
The time rule is the cheapest test, but the accelerometer yields the cheaper plan. Obtain outcome probabilities from representative traces; invented confidence values make the optimization misleading.
With optional attributes, there are subsets and full orderings, with different choices after each outcome. General optimal decision-tree and related sensing-plan formulations contain known NP-hard problems. Small constrained instances can still be searched exactly. Branch-and-bound stops expanding a partial tree when accumulated cost plus an optimistic lower bound exceeds the best complete plan found.