Debug Tracing Next Best Action Strategy Engine

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Debugging Next Best Action (NBA) engines in cloud computing environments is challenging due to limited information provided by existing tools, making it difficult to identify errors in strategies or code implementations.

Innovation Solution

A hierarchical tree representation is provided for the NBA engine's execution operations, along with data values for selected nodes, including an ordered list of options and time values, to facilitate detailed debugging and error identification.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of information

If existing debugging tools are used for NBA engines, then the debugging process can be initiated, but the information provided is limited and insufficient for identifying errors in strategies or code implementations

Engineering Contradiction:
Improvedebugging information completenessVSAvoiderror identification difficulty
Core Design Contradiction:
Loss of informationVSDifficulty of detecting and measuring

Solution Approach 1:

The debugging information is segmented into multiple hierarchical levels, with each level representing a different depth of execution detail. Users can navigate through these segments to access information at the appropriate granularity, from high-level execution flow to detailed node-level data, thereby comprehensively identifying errors without information overload

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a hierarchical dimension to the debugging interface, organizing execution information in a tree structure with multiple levels. This dimensional organization transforms flat, limited information into a multi-layered structure that preserves completeness while improving detectability through systematic navigation

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Measurement precision

If detailed execution data is provided for debugging, then error identification accuracy improves, but the complexity of the debugging tool increases

Engineering Contradiction:
Improveerror detection accuracyVSAvoiddebugging tool complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The debugging tool implements dynamic complexity management by allowing users to expand or collapse hierarchical nodes based on their debugging needs. The interface adapts its level of detail dynamically, presenting only necessary information at each stage, thus maintaining high detection accuracy while controlling perceived complexity through on-demand information disclosure

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent prepares debugging information in a pre-organized hierarchical structure before the user begins debugging. Execution data is collected and structured in advance according to the logical flow of the NBA engine, with nodes and relationships predetermined. This preliminary organization reduces the complexity of real-time information processing during debugging while ensuring accurate error detection

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10866959B2Debug tracing of next best action strategy engine
Publication Date: 2020.12.15 SALESFORCE INC
  • US10866959B2 patent drawing
  • US10866959B2 patent drawing
  • US10866959B2 patent drawing

AI summary

Disclosed are some implementations of systems, apparatus, methods and computer program products for facilitating the debug tracing of a Next Best Action (NBA) strategy engine. During debug tracing, a user may interact with a user interface representing execution of the NBA strategy engine. Upon interacting with a node representing a decision point, a corresponding ordered list of options generated by the NBA strategy engine and a set of time values resulting from execution of the corresponding segment of the NBA strategy engine are provided for display in proximity to the node.