Online and Hierarchical Agent Supervision

dc.contributor.advisorLesperance, Yves
dc.contributor.authorBanihashemi, Bita
dc.date.accessioned2023-10-04T11:07:18Z
dc.date.available2023-10-04T11:07:18Z
dc.date.issued2017-12
dc.date.updated2023-10-04T11:07:18Z
dc.degree.disciplineComputer Science
dc.degree.levelDoctoral
dc.degree.namePhD - Doctor of Philosophy
dc.description.abstractAgent supervision is a form of control/customization where a supervisor restricts the behavior of an agent to enforce certain requirements, while leaving the agent as much autonomy as possible. This framework is based on the situation calculus and a variant of the ConGolog agent programming language. In this dissertation, we focus on two of the open problems with the original account of agent supervision. The first open problem is supervising an agent that may acquire new knowledge about her environment during an online execution, for example, by sensing. The second open problem concerns the supervision of agents that operate in complex domains and have complex behavior. Such agents typically need to represent and reason about a large amount of knowledge. One approach to cope with this challenge is to use abstraction, which involves developing an abstract/high-level model of the agent behavior that suppresses less important details. Hence, we first investigate abstracting an agent's behavior in offline executions, and formalize a notion of sound and/or complete abstractions. Sound abstractions can be used to perform several forms of reasoning about action, such as planning, agent monitoring, and generating high-level explanations of low-level/concrete agent behavior. Moreover, we investigate abstraction of agent's behavior in online executions, and discuss its relation to hierarchical contingent planning. We then use our results on offline agent abstraction to formalize hierarchical agent supervision: in a first step, we only consider the high-level model and obtain the maximally permissive supervisor to customize the abstract agent behavior; then in a second step, we obtain a low-level supervisor by refining the high-level supervisor's actions locally. We show that this process can be done incrementally, without precomputing the local refinements.
dc.identifier.urihttps://hdl.handle.net/10315/41466
dc.languageen
dc.rightsAuthor owns copyright, except where explicitly noted. Please contact the author directly with licensing requests.
dc.subjectComputer science
dc.subjectArtificial intelligence
dc.subject.keywordsArtificial Intelligence
dc.subject.keywordsKnowledge representation and reasoning
dc.subject.keywordsReasoning about action and change
dc.subject.keywordsAgent supervision
dc.subject.keywordsOnline agent supervision
dc.subject.keywordsHierarchical agent supervision
dc.subject.keywordsAgent behavior customization
dc.subject.keywordsAgent behavior control
dc.subject.keywordsAgent abstraction
dc.titleOnline and Hierarchical Agent Supervision
dc.typeElectronic Thesis or Dissertation

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Banihashemi_Bita_2017_PhD.pdf
Size:
3.41 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
license.txt
Size:
1.87 KB
Format:
Plain Text
Description:
No Thumbnail Available
Name:
YorkU_ETDlicense.txt
Size:
3.39 KB
Format:
Plain Text
Description:

Collections