Title page for ETD etd-04252009-040338

Type of Document Master's Thesis
Author Klock, Brian Lee
URN etd-04252009-040338
Title Deceptive robots
Degree Master of Science
Department Electrical Engineering
Advisory Committee
Advisor Name Title
Roach, John W. Committee Chair
Abbott, A. Lynn Committee Member
Nutter, Jane Terry Committee Member
  • Robots
Date of Defense 1990-08-09
Availability restricted

Plan recognition in cooperative or adversarial situations requires the ability to reason with beliefs. The problem is complicated in adversarial situations because an opponent may employ deception. In this case, an agent must also be able to reason about an opponent's beliefs (nested beliefs) as well as his own beliefs. A system has been developed that permits agents to reason with nested beliefs using possible worlds semantics; consistency maintenance is employed to allow agents to revise their beliefs when an inconsistency occurs. The advantages over prior systems are that belief revision occurs without user interaction and that beliefs are treated as objects having equal status with facts; this permits complex interaction between beliefs and actions. The theory includes treatment of many areas necessary to create a system of multiple autonomous reasoning agents. These agents are given the ability to deceive each other and to predict when they are being deceived. The system is shown to be practical by its implementation in a simulation.

  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
[VT] LD5655.V855_1990.K576.pdf 10.86 Mb 00:50:16 00:25:51 00:22:37 00:11:18 00:00:57
[BTD] next to an author's name indicates that all files or directories associated with their ETD are accessible from the Virginia Tech campus network only.

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.