Repository Analysis

AtsushiSakai/PythonRobotics

Python sample codes and textbook for robotics algorithms.

9.8 Low AI signal View on GitHub

Analysis Overview

This report presents the forensic synthetic code analysis of AtsushiSakai/PythonRobotics, a Python project with 30,032 GitHub stars. SynthScan v2.0 examined 37,751 lines of code across 286 source files, recording 228 pattern matches distributed across 9 syntactic categories. The overall adjusted score of 9.8 places this repository in the Low AI signal band.

The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).

9.8
Adjusted Score
9.8
Raw Score
100%
Time Factor
2026-07-13
Last Push
30.0K
Stars
Python
Language
37.8K
Lines of Code
286
Files
228
Pattern Hits
2026-07-14
Scan Date
0.11
HC Hit Rate

What These Metrics Mean

Adjusted Score
Primary synthetic code indicator. Raw score normalised per 1,000 lines of code and multiplied by the temporal discount factor. This is the definitive comparative metric — use it to rank repositories by AI authorship density.
Raw Score
The unmodified sum of all severity-weighted, context-multiplied pattern match scores before temporal discounting. Reflects the absolute signal strength independent of when the repository was last active.
Time Factor
The temporal discount multiplier (0–100%) applied to the raw score. Repositories last updated before ChatGPT's launch (Nov 2022) receive a 5% factor. Full signal is only assigned to repositories active in the post-adoption era (Jan 2024+).
Pattern Hits
Total count of individual pattern matches across all files and categories. A high hit count with a low score may indicate a very large codebase with isolated AI snippets; a low count with a high score indicates dense, concentrated AI signatures.
HC Hit Rate
High+Critical pattern hits per file, averaged across the repository. This orthogonal signal catches repositories where a few files are densely packed with high-severity AI tells — a strong indicator even when the normalised score appears moderate due to codebase size.
Lines of Code / Files
Total lines and files analysed. The scanner examines 94 file extensions. These denominators are used to normalise the score, enabling fair comparison between repositories of vastly different sizes.

Score History

This chart maps the temporal evolution of the adjusted synthetic code score across successive scan runs. An upward trajectory indicates ongoing incorporation of AI-generated code or expanding LLM-assisted scaffolding; a stable or declining trajectory may reflect active human refactoring, code removal, or the adoption of stricter authorship policies. The dashed secondary line (right axis) independently tracks total raw pattern hit count, which can diverge from the normalised score when codebase size changes significantly between scans.

Severity Breakdown

Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.

CRITICAL 0HIGH 31MEDIUM 5LOW 192

Directory Score Breakdown

This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.

Pattern Findings

The scanner identified 228 distinct pattern matches across 9 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.

Reading the findings table: The Severity column indicates the diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.

