Fuzzy dynamic programming
Fuzzy dynamic programming
复制标题
DOI:
10.1007/978-1-4615-5645-9_9
复制
发表时间:
1999-04
期刊:
影响因子:
--
通讯作者:
A. Esogbue;J. Kacprzyk
中科院分区:
文献类型:
--
作者:
A. Esogbue;J. Kacprzyk
The performance of the process is measured over some planning horizon, and is expressed by an aggregate of partial scores which expresses the performance of the particular stage decision. This aggregate may take on various forms as, eg, from a pessimistic," safety-first" minimum to an optimistic maximum, through all intermediate cases exemplified by an (weighted) average. An optimal sequence ofdecisions or controls at the consecutive stages over the planning horizon (policy) assumed is then sought. Dynamic programming is a powerful formal apparatus for dealing with a large spectrum of multistage DM problems. Since its inception in the mid-1950's (cf. Bellman, 1957), dynamic programming has become a standard tool in many fields including operations research, systems analysis, engineering, data analysis, control, computer science, etc.In real world problems, we are faced however with imperfect information (data). We have to deal with, eg, uncertain, imprecise, vague, etc. data available. In modeling and analyzing problems of this genre, previous works tended to equate all aspects of imperfect information with uncertainty (of a random character). Thus, a multitude of probabilistic models were proposed. This was also the case with the use of dynamic programming. However, no simple and adequate formal apparatus for handling imprecise data-which may stem, eg, from the use of natural language by humans-was available until the mid-1960's when Zadeh (1965) proposed fuzzy sets theory. And, indeed, dynamic programming has been one of the earliest general techniques to which fuzzy sets theory has been applied (Chang, 1969; Bellman and Zadeh, 1970; Esogbue and Ramesh, 1970). These pioneering works have been followed by numerous contributions of both a foundational and applied character. They have been reviewed in many surveys as, eg, by Esogbue and Bellman (1984), Esogbue, Fedrizzi and Kacprzyk (1988), Kacprzyk (1994), Kacprzyk and Esogbue (1996) as well as in Kacprzyk (1983b, 1997). Recently, one may notice an increased interest in fuzzy dynamic programming which is certainly implied by more and more applications (d. Kacprzyk, 1997) some of which will be mentioned in this chapter too. The purpose of this chapter is to provide a short, readable, and up-to-date survey of fuzzy dynamic programming which would include a review of main problem classes, foundations, developments, and more relevant applications. Due to lack ofspace, we will assume that the reader is familiar with conventional (nonfuzzy) dynamic programming, though only a basic knowledge is required. To those readers who have not yet been exposed to dynamic programming, we can recommend any book on operations research, control, decision analysis, etc. Such books are available from virtually all major publishers. Our discussion will basically proceed in a broadly perceived context of decision analysis and operations research, though we have to be aware of the fact that (fuzzy) dynamic programming is a more general problem solving technique which goes well beyond these two fields. For instance, it is crucial for control with applications in all aspects of engineering and medicine, data analysis, computer science, economics, etc.