Planning under Uncertainty in Dynamic Domains - Carnegie Mellon ...

More documents

Recommendations

Info

7.4 Weaver's solution to the example problem, ignoring inference rules. : 997.5 The objects and goal for the example problem used to demonstrateadding steps to prevent anevent. : : : : : : : : : : : : : : : : : : : : 1017.6 The initial state for the example problem used to demonstrate addingsteps to prevent anevent. : : : : : : : : : : : : : : : : : : : : : : : : 1017.7 Proportion of nodes replayed by derivational analogy in randomly generatedproblems. : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 115B.1 The number of objects in a problem is chosen randomly according toa uniform distribution. This table shows the minimum and maximumnumber of objects generated for each type. : : : : : : : : : : : : : : : 156x
List of Figures3.1 An operator that can move an object of type Barge from the locationbound to variable to the location bound to variable .Variables have an associated type and can also be constrained withfunctions. : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 203.2 Two more operators in the example domain. : : : : : : : : : : : : : : 223.3 The type hierarchy for the planning domain. Objects in the exampleplanning problem are shown in brackets below their type. : : : : : : : 233.4 A candidate plan for the planning problem to dispose of the oil. Thevariable names have been ommitted from the instantiated operators.The head plan contains one step, to move the barge from Richmondto the west coast. : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 233.5 The Move-Barge action from the oil-spill domain used in Weaver hasa duration and a probability distribution of possible outcomes. : : : : 293.6 An exogenous event. : : : : : : : : : : : : : : : : : : : : : : : : : : : 303.7 The set of states reachable when the action Move-Barge is executedfrom the initial state shown, when Weather-Brightens is the onlyexogenous event in the domain and the action has a duration of onetime unit. The probability of reaching each state is shown along its arc. 313.8 The two possible sequences of states in the underlying Markov decisionprocess arising from executing the Move-Barge operator in the stateshown on the left in the absence of exogenous events. : : : : : : : : : 323.9 The possible sequences of states in the underlying Markov decisionprocess arising from executing the Move-Barge operator in the stateshown on the left, when the exogenous event Weather-Brightens canalso take place. Only literals that are changed from a parent state areshown. : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 333.10 The operators from the simple oil-spill domain used in this chapter.When the duration of an operator isn't mentioned, it defaults to 1. : 373.11 The exogenous events from the oil-spill domain. : : : : : : : : : : : : 38xi
Page 1 and 2: Planning under Uncertainty in Dynam
Page 3: AbstractPlanning, the process of nd
Page 6 and 7: 4.3.1 Analysing the belief net and
Page 8 and 9: viii
Page 12 and 13: 3.12 Reachability graph of literal
Page 14 and 15: 6.1 Operators in the parameterised
Page 16 and 17: xvi
Page 18 and 19: xviii
Page 20 and 21: 2 Chapter 1. Introductionif the pri
Page 22 and 23: 4 Chapter 1. Introductionweather co
Page 24 and 25: 6 Chapter 1. Introductionnet nodes
Page 26 and 27: 8 Chapter 1. Introduction
Page 28 and 29: 10 Chapter 2. Related workIn additi
Page 30 and 31: 12 Chapter 2. Related workmakes use
Page 32 and 33: 14 Chapter 2. Related workall the s
Page 34 and 35: 16 Chapter 2. Related workValue-Ite
Page 36 and 37: 18 Chapter 2. Related workdescent [
Page 38 and 39: 20 Chapter 3. Planning under Uncert
Page 60 and 61:
42 Chapter 3. Planning under Uncert
Page 62 and 63:
44 Chapter 4. The Weaver Algorithmi
Page 64 and 65:
46 Chapter 4. The Weaver Algorithmn
Page 66 and 67:
48 Chapter 4. The Weaver AlgorithmB
Page 68 and 69:
50 Chapter 4. The Weaver Algorithm
Page 70 and 71:
52 Chapter 4. The Weaver Algorithm0
Page 72 and 73:
54 Chapter 4. The Weaver AlgorithmI
Page 74 and 75:
56 Chapter 4. The Weaver Algorithmd
Page 76 and 77:
58 Chapter 4. The Weaver Algorithm(
Page 78 and 79:
60 Chapter 4. The Weaver AlgorithmT
Page 80 and 81:
62 Chapter 4. The Weaver Algorithmn
Page 82 and 83:
64 Chapter 4. The Weaver Algorithm4
Page 84 and 85:
66 Chapter 4. The Weaver Algorithml
Page 86 and 87:
68 Chapter 4. The Weaver Algorithmc
Page 88 and 89:
70 Chapter 5. Eciency improvements
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
94 Chapter 7. Experimental results
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Page 120 and 121:
Page 122 and 123:
Page 124 and 125:
Page 126 and 127:
Page 128 and 129:
Page 130 and 131:
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
118 Chapter 8. Conclusions The appl
Page 138 and 139:
120 Chapter 8. Conclusions
Page 140 and 141:
122 Appendix A. Proofs of theoremso
Page 142 and 143:
124 Appendix A. Proofs of theoremsN
Page 144 and 145:
126 Appendix B. The Oil-spill domai
Page 146 and 147:
Page 148 and 149:
Page 150 and 151:
Page 152 and 153:
Page 154 and 155:
Page 156 and 157:
Page 158 and 159:
Page 160 and 161:
Page 162 and 163:
Page 164 and 165:
Page 166 and 167:
Page 168 and 169:
Page 170 and 171:
Page 172 and 173:
Page 174 and 175:
Page 176 and 177:
158 BIBLIOGRAPHY[Blythe & Veloso 19
Page 178 and 179:
160 BIBLIOGRAPHY[Drummond & Bresina
Page 180 and 181:
162 BIBLIOGRAPHY[Koenig & Simmons 1
Page 182 and 183:
164 BIBLIOGRAPHY[Schoppers 1989b] S
Page 184:
166 BIBLIOGRAPHY
show all

Planning under Uncertainty in Dynamic Domains - Carnegie Mellon ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?