Skip to main content
Article thumbnail
Location of Repository

Agent programming via planning programs

By Fabio Patrizi and Sebastian Sardina

Abstract

We imagine agent “planning ” programs as programs built from achievement and maintenance goals. Their executions require the ability to meet such goals while respecting the programs ’ control flow. The question then is: can we always guarantee the execution of such programs? In this paper, we define this novel planningprogramming problem formally, and propose a sound, complete and optimal wrt computational complexity technique to actually generate a solution by appealing to recent results in LTL-based synthesis of reactive systems

Topics: I.12.4 [Artificial Intelligence, Knowledge Representation Formalisms and Methods General Terms Theory, Verification, Algorithms Keywords Agent programming, planning, synthesis, LTL, model checking
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.190.9247
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.dis.uniroma1.it/%7E... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.