liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Aghighi, Meysam
Publications (4 of 4) Show all publications
Aghighi, M. & Bäckström, C. (2016). A Multi-parameter Complexity Analysis of Cost-optimal and Net-benefit Planning. In: Amanda Coles, Andrew Coles, Stefan Edelkamp, Daniele Magazzeni, Scott Sanner (Ed.), Twenty-Sixth International Conference on Automated Planning and Scheduling King's College, London June 12, 2016 – June 17, 2016: . Paper presented at Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS-16), London, UK, June 12–17, 2016 (pp. 2-10). AAAI Press
Open this publication in new window or tab >>A Multi-parameter Complexity Analysis of Cost-optimal and Net-benefit Planning
2016 (English)In: Twenty-Sixth International Conference on Automated Planning and Scheduling King's College, London June 12, 2016 – June 17, 2016 / [ed] Amanda Coles, Andrew Coles, Stefan Edelkamp, Daniele Magazzeni, Scott Sanner, AAAI Press, 2016, p. 2-10Conference paper, Published paper (Refereed)
Abstract [en]

Aghighi and Bäckström have previously studied cost-optimal planning (COP) and net-benefit planning (NBP) for three action cost domains: the positive integers (Z_+), the non-negative integers (Z_0) and the positive rationals (Q_+). These were indistinguishable under standard complexity analysis for both problems, but separated for COP using parameterised complexity analysis. With the plan cost, k, as parameter, COP was W[2]-complete for Z_+, but para-NP-hard for both Z_0 and Q_+, i.e. presumably much harder. NBP was para-NP-hard for all three domains, thus remaining unseparable. We continue by considering combinations with several additional parameters and also the non-negative rationals (Q_0). Examples of new parameters are the plan length, l, and the largest denominator of the action costs, d. Our findings include: (1) COP remains W[2]-hard for all domains, even if combining all parameters; (2) COP for Z_0 is in W[2] for the combined parameter {k,l}; (3) COP for Q_+ is in W[2] for {k,d} and (4) COP for Q_0 is in W[2] for {k,d,l}. For NBP we consider further additional parameters, where the most crucial one for reducing complexity is the sum of variable utilities. Our results help to understand the previous results, eg. the separation between Z_+ and Q_+ for COP, and to refine the previous connections with empirical findings.

Place, publisher, year, edition, pages
AAAI Press, 2016
Keywords
cost-optimal planning, parameterised complexity, numeric domains
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-136278 (URN)9781577357575 (ISBN)
Conference
Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS-16), London, UK, June 12–17, 2016
Available from: 2017-04-05 Created: 2017-04-05 Last updated: 2019-05-08Bibliographically approved
Aghighi, M. & Bäckström, C. (2015). Cost-optimal and Net-benefit Planning: A Parameterised Complexity View. In: 24th International Joint Conference on Artificial Intelligence (IJCAI-15): . Paper presented at 24th International Joint Conference on Artificial Intelligence (IJCAI-15), Buenos Aires, Argentina, Jul 25-31, 2015 (pp. 1487-1493). IJCAI-INT JOINT CONF ARTIF INTELL, ALBERT-LUDWIGS UNIV FREIBURG GEORGES-KOHLER-ALLEE, INST INFORMATIK, GEB 052, FREIBURG, D-79110, GERMANY
Open this publication in new window or tab >>Cost-optimal and Net-benefit Planning: A Parameterised Complexity View
2015 (English)In: 24th International Joint Conference on Artificial Intelligence (IJCAI-15), IJCAI-INT JOINT CONF ARTIF INTELL, ALBERT-LUDWIGS UNIV FREIBURG GEORGES-KOHLER-ALLEE, INST INFORMATIK, GEB 052, FREIBURG, D-79110, GERMANY , 2015, p. 1487-1493Conference paper, Published paper (Refereed)
Abstract [en]

