Planning without state space explosion: Petri net to Markov decision process

DOI10.1111/j.1475-3995.2009.00674.xzbMath1168.90642OpenAlexW2093811986MaRDI QIDQ3393989

S. Naguleswaran, Langford B. White

Publication date: 28 August 2009

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00674.x

zbMATH Keywords

dynamic programmingMarkov decision processesPetri netsshortest path problemautomated planning

Mathematics Subject Classification ID

Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Uses Software

• Walksat
• Graphplan

Cites Work

• System modelling with high-level Petri nets
• A technique of state space search based on unfolding
• A predicate-transition net model for parallel interpretation of logic programs
• Markov nets: probabilistic models for distributed and concurrent systems
• A New Policy Evaluation Algorithm for Markov Decision Processes with Quasi Birth-Death Structure
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Planning without state space explosion: Petri net to Markov decision process