Share Email Print

Proceedings Paper

Transitioning Mechanized Plan Recognition From Closed To Real-World Domains
Author(s): Douglas Walter J. Chubb
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

David Chapman3 proved that planning which includes an action representation whose effects are a function of their input situation is undecidable. One of the paradoxes central to any formal theory of planning is how humans manage to accurately recognize on-going plans in real-world domains. Chapman has suggested that humans make use of cognitive cliches3. This paper introduces an axiomatic based mathematical theory of planning and plan recognition first described by the author4. The author argues that a real-world mechanized plan recognition paradigm should not include logical completeness as a criteria. Rather, the author proves that the human plan observer is knowledge-poor but cognitively complete. Plan action choice within cognitively complete domains is shown to critically depend upon ill-defined notions of set equality. The author describes a potential implementation of these ideas as a type of reactive planner, similar to Mase's and Kaelbing's recent research efforts8,7.

Paper Details

Date Published: 1 March 1990
PDF: 12 pages
Proc. SPIE 1198, Sensor Fusion II: Human and Machine Strategies, (1 March 1990); doi: 10.1117/12.970008
Show Author Affiliations
Douglas Walter J. Chubb, U.S. Army CECOM Center for Signals Warfare (United States)

Published in SPIE Proceedings Vol. 1198:
Sensor Fusion II: Human and Machine Strategies
Paul S. Schenker, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?