Arrow Research search

Author name cluster

Kwang Ryel Ryu

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

EAAI Journal 2017 Journal Article

Simulation-based multimodal optimization of decoy system design using an archived noise-tolerant genetic algorithm

  • Jeong Hee Hong
  • Kwang Ryel Ryu

The difficulty of warship decoy system design problem is twofold. First, we need to find not just one but as many optimal solutions as possible. Second, it demands a heavy computation to evaluate a candidate solution through a long series of underwater warfare simulations. The previous approach tried to reduce the amount of search by heuristically selecting a set of plausible starting points for the search by a simulated annealing algorithm. However, it shows only limited success and cannot easily scale up to larger problems. This paper proposes an efficient and easy-to-scale-up multimodal optimization algorithm named A-NTGA that is based on a genetic algorithm. A-NTGA quickly evaluates candidate solutions by conducting only a small number of simulations, but instead copes with these inaccurate or noisy fitness values by using a noisy optimization technique. To further enhance the efficiency of search by promoting the population diversity, A-NTGA is provided with an archive to which some good-looking solutions are migrated in order to prevent the population from being too crowded with similar solutions. Usually at the end of the search, many optimal solutions are retrieved from the archive as well as the population. The experimental results show that our method can find multiple optimal solutions more efficiently compared to other methods and can be easily scaled up to larger problems.

AAAI Conference 1992 Conference Paper

Learning from Goal Interactions in Planning: Goal Stack Analysis and Generalization

  • Kwang Ryel Ryu

This paper presents a methodology which enables the derivation of goal ordering rules from the analysis of problem failures. We examine all the planning actions that lead to failures. If there are restrictions imposed by a problem state on taking possible actions, the restrictions manifest themselves in the form of a restricted set of possible bindings. Our method makes use of this observation to derive general control rules which are guaranteed to be correct. The overhead involved in learning is low because our method examines only the goal stacks retrieved from the leaf nodes of a failure search tree rather than the whole tree. Empirical tests show that the rules derived by our system PAL, after sufficient training, performs as well as or better than those derived by systems such as PRODIGY/EBL and STATIC.

v2026.09.13