{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004232365,0.0006959076,0.001029447,0.0009552631,0.0005088256,0.001864702,0.001358937,0.001008902,0.0006947006],"category_scores_gemma":[0.01719741,0.0004186897,0.0005643645,0.001039709,0.00304394,0.004606554,0.001891261,0.00142966,0.0001218359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001631458,"about_ca_system_score_gemma":0.002053549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00624951,"about_ca_topic_score_gemma":0.003351204,"domain_scores_codex":[0.9977914,0.0007715501,0.0001305076,0.0004221344,0.00071127,0.0001731232],"domain_scores_gemma":[0.989736,0.007527947,0.0009963836,0.0007876411,0.0007123869,0.0002397164],"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.00007367292,0.00002126074,0.0003300977,0.00005397649,0.00001241595,0.00003802511,0.00008163275,0.924785,0.0008099533,0.05688747,0.0001164502,0.01679005],"study_design_scores_gemma":[0.00001181723,0.00003872971,0.00008479426,0.000006528624,0.000003558445,0.00001584331,0.0000212809,0.9569421,0.0008804444,0.04181363,0.0001742585,0.000007070081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06782012,0.0001985597,0.9297048,0.0001323469,0.00001375532,0.00002080387,0.00005055493,0.0002308001,0.001828146],"genre_scores_gemma":[0.6892486,0.000324133,0.3090133,0.00004214328,0.00002070624,0.0001088692,0.0001653326,0.00008815151,0.0009887991],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00624951,"threshold_uncertainty_score":0.02238315,"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."}}