To read this content please select one of the options below:

(excl. tax) 30 days to view and download

COST AUTOMATA, OPTIMALITY AND TOLERANCE

M.W. WARNER

Kybernetes

ISSN: 0368-492X

Article publication date: 1 January 1982

23

Abstract

A simple adaption of Dijkstra's algorithm for finding a minimum weight path on a weighted directed graph serves to solve the optimal control problem posed by Arbib for tolerance automata with cost function. Cumulative cost automata and the application of network theory to cost automata are also discussed.

Citation

WARNER, M.W. (1982), "COST AUTOMATA, OPTIMALITY AND TOLERANCE", Kybernetes, Vol. 11 No. 1, pp. 47-51. https://doi.org/10.1108/eb005607

Publisher

:

MCB UP Ltd

Copyright © 1982, MCB UP Limited

Related articles