ML Anthology

Nonlinear Planning: A Rigorous Reconstruction

David Chapman
IJCAI 1985 pp. 1022-1024
/ijcai/1985/chapman1985ijcai-nonlinear/

Abstract

The problem of achieving several goals simultaneously lias been central to domain-independent planning research, the nonlinear constraint-posting approach has been most successful Previous planners of this type ''. 4, 5. f> have been complicated, heuristic, and ill-defined. 1 have combined and distilled the state of the art into a simple, precise, implemented algorithm (TWEAK) which I have proved correct and complete The simplicity and rigor of this algorithm illuminate the workings of previous planners, the range of applicability of current planning technology, and suggest future directions for research. This paper presents the mathematical foundations for non-linear planning; due to space limitations, I have omitted proofs, some detail, and much discussion These appear in 1

PDF Semantic Scholar

Cite

Text

Chapman. "Nonlinear Planning: A Rigorous Reconstruction." International Joint Conference on Artificial Intelligence, 1985.

Markdown

[Chapman. "Nonlinear Planning: A Rigorous Reconstruction." International Joint Conference on Artificial Intelligence, 1985.](https://mlanthology.org/ijcai/1985/chapman1985ijcai-nonlinear/)

BibTeX

@inproceedings{chapman1985ijcai-nonlinear,
  title     = {{Nonlinear Planning: A Rigorous Reconstruction}},
  author    = {Chapman, David},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1985},
  pages     = {1022-1024},
  url       = {https://mlanthology.org/ijcai/1985/chapman1985ijcai-nonlinear/}
}