Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 8 (1992), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Generating action sequences to achieve a set of goals is a computationally difficult task. When multiple goals are present, the problem is even worse. Although many solutions to this problem have been discussed in the literature, practical solutions focus on the use of restricted mechanisms for planning or the application of domain dependent heuristics for providing rapid solutions (i.e., domain-dependent planning). One previously proposed technique for handling multiple goals efficiently is to design a planner or even a set of planners (usually domain-dependent) that can be used to generate separate plans for each goal. The outputs are typically either restricted to be independent and then concatenated into a single global plan, or else they are merged together using complex heuristic techniques. In this paper we explore a set of limitations, less restrictive than the assumption of independence, that still allow for the efficient merging of separate plans using straightforward algorithmic techniques.In particular, we demonstrate that for cases where separate plans can be individually generated, we can define a set of limitations on the allowable interactions between goals that allow efficient plan merging to occur. We propose a set of restrictions that are satisfied across a significant class of planning domains. We present algorithms that are efficient for special cases of multiple plan merging, propose a heuristic search algorithm that performs well in a more general case (where alternative partially ordered plans have been generated for each goal), and describe an empirical study that demonstrates the efficiency of this search algorithm.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: A great challenge in developing planning systems for practical applications is the difficulty of acquiring the domain information needed to guide such systems. This paper describes a way to learn some of that knowledge. More specifically, the following points are discussed. (1) We introduce a theoretical basis for formally defining algorithms that learn preconditions for Hierarchical Task Network (HTN) methods. (2) We describe Candidate Elimination Method Learner (CaMeL), a supervised, eager, and incremental learning process for preconditions of HTN methods. We state and prove theorems about CaMeL's soundness, completeness, and convergence properties. (3) We present empirical results about CaMeL's convergence under various conditions. Among other things, CaMeL converges the fastest on the preconditions of the HTN methods that are needed the most often. Thus CaMeL's output can be useful even before it has fully converged.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Research in engineering design 7 (1995), S. 173-192 
    ISSN: 1435-6066
    Keywords: Design critique ; Feature-based recognition ; Feature recognition ; Manufacturing alternatives
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract Automated recognition of features from CAD models has been attempted for a wide range of application domains. In this article we address the problem of representing and recognizing a complete class of features in alternative interpretation for a given design. We present a methodology for recognizing a class of machinable features and addressing the computational problems posed by the existence of feature-based alternatives. Our approach addresses a class of volumetric features that describe material removal volumes made by operations on three-axis vertical machining centers, including drilling, pocket-milling, slot-milling, face-milling, chamfering, filleting, and blended surfaces. This approach recognizes intersecting features and is complete over all features in our class; i.e., for any given part, the algorithm produces a set containing all features in our class that correspond to possible operations for machining that part. This property is of particular significance in applications where consideration of different manufacturing alternatives is crucial. This approach employs a class of machinable features expressible as MRSEVs (a STEP-based library of machining features). An example of this methodology has been implemented using the ACIS solid modeler and the National Institute's of Health C++ class library.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Research in engineering design 9 (1997), S. 168-190 
    ISSN: 1435-6066
    Keywords: CAD ; Concurrent engineering ; Design for manufacturing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Technology
    Notes: Abstract In the market-place of the 21st century, there is no place for traditional ‘over-the-wall’ communications between design and manufacturing. In order to ‘design it right the very first time’, designers must ensure that their products are both functional and easy to manufacture. Software tools have had some successes in reducing the barriers between design and manufacturing. Manufacturability analysis systems are emerging as one such tool — enabling identification of potential manufacturing problems during the design phase and providing suggestions to designers on how to eliminate them. In this paper, we provide a survey of current state-of-the-art automated manufacturability analysis. We present the historical context in which this area has emerged and outline characteristics to compare and classify various systems. We describe the two dominant approaches to automated manufacturability analysis and overview representative systems based on their application domain. We describe support tools that enhance the effectiveness of manufacturability analysis systems. Finally, we attempt to expose some of the existing research challenges and future directions.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 65 (1996), S. 35-54 
    ISSN: 1572-9338
    Keywords: Group technology ; cellular manufacturing ; machine grouping ; state-space search ; branch-and-bound algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper addresses the problem of grouping machines in order to design cellular manufacturing cells, with an objective to minimize inter-cell flow. This problem is related to one of the major aims of group technology (GT): to decompose the manufacturing system into manufacturing cells that are as independent as possible. This problem is NP-hard. Thus, nonheuristic methods cannot address problems of typical industrial dimensions because they would require exorbitant amounts of computing time, while fast heuristic methods may suffer from poor solution quality. We present a branch-and-bound state-space search algorithm that attempts to overcome both these deficiencies. One of the major strengths of this algorithm is its efficient branching and search strategy. In addition, the algorithm employs the fast Inter-Cell Traffic Minimization Method to provide good upper bounds, and computes lower bounds based on a relaxation of merging.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 15 (1986), S. 163-183 
    ISSN: 1573-7640
    Keywords: Artificial intelligence ; decision analysis ; games trees ; minimax, search
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In the field of Artificial Intelligence, traditional approaches to choosing moves in games involve the use of the minimax algorithm. However, recent research results indicate that minimaxing may not always be the best approach. In this paper we report some measurements on several model games with several different evaluation functions. These measurements show that there are some new algorithms that can makes significantly better use of evaluation function values than the minimax algorithm does.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 12 (1983), S. 367-383 
    ISSN: 1573-7640
    Keywords: Artificial intelligence ; decision analysis ; decision trees ; games ; game trees ; minimaxing ; pathology ; problem solving ; search
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Almost all game tree search procedures used in Artificial Intelligence are variants on minimaxing. Until recently, it was almost universally believed that searching deeper on game trees with such procedures would in general yield a better decision. However, recent investigations show that there are many “pathological” game trees for which searching deeper consistentlydegrades the decision. This paper investigates one possible cause of pathology. In particular, a class of games that is normally pathological is shown to become nonpathological when the games are modified so that game positions can be reached by more than one path. This result suggests that in general, pathology is less likely when game positions can be reached by more than one path. This may be one reason why games such as chess and checkers are nonpathological. In addition, this result supports the hypothesis(9) that pathology is less likely when sibling nodes have similar minimax values. This paper also investigates a possible cure for pathology-an alternative to minimaxing called probability estimation which has been shown to avoid pathology and thus produce more accurate decisions than minimaxing on at least one pathological game. (11) The current paper shows that depending on what evaluation function is used, probability estimation can also produce more accurate decisions than minimaxing on at least one nonpathological game. Probability estimation or other related procedures could conceivably become attractive alternatives to minimaxing if suitable tree pruning procedures could be developed for use with them.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Annals of mathematics and artificial intelligence 18 (1996), S. 69-93 
    ISSN: 1573-7470
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Most practical work on AI planning systems during the last fifteen years has been based on Hierarchical Task Network (HTN) decomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks, and how it compares to STRIPS-style planning.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Book
    Book
    Amsterdam [u.a.] :Elsevier, Kaufmann,
    Title: Automated planning : theory and practice
    Author: Ghallab, Malik
    Contributer: Nau, Dana , Traverso, Paolo
    Edition: 1
    Publisher: Amsterdam [u.a.] :Elsevier, Kaufmann,
    Year of publication: 2004
    Pages: XXVIII, 635 S. : , Ill., graph. Darst.
    ISBN: 1-558-60856-7
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...