nrl-tracker 0.21.4__tar.gz → 0.22.0__tar.gz

{nrl_tracker-0.21.4/nrl_tracker.egg-info → nrl_tracker-0.22.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: nrl-tracker
-Version: 0.21.4
+Version: 0.22.0
 Summary: Python port of the U.S. Naval Research Laboratory's Tracker Component Library for target tracking algorithms
 Author: Original: David F. Crouse, Naval Research Laboratory
 Maintainer: Python Port Contributors
@@ -60,7 +60,7 @@ Requires-Dist: nrl-tracker[astronomy,dev,geodesy,optimization,signal,visualizati
 
 # Tracker Component Library (Python)
 
-[![PyPI version](https://img.shields.io/badge/pypi-v0.21.4-blue.svg)](https://pypi.org/project/nrl-tracker/)
+[![PyPI version](https://img.shields.io/badge/pypi-v0.22.0-blue.svg)](https://pypi.org/project/nrl-tracker/)
 [![Python 3.10+](https://img.shields.io/badge/python-3.10+-blue.svg)](https://www.python.org/downloads/)
 [![License: Public Domain](https://img.shields.io/badge/License-Public%20Domain-brightgreen.svg)](https://en.wikipedia.org/wiki/Public_domain)
 [![Code style: black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black)

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/README.md

@@ -1,6 +1,6 @@
 # Tracker Component Library (Python)
 
-[![PyPI version](https://img.shields.io/badge/pypi-v0.21.4-blue.svg)](https://pypi.org/project/nrl-tracker/)
+[![PyPI version](https://img.shields.io/badge/pypi-v0.22.0-blue.svg)](https://pypi.org/project/nrl-tracker/)
 [![Python 3.10+](https://img.shields.io/badge/python-3.10+-blue.svg)](https://www.python.org/downloads/)
 [![License: Public Domain](https://img.shields.io/badge/License-Public%20Domain-brightgreen.svg)](https://en.wikipedia.org/wiki/Public_domain)
 [![Code style: black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black)

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0/nrl_tracker.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: nrl-tracker
-Version: 0.21.4
+Version: 0.22.0
 Summary: Python port of the U.S. Naval Research Laboratory's Tracker Component Library for target tracking algorithms
 Author: Original: David F. Crouse, Naval Research Laboratory
 Maintainer: Python Port Contributors
@@ -60,7 +60,7 @@ Requires-Dist: nrl-tracker[astronomy,dev,geodesy,optimization,signal,visualizati
 
 # Tracker Component Library (Python)
 
-[![PyPI version](https://img.shields.io/badge/pypi-v0.21.4-blue.svg)](https://pypi.org/project/nrl-tracker/)
+[![PyPI version](https://img.shields.io/badge/pypi-v0.22.0-blue.svg)](https://pypi.org/project/nrl-tracker/)
 [![Python 3.10+](https://img.shields.io/badge/python-3.10+-blue.svg)](https://www.python.org/downloads/)
 [![License: Public Domain](https://img.shields.io/badge/License-Public%20Domain-brightgreen.svg)](https://en.wikipedia.org/wiki/Public_domain)
 [![Code style: black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black)

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/nrl_tracker.egg-info/SOURCES.txt

@@ -19,9 +19,11 @@ pytcl/assignment_algorithms/two_dimensional/__init__.py
 pytcl/assignment_algorithms/two_dimensional/assignment.py
 pytcl/assignment_algorithms/two_dimensional/kbest.py
 pytcl/astronomical/__init__.py
+pytcl/astronomical/ephemerides.py
 pytcl/astronomical/lambert.py
 pytcl/astronomical/orbital_mechanics.py
 pytcl/astronomical/reference_frames.py
+pytcl/astronomical/relativity.py
 pytcl/astronomical/time_systems.py
 pytcl/atmosphere/__init__.py
 pytcl/atmosphere/models.py
@@ -163,6 +165,7 @@ tests/test_coverage_boost_2.py
 tests/test_dynamic_models.py
 tests/test_egm.py
 tests/test_emm.py
+tests/test_ephemerides.py
 tests/test_gaussian_mixtures.py
 tests/test_geophysical.py
 tests/test_great_circle.py
@@ -176,6 +179,7 @@ tests/test_performance_evaluation.py
 tests/test_phase6_specialized.py
 tests/test_plotting.py
 tests/test_projections.py
+tests/test_relativity.py
 tests/test_rhumb.py
 tests/test_signal_processing.py
 tests/test_smoothers.py

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "nrl-tracker"
-version = "0.21.4"
+version = "0.22.0"
 description = "Python port of the U.S. Naval Research Laboratory's Tracker Component Library for target tracking algorithms"
 readme = "README.md"
 authors = [

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/pytcl/__init__.py

@@ -20,7 +20,7 @@ References
        no. 5, pp. 18-27, May 2017.
 """
 
-__version__ = "0.21.4"
+__version__ = "0.22.0"
 __author__ = "Python Port Contributors"
 __original_author__ = "David F. Crouse, Naval Research Laboratory"
 
@@ -30,16 +30,14 @@ __original_author__ = "David F. Crouse, Naval Research Laboratory"
 # Specialized domains (Phase 6)
 # Assignment algorithms (Phase 5)
 # Core utilities
-from pytcl import (
-    assignment_algorithms,
-    astronomical,
-    atmosphere,
-    core,
-    navigation,
-    performance_evaluation,
-    plotting,
-    trackers,
-)
+from pytcl import assignment_algorithms
+from pytcl import astronomical
+from pytcl import atmosphere
+from pytcl import core
+from pytcl import navigation
+from pytcl import performance_evaluation
+from pytcl import plotting
+from pytcl import trackers
 
 
 # Version tuple for programmatic access

nrl_tracker-0.22.0/pytcl/assignment_algorithms/__init__.py

@@ -0,0 +1,84 @@
+"""
+Assignment algorithms for data association in target tracking.
+
+This module provides:
+- 2D assignment algorithms (Hungarian, Auction)
+- K-best 2D assignment (Murty's algorithm)
+- 3D assignment algorithms (Lagrangian relaxation, Auction)
+- Gating methods (ellipsoidal, rectangular)
+- Data association algorithms (GNN, JPDA)
+"""
+
+from pytcl.assignment_algorithms.data_association import AssociationResult
+from pytcl.assignment_algorithms.data_association import compute_association_cost
+from pytcl.assignment_algorithms.data_association import gated_gnn_association
+from pytcl.assignment_algorithms.data_association import gnn_association
+from pytcl.assignment_algorithms.data_association import nearest_neighbor
+from pytcl.assignment_algorithms.gating import chi2_gate_threshold
+from pytcl.assignment_algorithms.gating import compute_gate_volume
+from pytcl.assignment_algorithms.gating import ellipsoidal_gate
+from pytcl.assignment_algorithms.gating import gate_measurements
+from pytcl.assignment_algorithms.gating import mahalanobis_distance
+from pytcl.assignment_algorithms.gating import rectangular_gate
+from pytcl.assignment_algorithms.jpda import JPDAResult
+from pytcl.assignment_algorithms.jpda import JPDAUpdate
+from pytcl.assignment_algorithms.jpda import compute_likelihood_matrix
+from pytcl.assignment_algorithms.jpda import jpda
+from pytcl.assignment_algorithms.jpda import jpda_probabilities
+from pytcl.assignment_algorithms.jpda import jpda_update
+from pytcl.assignment_algorithms.three_dimensional import Assignment3DResult
+from pytcl.assignment_algorithms.three_dimensional import assign3d
+from pytcl.assignment_algorithms.three_dimensional import assign3d_auction
+from pytcl.assignment_algorithms.three_dimensional import assign3d_lagrangian
+from pytcl.assignment_algorithms.three_dimensional import decompose_to_2d
+from pytcl.assignment_algorithms.three_dimensional import greedy_3d
+from pytcl.assignment_algorithms.two_dimensional import AssignmentResult
+from pytcl.assignment_algorithms.two_dimensional import KBestResult
+from pytcl.assignment_algorithms.two_dimensional import assign2d
+from pytcl.assignment_algorithms.two_dimensional import auction
+from pytcl.assignment_algorithms.two_dimensional import hungarian
+from pytcl.assignment_algorithms.two_dimensional import kbest_assign2d
+from pytcl.assignment_algorithms.two_dimensional import linear_sum_assignment
+from pytcl.assignment_algorithms.two_dimensional import murty
+from pytcl.assignment_algorithms.two_dimensional import ranked_assignments
+
+__all__ = [
+    # 2D Assignment
+    "hungarian",
+    "auction",
+    "linear_sum_assignment",
+    "assign2d",
+    "AssignmentResult",
+    # K-Best 2D Assignment
+    "KBestResult",
+    "murty",
+    "kbest_assign2d",
+    "ranked_assignments",
+    # 3D Assignment
+    "Assignment3DResult",
+    "assign3d",
+    "assign3d_lagrangian",
+    "assign3d_auction",
+    "greedy_3d",
+    "decompose_to_2d",
+    # Gating
+    "ellipsoidal_gate",
+    "rectangular_gate",
+    "gate_measurements",
+    "mahalanobis_distance",
+    "chi2_gate_threshold",
+    "compute_gate_volume",
+    # Data Association
+    "gnn_association",
+    "nearest_neighbor",
+    "compute_association_cost",
+    "gated_gnn_association",
+    "AssociationResult",
+    # JPDA
+    "JPDAResult",
+    "JPDAUpdate",
+    "jpda",
+    "jpda_update",
+    "jpda_probabilities",
+    "compute_likelihood_matrix",
+]

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/pytcl/assignment_algorithms/data_association.py

@@ -5,18 +5,17 @@ This module provides algorithms for associating measurements to tracks,
 including Global Nearest Neighbor (GNN) and related methods.
 """
 
-from typing import List, NamedTuple, Optional
+from typing import List
+from typing import NamedTuple
+from typing import Optional
 
 import numpy as np
-from numpy.typing import ArrayLike, NDArray
-
-from pytcl.assignment_algorithms.gating import (
-    mahalanobis_batch,
-    mahalanobis_distance,
-)
-from pytcl.assignment_algorithms.two_dimensional import (
-    assign2d,
-)
+from numpy.typing import ArrayLike
+from numpy.typing import NDArray
+
+from pytcl.assignment_algorithms.gating import mahalanobis_batch
+from pytcl.assignment_algorithms.gating import mahalanobis_distance
+from pytcl.assignment_algorithms.two_dimensional import assign2d
 
 
 class AssociationResult(NamedTuple):

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/pytcl/assignment_algorithms/gating.py

@@ -5,11 +5,13 @@ This module provides gating methods to determine which measurements
 fall within a validation region around predicted track states.
 """
 
-from typing import List, Tuple
+from typing import List
+from typing import Tuple
 
 import numpy as np
 from numba import njit
-from numpy.typing import ArrayLike, NDArray
+from numpy.typing import ArrayLike
+from numpy.typing import NDArray
 from scipy.stats import chi2
 
 
@@ -19,9 +21,9 @@ def _mahalanobis_distance_2d(
     S_inv: np.ndarray,
 ) -> float:
     """JIT-compiled Mahalanobis distance for 2D innovations."""
-    return innovation[0] * (
-        S_inv[0, 0] * innovation[0] + S_inv[0, 1] * innovation[1]
-    ) + innovation[1] * (S_inv[1, 0] * innovation[0] + S_inv[1, 1] * innovation[1])
+    return innovation[0] * (S_inv[0, 0] * innovation[0] + S_inv[0, 1] * innovation[1]) + innovation[
+        1
+    ] * (S_inv[1, 0] * innovation[0] + S_inv[1, 1] * innovation[1])
 
 
 @njit(cache=True, fastmath=True)

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/pytcl/assignment_algorithms/jpda.py

@@ -9,11 +9,15 @@ This is more sophisticated than GNN which makes hard assignment decisions,
 as JPDA can handle measurement origin uncertainty in cluttered environments.
 """
 
-from typing import List, NamedTuple, Optional, Tuple
+from typing import List
+from typing import NamedTuple
+from typing import Optional
+from typing import Tuple
 
 import numpy as np
 from numba import njit
-from numpy.typing import ArrayLike, NDArray
+from numpy.typing import ArrayLike
+from numpy.typing import NDArray
 from scipy.stats import chi2
 
 from pytcl.assignment_algorithms.gating import mahalanobis_distance
@@ -94,9 +98,7 @@ def compute_measurement_likelihood(
         return 0.0
 
     mahal_sq = innovation @ np.linalg.solve(innovation_cov, innovation)
-    likelihood = (
-        detection_prob * np.exp(-0.5 * mahal_sq) / np.sqrt((2 * np.pi) ** m * det_S)
-    )
+    likelihood = detection_prob * np.exp(-0.5 * mahal_sq) / np.sqrt((2 * np.pi) ** m * det_S)
 
     return likelihood
 
@@ -210,9 +212,7 @@ def jpda_probabilities(
     if n_tracks <= 5 and n_meas <= 5:
         beta = _jpda_exact(likelihood_matrix, gated, detection_prob, clutter_density)
     else:
-        beta = _jpda_approximate(
-            likelihood_matrix, gated, detection_prob, clutter_density
-        )
+        beta = _jpda_approximate(likelihood_matrix, gated, detection_prob, clutter_density)
 
     return beta
 
@@ -258,9 +258,7 @@ def _jpda_exact(
             if gated[track_idx, meas_idx] and track_idx not in used_tracks:
                 current_assignment.append(track_idx)
                 used_tracks.add(track_idx)
-                yield from generate_hypotheses(
-                    meas_idx + 1, current_assignment, used_tracks
-                )
+                yield from generate_hypotheses(meas_idx + 1, current_assignment, used_tracks)
                 used_tracks.remove(track_idx)
                 current_assignment.pop()
 
@@ -298,9 +296,7 @@ def _jpda_exact(
         hypothesis_probs = [p / total_prob for p in hypothesis_probs]
 
     # Compute marginal association probabilities
-    for h_idx, (assignment, prob) in enumerate(
-        zip(hypothesis_assignments, hypothesis_probs)
-    ):
+    for h_idx, (assignment, prob) in enumerate(zip(hypothesis_assignments, hypothesis_probs)):
         detected_tracks = set()
         for j, track_idx in enumerate(assignment):
             if track_idx >= 0:

nrl_tracker-0.22.0/pytcl/assignment_algorithms/three_dimensional/__init__.py

@@ -0,0 +1,22 @@
+"""
+Three-dimensional assignment algorithms.
+
+This module provides algorithms for solving 3D assignment problems,
+which arise in multi-sensor data fusion and multi-scan tracking.
+"""
+
+from pytcl.assignment_algorithms.three_dimensional.assignment import Assignment3DResult
+from pytcl.assignment_algorithms.three_dimensional.assignment import assign3d
+from pytcl.assignment_algorithms.three_dimensional.assignment import assign3d_auction
+from pytcl.assignment_algorithms.three_dimensional.assignment import assign3d_lagrangian
+from pytcl.assignment_algorithms.three_dimensional.assignment import decompose_to_2d
+from pytcl.assignment_algorithms.three_dimensional.assignment import greedy_3d
+
+__all__ = [
+    "Assignment3DResult",
+    "assign3d",
+    "assign3d_lagrangian",
+    "assign3d_auction",
+    "greedy_3d",
+    "decompose_to_2d",
+]

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/pytcl/assignment_algorithms/three_dimensional/assignment.py

@@ -11,10 +11,14 @@ cost subject to the constraint that each index appears in at most one
 selected tuple.
 """
 
-from typing import List, NamedTuple, Optional, Tuple
+from typing import List
+from typing import NamedTuple
+from typing import Optional
+from typing import Tuple
 
 import numpy as np
-from numpy.typing import ArrayLike, NDArray
+from numpy.typing import ArrayLike
+from numpy.typing import NDArray
 from scipy.optimize import linear_sum_assignment as scipy_lsa
 
 

nrl_tracker-0.22.0/pytcl/assignment_algorithms/two_dimensional/__init__.py

@@ -0,0 +1,31 @@
+"""
+Two-dimensional assignment algorithms.
+
+This module provides optimal and suboptimal algorithms for solving
+the 2D assignment problem (bipartite matching), as well as k-best
+assignment algorithms for Multiple Hypothesis Tracking.
+"""
+
+from pytcl.assignment_algorithms.two_dimensional.assignment import AssignmentResult
+from pytcl.assignment_algorithms.two_dimensional.assignment import assign2d
+from pytcl.assignment_algorithms.two_dimensional.assignment import auction
+from pytcl.assignment_algorithms.two_dimensional.assignment import hungarian
+from pytcl.assignment_algorithms.two_dimensional.assignment import linear_sum_assignment
+from pytcl.assignment_algorithms.two_dimensional.kbest import KBestResult
+from pytcl.assignment_algorithms.two_dimensional.kbest import kbest_assign2d
+from pytcl.assignment_algorithms.two_dimensional.kbest import murty
+from pytcl.assignment_algorithms.two_dimensional.kbest import ranked_assignments
+
+__all__ = [
+    # 2D Assignment
+    "hungarian",
+    "auction",
+    "linear_sum_assignment",
+    "assign2d",
+    "AssignmentResult",
+    # K-Best Assignment
+    "KBestResult",
+    "murty",
+    "kbest_assign2d",
+    "ranked_assignments",
+]

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/pytcl/assignment_algorithms/two_dimensional/assignment.py

@@ -5,10 +5,13 @@ This module provides algorithms for solving the 2D assignment (bipartite matchin
 problem, which is fundamental to data association in target tracking.
 """
 
-from typing import NamedTuple, Optional, Tuple
+from typing import NamedTuple
+from typing import Optional
+from typing import Tuple
 
 import numpy as np
-from numpy.typing import ArrayLike, NDArray
+from numpy.typing import ArrayLike
+from numpy.typing import NDArray
 from scipy.optimize import linear_sum_assignment as scipy_lsa
 
 

{nrl_tracker-0.21.4 → nrl_tracker-0.22.0}/pytcl/assignment_algorithms/two_dimensional/kbest.py

@@ -6,16 +6,18 @@ This module provides algorithms for finding the k best solutions to the
 Multiple Hypothesis Tracking (MHT).
 """
 
-from typing import List, NamedTuple, Optional, Tuple
+from typing import List
+from typing import NamedTuple
+from typing import Optional
+from typing import Tuple
 
 import numpy as np
-from numpy.typing import ArrayLike, NDArray
+from numpy.typing import ArrayLike
+from numpy.typing import NDArray
 from scipy.optimize import linear_sum_assignment as scipy_lsa
 
-from pytcl.assignment_algorithms.two_dimensional.assignment import (
-    AssignmentResult,
-    assign2d,
-)
+from pytcl.assignment_algorithms.two_dimensional.assignment import AssignmentResult
+from pytcl.assignment_algorithms.two_dimensional.assignment import assign2d
 
 
 class KBestResult(NamedTuple):
@@ -335,9 +337,7 @@ def _partition_solution(
 
     for i in range(start_idx, n_assigned):
         # Require assignments 0..i-1, forbid assignment i
-        new_required = required + [
-            (row_ind[j], col_ind[j]) for j in range(start_idx, i)
-        ]
+        new_required = required + [(row_ind[j], col_ind[j]) for j in range(start_idx, i)]
         new_forbidden = forbidden + [(row_ind[i], col_ind[i])]
 
         # Solve constrained problem