Full metadata
Title
AI Planning and Team Abstractions
Description
Many real-world problems rely on the collaboration of multiple agents. Making plans for these multiple agents such that the goal state can be achieved becomes more and more difficult as the number of objects to consider increases. The increase in the number of objects results in the exponential increase in time and space required to find a viable plan. By mapping each agent onto some team, creating an abstract plan, and applying the abstract plan to the concrete problem, we can produce plans that reach the goal state more quickly than by solving them directly. This is demonstrated by applying this method to multiple problems in a custom domain dubbed the “garden” domain.
Date Created
2022-05
Contributors
- Atkinson, Kyle (Author)
- Srivastava, Siddharth (Thesis director)
- Shah, Naman (Committee member)
- Barrett, The Honors College (Contributor)
- Computer Science and Engineering Program (Contributor)
Topical Subject
Resource Type
Copyright Statement
In Copyright
Primary Member of
Peer-reviewed
No
Open Access
No
Series
Academic Year 2021-2022
Handle
https://hdl.handle.net/2286/R.2.N.165152
System Created
- 2022-04-15 10:58:23
System Modified
- 2022-05-26 10:42:07
- 2 years 5 months ago
Additional Formats