{"id":"W1561255266","doi":"10.1007/978-3-540-28633-2_13","title":"An Hierarchical Terrain Representation for Approximately Shortest Paths","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Terrain; Preprocessor; Shortest path problem; Representation (politics); Logarithm; Algorithm; Line segment; Grid; Path (computing); Line (geometry); Graph; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001198806,0.0006002082,0.0006177049,0.0008195498,0.0003468379,0.0007981489,0.004048255,0.0004253044,0.000006974112],"category_scores_gemma":[0.0001972954,0.0005700586,0.0001623327,0.0005648154,0.000679534,0.0009411881,0.0006418292,0.0008189593,0.00001821724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004070969,"about_ca_system_score_gemma":0.0008735193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003371132,"about_ca_topic_score_gemma":0.00001300499,"domain_scores_codex":[0.9949232,0.00005374855,0.0006693351,0.002341572,0.001121259,0.0008908873],"domain_scores_gemma":[0.9965342,0.0006190233,0.0003098883,0.001969853,0.000253118,0.0003139098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000105639,0.0000784142,0.00006215435,0.00004010551,0.00001136711,0.0001590881,0.002090979,0.261737,0.000295795,0.03276554,0.00001380809,0.7027352],"study_design_scores_gemma":[0.0003201252,0.0003585387,0.0002620228,0.00023484,0.000006715902,0.00009745663,2.360919e-7,0.7159875,0.0005742989,0.2815371,0.00007964957,0.0005415303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006804468,0.00008632512,0.9952153,0.0007524124,0.001720638,0.0009127902,0.00001761106,0.0003538308,0.0008730486],"genre_scores_gemma":[0.05153126,0.000006533933,0.9467773,0.0008048035,0.0006603769,0.00004502631,0.00004507446,0.00004988345,0.00007975336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7021937,"threshold_uncertainty_score":0.9996751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03130798972528696,"score_gpt":0.2976493554192967,"score_spread":0.2663413656940097,"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."}}