Automated Task Rescheduling using Relational Markov Decision Processes with Logical State Abstractions

Autores
Palombarini, Jorge; Martínez, Ernesto
Año de publicación
2012
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Generating and representing knowledge about heuristics for repair-based scheduling is a key issue in any rescheduling strategy to deal with unforeseen events and disturbances. Resorting to a feature-based representation of schedule states is very inefficient and generalization to unseen states is highly unreliable whereas the acquired knowledge is difficult to transfer to similar scheduling domains. In contrast, first-order relational representations enable the exploitation of the existence of domain objects and relations over these objects, and enable the use of quantification over objectives (goals), action effects and properties of states. In this work, a novel approach which formalizes the rescheduling problem as a Relational Markov Decision Process integrating first-order (deictic) representations of (abstract) schedule states is presented. The proposed approach is implemented in a real-time rescheduling prototype, allowing an interactive scheduling strategy that may handle different repair goals and disruption scenarios. The industrial case study vividly shows how relational abstractions provide compact repair policies with less computational efforts.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Rescheduling
Relational Markov Decision Process
Manufacturing Systems
Reinforcement Learning
Abstract States
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/123726

id SEDICI_8fda5875d3e043e4af57838afe04e00e
oai_identifier_str oai:sedici.unlp.edu.ar:10915/123726
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Automated Task Rescheduling using Relational Markov Decision Processes with Logical State AbstractionsPalombarini, JorgeMartínez, ErnestoCiencias InformáticasReschedulingRelational Markov Decision ProcessManufacturing SystemsReinforcement LearningAbstract StatesGenerating and representing knowledge about heuristics for repair-based scheduling is a key issue in any rescheduling strategy to deal with unforeseen events and disturbances. Resorting to a feature-based representation of schedule states is very inefficient and generalization to unseen states is highly unreliable whereas the acquired knowledge is difficult to transfer to similar scheduling domains. In contrast, first-order relational representations enable the exploitation of the existence of domain objects and relations over these objects, and enable the use of quantification over objectives (goals), action effects and properties of states. In this work, a novel approach which formalizes the rescheduling problem as a Relational Markov Decision Process integrating first-order (deictic) representations of (abstract) schedule states is presented. The proposed approach is implemented in a real-time rescheduling prototype, allowing an interactive scheduling strategy that may handle different repair goals and disruption scenarios. The industrial case study vividly shows how relational abstractions provide compact repair policies with less computational efforts.Sociedad Argentina de Informática e Investigación Operativa2012-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf59-70http://sedici.unlp.edu.ar/handle/10915/123726enginfo:eu-repo/semantics/altIdentifier/url/https://41jaiio.sadio.org.ar/sites/default/files/6_ASAI_2012.pdfinfo:eu-repo/semantics/altIdentifier/issn/1850-2784info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:29:39Zoai:sedici.unlp.edu.ar:10915/123726Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:29:39.569SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Automated Task Rescheduling using Relational Markov Decision Processes with Logical State Abstractions
title Automated Task Rescheduling using Relational Markov Decision Processes with Logical State Abstractions
spellingShingle Automated Task Rescheduling using Relational Markov Decision Processes with Logical State Abstractions
Palombarini, Jorge
Ciencias Informáticas
Rescheduling
Relational Markov Decision Process
Manufacturing Systems
Reinforcement Learning
Abstract States
title_short Automated Task Rescheduling using Relational Markov Decision Processes with Logical State Abstractions
title_full Automated Task Rescheduling using Relational Markov Decision Processes with Logical State Abstractions
title_fullStr Automated Task Rescheduling using Relational Markov Decision Processes with Logical State Abstractions
title_full_unstemmed Automated Task Rescheduling using Relational Markov Decision Processes with Logical State Abstractions
title_sort Automated Task Rescheduling using Relational Markov Decision Processes with Logical State Abstractions
dc.creator.none.fl_str_mv Palombarini, Jorge
Martínez, Ernesto
author Palombarini, Jorge
author_facet Palombarini, Jorge
Martínez, Ernesto
author_role author
author2 Martínez, Ernesto
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Rescheduling
Relational Markov Decision Process
Manufacturing Systems
Reinforcement Learning
Abstract States
topic Ciencias Informáticas
Rescheduling
Relational Markov Decision Process
Manufacturing Systems
Reinforcement Learning
Abstract States
dc.description.none.fl_txt_mv Generating and representing knowledge about heuristics for repair-based scheduling is a key issue in any rescheduling strategy to deal with unforeseen events and disturbances. Resorting to a feature-based representation of schedule states is very inefficient and generalization to unseen states is highly unreliable whereas the acquired knowledge is difficult to transfer to similar scheduling domains. In contrast, first-order relational representations enable the exploitation of the existence of domain objects and relations over these objects, and enable the use of quantification over objectives (goals), action effects and properties of states. In this work, a novel approach which formalizes the rescheduling problem as a Relational Markov Decision Process integrating first-order (deictic) representations of (abstract) schedule states is presented. The proposed approach is implemented in a real-time rescheduling prototype, allowing an interactive scheduling strategy that may handle different repair goals and disruption scenarios. The industrial case study vividly shows how relational abstractions provide compact repair policies with less computational efforts.
Sociedad Argentina de Informática e Investigación Operativa
description Generating and representing knowledge about heuristics for repair-based scheduling is a key issue in any rescheduling strategy to deal with unforeseen events and disturbances. Resorting to a feature-based representation of schedule states is very inefficient and generalization to unseen states is highly unreliable whereas the acquired knowledge is difficult to transfer to similar scheduling domains. In contrast, first-order relational representations enable the exploitation of the existence of domain objects and relations over these objects, and enable the use of quantification over objectives (goals), action effects and properties of states. In this work, a novel approach which formalizes the rescheduling problem as a Relational Markov Decision Process integrating first-order (deictic) representations of (abstract) schedule states is presented. The proposed approach is implemented in a real-time rescheduling prototype, allowing an interactive scheduling strategy that may handle different repair goals and disruption scenarios. The industrial case study vividly shows how relational abstractions provide compact repair policies with less computational efforts.
publishDate 2012
dc.date.none.fl_str_mv 2012-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/123726
url http://sedici.unlp.edu.ar/handle/10915/123726
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://41jaiio.sadio.org.ar/sites/default/files/6_ASAI_2012.pdf
info:eu-repo/semantics/altIdentifier/issn/1850-2784
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
59-70
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616175819948032
score 13.070432