From dynamic programming to search algorithms with functional costs

Authors:
A. Martelli;U. Montanari
Affiliations:
Istituto di Elaborazione dell'lnformazione, Consiglio Nazionale delle Ricerche, Pisa, Italy;Istituto di Elaborazione dell'lnformazione, Consiglio Nazionale delle Ricerche, Pisa, Italy
Venue:
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Year:
1975

Citing 6
Cited 1

Dynamic Programming Schemata

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Dynamic Programming

Dynamic Programming
Bi-directional and heuristic search in path problems

Bi-directional and heuristic search in path problems
Algorithms for shortest paths.

Algorithms for shortest paths.
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
Additive AND/OR graphs

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence

The Seventies

Concurrency, Graphs and Models

Quantified Score

Hi-index	0.00

Visualization

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. Putting some constraints on cost functions and on the estimate, this algorithm can be simplified until the classical version, with additive cost functions, is reached.