IP Library › Granted Patent US 12,682,176
Granted Patent B2
US 12,682,176 · App. 19/370,640 · Granted Jul 14, 2026

System and method for real-time team intent modeling using persistent cognitive machines with federated human profiles

Inventor: Brian Galvin (Silverdale, WA)
Assignee: ATOMBEAM TECHNOLOGIES INC.
G06F40/30G06F16/3325G06F16/3329
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,682,176
App. No.
19/370,640
Filed
Oct 27, 2025
Granted
Jul 14, 2026
Kind
B2
Art Unit
2658
USPC
704/9
Abstract

A system and method for real-time team intent modeling using persistent cognitive machines with federated human profiles which processes individual team member behavioral signals through geometric intent analyzers that generate high-dimensional vector representations of individual objectives and preferences. A team intent orchestrator aggregates individual vectors into collective representations within a dynamic geometric manifold that evolves based on team coordination patterns. Federated human profiles enable privacy-preserving knowledge sharing across teams through geometric abstraction techniques that preserve coordination utility while protecting individual privacy. The system implements proactive conflict detection through trajectory analysis that identifies potential coordination issues before performance impact, and provides real-time synchronization mechanisms that maintain team coordination coherence despite individual behavioral changes. Cross-team learning capabilities enable organizational intelligence development through pattern abstraction and context-aware adaptation of successful coordination strategies. The persistent cognitive architecture maintains coordination patterns across sessions and team composition changes, enabling continuous improvement through accumulated team experience.

Claims (31)

1 . A computer system for geometric intent processing comprising a hardware memory and one or more processors, wherein the computer system is configured to execute software instructions stored on nontransitory machine-readable storage media that:

receive a plurality of multi-modal behavioral input signals from individual users and transform the behavioral input signals into high-dimensional geometric intent vectors through mathematical encoding algorithms that map semantic relationships to coordinate positions within a latent vector space;

implement geometric manifold operations including computing geodesic distances between intent vectors using Riemannian metric tensor calculations and determining curvature properties that quantify semantic density distributions across the latent vector space, wherein determining the curvature properties comprises evaluating Ricci curvature tensors at a plurality of manifold positions and identifying regions of semantic concentration that function as persistent attractor basins guiding subsequent intent-vector trajectory computation;

execute real-time geometric aggregation algorithms that combine individual intent vectors through weighted centroid calculations and manifold-aware interpolation operations while preserving geometric consistency constraints;

apply differential privacy transformations to geometric representations through calibrated noise injection while maintaining coordination utility through dimensional reduction algorithms that preserve essential semantic relationships;

generate predictive trajectory calculations by solving geodesic equations through numerical integration schemes to forecast intent evolution patterns and identify geometric divergence conditions indicating potential coordination conflicts, wherein generating the predictive trajectory calculations comprises solving a geodesic deviation equation through Jacobi field computations to quantify trajectory stability, and identifying potential coordination conflicts when computed deviation magnitude exceeds a configurable threshold; and

update geometric manifold structure through controlled geometric flow processes that modify local curvature properties based on coordination effectiveness metrics while maintaining mathematical stability through constraint satisfaction algorithms, wherein updating the geometric manifold structure comprises applying a Ricci flow process that evolves a metric tensor field according to a curvature-driven differential equation modified by a coordination-effectiveness coupling term, and enforcing positive definiteness and bounded curvature constraints to prevent geometric singularities;

wherein the geometric processing operations enable computational performance improvements over conventional retrieval-based systems through continuous manifold traversal rather than iterative database queries, such that retrieval latency for relevant intent patterns remains substantially independent of the size of the maintained intent history.

2 . The computer system of claim 1 , wherein the high-dimensional geometric intent vectors comprise coordinate representations in Riemannian manifold space with time-evolving metric tensors that encode behavioral pattern strength through local curvature variations.

3 . The computer system of claim 1 , wherein the mathematical encoding algorithms comprise multi-modal signal processing that extracts semantic features from textual communications, temporal behavioral patterns, and contextual information through natural language processing and pattern recognition techniques.

4 . The computer system of claim 1 , wherein the geometric aggregation algorithms implement federated learning coordination that enables collective intelligence processing without exposing individual behavioral data through privacy-preserving geometric abstraction operations.

5 . The computer system of claim 1 , wherein the differential privacy transformations comprise k-anonymity techniques and coordinate system rotation operations that prevent individual identification while preserving geometric relationships necessary for coordination analysis.

6 . The computer system of claim 1 , wherein the geometric flow processes implement Ricci flow algorithms that evolve metric tensor properties according to curvature-driven differential equations while preserving manifold topology.

7 . The computer system of claim 1 , wherein the computer system is further configured to execute software instructions that maintain persistent geometric state across session boundaries through manifold geometry serialization and coordinate position restoration algorithms.

8 . The computer system of claim 1 , wherein the computer system is further configured to execute software instructions that generate coordination recommendations through geometric similarity calculations and pattern matching algorithms that identify optimal coordination strategies based on manifold trajectory analysis.

