{"type":"ScholarlyArticle","title":"Form Dynamic Programming To Search Algorithms With Functional Costs","authors":[{"name":"Alberto Martelli","slug":"alberto-martelli","given":"Alberto","family":"Martelli","affiliation":"dell'lnformazione Consiglio Nazionale delle Ricerche Pisa , Italy"},{"name":"Ugo Montanari","slug":"ugo-montanari","given":"Ugo","family":"Montanari","affiliation":"dell'lnformazione Consiglio Nazionale delle Ricerche Pisa , Italy"}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1975/53","pdf":"https://ijcai.org/proceedings/1975/0053.pdf","markdown":"https://ijcai.org/proceedings/1975/53.md","bibtex":"https://ijcai.org/proceedings/1975/bibtex/53","volume":{"slug":"1975","title":"Proceedings of the Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1975","url":"https://ijcai.org/proceedings/1975/","year":1975,"location":"Tbilisi, Georgia, USSR","dates":"","editors":"Patrick Winston and Carl Hewitt","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Search Techniques","track":"Search Techniques","number":53,"pages":{"first":345,"last":349},"keywords":[],"videos":[],"references":[{"position":1,"raw":"I . Karp , K.M. and Held, M .• Finite• state processes and dynamic pro!(• rammina SIAM J. Appl. Math., 15. 1'167, pp . 69.l-71K .","title":"Finite• state processes and dynamic pro!","authors":"I Karp, K M Held, M","year":null,"venue":"rammina SIAM J. Appl. Math","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"Martelli, A. and Montanari, U., On the foundations of dynamic prog- ramming , N.J. B73-ll,I.E.I. , Pisa, Oct. 197.1, to appear in li1pir. ! in 01mbinatorial Optimization , S. Kinaldi ed .. (' ISM, Springer Verlag .","title":"On the foundations of dynamic programming","authors":"A Martelli, U Montanari","year":null,"venue":"N.J. B","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"Martelli,A . and Montanari U., Dynamic programming schemata, Prur. second Coil on Automata, Languages and Programming. Saarbriicken, July 1974, Springer Verlag, pp . 66-80.","title":"Dynamic programming schemata","authors":"A Martelli, U Montanari","year":"1974","venue":"Prur. second Coil on Automata, Languages and Programming","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Hart , P .• Nilsson, N. and Raphael , B., A formal basis for the heuristic determination of minimum cost paths, IEEE Trant on Sy1 Sci. Cybernetics , SSC-4 , N. 2, July 1968, pp . 100-107 .","title":"A formal basis for the heuristic determination of minimum cost paths","authors":"P Hart, N Nilsson, B Raphael","year":"1968","venue":"IEEE Trant on Sy1 Sci. Cybernetics , SSC","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"Bellman, R.E., DyTIIJmic Programming, Princeton University Press, Princeton NJ . 1957.","title":"DyTIIJmic Programming","authors":"R E Bellman","year":"1957","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"Dijkstra, E., A note on two problems in connection with graphs, Numerische Matk, I, 1959, pp . 269-271.","title":"A note on two problems in connection with graphs","authors":"E Dijkstra","year":"1959","venue":"Numerische Matk","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"Johnson . D.B., Algorithms for shortest paths, Ph. D. Thesis, Cornell University,lthaca, N.Y ., May 1973.","title":"Algorithms for shortest paths","authors":"Johnson D B","year":"1973","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"Martelli , A. and Montanari, U., Additive AND/OR graphs, Proc TltiTd Int. Joint Conf on Art. Int. , Stanford, 1973, pp. I-ll .","title":"Additive AND/OR graphs","authors":"A Martelli, U Montanari","year":"1973","venue":"Proc TltiTd Int. Joint Conf on Art. Int","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"Martelli. A. and Montanari, U. , Programmazione dinamica c punto fisso,Atti Conv. di Informatica Teorica, Mantova, Nov. 1974, pp. l-19 (in Italian).","title":"Programmazione dinamica c punto fisso,Atti Conv. di Informatica Teorica","authors":"Martelli A Montanari, U","year":"1974","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Nilsson, N.J ., Problem-solving methods in artificial intelligence, Me Graw-Hill, N.Y., 1971.","title":"Problem-solving methods in artificial intelligence","authors":"N J Nilsson","year":"1971","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"II . Martelli, A. and Montanari, U., From dynamic programming to search algorithms with functional costs, lEI Internal Report 875-1, January 1975 .","title":"From dynamic programming to search algorithms with functional costs","authors":"A Ii . Martelli, U Montanari","year":"1975","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"Pohl, 1., Bi-directional and heuristic search in path problems, Ph .D. Thesis , Stanford University, Stanford , 1969.","title":"Bi-directional and heuristic search in path problems","authors":"Pohl","year":"1969","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}