{"id":"W2293312031","doi":"10.1109/csci.2015.92","title":"C-Theta*: Cluster Based Path-Planning on Grids","year":2015,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Grid; Motion planning; Shortest path problem; Path (computing); Computer science; Cluster analysis; Constraint (computer-aided design); Widest path problem; Grid reference; Any-angle path planning; Grid method multiplication; Algorithm; Cluster (spacecraft); Path length; Mathematical optimization; K shortest path routing; Mathematics; Artificial intelligence; Theoretical computer science; Mobile robot; Graph; Geometry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000318396,0.0006121245,0.0005260136,0.0005451701,0.0005844161,0.0005762494,0.001364381,0.0005412279,0.003426406],"category_scores_gemma":[0.0013227,0.000306815,0.0004662257,0.001010241,0.0004956182,0.0007919004,0.0009111323,0.0007609436,0.0006943286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008050389,"about_ca_system_score_gemma":0.001694361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02203867,"about_ca_topic_score_gemma":0.01517627,"domain_scores_codex":[0.999785,0.00004390999,0.00001003515,0.00004830855,0.00007703166,0.00003572916],"domain_scores_gemma":[0.9995264,0.0001758753,0.00004740458,0.0001016964,0.0001139478,0.00003469119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001036038,0.00003345946,0.0006392089,0.00006592798,0.00002715782,0.00004960825,0.00006572132,0.8939184,0.001769805,0.01049608,0.004354474,0.08847656],"study_design_scores_gemma":[0.00001487162,0.00003203776,0.0001303731,0.000004822612,0.00000456909,0.00002493089,0.00002376931,0.9905639,0.001277656,0.005413137,0.002503403,0.000006572447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01444638,0.0001232322,0.9782164,0.0001364712,0.0000468596,0.0001068291,0.0001767676,0.002692284,0.004054692],"genre_scores_gemma":[0.3856812,0.0002259506,0.6074656,0.00008050643,0.00001793019,0.0002918936,0.0005078094,0.0003406954,0.005388389],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02203867,"threshold_uncertainty_score":0.0438208,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06172175499465651,"score_gpt":0.2878198593003833,"score_spread":0.2260981043057268,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}