{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002174696,0.0006942675,0.0009532234,0.00137018,0.0004177245,0.001162877,0.001777066,0.0007611187,0.006289497],"category_scores_gemma":[0.001218579,0.0005977659,0.0009016378,0.002610612,0.0003345307,0.00195506,0.001198108,0.001153344,0.001417871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006939119,"about_ca_system_score_gemma":0.0006936695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01416234,"about_ca_topic_score_gemma":0.01844103,"domain_scores_codex":[0.9997343,0.00003514434,0.00001828164,0.00005358392,0.0001229889,0.00003568767],"domain_scores_gemma":[0.9997868,0.0000704219,0.00001699469,0.00005871812,0.00005386253,0.00001320732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001648114,0.00007695539,0.0004084543,0.0002474855,0.00003942676,0.0001065261,0.0001507832,0.5496064,0.008043607,0.06249407,0.01291957,0.3657419],"study_design_scores_gemma":[0.00001180267,0.00001280187,0.00009204976,0.00001162927,0.000009546267,0.00002452462,0.00001820576,0.9784259,0.0007391756,0.0174454,0.00320087,0.00000799067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004765233,0.0001854944,0.9907747,0.00004640829,0.00002343719,0.00003867036,0.0006746313,0.00162372,0.001867703],"genre_scores_gemma":[0.1533527,0.0005490737,0.8389132,0.00005997305,0.00003172999,0.0001913927,0.003276545,0.0004338296,0.003191514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01416234,"threshold_uncertainty_score":0.0281598,"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."}}