Cost-optimal planning (COP) uses action costs and asks for a minimum-cost plan. It is sometimes assumed that there is no harm in using actions with zero cost or rational cost. Classical complexity analysis does not contradict this assumption; planning is PSPACE-complete regardless of whether action costs are positive or non-negative, integer or rational. We thus apply parameterised complexity analysis to shed more light on this issue. Our main results are the following. COP is W[2]-complete for positive integer costs, i.e. it is no harder than finding a minimum-length plan, but it is para-NPhard if the costs are non-negative integers or positive rationals. This is a very strong indication that the latter cases are substantially harder. Net-benefit planning (NBP) additionally assigns goal utilities and asks for a plan with maximum difference between its utility and its cost. NBP is para-NP-hard even when action costs and utilities are positive integers, suggesting that it is harder than COP. In addition, we also analyse a large number of subclasses, using both the PUBS restrictions and restricting the number of preconditions and effects.

Place, publisher, year, edition, pages
IJCAI-INT JOINT CONF ARTIF INTELL, ALBERT-LUDWIGS UNIV FREIBURG GEORGES-KOHLER-ALLEE, INST INFORMATIK, GEB 052, FREIBURG, D-79110, GERMANY, 2015
National Category
Transport Systems and Logistics
Identifiers
urn:nbn:se:liu:diva-128181 (URN)000442637801080 ()9781577357384 (ISBN)
Conference
24th International Joint Conference on Artificial Intelligence (IJCAI-15), Buenos Aires, Argentina, Jul 25-31, 2015
Funder
CUGS (National Graduate School in Computer Science), 1054Swedish Research Council, 621- 2014-4086
Available from: 2016-05-20 Created: 2016-05-20 Last updated: 2019-07-03Bibliographically approved
Aghighi, M., Jonsson, P. & Ståhlberg, S. (2015). Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence: . Paper presented at 29th AAAI Conference on Artificial Intelligence (AAAI-15), January 25–30, Austin, TX, USA. AAAI Press
Open this publication in new window or tab >>Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs
2015 (English)In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, 2015Conference paper, Published paper (Refereed)
Abstract [en]

Causal graphs are widely used to analyze the complexity of planning problems. Many tractable classes have been identified with their aid and state-of-the-art heuristics have been derived by exploiting such classes. In particular, Katz and Keyder have studied causal graphs that are hourglasses (which is a generalization of forks and inverted-forks) and shown that the corresponding cost-optimal planning problem is tractable under certain restrictions. We continue this work by studying polytrees (which is a generalization of hourglasses) under similar restrictions. We prove tractability of cost-optimal planning by providing an algorithm based on a novel notion of variable isomorphism. Our algorithm also sheds light on the k-consistency procedure for identifying unsolvable planning instances. We speculate that this may, at least partially, explain why merge-and-shrink heuristics have been successful for recognizing unsolvable instances.

Place, publisher, year, edition, pages
AAAI Press, 2015
Series
Proceedings of the AAAI Conference on Artificial Intelligence, ISSN 2159-5399, E-ISSN 2374-3468
Keywords
automated planning, causal graph, polynomial-time algorithm, cost-optimal planning, polytree
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-118729 (URN)978-1-57735-703-2 (ISBN)
Conference
29th AAAI Conference on Artificial Intelligence (AAAI-15), January 25–30, Austin, TX, USA
Funder
CUGS (National Graduate School in Computer Science)
Available from: 2015-06-03 Created: 2015-06-03 Last updated: 2017-05-17
Aghighi, M. & Jonsson, P. (2014). Oversubscription planning: Complexity and compilability. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence: . Paper presented at 28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014 (pp. 2221-2227). AI Access Foundation, 3
Open this publication in new window or tab >>Oversubscription planning: Complexity and compilability
2014 (English)In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AI Access Foundation , 2014, Vol. 3, p. 2221-2227Conference paper, Published paper (Refereed)
Abstract [en]

Many real-world planning problems are oversubscription problems where all goals are not simultaneously achievable and the planner needs to find a feasible subset. We present complexity results for the so-called partial satisfaction and net benefit problems under various restrictions; this extends previous work by van den Briel et al. Our results reveal strong connections between these problems and with classical planning. We also present a method for efficiently compiling oversubscription problems into the ordinary plan existence problem; this can be viewed as a continuation of earlier work by Keyder and Geffner.

Place, publisher, year, edition, pages
AI Access Foundation, 2014
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:liu:diva-116727 (URN)2-s2.0-84908192348 (Scopus ID)9781577356790 (ISBN)
Conference
28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014
Available from: 2015-04-09 Created: 2015-04-02 Last updated: 2018-01-11
Organisations

Search in DiVA

Show all publications