Design Optimization Using Dynamic Evaluation
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Knowledge Representation. Pages 1408-1411.
Abstract
We describe a search strategy that may be useful for a class of design problems by developing an example from cancer radiation treatment planning. This application problem involves typical features of design problems such as constraints, optimality, a large search space with continuously varying parameters as well as discrete (non-numeric) parameters. There is no known method of comparing elements of the solution space based on a static evaluation function. We have therefore developed a dynamic evaluation function, which attempts to heuristically compare all solutions with one another, as a way of interpreting the evaluation results. This allows us to use an analog of hill-climbing with a simple SELECT-GENERATETEST loop where expert rules are used as "move generators" and a similarity metric is used to control or direct the application of the rules for plan modification. Preliminary tests of these ideas indicate that a practical working system can be built.
@inproceedings{ijcai1989p225,
title = {Design Optimization Using Dynamic Evaluation},
author = {Paluszynski, Witold and Kalet, Ira},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {1408--1411},
year = {1989},
month = {8},
note = {Knowledge Representation},
url = {https://ijcai.org/proceedings/1989/225},
}
TY - CPAPER TI - Design Optimization Using Dynamic Evaluation AU - Paluszynski, Witold AU - Kalet, Ira T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 1408 EP - 1411 UR - https://ijcai.org/proceedings/1989/225 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: