ANNOUNCEMENT

NOBEL PRIZE 2026

This year's laureates, their fields, and the discoveries that earned them the prize.Live nowSee the winners
Moonbase
← Back to Awards
NSFDirectorate for Computer and Information Science and Engineering

CAREER: Solving Pathfinding Problems with High-Level Goal Specifications

Active
Institution
University of South Carolina at Columbia, SC
Principal investigator
Forest Agostinelli
Funding
$492K
Duration
2026–2031
Open portfolio

Moonbase score

Still being scored

Abstract

Pathfinding is essential for making effective decisions about how to move through complex spaces, from robots navigating crowded warehouses to synthesizing molecules through sequences of reactions. A significant roadblock to solving these pathfinding problems is that the goal may only be describable at a high level. For example, in chemical synthesis, scientists may know the properties a therapeutic molecule should have, but not know of any molecule that has such properties. This project seeks to remove this roadblock by creating novel artificial intelligence (AI) algorithms to solve pathfinding problems based on high-level goal descriptions. This could lead to the discovery of new goal configurations and reduce the time and cost required to solve pathfinding problems. The objective of this project is to address high-level goal specification and goal reaching for pathfinding problems, where a high-level goal specification defines a set of goal states without explicitly specifying any state in the set. The ability to find paths based on high-level goal specifications becomes necessary when properties of a goal state can be specified, but states that satisfy these properties are not known. This project will develop novel domain-independent AI algorithms that combine machine learning, heuristic search, and formal logic to reach goals specified with answer set programming, an expressive logic programming language. Deep reinforcement learning will be used to train a deep neural network heuristic function that estimates the distance between a given state and a high-level goal specification defined using answer set programming. To learn from failures, a neuro-symbolic algorithm that refines the heuristic function using symbolic constraints extracted from failure cases will be developed. The project will also contribute to education and training of students in AI by providing hands-on experience, exposure to real-world applications, and engagement with current research challenges that build both practical skills and deeper conceptual understanding. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

LOADING MOONBASE SCORE

Directorate for Computer and Information Science and Engineering01002627DB NSF RESEARCH & RELATED ACTIVIT01002930DB NSF RESEARCH & RELATED ACTIVIT01003031DB NSF RESEARCH & RELATED ACTIVITRobust Intelligencetrainintelligencesequencesexamplespecificationsspacesessentialaddresswithoutdescribable

Questions for University of South Carolina at Columbia

Answered by the team behind this research.

Same researchers, same institution, same topic, scored first.