Hierarchical dynamic planning of foundation model agents

A computer-implemented method, comprising:

• selecting, using a first FM-based agent, at least one existing agent available on an agent repository to execute a given sub-task in a plan based on at least one of skills of the existing agents, and complexity of the given sub-task;
• selecting an architecture for communication between the at least one existing agent, the selecting being based on at least one of:
• a problem domain, the complexity of the sub-task, and a context;
• and
• decomposing and executing the given sub-task using the selected architecture and the at least one existing agent.

A computer system comprising one or more processors, and a memory storing instructions, when the instructions are executed by the one or more processors, the computer system is configured to:

• acquire an initial requirement in natural language;
• generate, using a first FM-based agent and based on the initial requirement, a plan indicative of tasks and skills for achieving an objective;
• iteratively generate, using the first FM-based agent, adjusted versions of the plan,
• during a given iteration:
• verify, using a second FM-based agent, that a current version of the plan matches the initial requirement;
• compile a latest version of the plan in an executable graph format, thereby generating a compiled plan;
• and
• provide the compiled plan for execution by a third FM-based agent.