Decision-Theoretic, High-Level Agent Programming in the Situation Calculus

Abstract

We proposea framework for robot programming which allows the seamless integration of explicit agent programming with decision-theoretic planning. Specifically, the DTGolog model allows one to partially specify a control program in a highlevel, logical language, and provides an interpreter that, given a logical axiomatization of a domain, will determine the optimal completion of that program (viewed as a Markov decision process). We demonstrate the utility of this model with results obtained in an office delivery robotics domain. 1 Introduction The construction of autonomous agents, such as mobile robots or software agents, is paramount in artificial intelligence, with considerable research devoted to methods that will ease the burden of designing controllers for such agents. There are two main ways in which the conceptual complexity of devising controllers can be managed. The first is to provide languages with which a programmer can specify a control program with relative eas...

Cite

Text

Boutilier et al. "Decision-Theoretic, High-Level Agent Programming in the Situation Calculus." AAAI Conference on Artificial Intelligence, 2000.

Markdown

[Boutilier et al. "Decision-Theoretic, High-Level Agent Programming in the Situation Calculus." AAAI Conference on Artificial Intelligence, 2000.](https://mlanthology.org/aaai/2000/boutilier2000aaai-decision-a/)

BibTeX

@inproceedings{boutilier2000aaai-decision-a,
  title     = {{Decision-Theoretic, High-Level Agent Programming in the Situation Calculus}},
  author    = {Boutilier, Craig and Reiter, Raymond and Soutchanski, Mikhail and Thrun, Sebastian},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2000},
  pages     = {355-362},
  url       = {https://mlanthology.org/aaai/2000/boutilier2000aaai-decision-a/}
}