Form Dynamic Programming To Search Algorithms With Functional Costs
Proceedings of the Fourth International Joint Conference on Artificial Intelligence. Search Techniques. Pages 345-349.
Abstract
In this paper we approach, using artificial intelligence methods, the problem of finding a minimal-cost path in a functionally weighted graph, i.e . a graph with monotone cost functions associated with the arcs. This problem is important since solving any system of functional equations in a general dynamic programming formulation can be shown equivalent to it. A general heuristic search algorithm with estimate is given, which is a nontrivial extension of algorithm A• by Hart, Nilsson and Raphael. Put· ling some constraints on cost functions and on the estimate, this algorithm can be simplified until the classical version, with additive cost functions, is reached.
@inproceedings{ijcai1975p53,
title = {Form Dynamic Programming To Search Algorithms With Functional Costs},
author = {Martelli, Alberto and Montanari, Ugo},
booktitle = {Proceedings of the Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-75}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Patrick Winston and Carl Hewitt},
pages = {345--349},
year = {1975},
note = {Search Techniques},
url = {https://ijcai.org/proceedings/1975/53},
}
TY - CPAPER TI - Form Dynamic Programming To Search Algorithms With Functional Costs AU - Martelli, Alberto AU - Montanari, Ugo T2 - Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75 PB - International Joint Conferences on Artificial Intelligence PY - 1975 SP - 345 EP - 349 UR - https://ijcai.org/proceedings/1975/53 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