9 . The computer system of claim 1 , wherein the geometric manifold operations comprise attractor basin creation algorithms that establish stable coordination patterns as persistent geometric structures with curvature properties that guide future intent evolution toward effective coordination states.

10 . A method for geometric intent processing comprising:

receiving a plurality of multi-modal behavioral input signals from individual users and transforming the behavioral input signals into high-dimensional geometric intent vectors through mathematical encoding algorithms that map semantic relationships to coordinate positions within a latent vector space;

implementing geometric manifold operations including computing geodesic distances between intent vectors using Riemannian metric tensor calculations and determining curvature properties that quantify semantic density distributions across the latent vector space, wherein determining the curvature properties comprises evaluating Ricci curvature tensors at a plurality of manifold positions and identifying regions of semantic concentration that function as persistent attractor basins guiding subsequent intent-vector trajectory computation;

executing real-time geometric aggregation algorithms that combine individual intent vectors through weighted centroid calculations and manifold-aware interpolation operations while preserving geometric consistency constraints;

applying differential privacy transformations to geometric representations through calibrated noise injection while maintaining coordination utility through dimensional reduction algorithms that preserve essential semantic relationships;

generating predictive trajectory calculations by solving geodesic equations through numerical integration schemes to forecast intent evolution patterns and identify geometric divergence conditions indicating potential coordination conflicts, wherein generating the predictive trajectory calculations comprises solving a geodesic deviation equation through Jacobi field computations to quantify trajectory stability, and identifying potential coordination conflicts when computed deviation magnitude exceeds a configurable threshold; and

updating geometric manifold structure through controlled geometric flow processes that modify local curvature properties based on coordination effectiveness metrics while maintaining mathematical stability through constraint satisfaction algorithms, wherein updating the geometric manifold structure comprises applying a Ricci flow process that evolves a metric tensor field according to a curvature-driven differential equation modified by a coordination-effectiveness coupling term, and enforcing positive definiteness and bounded curvature constraints to prevent geometric singularities;

wherein the geometric processing operations enable computational performance improvements over conventional retrieval-based systems through continuous manifold traversal rather than iterative database queries, such that retrieval latency for relevant intent patterns remains substantially independent of the size of the maintained intent history.

11 . The method of claim 10 , wherein the high-dimensional geometric intent vectors comprise coordinate representations in Riemannian manifold space with time-evolving metric tensors that encode behavioral pattern strength through local curvature variations.

12 . The method of claim 10 , wherein the mathematical encoding algorithms comprise multi-modal signal processing that extracts semantic features from textual communications, temporal behavioral patterns, and contextual information through natural language processing and pattern recognition techniques.

13 . The method of claim 10 , wherein the geometric aggregation algorithms implement federated learning coordination that enables collective intelligence processing without exposing individual behavioral data through privacy-preserving geometric abstraction operations.

14 . The method of claim 10 , wherein the differential privacy transformations comprise k-anonymity techniques and coordinate system rotation operations that prevent individual identification while preserving geometric relationships necessary for coordination analysis.

15 . The method of claim 10 , further comprising maintaining persistent geometric state across session boundaries through manifold geometry serialization and coordinate position restoration algorithms.

16 . The method of claim 10 , further comprising generating coordination recommendations through geometric similarity calculations and pattern matching algorithms that identify optimal coordination strategies based on manifold trajectory analysis.