Cross-File Repetition31 hits · 155 pts
SeverityFileLineSnippetContext
HIGH…ing/lqr_speed_steer_control/lqr_speed_steer_control.py0solve a discrete time_algebraic riccati equation (dare)STRING
HIGHPathTracking/lqr_steer_control/lqr_steer_control.py0solve a discrete time_algebraic riccati equation (dare)STRING
HIGHInvertedPendulum/inverted_pendulum_lqr_control.py0solve a discrete time_algebraic riccati equation (dare)STRING
HIGHPathPlanning/LQRPlanner/lqr_planner.py0solve a discrete time_algebraic riccati equation (dare)STRING
HIGH…ing/lqr_speed_steer_control/lqr_speed_steer_control.py0solve the discrete time lqr controller. x[k+1] = a x[k] + b u[k] cost = sum x[k].t*q*x[k] + u[k].t*r*u[k] # ref bertsekaSTRING
HIGHPathTracking/lqr_steer_control/lqr_steer_control.py0solve the discrete time lqr controller. x[k+1] = a x[k] + b u[k] cost = sum x[k].t*q*x[k] + u[k].t*r*u[k] # ref bertsekaSTRING
HIGHInvertedPendulum/inverted_pendulum_lqr_control.py0solve the discrete time lqr controller. x[k+1] = a x[k] + b u[k] cost = sum x[k].t*q*x[k] + u[k].t*r*u[k] # ref bertsekaSTRING
HIGHPathPlanning/LQRPlanner/lqr_planner.py0solve the discrete time lqr controller. x[k+1] = a x[k] + b u[k] cost = sum x[k].t*q*x[k] + u[k].t*r*u[k] # ref bertsekaSTRING
HIGHPathPlanning/AStar/a_star.py0initialize grid map for greedy best-first planning ox: x position list of obstacles [m] oy: y position list of obstaclesSTRING
HIGHPathPlanning/BidirectionalAStar/bidirectional_a_star.py0initialize grid map for greedy best-first planning ox: x position list of obstacles [m] oy: y position list of obstaclesSTRING
HIGHPathPlanning/BreadthFirstSearch/breadth_first_search.py0initialize grid map for greedy best-first planning ox: x position list of obstacles [m] oy: y position list of obstaclesSTRING
HIGH…eadthFirstSearch/bidirectional_breadth_first_search.py0initialize grid map for greedy best-first planning ox: x position list of obstacles [m] oy: y position list of obstaclesSTRING
HIGHPathPlanning/DepthFirstSearch/depth_first_search.py0initialize grid map for greedy best-first planning ox: x position list of obstacles [m] oy: y position list of obstaclesSTRING
HIGHPathPlanning/ThetaStar/theta_star.py0initialize grid map for greedy best-first planning ox: x position list of obstacles [m] oy: y position list of obstaclesSTRING
HIGHPathPlanning/Dijkstra/dijkstra.py0initialize grid map for greedy best-first planning ox: x position list of obstacles [m] oy: y position list of obstaclesSTRING
HIGH…ning/GreedyBestFirstSearch/greedy_best_first_search.py0initialize grid map for greedy best-first planning ox: x position list of obstacles [m] oy: y position list of obstaclesSTRING
HIGHPathPlanning/AStar/a_star.py0theta star path search input: s_x: start x position [m] s_y: start y position [m] gx: goal x position [m] gy: goal y posSTRING
HIGHPathPlanning/BidirectionalAStar/bidirectional_a_star.py0theta star path search input: s_x: start x position [m] s_y: start y position [m] gx: goal x position [m] gy: goal y posSTRING
HIGHPathPlanning/ThetaStar/theta_star.py0theta star path search input: s_x: start x position [m] s_y: start y position [m] gx: goal x position [m] gy: goal y posSTRING
HIGHPathPlanning/AStar/a_star.py0calc grid position :param index: :param min_position: :return:STRING
HIGH…eadthFirstSearch/bidirectional_breadth_first_search.py0calc grid position :param index: :param min_position: :return:STRING
HIGHPathPlanning/BidirectionalAStar/bidirectional_a_star.py0calc grid position :param index: :param min_position: :return:STRING
HIGHPathPlanning/ThetaStar/theta_star.py0calc grid position :param index: :param min_position: :return:STRING
HIGHPathPlanning/BreadthFirstSearch/breadth_first_search.py0calc grid position :param index: :param minp: :return:STRING
HIGHPathPlanning/DepthFirstSearch/depth_first_search.py0calc grid position :param index: :param minp: :return:STRING
HIGH…ning/GreedyBestFirstSearch/greedy_best_first_search.py0calc grid position :param index: :param minp: :return:STRING
HIGHPathPlanning/LQRRRTStar/lqr_rrt_star.py0setting parameter start:start position [x,y] goal:goal position [x,y] obstacle_list:obstacle positions [[x,y,size],...] STRING
HIGHPathPlanning/RRTDubins/rrt_dubins.py0setting parameter start:start position [x,y] goal:goal position [x,y] obstacle_list:obstacle positions [[x,y,size],...] STRING
HIGHPathPlanning/RRTStarReedsShepp/rrt_star_reeds_shepp.py0setting parameter start:start position [x,y] goal:goal position [x,y] obstacle_list:obstacle positions [[x,y,size],...] STRING
HIGHPathPlanning/RRTStarDubins/rrt_star_dubins.py0setting parameter start:start position [x,y] goal:goal position [x,y] obstacle_list:obstacle positions [[x,y,size],...] STRING
HIGHPathPlanning/RRT/rrt_with_sobol_sampler.py0setting parameter start:start position [x,y] goal:goal position [x,y] obstacle_list:obstacle positions [[x,y,size],...] STRING
Hyper-Verbose Identifiers91 hits · 96 pts
SeverityFileLineSnippetContext
LOWMapping/gaussian_grid_map/gaussian_grid_map.py19def generate_gaussian_grid_map(ox, oy, xyreso, std):CODE
LOWMapping/lidar_to_grid_map/lidar_to_grid_map.py161def generate_ray_casting_grid_map(ox, oy, xy_resolution, breshen=True):CODE
LOWMapping/ndt_map/ndt_map.py83def create_dummy_observation_data():CODE
LOWMapping/ray_casting_grid_map/ray_casting_grid_map.py78def generate_ray_casting_grid_map(ox, oy, xyreso, yawreso):CODE
LOWMapping/grid_map_lib/grid_map_lib.py158 def calc_grid_index_from_xy_index(self, x_ind, y_ind):CODE
LOWMapping/grid_map_lib/grid_map_lib.py162 def calc_xy_index_from_grid_index(self, grid_ind):CODE
LOWMapping/grid_map_lib/grid_map_lib.py166 def calc_grid_index_from_xy_pos(self, x_pos, y_pos):CODE
LOWMapping/grid_map_lib/grid_map_lib.py179 def calc_grid_central_xy_position_from_grid_index(self, grid_ind):CODE
LOWMapping/grid_map_lib/grid_map_lib.py183 def calc_grid_central_xy_position_from_xy_index(self, x_ind, y_ind):CODE
LOWMapping/grid_map_lib/grid_map_lib.py191 def calc_grid_central_xy_position_from_index(self, index, lower_pos):CODE
LOWMapping/grid_map_lib/grid_map_lib.py194 def calc_xy_index_from_position(self, pos, lower_pos, max_index):CODE
LOWMapping/grid_map_lib/grid_map_lib.py201 def check_occupied_from_xy_index(self, x_ind, y_ind, occupied_val):CODE
LOW…g/normal_vector_estimation/normal_vector_estimation.py66def ransac_normal_vector_estimation(points_3d, inlier_radio_th=0.7,CODE
LOWMapping/rectangle_fitting/rectangle_fitting.py92 def _calc_closeness_criterion(self, c1, c2):CODE
LOWMapping/rectangle_fitting/rectangle_fitting.py173 def _adoptive_range_segmentation(self, ox, oy):CODE
LOWSLAM/GraphBasedSLAM/graphslam/util.py34def solve_for_edge_dimensionality(n):STRING
LOWSLAM/GraphBasedSLAM/graphslam/util.py54def upper_triangular_matrix_to_full_matrix(arr, n):STRING
LOWSLAM/ICPMatching/icp_matching.py75def update_homogeneous_matrix(Hin, R, T):CODE
LOWSLAM/ICPMatching/icp_matching.py90def nearest_neighbor_association(previous_points, current_points):CODE
LOWSLAM/EKFSLAM/ekf_slam.py136def get_landmark_position_from_state(x, ind):CODE
LOWSLAM/EKFSLAM/ekf_slam.py142def search_correspond_landmark_id(xAug, PAug, zi):CODE
LOWPathTracking/pure_pursuit/pure_pursuit.py129def pure_pursuit_steer_control(state, trajectory, pind):CODE
LOW…ing/lqr_speed_steer_control/lqr_speed_steer_control.py96def lqr_speed_steering_control(state, cx, cy, cyaw, ck, pe, pth_e, sp, Q, R):CODE
LOWPathTracking/cgmres_nmpc/cgmres_nmpc.py66 def calc_predict_and_adjoint_state(self, x, y, yaw, v, u_1s, u_2s, N, dt):CODE
LOWPathTracking/cgmres_nmpc/cgmres_nmpc.py111 def _predict_state_with_oylar(x, y, yaw, v, u_1, u_2, dt):CODE
LOWPathTracking/cgmres_nmpc/cgmres_nmpc.py124 def _adjoint_state_with_oylar(yaw, v, lam_1, lam_2, lam_3, lam_4, u_2, dt):CODE
LOW…er_control/model_predictive_speed_and_steer_control.py223def iterative_linear_mpc_control(xref, x0, dref, oa, od):CODE
LOW…_wheel_feedback_control/rear_wheel_feedback_control.py105def rear_wheel_feedback_control(state, e, k, yaw_ref):CODE
LOWtests/test_dubins_path_planning.py72def test_path_plannings_types():CODE
LOWtests/test_rrt_star.py22def test_no_obstacle_and_robot_radius():CODE
LOWtests/test_frenet_optimal_trajectory.py15def high_speed_and_merging_and_stopping_scenario_test():CODE
LOWtests/test_frenet_optimal_trajectory.py23def high_speed_and_velocity_keeping_scenario_test():CODE
LOWtests/test_frenet_optimal_trajectory.py31def low_speed_and_velocity_keeping_scenario_test():CODE
LOWtests/test_frenet_optimal_trajectory.py39def low_speed_and_merging_and_stopping_scenario_test():CODE
LOWtests/test_distance_map.py89def test_compute_udf_invalid_input():CODE
LOWtests/test_grid_map_lib.py28def test_xy_and_grid_index_conversion():CODE
LOWtests/test_rrt_with_pathsmoothing_radius.py6def test_smoothed_path_safety():CODE
LOWdocs/conf.py223def get_relative_path_from_parent(file_path: str, parent_dir: str):CODE
LOWInvertedPendulum/inverted_pendulum_lqr_control.py116def get_numpy_array_from_matrix(x):CODE
LOWInvertedPendulum/inverted_pendulum_mpc_control.py111def get_numpy_array_from_matrix(x):CODE
LOWMissionPlanning/StateMachine/robot_behavior_case.py88 def on_enter_returning_to_base(self):CODE
LOWMissionPlanning/BehaviorTree/behavior_tree.py82 def not_set_children_raise_error(self):CODE
LOWMissionPlanning/BehaviorTree/behavior_tree.py303 def not_set_child_raise_error(self):CODE
LOWMissionPlanning/BehaviorTree/robot_behavior_case.py169def create_robot_behavior_tree():CODE
LOW…thPlanning/ReedsSheppPath/reeds_shepp_path_planning.py177def left_x_right_left_x_right(x, y, phi):CODE
LOW…thPlanning/ReedsSheppPath/reeds_shepp_path_planning.py345def calc_interpolate_dists_list(lengths, step_size):CODE
LOW…thPlanning/ReedsSheppPath/reeds_shepp_path_planning.py427def reeds_shepp_path_planning(sx, sy, syaw, gx, gy, gyaw, maxc, step_size=0.2):CODE
LOW…redictiveTrajectoryGenerator/lookup_table_generator.py37def search_nearest_one_from_lookup_table(tx, ty, tyaw, lookup_table):CODE
LOWPathPlanning/BSplinePath/bspline_path.py19def approximate_b_spline_path(x: list,CODE
LOWPathPlanning/BSplinePath/bspline_path.py66def interpolate_b_spline_path(x, y,CODE
LOWPathPlanning/HybridAStar/hybrid_a_star.py182def update_node_with_analytic_expansion(current, goal,CODE
LOW…g/FrenetOptimalTrajectory/frenet_optimal_trajectory.py129 def calc_cartesian_parameters(self, fp, csp):CODE
LOW…g/FrenetOptimalTrajectory/frenet_optimal_trajectory.py175 def calc_cartesian_parameters(self, fp, csp):CODE
LOW…g/FrenetOptimalTrajectory/frenet_optimal_trajectory.py217 def calc_cartesian_parameters(self, fp, csp):CODE
LOW…g/FrenetOptimalTrajectory/frenet_optimal_trajectory.py241 def calc_longitudinal_trajectory(self, c_speed, c_accel, Ti, s0):CODE
LOW…g/FrenetOptimalTrajectory/frenet_optimal_trajectory.py261 def calc_longitudinal_trajectory(self, c_speed, c_accel, Ti, s0):CODE
LOW…g/FrenetOptimalTrajectory/frenet_optimal_trajectory.py285 def calc_longitudinal_trajectory(self, c_speed, c_accel, Ti, s0):CODE
LOWPathPlanning/VisibilityRoadMap/visibility_road_map.py49 def generate_visibility_nodes(self, start_x, start_y, goal_x, goal_y,CODE
LOWPathPlanning/VisibilityRoadMap/visibility_road_map.py71 def calc_vertexes_in_configuration_space(self, x_list, y_list):CODE
LOW…ning/TimeBasedPathPlanning/GridWithDynamicObstacles.py82 def generate_dynamic_obstacles(self, obs_count: int) -> list[list[Position]]:CODE
31 more matches not shown…
Deep Nesting77 hits · 77 pts
SeverityFileLineSnippetContext
LOWMapping/gaussian_grid_map/gaussian_grid_map.py19CODE
LOWMapping/rectangle_fitting/rectangle_fitting.py233CODE
LOWMapping/rectangle_fitting/rectangle_fitting.py126CODE
LOWSLAM/GraphBasedSLAM/graph_based_slam.py105CODE
LOWPathTracking/pure_pursuit/pure_pursuit.py269CODE
LOWMissionPlanning/BehaviorTree/behavior_tree.py196CODE
LOWMissionPlanning/BehaviorTree/behavior_tree.py613CODE
LOW…thPlanning/ReedsSheppPath/reeds_shepp_path_planning.py287CODE
LOWPathPlanning/AStar/a_star_variants.py56CODE
LOWPathPlanning/AStar/a_star_variants.py180CODE
LOWPathPlanning/AStar/a_star_variants.py267CODE
LOWPathPlanning/AStar/a_star.py51CODE
LOWPathPlanning/AStar/a_star.py170CODE
LOWPathPlanning/AStar/a_star.py189CODE
LOWPathPlanning/AStar/a_star_searching_from_two_side.py131CODE
LOW…hPlanning/HybridAStar/dynamic_programming_heuristic.py45CODE
LOW…hPlanning/HybridAStar/dynamic_programming_heuristic.py120CODE
LOW…hPlanning/HybridAStar/dynamic_programming_heuristic.py136CODE
LOWPathPlanning/FlowField/flowfield.py46CODE
LOWPathPlanning/FlowField/flowfield.py63CODE
LOW…g/FrenetOptimalTrajectory/frenet_optimal_trajectory.py450CODE
LOWPathPlanning/BreadthFirstSearch/breadth_first_search.py146CODE
LOWPathPlanning/BreadthFirstSearch/breadth_first_search.py165CODE
LOW…eadthFirstSearch/bidirectional_breadth_first_search.py204CODE
LOW…eadthFirstSearch/bidirectional_breadth_first_search.py223CODE
LOWPathPlanning/DStar/dstar.py93CODE
LOWPathPlanning/VoronoiRoadMap/dijkstra_search.py34CODE
LOWPathPlanning/DepthFirstSearch/depth_first_search.py143CODE
LOWPathPlanning/DepthFirstSearch/depth_first_search.py162CODE
LOWPathPlanning/VisibilityRoadMap/visibility_road_map.py89CODE
LOW…lanning/Eta3SplineTrajectory/eta3_spline_trajectory.py199CODE
LOWPathPlanning/TimeBasedPathPlanning/Plotting.py53CODE
LOWPathPlanning/TimeBasedPathPlanning/SpaceTimeAStar.py27CODE
LOW…ning/TimeBasedPathPlanning/GridWithDynamicObstacles.py82CODE
LOWPathPlanning/TimeBasedPathPlanning/SafeInterval.py50CODE
LOWPathPlanning/TimeBasedPathPlanning/SafeInterval.py102CODE
LOWPathPlanning/InformedRRTStar/informed_rrt_star.py44CODE
LOWPathPlanning/BidirectionalAStar/bidirectional_a_star.py49CODE
LOWPathPlanning/BidirectionalAStar/bidirectional_a_star.py235CODE
LOWPathPlanning/BidirectionalAStar/bidirectional_a_star.py254CODE
LOW…anning/WavefrontCPP/wavefront_coverage_path_planner.py20CODE
LOW…anning/WavefrontCPP/wavefront_coverage_path_planner.py94CODE
LOW…anning/WavefrontCPP/wavefront_coverage_path_planner.py113CODE
LOWPathPlanning/ElasticBands/elastic_bands.py257CODE
LOWPathPlanning/RRT/sobol/sobol.py218CODE
LOWPathPlanning/ThetaStar/theta_star.py51CODE
LOWPathPlanning/ThetaStar/theta_star.py233CODE
LOWPathPlanning/ThetaStar/theta_star.py252CODE
LOW…gTreeCPP/spiral_spanning_tree_coverage_path_planner.py36CODE
LOW…gTreeCPP/spiral_spanning_tree_coverage_path_planner.py73CODE
LOW…gTreeCPP/spiral_spanning_tree_coverage_path_planner.py132CODE
LOW…gTreeCPP/spiral_spanning_tree_coverage_path_planner.py154CODE
LOW…gTreeCPP/spiral_spanning_tree_coverage_path_planner.py171CODE
LOW…gTreeCPP/spiral_spanning_tree_coverage_path_planner.py187CODE
LOWPathPlanning/BugPlanning/bug.py14CODE
LOWPathPlanning/BugPlanning/bug.py39CODE
LOWPathPlanning/BugPlanning/bug.py55CODE
LOWPathPlanning/BugPlanning/bug.py116CODE
LOWPathPlanning/BugPlanning/bug.py193CODE
LOW…anning/BatchInformedRRTStar/batch_informed_rrt_star.py233CODE
17 more matches not shown…
Redundant / Tautological Comments10 hits · 14 pts
SeverityFileLineSnippetContext
LOWPathTracking/pure_pursuit/pure_pursuit.py323 if not plt.get_fignums(): # Check if window is closedCODE
LOWtests/test_rrt_with_pathsmoothing_radius.py38 # Check if all points on the smoothed path are safely distant from obstaclesCOMMENT
LOWtests/test_move_to_pose.py33 # Check if the speed is changing too muchCOMMENT
LOWPathPlanning/TimeBasedPathPlanning/SpaceTimeAStar.py96 # Check if the new node is valid for the next 2 time steps - one step to enter, and another to leaveCOMMENT
LOW…ning/TimeBasedPathPlanning/GridWithDynamicObstacles.py199 # Check if position is in gridCOMMENT
LOW…ning/TimeBasedPathPlanning/GridWithDynamicObstacles.py203 # Check if position is not occupied at time tCOMMENT
LOW…rticleSwarmOptimization/particle_swarm_optimization.py132 # Check if start point is inside obstacleCOMMENT
LOW…rticleSwarmOptimization/particle_swarm_optimization.py139 # Check if intersection on segmentCOMMENT
LOW…anning/BatchInformedRRTStar/batch_informed_rrt_star.py254 # Check if this can improve the current solutionCOMMENT
LOW…anning/BatchInformedRRTStar/batch_informed_rrt_star.py534 # Check if we're at the goalCOMMENT
Excessive Try-Catch Wrapping7 hits · 10 pts
SeverityFileLineSnippetContext
MEDIUM…er_control/model_predictive_speed_and_steer_control.py297 print("Error: Cannot solve mpc..")CODE
LOWdocs/conf.py217 except Exception:CODE
LOWMissionPlanning/StateMachine/state_machine.py291 except Exception as e:CODE
MEDIUMMissionPlanning/StateMachine/state_machine.py292 print(f"Error showing PlantUML: {e}")CODE
MEDIUMPathPlanning/HybridAStar/hybrid_a_star.py284 print("Error: Cannot find path, No open set")CODE
LOWPathPlanning/ClothoidPath/clothoid_path_planner.py76 except Exception as e:CODE
LOWPathPlanning/ClothoidPath/clothoid_path_planner.py89 except Exception as e:CODE
Over-Commented Block7 hits · 7 pts
SeverityFileLineSnippetContext
LOWSLAM/GraphBasedSLAM/graphslam/edge/__init__.py1# Copyright (c) 2020 Jeff Irion and contributorsCOMMENT
LOWSLAM/GraphBasedSLAM/graphslam/pose/__init__.py1# Copyright (c) 2020 Jeff Irion and contributorsCOMMENT
LOWPathTracking/move_to_pose/move_to_pose.py61 v : Command linear velocityCOMMENT
LOWdocs/conf.py1#COMMENT
LOWdocs/conf.py121# Custom sidebar templates, must be a dictionary that maps document namesCOMMENT
LOWdocs/conf.py141 # The paper size ('letterpaper' or 'a4paper').COMMENT
LOWPathPlanning/DStarLite/d_star_lite.py381 # Obstacles discovered at time = rowCOMMENT
Self-Referential Comments2 hits · 6 pts
SeverityFileLineSnippetContext
MEDIUMtests/test_distance_map.py8 # Create a simple obstacle map for testingCOMMENT
MEDIUMPathPlanning/ElasticBands/elastic_bands.py289 # Create an elastic band object and optimizeCOMMENT
Unused Imports2 hits · 2 pts
SeverityFileLineSnippetContext
LOWSLAM/ICPMatching/icp_matching.py8CODE
LOWPathPlanning/RRT/sobol/__init__.py1CODE
AI Structural Patterns1 hit · 1 pts
SeverityFileLineSnippetContext
LOW…lNavigation/drone_3d_trajectory_following/Quadrotor.py12CODE