{"id":"W3002291166","doi":"10.1145/3369114.3369140","title":"Any Angle Path Finding in Stochastic Obstacle Scenes","year":2019,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Obstacle; Shortest path problem; Dijkstra's algorithm; Discretization; Computer science; Traverse; Euclidean shortest path; Path (computing); Motion planning; Pathfinding; Algorithm; Mathematical optimization; Graph; K shortest path routing; Artificial intelligence; Mathematics; Theoretical computer science; Robot; Geography","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003368902,0.0004239193,0.0005419628,0.0003938637,0.0005987526,0.0007536982,0.0008944622,0.0005296612,0.001156762],"category_scores_gemma":[0.001814064,0.0003234491,0.0004879069,0.0007627869,0.0007692875,0.001137508,0.001242649,0.0005089289,0.0001204902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007107683,"about_ca_system_score_gemma":0.001072157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009715103,"about_ca_topic_score_gemma":0.01005245,"domain_scores_codex":[0.9996619,0.00008201894,0.00001716823,0.00009148494,0.00008661737,0.00006078591],"domain_scores_gemma":[0.9993345,0.0004068674,0.00009675659,0.00006637388,0.00005373178,0.00004173289],"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.0000602615,0.00002656957,0.000866376,0.0000481272,0.00001845704,0.00009538351,0.00009443045,0.9545652,0.00167288,0.01677859,0.0004037939,0.02536991],"study_design_scores_gemma":[0.000006623167,0.00003233816,0.0002091369,0.000004473811,0.000004457211,0.00004711587,0.00004698919,0.9884321,0.0006619082,0.009908178,0.000640514,0.000006128374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08155318,0.0002207498,0.9145532,0.0001178924,0.00001682822,0.00004400679,0.0001251632,0.0003137242,0.003055385],"genre_scores_gemma":[0.7448385,0.0002012604,0.2531913,0.00003726507,0.000009235985,0.00005867226,0.0002214179,0.00005927155,0.001382908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009715103,"threshold_uncertainty_score":0.01931715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01898925250513745,"score_gpt":0.2479793428834967,"score_spread":0.2289900903783592,"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."}}