Goal Generation for Autonomous Planning Agents
Generating objectives and reasoning about them is key for intelligent planning agents to become more autonomous. Once a set of achievable goals has been chosen, a symbolic planner can find an executable plan to fulfil them. However, finding these goals is a complex problem when the aim is to optimise conflicting metrics such as goal benefit, plan cost, and its makespan. In this paper, we first propose a method to identify a set of potential goals in a temporal PDDL domain. Next, we find the achievable subset of goals that yields the most benefit by posing the problem as an integer linear program. Finally, a planner is used to solve the resulting subset of goals. The proposed method is generic and planner-independent, generating sets of goals that are neither provably unreachable nor mutually exclusive, thereby increasing the likelihood of finding a solvable plan. We demonstrate the effectiveness of the proposed approach in comparison with a baseline oversubscription planner.
Authors
- Gerard Canal (ORCID: https://orcid.org/0000-0002-6718-1198)
Institutions
- King's College London (GB)
Publication Details
- Journal
- ACM Transactions on Intelligent Systems and Technology
- Published
- 2026-11-12
- DOI
- https://doi.org/10.1145/3862854
- Primary Topic
- AI-based Problem Solving and Planning
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Royal Academy of Engineering