Network Layout Authoring via Activity Clustering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network layout authoring tools, particularly those using the Critical Path Method (CPM), rely on outdated Gantt charts for visualization, which are ineffective in communicating project plans and schedules, especially when converting CPM schedules to Graphical Path Method (GPM) networks, leading to cluttered and suboptimal layouts that hinder user collaboration and interoperability.
Innovation Solution
An interactive, constraint-based network layout authoring method that utilizes logic chains and activity clusters to collaboratively author network layouts, transforming the GPM application from a mere layout servitor to a collaborator, enabling users to visually organize and optimize network layouts through a logic-timeline interface, thereby enhancing planning and scheduling efficacy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If traditional CPM Gantt charts are used for network layout visualization, then the layout process is simple, but the visualization effectiveness and clarity deteriorate
Solution Approach 1:
The patent segments the network layout into activity clusters that can be independently identified and placed as groups. This segmentation allows complex networks to be broken down into manageable units (clusters of contiguous activities) that maintain logical relationships while improving overall visualization clarity and reducing layout clutter.
Solution Approach 2:
The patent transitions from traditional one-dimensional Gantt chart timelines to a two-dimensional display grid layout where activities are positioned based on multiple criteria (logical relationships, temporal sequences, and spatial optimization). This dimensional change enables better visualization of complex network relationships while maintaining clarity.
2Productivity
If manual layout authoring is used, then layout precision can be controlled, but productivity and time consumption deteriorate
Solution Approach 1:
The system performs preliminary automated identification of activity clusters and their logical relationships before final placement. This preliminary structuring of the network data enables rapid subsequent placement while maintaining precision, as the clustering algorithm pre-processes the network to identify natural groupings that should remain together.
Solution Approach 2:
The layout system serves itself by automatically identifying activity clusters and determining their optimal placements based on embedded logical relationships and constraints. This self-service capability reduces manual intervention while maintaining high layout precision through algorithmic optimization of activity positioning on the display grid.
3Stability of the object's composition
If activities are placed individually, then placement flexibility is high, but layout coherence and visual organization deteriorate
Solution Approach 1:
The patent merges related activities into activity clusters that are placed and positioned as groups rather than individual elements. This merging maintains the logical coherence of related activities while preserving placement flexibility at the cluster level, allowing users to move entire clusters while maintaining internal relationships among cluster members.
4Adaptability or versatility
If automated layout algorithms are used, then productivity improves, but adaptability to user preferences deteriorates
Solution Approach 1:
The system dynamically adapts between automated cluster identification and user-directed placement adjustments. The layout process is dynamic, allowing automatic algorithmic placement when speed is prioritized, while also enabling user intervention to modify cluster positions or configurations when specific preferences need to be accommodated, thus balancing adaptability with efficiency.
Data Source
AI summary
A computer-implemented method for interactively authoring a layout of a network includes providing a network of activities, embedded nodes, milestones, benchmarks, and links between at least a portion of the activities, milestones, and benchmarks; identifying a plurality of activity clusters from the activities, each such activity cluster comprising a sequence of linked, contiguous activities in the network; and placing, as a group, the activities of each of the activity clusters on a display grid upon which the network is laid out.


