The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Most of existing planning methods hitherto assume that each goal is achievable and goals are independent, which is very impractical in our daily life. In fact there often exist many positive and negative interactions between goals, and the orders suggested by the dependence between goals can be further used as heuristic information in planning. Although recently Over-Subscription Planning problems...
We introduce a novel extension to the classic Graphplan. Graphplan is based on the assumption that the initial set of objects is not changeable during planning. This assumption is not true in some cases. That is to say, the planning problems involving creating and destroying objects dynamically canpsilat be solved with classic Graphplan. In this paper, classic Graphplan is extended to solve the planning...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.