By Topic

Planning via heuristic search in a Petri net framework

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. M. Passino ; Dept. of Electr. & Comput. Eng., Notre Dame Univ., IN, USA ; P. J. Antsaklis

An artificial intelligence planning system's main components consist of a planner and a problem domain. The problem domain is the environment about which the planner reasons and on which it takes action. In the paper, a special type of extended input/output Petri net is defined and then used as the problem representation for a wide class of problem domains. A planning strategy is developed using results from the theory of heuristic search. In particular, using the developed Petri net framework and metric spaces, a class of heuristic functions that are both admissible and consistent for the A* algorithm is specified. The planning system architecture is discussed, and, as an illustration of the results, two simple planning problems are modeled and solved

Published in:

Intelligent Control, 1988. Proceedings., IEEE International Symposium on

Date of Conference:

24-26 Aug 1988