Resource-conscious AI planning with conjunctions and disjunctions

Küngas, Peep: Resource-conscious AI planning with conjunctions and disjunctions. Acta cybernetica, (15) 4. pp. 601-620. (2002)

[img] Cikk, tanulmány, mű
cybernetica_015_numb_004_601-620.pdf

Download (1MB)

Abstract

The aim of this work is to develop a resource-conscious Artificial Intelligence (AI) planning system, which allows for nondeterminism in the environment. Such planner has a potential in applications where actions in "real world" are considered. The planning process is based on proof search for a fragment of Linear Logic (LL) [10] sequents using a subset of LL rules. As LL is resourceconscious and has additive disjunction connective (represents nondeterminism), LL sequents are used to describe an application domain, whereby every LL sequent represents pre- and postconditions of a particular action execution. We present an idea to use Petri net reachability tree analysis for finding proofs for propositional LL sequents. Game playing is used to solve LL additive disjunctions. From LL proofs plans are extracted which because of underlying LL properties keep track of resources and handle both deterministic and nondeterministic actions.

Item Type: Article
Event Title: Finno-Ugoric Symposium on Programming Languages and Software Tools, 7., 2001, Szeged
Journal or Publication Title: Acta cybernetica
Date: 2002
Volume: 15
Number: 4
Page Range: pp. 601-620
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 617-620.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 15:04
URI: http://acta.bibl.u-szeged.hu/id/eprint/12698

Actions (login required)

View Item View Item