17 . The method of claim 10 , wherein the geometric manifold operations comprise attractor basin creation algorithms that establish stable coordination patterns as persistent geometric structures with curvature properties that guide future intent evolution toward effective coordination states.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 20, 2026
From: GALVIN, BRIAN
To: ATOMBEAM TECHNOLOGIES INC.
Reel/Frame 073857/0118 →
Continuity (46)
Continuation In Part 19352401 · Oct 7, 2025
Continuation In Part 19339302 · Sep 25, 2025
Continuation In Part 19329369 · Sep 15, 2025
Continuation In Part 19329533 · Sep 15, 2025
Continuation In Part 19328199 · Sep 14, 2025
Continuation In Part 19328179 · Sep 14, 2025
Continuation In Part 19328103 · Sep 13, 2025
Continuation In Part 19326730 · Sep 12, 2025
Continuation In Part 19328094 · Sep 12, 2025
Continuation In Part 19326730 · Sep 12, 2025
Continuation In Part 19321173 · Sep 6, 2025
Continuation In Part 19321173 · Sep 6, 2025
Continuation In Part 19294125 · Aug 7, 2025
Continuation In Part 19284115 · Jul 29, 2025
Continuation In Part 19245366 · Jun 22, 2025
Continuation In Part 19203069 · Jun 3, 2025
Continuation In Part 19205960 · May 12, 2025
Continuation In Part 19204525 · May 10, 2025
Continuation In Part 19192215 · Apr 28, 2025
Continuation In Part 19178873 · Apr 15, 2025
Continuation In Part 19177611 · Apr 13, 2025
Continuation In Part 19060794 · Feb 24, 2025
Continuation In Part 19051193 · Feb 12, 2025
Continuation 19051193 · Feb 12, 2025
Continuation In Part 19044546 · Feb 3, 2025
Continuation In Part 19026276 · Jan 16, 2025
Continuation In Part 18972797 · Dec 6, 2024
Continuation In Part 18928022 · Oct 26, 2024
Continuation In Part 18918077 · Oct 17, 2024
Continuation In Part 18919417 · Oct 17, 2024
Continuation In Part 18737906 · Jun 7, 2024
Continuation In Part 18736498 · Jun 6, 2024
Continuation In Part 18648340 · Apr 27, 2024
Continuation In Part 18427716 · Jan 30, 2024
Continuation In Part 18410980 · Jan 11, 2024
Continuation In Part 18537728 · Dec 12, 2023
Provisional Application 63848101 · Jul 21, 2025
Provisional Application 63847889 · Jul 21, 2025
Provisional Application 63848202 · Jul 21, 2025
Provisional Application 63847408 · Jul 20, 2025
Provisional Application 63847091 · Jul 19, 2025
Provisional Application 63847101 · Jul 19, 2025
Provisional Application 63847082 · Jul 19, 2025
Provisional Application 63847096 · Jul 19, 2025
Provisional Application 63651359 · May 23, 2024
Related Publication 20260050745A1 · Feb 19, 2026
References Cited (37)
US 4780718A · Hudson et al. · 1988 [cited by applicant]
US 5708436A · Loiz et al. · 1998 [cited by applicant]
US 7411540B1 · Lopez et al. · 2008 [cited by applicant]
US 7629922B2 · Winstead et al. · 2009 [cited by applicant]
US 7876257B2 · Vetro et al. · 2011 [cited by applicant]
US 9524392B2 · Naehrig et al. · 2016 [cited by applicant]
US 10489393B1 · Mittal · 2019 [cited by examiner]
US 10878808B1 · Mathias · 2020 [cited by examiner]
US 11132994B1 · Zhou · 2021 [cited by examiner]
US 11451242B2 · Choi et al. · 2022 [cited by applicant]
US 11656353B2 · Li et al. · 2023 [cited by applicant]
US 20040017307A1 · Cirillo et al. · 2004 [cited by applicant]
US 20040160353A1 · Cirillo et al. · 2004 [cited by applicant]
US 20080231504A1 · Sartor et al. · 2008 [cited by applicant]
US 20110012778A1 · Nguyen et al. · 2011 [cited by applicant]
US 20150054678A1 · Wakayama · 2015 [cited by applicant]
US 20170048537A1 · Boufounos et al. · 2017 [cited by applicant]
US 20180196609A1 · Niesen · 2018 [cited by applicant]
US 20200258296A1 · Pennings et al. · 2020 [cited by applicant]
US 20220156631A1 · Kanso et al. · 2022 [cited by applicant]
US 20220404490A1 · Evans et al. · 2022 [cited by applicant]
US 20230131694A1 · Saber et al. · 2023 [cited by applicant]
US 20230169623A1 · Chen et al. · 2023 [cited by applicant]
US 20230184927A1 · Chen et al. · 2023 [cited by applicant]
US 20240185037A1 · Park et al. · 2024 [cited by applicant]
US 20240195438A1 · Isik et al. · 2024 [cited by applicant]
EP 3364212A1 · 2018 [cited by applicant]
GB 2620921A · 2024 [cited by applicant]
WO 2020104416A1 · 2020 [cited by applicant]
Balaneshin-Kordan, Saeid et al; “Deep Neural Architecture for Multi-Modal Retrieval based on Joint Embedding Space for Text and Images”, Association for Computing Machinery, Feb. 5-9, 2018, pp. 1-9, Marina Del Rey, CA, … [cited by applicant]
Gim, In, et al; “Prompt Cache: Modular Attention Reuse for Low-Latency Inference”, arXiv:2311.04934v2, Apr. 2024. [cited by applicant]
Khan, Abdul Rafae, et al; “Coding Textual Inputs Boosts the Accuracy of Neural Networks”, 2020 Conference on Empirical Methods in Natural Language Processing, Nov. 16-20, 2020, pp. 1350-1360. [cited by applicant]
Messina, Nicola et al; “Towards Efficient Cross-Modal Visual Textual Retrieval using Transformer-Encoder Deep Features”, 2021 International Conference on Content-Based Multimedia Indexing, 2021, pp. 1-6, United States. [cited by applicant]
Seo, Beomsoek et al; “How Does A Transformer Learn Compression? An Attention Study on Huffman and LZ4”, Department of Electronic and Electrical Engineering, Dec. 12, 2023, vol. 11, Seoul, South Korea. [cited by applicant]
Vaswani, Ashish, et al; “Attention is All You Need”, arXiv:1706.03762v7, Aug. 2023. [cited by applicant]
Wang, Tianming, & Wan, Xiaojun; “T-CVAE: Transformer-based conditioned variational autoencoder for story completion”, Proceedings of the Twenty-Eighth Joint Conference on Artificial Intelligence, pp. 5233-5239, 2019. [cited by applicant]
Wieting, John et al; “A Bilingual Generative Transformer for Semantic Sentence Embedding”, arXiv:1911.03895v2, Nov. 2020. [cited by applicant]