Reasoning about partially observed actions

作者: Eyal Amir , Adam Vogel , Megan Nance

DOI:

关键词: Action (philosophy)Possible worldArtificial intelligenceRepresentation (mathematics)Automated planning and schedulingSequenceIdentity (object-oriented programming)Computer scienceKey (cryptography)State (computer science)

摘要: Partially observed actions are observations of action executions in which we uncertain about the identity objects, agents, or locations involved (e.g., know that move(?o, ?x, ?y) occurred, but do not ?o, ?y). Observed-Action Reasoning is problem reasoning world state after a sequence partial and states. In this paper formalize Reasoning, prove intractability results for current techniques, find tractable algorithms STRIPS other actions. Our new update representation all possible states (the belief state) logic using logical constants unknown objects. A straightforward application idea incorrect, identify add two key amendments. We also present successful experimental our algorithm Blocks-world domains varying sizes Kriegspiel (partially observable chess). These promising relating sensors with symbols, partial-knowledge games, multi-agent decision making, AI planning.

参考文章(12)
Stuart Russell, Jason Wolfe, Efficient belief-state AND-OR search, with application to Kriegspiel international joint conference on artificial intelligence. pp. 278- 285 ,(2005)
Peter F. Patel-Schneider, DLP System Description. Description Logics. ,(1998)
Paolo Liberatore, The complexity of belief update international joint conference on artificial intelligence. pp. 68- 73 ,(1997)
Eyal Amir, Afsaneh Shirazi, First-order logical filtering international joint conference on artificial intelligence. pp. 589- 595 ,(2005)
Alexandre Riazanov, Andrei Voronkov, Vampire 1.1 (System Description) international joint conference on automated reasoning. pp. 376- 380 ,(2001)
Bart Selman, Henry A. Kautz, David A. McAllester, Encoding plans in propositional logic principles of knowledge representation and reasoning. pp. 374- 384 ,(1996)
Bart Selman, Henry Kautz, Pushing the envelope: planning, propositional logic, and stochastic search national conference on artificial intelligence. pp. 1194- 1201 ,(1996)
Niklas Sörensson, Koen Lindström Claessen, New Techniques that Improve MACE-style Model Finding Model Computation. ,(2003)
Richard E Fikes, Peter E Hart, Nils J Nilsson, Learning and executing generalized robot plans Artificial Intelligence. ,vol. 3, pp. 485- 503 ,(1993) , 10.1016/0004-3702(72)90051-3