Highly Reactive Decision Making: A Game with Time
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Planning and Scheduling. Pages 1002-1006.
Abstract
Real-time monitoring calls for decision making capabilities in reaction to observed events. Associative models provide efficiency by matching the observed situation to a recorded pattern equipped with an accurate decision. We rely on a decision tree accounting for the context and temporal chronicles expressing dynamic patterns. In highly reactive domains, i.e. when actions get as frequent as observations, the decision must anticipate the complete recognition of a pattern, comparing possible evolutions. This paper focuses on the on-line decision process, a game against Nature in the general case: a timed game automaton gathers the possible next steps with associated goodness values, and uses an opportunistic algorithm to compute a temporally expressive decision, maximizing its utility, i .e. the chances of "winning".
@inproceedings{ijcai1999p143,
title = {Highly Reactive Decision Making: A Game with Time},
author = {Vidal, Thierry and Coradeschi, Silvia},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {1002--1006},
year = {1999},
note = {Planning and Scheduling},
url = {https://ijcai.org/proceedings/1999/143},
}
TY - CPAPER TI - Highly Reactive Decision Making: A Game with Time AU - Vidal, Thierry AU - Coradeschi, Silvia T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 1002 EP - 1006 UR - https://ijcai.org/proceedings/1999/143 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
