{"id":"W2126757501","doi":"10.1109/robot.2006.1641818","title":"Optimal path planning under defferent norms in continuous state spaces","year":2006,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dijkstra's algorithm; Maxima and minima; Motion planning; Fast marching method; Mathematical optimization; Computer science; Path (computing); Shortest path problem; Any-angle path planning; State (computer science); Euclidean distance; Graph; Algorithm; Mathematics; Robot; Theoretical computer science; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002649387,0.0001816027,0.0002282561,0.0001522496,0.00006051461,0.000240388,0.0005398897,0.00005310355,0.000007206876],"category_scores_gemma":[0.000011442,0.000146569,0.00003764441,0.0002909002,0.00003213541,0.0003178104,0.0001806894,0.0001750217,0.00006380617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006555927,"about_ca_system_score_gemma":0.00005147383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006262341,"about_ca_topic_score_gemma":0.000009604703,"domain_scores_codex":[0.9984656,0.00005313564,0.0002842137,0.0004056105,0.0002969539,0.0004944616],"domain_scores_gemma":[0.9993612,0.0001153527,0.0000823168,0.0003345612,0.00003382318,0.00007272291],"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.000006546131,0.0001125317,0.05330767,0.000008568682,0.000009663359,0.0003756976,0.0007223286,0.9346039,0.0002366502,0.005261834,0.002282197,0.003072367],"study_design_scores_gemma":[0.0007968309,0.0001220847,0.1946383,0.0000758263,0.000002889401,0.0000495625,0.0001542318,0.8001533,0.0008055826,0.0024942,0.0002990192,0.000408192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3364225,0.00009074805,0.660286,0.0002263725,0.0002024455,0.00009476465,0.000001141731,0.0001948197,0.002481212],"genre_scores_gemma":[0.6985593,0.000001360522,0.3000011,0.0001223564,0.00004052164,0.0000090107,0.000004530327,0.00001011379,0.001251674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3621368,"threshold_uncertainty_score":0.5976908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01483964443953344,"score_gpt":0.2448253106419497,"score_spread":0.2299856662024163,"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."}}