By Topic

Planning using abstraction induced by substitution property

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)
S. Mehta ; Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA ; A. Prakash

A knowledge-independent planning approach for a class of structured problems is discussed. The planning method is based on abstraction of the search space. It is shown that if the search space has the substitution property (substitution partitions), then a hierarchy of abstract spaces can be realized in which each space is a homomorphic image of its predecessor. The determination of the substitution property is considered. A sufficient condition for the existence of the substitution partition is identified in the form of a partition generator. Two interesting classes of problems are shown to possess such a generator. They are the problems with symmetry and direct product spaces with acyclic dependency (interaction)

Published in:

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

Date of Conference:

24-26 Aug 1988