Craig A. Knoblock. Generating Abstraction Hierarchies: An<E-407> Automated Approach to Reducing Search in Planning. Kluwer Academic<E-356> Publishers, 1993.<E-64>  Home/Search   Document Not in Database   Summary   Related Articles

.... l 1 E 27 ) n k E 57 l 1 E 77 f(k) n k E 142 l 2 E 162 f(k) n k f(k) E 285 Since k is a constant, and we can choose l=log E 224 k E 250 n, the equation can be reduced to E 426 O( k l E 28 1) k 1) f(k) which can be simplified simply to O(n) Korf 1987; Knoblock 1993] E 437 More importantly, if each level of the hierarchy has agents that solve their E 387 subproblems in general, then the time needed below the top of the hierarchy E 373 (assuming negligible distribution and communication time) is simply f(k) for each E 432 level, so (l 1)f(k) This is ....

Craig A. Knoblock. Generating Abstraction Hierarchies: An<E-407> Automated Approach to Reducing Search in Planning. Kluwer Academic<E-356> Publishers, 1993.<E-64>

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC