On Transformation of Conditional Action Planning to Linear Programming

被引：0

作者：

Galuszka, Adam ^{[1
]}

Skrzypczyk, Krzysztof ^{[1
]}

Ilewicz, Witold ^{[1
]}

机构：

[1] Silesian Tech Univ, Inst Automat Control, PL-44100 Gliwice, Poland

来源：

2014 19TH INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN AUTOMATION AND ROBOTICS (MMAR) | 2014年

关键词：

conditional planning; linear programming; computional efficiency; COMPUTATIONAL-COMPLEXITY;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Planning in Artificial Intelligence is a problem of finding a sequence of actions that transform given initial state of the problem to desired goal situation. In this work we consider computational difficulty of so called conditional planning. Conditional planning is a problem of searching for plans that depend on sensory information and succeed no matter which of the possible initial states the world was actually in. Finding a plan of such problems is computationally difficult. To avoid this difficulty a transformation to Linear Programming Problem, illustrated by an example, is proposed.

引用

页码：764 / 769

页数：6

共 50 条

[31] Diversity, Equity, and Inclusion in Action: Planning, Leadership, and Programming
Johnson, Catherine
SERIALS REVIEW, 2022,
[32] A GRAPHICAL IMPLICIT PROGRAMMING SYSTEM FOR ROBOT ACTION PLANNING
FROMMHERZ, B
WERLING, G
INTELLIGENT AUTONOMOUS SYSTEMS 2, VOLS 1 AND 2, 1989, : 196 - 207
[33] Polyhedral Auto-transformation with No Integer Linear Programming
Acharya, Aravind
Bondhugula, Uday
Cohen, Albert
ACM SIGPLAN NOTICES, 2018, 53 (04) : 529 - 542
[34] Transformation Method for Solving Interval Linear Programming Problem
Suprajitno, Herry
bin Mohd, Ismail
INTERNATIONAL CONFERENCE ON MATHEMATICS, COMPUTATIONAL SCIENCES AND STATISTICS 2020, 2021, 2329
[35] Polyhedral Auto-transformation with No Integer Linear Programming
Acharya, Aravind
Bondhugula, Uday
Cohen, Albert
PROCEEDINGS OF THE 39TH ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION, PLDI 2018, 2018, : 529 - 542
[36] Conditional value at risk and related linear programming models for portfolio optimization
Renata Mansini
Włodzimierz Ogryczak
M. Grazia Speranza
Annals of Operations Research, 2007, 152 : 227 - 256
[37] Conditional value at risk and related linear programming models for portfolio optimization
Mansini, Renata
Ogryczak, Wlodzimierz
Speranza, M. Grazia
ANNALS OF OPERATIONS RESEARCH, 2007, 152 : 227 - 256
[38] Transformation of a multi-choice linear programming problem
Biswal, M. P.
Acharya, S.
APPLIED MATHEMATICS AND COMPUTATION, 2009, 210 (01) : 182 - 188
[39] THE TRANSFORMATION OF THE LINEAR DISJUNCTIVE PROGRAMMING PROBLEM INTO A FACIAL PROBLEM
FULOP, J
ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1988, 68 (05): : T440 - T441
[40] Scoring Functions of Approximation of STRIPS Planning by Linear Programming
Galuszka, Adam
PROCEEDINGS OF THE 9TH WSEAS INTERNATIONAL CONFERENCE ON SIMULATION, MODELLING AND OPTIMIZATION, 2009, : 316 - +

← 1 2 3 4 5 →