Files in this item



application/pdf9512334.pdf (14MB)Restricted to U of Illinois
(no description provided)PDF


Title:Algorithms for combinatorial optimization in real-time and their automated refinements by genetics-based learning
Author(s):Chu, Lon-Chan
Doctoral Committee Chair(s):Wah, Benjamin W.
Department / Program:Electrical and Computer Engineering
Discipline:Electrical Engineering
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Engineering, Electronics and Electrical
Artificial Intelligence
Computer Science
Abstract:The goal of this research is to develop a systematic, integrated method of designing efficient search algorithms that solve optimization problems in real time. Search algorithms studied in this thesis comprise meta-control and primitive search. The class of optimization problems addressed are called combinatorial optimization problems, examples of which include many NP-hard scheduling and planning problems, and problems in operations research and artificial-intelligence applications. The problems we have addressed have a well-defined problem objective and a finite set of well-defined problem constraints. In this research, we use state-space trees as problem representations. The approach we have undertaken in designing efficient search algorithms is an engineering approach and consists of two phases: (a) designing generic search algorithms, and (b) improving by genetics-based machine learning methods parametric heuristics used in the search algorithms designed. Our approach is a systematic method that integrates domain knowledge, search techniques, and automated learning techniques for designing better search algorithms. Knowledge captured in designing one search algorithm can be carried over for designing new ones.
Issue Date:1994
Rights Information:Copyright 1994 Chu, Lon-Chan
Date Available in IDEALS:2011-05-07
Identifier in Online Catalog:AAI9512334
OCLC Identifier:(UMI)AAI9512334

This item appears in the following Collection(s)

Item Statistics