Temporal plannability by variance of the episode length

Simple item page
dc.creatorTakacs, Balint
dc.creatorSzita, Istvan
dc.creatorLorincz, Andras
dc.date2003-01-09
dc.date.accessioned2026-07-07T03:19:20Z
dc.date.available2026-07-07T03:19:20Z
dc.descriptionOptimization of decision problems in stochastic environments is usually concerned with maximizing the probability of achieving the goal and minimizing the expected episode length. For interacting agents in time-critical applications, learning of the possibility of scheduling of subtasks (events) or the full task is an additional relevant issue. Besides, there exist highly stochastic problems where the actual trajectories show great variety from episode to episode, but completing the task takes almost the same amount of time. The identification of sub-problems of this nature may promote e.g., planning, scheduling and segmenting Markov decision processes. In this work, formulae for the average duration as well as the standard deviation of the duration of events are derived. The emerging Bellman-type equation is a simple extension of Sobel's work (1982). Methods of dynamic programming as well as methods of reinforcement learning can be applied for our extension. Computer demonstration on a toy problem serve to highlight the principle.
dc.identifierhttps://arxiv.org/abs/cs/0301006
dc.identifierhttp://arxiv.org/abs/cs/0301006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31420
dc.subjectArtificial Intelligence
dc.subjectI.2.8
dc.titleTemporal plannability by variance of the episode length
dc.typetext

Files

Collections

arXiv