{"id":"W2170141090","doi":"10.1109/tase.2011.2123888","title":"Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Metric (unit); Motion planning; Range (aeronautics); Travelling salesman problem; Approximation algorithm; Mathematical optimization; Visibility; Mathematics; Set cover problem; Set (abstract data type); Cover (algebra); Metric space; Robot; Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Engineering","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.002128875,0.002004313,0.001860349,0.001081543,0.001354445,0.003294,0.003371962,0.002566846,0.01007029],"category_scores_gemma":[0.01294581,0.0009254876,0.002437929,0.002329677,0.001452383,0.008489087,0.002737442,0.004411181,0.00109564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003419654,"about_ca_system_score_gemma":0.002675275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006064675,"about_ca_topic_score_gemma":0.00546962,"domain_scores_codex":[0.9970118,0.0008035795,0.0001775942,0.0007062798,0.0007680598,0.0005327686],"domain_scores_gemma":[0.9910882,0.006778146,0.0005788046,0.0007837763,0.0004842873,0.0002868401],"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.000410702,0.0004081282,0.001536925,0.0009803039,0.0001456548,0.0002221805,0.0003865289,0.7541655,0.003562279,0.1327953,0.01374579,0.09164067],"study_design_scores_gemma":[0.00005129488,0.00006769355,0.0003211513,0.00002697076,0.00003872373,0.00009960619,0.00007265825,0.9365083,0.0007098545,0.05954957,0.002533544,0.00002070171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0211749,0.00151096,0.9642246,0.00167073,0.0001204876,0.0002103272,0.0003681007,0.0005614081,0.01015857],"genre_scores_gemma":[0.3365454,0.002761123,0.6487622,0.0006658076,0.0005876589,0.0008889702,0.001898986,0.0005785467,0.007311346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01007029,"threshold_uncertainty_score":0.03368849,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07460280181598752,"score_gpt":0.2791214548209429,"score_spread":0.2045186530049554,"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."}}