Matches in SemOpenAlex for { <https://semopenalex.org/work/W232029085> ?p ?o ?g. }
Showing items 1 to 41 of
41
with 100 items per page.
- W232029085 abstract "Abstract : A special structure in dynamic programming is the problem of programming over a Markov chain. This paper extends the solution algorithms to programming over a Markov - renewal process - in which times between transitions of the system from state i to state j are independent samples from an inter-transition distribution which may depend on both i and j. For these processes, a general reward structure and a decision mechanism are postulated; the problem is to make decisions at each transition to maximize the total expected reward at the end of the planning horizon. For finite-horizon problems, or infinite-horizon problems with discounting, there is no difficulty; the results are similar to previous work, expect for a new dependency upon the transition time distributions being generally present. In the cases where the horizon extends towards infinity, or when discounting vanishes, however, a fundamental dichotomy in the optimal solutions may occur. It then becomes important to specify whether the limiting experiment is: (i) undiscounted, with the number of transitions n approaches infinity , (ii) undiscounted, with a time horizon t approaches infinity , or (iii) infinite n or t , with discount factor a approaches 0 . In each case, a limiting form for the total expected reward is shown, and an algorithm developed to maximize the rate of return. The problem of finding the optimal or near-optimal policies In the case of ties in rate of return is still computationally unresolved. Extensions to non-ergodic processes are indicated, and special results for the two-state process are presented. Finally, an example of machine maintenance and repair is used to illustrate the generality of the approach and the special problems which may arise." @default.
- W232029085 created "2016-06-24" @default.
- W232029085 creator A5065755086 @default.
- W232029085 date "1962-10-23" @default.
- W232029085 modified "2023-09-27" @default.
- W232029085 title "MARKOV-RENEWAL PROGRAMMING" @default.
- W232029085 doi "https://doi.org/10.21236/ad0402064" @default.
- W232029085 hasPublicationYear "1962" @default.
- W232029085 type Work @default.
- W232029085 sameAs 232029085 @default.
- W232029085 citedByCount "28" @default.
- W232029085 countsByYear W2320290852014 @default.
- W232029085 countsByYear W2320290852015 @default.
- W232029085 countsByYear W2320290852017 @default.
- W232029085 countsByYear W2320290852018 @default.
- W232029085 countsByYear W2320290852020 @default.
- W232029085 countsByYear W2320290852022 @default.
- W232029085 countsByYear W2320290852023 @default.
- W232029085 crossrefType "report" @default.
- W232029085 hasAuthorship W232029085A5065755086 @default.
- W232029085 hasConcept C199360897 @default.
- W232029085 hasConcept C41008148 @default.
- W232029085 hasConceptScore W232029085C199360897 @default.
- W232029085 hasConceptScore W232029085C41008148 @default.
- W232029085 hasLocation W2320290851 @default.
- W232029085 hasOpenAccess W232029085 @default.
- W232029085 hasPrimaryLocation W2320290851 @default.
- W232029085 hasRelatedWork W2013111119 @default.
- W232029085 hasRelatedWork W2047793074 @default.
- W232029085 hasRelatedWork W2112962394 @default.
- W232029085 hasRelatedWork W2118300983 @default.
- W232029085 hasRelatedWork W2382501300 @default.
- W232029085 hasRelatedWork W3137189469 @default.
- W232029085 hasRelatedWork W3162240892 @default.
- W232029085 hasRelatedWork W4235530921 @default.
- W232029085 hasRelatedWork W4243252198 @default.
- W232029085 hasRelatedWork W4245713008 @default.
- W232029085 isParatext "false" @default.
- W232029085 isRetracted "false" @default.
- W232029085 magId "232029085" @default.
- W232029085 workType "report" @default.