The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Forward-Chaining Partial-Order Planning
Open accessAbstract
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approaches of UCPOP and VHPOP. In this paper we explore the potential of a forward-chaining state-based search strategy to support partial-order planning in the solution of temporal-numeric problems. Our planner, POPF, is built on the foundations of grounded forward search, in combination with linear programming to handle continuous linear numeric change. To achieve a partial ordering we delay commitment to ordering decisions, timestamps and the values of numeric parameters, managing sets of constraints as actions are started and ended. In the context of a partially ordered collection of actions, constructing the linear program is complicated and we propose an efficient method for achieving this. Our late-commitment approach achieves flexibility, while benefiting from the informative search control of forward planning, and allows temporal and metric decisions to be made - as is most efficient - by the LP solver rather than by the discrete reasoning of the planner. We compare POPF with the approach of constructing a sequenced plan and then lifting a partial order from it, showing that our approach can offer improvements in terms of makespan, and time to find a solution, in several benchmark domains.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The FF Planning System: Fast Plan Generation Through Heuristic Search
Hoffmann, J., & Nebel, B. (2001) · Journal of Artificial Intelligence Research · doi:10.1613/jair.855 · Cited by 1,838
Dechter, R., Meiri, I., & Pearl, J. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90006-6 · Cited by 1,799
Planning for conjunctive goals
Chapman, D. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90092-0 · Cited by 1,112
UCPOP: a sound, complete, partial order planner for ADL
Penberthy, J. S., & Weld, D. S. (1992) · Cited by 676
VHPOP: Versatile Heuristic Partial Order Planner
Younes, H. L. S., & Simmons, R. G. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1136 · Cited by 187
Temporal planning with continuous change
Penberthy, J. S., & Weld, D. S. (1994) · Cited by 157
Sapa: A Domain-Independent Heuristic Metric Temporal Planner
Minh, N., & Subbarao Kambhampati, B. (2014) · Cited by 112
Planning with problems requiring temporal coordination
Coles, A., Fox, M., Long, D. P., & Smith, A. (2008) · Cited by 73
Self-citation
Cited by
ROSPlan: Planning in the Robot Operating System
Cashmore, M., Fox, M., Long, D., Magazzeni, D., Ridder, B., Carrera, A., Palomeras, N., Hurtos, N., & Carreras, M. (2015) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v25i1.13699 · Cited by 245
Self-citationMPTP: Motion-Planning-Aware Task Planning for Navigation in Belief Space
Thomas, A., Mastrogiovanni, F., & Baglietto, M. (2021) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2021.103786 · Cited by 21
Metadata
- Authors
- Coles, A., Coles, A., Fox, M., & Long, D.
- Venue
- Proceedings of the International Conference on Automated Planning and Scheduling
- Published
- 2010-05-05
- Volume
- 20
- Pages
- 42-49
- ISSN
- 2334-0835 (ISSN-L)
- 2334-0843
- OpenAlex
- W2159061314
- Cited by
- 257
- References
- 8
- FWCI
- 8.58
- Type
- conference paper
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.