A complete parameterized complexity analysis of bounded planning
- Submitting institution
-
The University of Sheffield
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2455
- Type
- D - Journal article
- DOI
-
10.1016/j.jcss.2015.04.002
- Title of journal
- Journal of Computer and System Sciences
- Article number
- -
- First page
- 1311
- Volume
- 81
- Issue
- 7
- ISSN
- 0022-0000
- Open access status
- Out of scope for open access requirements
- Month of publication
- April
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
A - Algorithms
- Citation count
- 10
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Planning is a central problem in AI, with a wide range of industrial applications for intelligent agents, autonomous robots and vehicles, NLP and verification. This work pioneers the study of parameterized complexity in planning, leading to a first comprehensive analysis and novel efficient algorithms. It initiated new collaborations with a world-leading planning group (Linköping University) as well as researchers at TU Wien, leading to 10 papers at key AI venues, e.g. AIJ: doi.org/10.1016/j.artint.2018.10.002, IJCAI: doi.org/10.24963/ijcai.2018/647 and https://www.ijcai.org/Abstract/13/146) and planning (ICAPS: https://tinyurl.com/yxlnj45w).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -