
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
C. Powley, R.E. Korf, "SingleAgent Parallel Window Search," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 5, pp. 466477, May, 1991.  
BibTex  x  
@article{ 10.1109/34.134045, author = {C. Powley and R.E. Korf}, title = {SingleAgent Parallel Window Search}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {13}, number = {5}, issn = {01628828}, year = {1991}, pages = {466477}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.134045}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  SingleAgent Parallel Window Search IS  5 SN  01628828 SP466 EP477 EPD  466477 A1  C. Powley, A1  R.E. Korf, PY  1991 KW  parallel window search; singleagent problems; IterativeDeepeningA*; node ordering; time complexity; computational complexity; iterative methods; optimisation; parallel algorithms; search problems VL  13 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
Parallel window search is applied to singleagent problems by having different processes simultaneously perform iteration of IterativeDeepeningA* (IDA*) on the same problem but with different cost thresholds. This approach is limited by the time to perform the goal iteration. To overcome this disadvantage, the authors consider node ordering. They discuss how global node ordering by minimum h among nodes with equal f=g+h values can reduce the time complexity of serial IDA* by reducing the time to perform the iterations prior to the goal iteration. Finally, the two ideas of parallel window search and node ordering are combined to eliminate the weaknesses of each approach while retaining the strengths. The resulting approach, called simply parallel window search, can be used to find a nearoptimal solution quickly, improve the solution until it is optimal, and then finally guarantee optimality, depending on the amount of time available.
[1] G. Baudet, "The design and analysis of algorithms for asynchronous multiprocessors," Ph.D. dissertation, Dep. Comput. Sci., CarnegieMellon Univ., Pittsburgh, PA, Apr. 1978.
[2] P. P. Chakrabarti, S. Ghose, A. Acharya, and S. C. de Sarkar, "Heuristic search in restricted memory,"Artificial Intell., vol. 41, no. 2, pp. 197221, Dec. 1989.
[3] C. Ebeling,All The Right Moves. Cambridge, MA: MIT Press, 1987.
[4] R. E. Felderman, E. M. Schooler, and L. Kleinrock, "The benevolent bandit laboratory: A testbed for distributed algorithms,"IEEE J. Select. Areas Commun., vol. 7, no. 2, pp. 303311, Feb. 1989.
[5] R. Feldmann, B. Monien, P. Mysliwietz, and O. Vornberger, "Distributed game tree search," inParallel Algorithms for Machine Intelligence and Vision, Kumar, Gopalakrishnan, and Kanal, Eds. New York: SpringerVerlag, 1990, pp. 66101.
[6] E. Felton and S. Otto, "A highly parallel chess program," inProc. Int. Conf. Fifth Generation Computer Systems, Tokyo, Japan, 1988.
[7] C. Ferguson and R. E. Korf, "Distributed tree search and its application to alphabeta pruning," inProc. Seventh Nat. Conf. Artificial Intelligence (AAAI 88), St. Paul, MN, Aug. 1988, pp. 128132.
[8] P. E. Hart, N. J. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths,"IEEE Trans. Syst. Sci. Cybern., vol. 4, no. 2, pp. 100107, 1968.
[9] F.h. Hsu, "Large scale parallelization of alphabeta search: An algorithmic and architectural study with computer chess," Ph.D. dissertation, Dep. Comput. Sci., CarnegieMellon Univ., Pittsburgh, PA, Rep. CMUCS90108, Feb. 1990.
[10] R. E. Korf, "Depthfirst iterative deepening: An optimal admissible tree search,"Artificial Intell., vol. 25, pp. 97109, 1985.
[11] V. Kumar and L. N. Kanal, "Parallel branchandbound formulations for AND/OR tree search,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI6, pp. 768778, Nov. 1984.
[12] V. Kumar and V. N. Rao, "Parallel depthfirst search, Part II: Analysis,"Int. J. Parallel Program., vol. 16, no. 6, pp. 501519, 1987.
[13] I. Pohl, "Heuristic search viewed as path finding in a graph,"Artificial Intell., vol. 1, pp. 193204, 1970.
[14] C. Powley and R. E. Korf, "Singleagent parallel window search: A summary of results," inProc. Eleventh Int. Joint Conf. Artificial Intelligence (IJCAI 89), Detroit, MI, Aug. 1989, pp. 3641.
[15] C. Powley, C. Ferguson, and R. E. Korf, "Parallel heuristic search: Two approaches," inParallel Algorithms for Machine Intelligence and Vision, Kumar, Gopalakrishnan, and Kanal, Eds. New York: SpringerVerlag, 1990, pp. 4265.
[16] V. N. Rao, V. Kumar, and K. Ramesh, "A parallel implementation of iterativedeepeningA*," inProc. Sixth Nat. Conf. Artificial Intelligence (AAAI 87), Seattle, WA, July 1987, pp. 178182.
[17] V. N. Rao and V. Kumar, "Parallel depthfirst search, Part I: Implementation,"Int. J. Parallel Programming, vol. 16, no. 6, pp. 479499, 1987.
[18] H. A. Simon and J. B. Kadane, "Optimal problemsolving search: Allornone solutions,"Artificial Intell., vol. 6, pp. 235247, 1975.
[19] D. J. Slate and L. R. Atkin, "CHESS 4.5The Northwestern University chess program," inChess Skill in Man and Machine, P.W. Frey, Ed. New York: SpringerVerlag, 1977, pp. 82118.