Skip to main navigation Skip to search Skip to main content

Planning with uncertainty in action outcomes as linear programming problem

  • Silesian University of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Planning is a difficult computational problem. One way to increase efficiency of searching for a solution may be a transformation of a problem to another problem and then search for a solution of the transformed problem. In this work a transformation of STRIPS planning problem with uncertainty of operators outcomes to linear programming is shown. The transformation from planning to Linear Programming is based on mapping of conditions and operators in each plan step to variables. Exemplary simulation shows properties of proposed approach.

Original languageEnglish
Title of host publicationDistributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, Ambient Assisted Living - 10th Int. Work-Conf. Artificial Neural Networks, IWANN 2009 Workshops, Proceedings
Pages438-445
Number of pages8
EditionPART 2
DOIs
Publication statusPublished - 2009
Event10th International Work-Conference on Artificial Neural Networks, IWANN 2009 - Salamanca, Spain
Duration: 10 Jun 200912 Jun 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume5518 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Work-Conference on Artificial Neural Networks, IWANN 2009
Country/TerritorySpain
CitySalamanca
Period10/06/0912/06/09

Keywords

  • Biometrics
  • Computational efficiency
  • Linear programming
  • STRIPS planning
  • Uncertainty

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Planning with uncertainty in action outcomes as linear programming problem'. Together they form a unique fingerprint.

Cite this