Forward Pruning for Approximation and Flexible Computation, Part I: Single-Agent Combinatorial Optimization

  • Weixiong Zhang


One of the straightforward methods for speeding up the process of searching for a solution in the large state space of a complex problem is to prune some search alternatives before exploring them. Search methods that use such a pruning mechanism can be categorized as forward pruning methods. Forward pruning can be found in both single-agent and multiagent problemsolving domains. This chapter focuses on single-agent forward pruning, and the next chapter considers forward pruning for multiple-agent game search.




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Weixiong Zhang
    • 1
  1. 1.Information Sciences Institute and Department of Computer ScienceUniversity of Southern CaliforniaMarina del ReyUSA

Personalised recommendations