• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Machine Recognition as Representation and Search

Zhao, Feng 01 December 1989 (has links)
Generality, representation, and control have been the central issues in machine recognition. Model-based recognition is the search for consistent matches of the model and image features. We present a comparative framework for the evaluation of different approaches, particularly those of ACRONYM, RAF, and Ikeuchi et al. The strengths and weaknesses of these approaches are discussed and compared and the remedies are suggested. Various tradeoffs made in the implementations are analyzed with respect to the systems' intended task-domains. The requirements for a versatile recognition system are motivated. Several directions for future research are pointed out.
2

Generating Motion-economical Plans For Manual Operations

Canan, Ozgen 01 September 2005 (has links) (PDF)
This thesis discusses applying AI planning tools for generating plans for manual operations. Expertise of motion economy domain is used to select good plans among feasible ones. Motion economy is a field of industrial engineering, which deals with observing, reporting and improving manual operations. Motion economy knowledge is organized in principles regarding the sequences and characteristics of motions, arrangement of workspace, design of tools etc. A representation scheme is developed for products, workspace and hand motions of manual operations. Operation plans are generated using a forward chaining planner (TLPLAN). Planner and representation of domain have extensions compared to a standard forward chaining planner, for supporting concurrency, actions with resources and actions with durations. We formulated principles of motion economy as search control temporal formulas. In addition to motion economy rules, we developed rules for simulating common sense of humans and goal-related rules for preventing absurd sequences of actions in the plans. Search control rules constrain the problem and reduce search complexity. Plans are evaluated during search. Paths, which are not in conformity with the principles of motion economy, are pruned with motion economy rules. Sample problems are represented and solved. Diversity of types of these problems shows the generality of representation scheme. In experimental runs, effects of motion economy principles on the generation of plans are observed and analyzed.

Page generated in 0.2131 seconds