For the most recent entries see the Petri Nets Newsletter.

Reduced MDP Representation of a Logistical Planning Problem Using Petri-Nets.

Naguleswaran, Sanjeev; Hickmott, Sarah; White, Langford

In: Shichao Zhang, Ray Jarvis (Eds.): Lecture Notes in Computer Science, 3809: AI 2005: Advances in Artificial Intelligence: 18th Australian Joint Conference on Artificial Intelligence, Sydney, Australia, December 5-9, 2005., pages 830-833. Springer-Verlag, November 2005. URL: http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/1158999090,.

Abstract: This paper describes a method for unfolding a Predicate-net representation of a logistical planning problem, such that it possesses the Markov property. The problem can then be easily converted into a Markov Decision Process (MDP) which can be solved in a tractable manner using standard Dynamic Programming algorithms.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography